Stabilizing Stereo Correspondence Computation Using Delaunay Triangulation and Planar Homography

Authors:
Chao-I Chen;Dusty Sargent;Chang-Ming Tsai;Yuan-Fang Wang;Dan Koppel
Affiliations:
Department of Computer Science, University of California, Santa Barbara,;Department of Computer Science, University of California, Santa Barbara,;Department of Computer Science, University of California, Santa Barbara,;Department of Computer Science, University of California, Santa Barbara,;STI Medical Systems, Honolulu, Suite 3100
Venue:
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Year:
2008

Citing 7
Cited 1

Large Occlusion Stereo

International Journal of Computer Vision
Theory and Practice of Projective Rectification

International Journal of Computer Vision
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms

International Journal of Computer Vision
Multiple View Geometry in Computer Vision

Multiple View Geometry in Computer Vision
Advances in Computational Stereo

IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Stereo Matching Using Reliability-Based Dynamic Programming and Consistency Constraints

ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
SURF: speeded up robust features

ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part I

Multi-view stereo point clouds visualization

ISVC'11 Proceedings of the 7th international conference on Advances in visual computing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method for stabilizing the computation of stereo correspondences is presented in this paper. Delaunay triangulation is employed to partition the input images into small, localized regions. Instead of simply assuming that the surface patches viewed from these small triangles are locally planar, we explicitly examine the planarity hypothesis in the 3D space. To perform the planarity test robustly, adjacent triangles are merged into larger polygonal patches first and then the planarity assumption is verified. Once piece-wise planar patches are identified, point correspondences within these patches are readily computed through planar homographies. These point correspondences established by planar homographies serve as the ground control points (GCPs) in the final dynamic programming (DP)-based correspondence matching process. Our experimental results show that the proposed method works well on real indoor, outdoor, and medical image data and is also more efficient than the traditional DP method.