Abstract
The problem of processing two gray-level images forming a stereo pair is considered on the basis of treating the sought-for disparity map and the original image pair as, respectively, the hidden and the observable constituent of a two-component random field with known probabilistic properties. The stereo matching algorithm resulting from such an approach is actually a version of the classical random field interpolation procedure with some alterations aimed at the attainment of a higher computation speed. The specificity of the stereo matching problem among random field interpolation problems of general kind is carried by a special a priori model that allows for taking into account all the usual constraints posed upon the disparity map by the geometric projection laws.© (1995) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
