165 search results - page 3 / 33 » Stereo Matching as a Nearest-Neighbor Problem |
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
3DPVT
2006
IEEE
14 years 2 months ago
2006
IEEE
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
CVPR
2005
IEEE
14 years 10 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...
SODA
1992
ACM
13 years 9 months ago
1992
ACM
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...