Shape tracking using centroid-based methods

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Algorithms for tracking generic 2D object boundaries in a video sequence should not make strong assumptions about the shapes to be tracked. When only a weak prior is at hand, the tracker performance becomes heavily dependent on its ability to detect image features; to classify them as informative (i.e., belonging to the object boundary) or as outliers; and to match the informative features with corresponding model points. Unlike simpler approaches often adopted in tracking problems, this worklo oks at feature classification and matching as two unsupervised learning problems. Consequently, object tracking is converted into a problem of dynamic clustering of data, which is solved using competitive learning algorithms. It is shown that competitive learning is a key technique for obtaining accurate local motion estimates (avoiding aperture problems) and for discarding the outliers. In fact, the competitive learning approach shows several benefits: (i) a gradual propagation of shape information across the model; (ii) the use of shape and noise models competing for explaining the data; and (iii) the possibility of adopting high dimensional feature spaces containing relevant information extracted from the image. This workextends the unified framework proposed by the authors in [1].

Cite

CITATION STYLE

APA

Abrantes, A. J., & Marques, J. S. (2001). Shape tracking using centroid-based methods. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2134, pp. 576–591). Springer Verlag. https://doi.org/10.1007/3-540-44745-8_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free