A gradient algorithm for stereo matching without correspondence

DOI10.1109/9.544006MaRDI QIDQ5689960zbMATH OpenOpenAlexFDO

Authors

Publication date 23 February 1997

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.544006

zbMATH Keywords

feature point matchinggradient algorithmmachine visionstereo matching

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Automated systems (robots, etc.) in control theory (93C85)

Recommendations

• Stereo matching based on the self-organizing feature-mapping algorithm
• An adaptive multifeature correspondence algorithm for stereo using dynamic programming
• scientific article; zbMATH DE number 1691512
• scientific article; zbMATH DE number 4187173
• A taxonomy and evaluation of dense two-frame stereo correspondence algorithms

Cited in

(10)

• Improving stereovision matching through supervised learning
• Self-consistency and MDL: A paradigm for evaluating point-correspondence algorithms, and its application to detecting changes in surface elevation
• Local stereovision matching through the ADALINE neural network
• 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
• A global algorithm for straight line stereo matching based on feature grouping
• Feature point matching of curved surface and robust uncertainty
• Stereo matching based on the self-organizing feature-mapping algorithm
• Jacobi‐type Methods in Computer Vision: A Case Study
• An Algorithm for Computation of the Scene Geometry by the Log-Polar Area Matching Around Salient Points

This page was built for publication: A gradient algorithm for stereo matching without correspondence

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