Abstract
Combining the reliable edge feature points and area similarity, the fast stereo matching algorithm using edge traction was presented. First, find valid disparity set of feature points and traverse combinations of adjacent points’ disparities, obtain the valid disparity set of featureless points using dynamic program, then, generate the initial sparse disparity space using area similarity. The algorithm reduces the computation complexity of disparity space and decreases the possibility of mismatching illusion. Under the uniqueness constraint, integral dense disparity map and occlusion area can be obtained by collision detection. Experiment on real visual images is performed to verify the feasibility and effectiveness of this algorithm.
Chapter PDF
Similar content being viewed by others
References
T. Kanade, M. Okutomi. A stereo matching algorithm with an adaptive window: Theory and experiment. IEEE Trans. on Pattern Analysis and Machine Intelligence, 1994, 16(9): 920–932.
C. L. Zitnick, T. Kanade. A Cooperative Algorithm for Stereo Matching and occlusion Detection. IEEE Trans. on Pattern Analysis and Machine Intelligence, 2000, 22(7): 675–684.
H. Baker, T. Binford. Depth from Edge and Intensity Based Stereo. In: Proceedings of the 7th International Joint Conference on Artificial Intelligence, Vancouver, 1981. 631–636.
W. Grimson. Computational experiments with a feature based stereo algorithm. IEEE Trans. on Pattern Analysis and Machine Intelligence, 1985, 7(1): 17–34.
Qiuming Luo, Jingli Zhou. Stereo matching and occlusion detection with integrity and illusion sensitivity. Pattern Recognition Letters, 2003, 24(9–10): 1143–1149.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Zheng-dong, L., Ying-nan, Z., Jing-yu, Y. (2005). Fast Stereo Matching Method Using Edge Traction. In: Shi, Z., He, Q. (eds) Intelligent Information Processing II. IIP 2004. IFIP International Federation for Information Processing, vol 163. Springer, Boston, MA. https://doi.org/10.1007/0-387-23152-8_12
Download citation
DOI: https://doi.org/10.1007/0-387-23152-8_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23151-8
Online ISBN: 978-0-387-23152-5
eBook Packages: Computer ScienceComputer Science (R0)