TY - JOUR
T1 - Surfaces from Stereo
T2 - Integrating Feature Matching, Disparity Estimation, and Contour Detection
AU - Hoff, William
AU - Ahuja, Narendra
N1 - Funding Information:
Manuscript received February 3, 1987: revised June I , 1988. This work was supported by the National Science Foundation under Grant ECS 8352408 and by Rockwell International. W. Hoff was with the Coordinated Science Laboratory, University of Illinois. 1101 West Springfield Ave., Urbana, IL 61801. He is now with Martin Marietta Astronautics Group, P.O. Box 179. Denver, CO 80201. N. Ahuja is with the Coordinated Science Laboratory, University of Illinois, I101 West Springfield Ave.. Urbana, IL 61801. IEEE Log Number 8824799,
PY - 1989/2
Y1 - 1989/2
N2 - The goal of stereo algorithms is to determine the Threedimensional distance, or depth, of objects from a stereo pair of images. The usual approach is to first identify corresponding features between the two images and estimate their depths, then interpolate to obtain a complete distance or depth map. Traditionally, finding the corresponding features has been considered to be the most difficult problem. Also, occluding and ridge contours (depth and orientation discontinuities) have not been explicitly detected which has made surface interpolation difficult. The approach described in this paper integrates the processes of feature matching, contour detection, and surface interpolation. Integration is necessary to ensure that the detected surfaces are smooth. Surface interpolation takes into account detected occluding and ridge contours in the scene; interpolation is performed within regions enclosed by these contours. Planar and quadratic patches are used as local models of the surface. Occluded regions in the image are identified, and are not used for matching and interpolation. A coarse-to-fine algorithm is presented that generates a multiresolution hierarchy of surface maps, one at each level of resolution. Experimental results are given for a variety of stereo images.
AB - The goal of stereo algorithms is to determine the Threedimensional distance, or depth, of objects from a stereo pair of images. The usual approach is to first identify corresponding features between the two images and estimate their depths, then interpolate to obtain a complete distance or depth map. Traditionally, finding the corresponding features has been considered to be the most difficult problem. Also, occluding and ridge contours (depth and orientation discontinuities) have not been explicitly detected which has made surface interpolation difficult. The approach described in this paper integrates the processes of feature matching, contour detection, and surface interpolation. Integration is necessary to ensure that the detected surfaces are smooth. Surface interpolation takes into account detected occluding and ridge contours in the scene; interpolation is performed within regions enclosed by these contours. Planar and quadratic patches are used as local models of the surface. Occluded regions in the image are identified, and are not used for matching and interpolation. A coarse-to-fine algorithm is presented that generates a multiresolution hierarchy of surface maps, one at each level of resolution. Experimental results are given for a variety of stereo images.
UR - http://www.scopus.com/inward/record.url?scp=0024612322&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0024612322&partnerID=8YFLogxK
U2 - 10.1109/34.16709
DO - 10.1109/34.16709
M3 - Article
AN - SCOPUS:0024612322
SN - 0162-8828
VL - 11
SP - 121
EP - 136
JO - IEEE transactions on pattern analysis and machine intelligence
JF - IEEE transactions on pattern analysis and machine intelligence
IS - 2
ER -