9 search results - page 1 / 2 » A quadratic programming based cluster correspondence project... |
CVIU
2010
13 years 7 months ago
2010
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up corres...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
In many retrieval, object recognition and wide baseline stereo methods, correspondences of interest points are established possibly sublinearly by matching a compact descriptor su...
EUROPAR
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Point matching is crucial for many computer vision applications. Establishing the correspondence between a large number of data points is a computationally intensive proc...
ICCV
2007
IEEE
14 years 1 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...