165 search results - page 4 / 33 » Stereo Matching as a Nearest-Neighbor Problem |
ICRA
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— Many computer vision problems such as recognition, image retrieval, and tracking require matching two images. Currently, ones try to find as reliable as possible match...
ICDE
1999
IEEE
14 years 10 months ago
1999
IEEE
Time series stored as feature vectors can be indexed by multidimensional index trees like R-Trees for fast retrieval. Due to the dimensionality curse problem, transformations are ...
MMSP
2008
IEEE
14 years 2 months ago
2008
IEEE
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Conventional stereo matching algorithms assume color constancy on the corresponding opaque pixels in the stereo images. However, when the foreground objects with fractional bounda...
SIGMOD
2005
ACM
14 years 8 months ago
2005
ACM
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...