Sciweavers

305 search results - page 45 / 61
» A Robust Interest Points Matching Algorithm
Sort
View
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
13 years 9 months ago
Earth mover distance over high-dimensional spaces
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer
AVBPA
2003
Springer
172views Biometrics» more  AVBPA 2003»
14 years 1 months ago
Constraint Shape Model Using Edge Constraint and Gabor Wavelet Based Search
: Constraint Shape Model is proposed to extract facial feature using two different search methods for contour points and control points individually. In the proposed algorithm, sal...
Baochang Zhang, Wen Gao, Shiguang Shan, Wei Wang
ICRA
2009
IEEE
137views Robotics» more  ICRA 2009»
14 years 2 months ago
Unsupervised learning of 3D object models from partial views
— We present an algorithm for learning 3D object models from partial object observations. The input to our algorithm is a sequence of 3D laser range scans. Models learned from th...
Michael Ruhnke, Bastian Steder, Giorgio Grisetti, ...
ICIP
2009
IEEE
13 years 5 months ago
Object tracking using multiple fragments
This paper presents a low-cost tracking algorithm based on multiple multiple fragments, increasing robustness with respect to partial occlusions. Given the initial template repres...
Claudio R. Jung, Amir Said
MM
2010
ACM
462views Multimedia» more  MM 2010»
13 years 8 months ago
KPB-SIFT: a compact local feature descriptor
Invariant feature descriptors such as SIFT and GLOH have been demonstrated to be very robust for image matching and object recognition. However, such descriptors are typically of ...
Gangqiang Zhao, Ling Chen, Gencai Chen, Junsong Yu...