Sciweavers

283 search results - page 4 / 57
» Versatile spectral methods for point set matching
Sort
View
COMPGEOM
1994
ACM
15 years 1 months ago
Matching Shapes with a Reference Point
For two given point sets, we present a very simple (almost trivial) algorithm to translate one set so that the Hausdor distance between the two sets is not larger than a constant ...
Helmut Alt, Oswin Aichholzer, Günter Rote
AVSS
2005
IEEE
15 years 3 months ago
Multiple object tracking using elastic matching
A novel region-based multiple object tracking framework based on Kalman filtering and elastic matching is proposed. The proposed Kalman filtering-elastic matching model is gener...
Xingzhi Luo, Suchendra M. Bhandarkar
ICIAR
2005
Springer
15 years 3 months ago
A Novel Tracking Framework Using Kalman Filtering and Elastic Matching
A novel region-based multiple object tracking framework based on Kalman filtering and elastic matching is proposed. The proposed Kalman filtering-elastic matching model is genera...
Xingzhi Luo, Suchendra M. Bhandarkar
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 6 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
PAMI
2012
13 years 22 hour ago
Face Recognition Using Sparse Approximated Nearest Points between Image Sets
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
Yiqun Hu, Ajmal S. Mian, Robyn A. Owens