A fast algorithm for stereo matching

DOI10.1016/S0020-0190(97)00101-4MaRDI QIDQ287131zbMATH OpenFDO

Authors Kuo-Liang Chung

Publication date 26 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0020-0190(97)00101-4

zbMATH Keywords

dynamic programmingstereo matching

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• Fast stereo matching using rectangular subregioning and 3D maximum-surface techniques
• Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem
• Approaches for Stereo Matching
• An improved algorithm for solving the banded cyclic string-to-string correction problem
• Comparison of stereo images as the assignment problem.

Cites work

• A GENERALIZED MAPPING OF 2-D ARRAY PROCESSOR TO LINEAR ARRAY PROCESSOR AND ITS APPLICATIONS
• An algorithm for matching run-length coded strings
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• On a cyclic string-to-string correction problem
• The String-to-String Correction Problem

Cited in

(4)

• Fast stereo matching using rectangular subregioning and 3D maximum-surface techniques
• scientific article; zbMATH DE number 1691512 (Why is no real title available?)
• Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem
• Hybrid symbiotic genetic optimisation for robust edge-based stereo correspondence

This page was built for publication: A fast algorithm for stereo matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287131)