Sciweavers

PAMI
1998

Stereo Matching as a Nearest-Neighbor Problem

13 years 4 months ago
Stereo Matching as a Nearest-Neighbor Problem
—We propose a representation of images, called intrinsic curves, that transforms stereo matching from a search problem into a nearest-neighbor problem. Intrinsic curves are the paths that a set of local image descriptors trace as an image scanline is traversed from left to right. Intrinsic curves are ideally invariant with respect to disparity. Stereo correspondence then becomes a trivial lookup problem in the ideal case. We also show how to use intrinsic curves to match real images in the presence of noise, brightness bias, contrast fluctuations, moderate geometric distortion, image ambiguity, and occlusions. In this case, matching becomes a nearest-neighbor problem, even for very large disparity values.
Carlo Tomasi, Roberto Manduchi
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 1998
Where PAMI
Authors Carlo Tomasi, Roberto Manduchi
Comments (0)