A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is
Proceedings of Conference on Computer Architectures for Machine Perception
Only few problems in computer vision have been investigated more vigorously than stereo. Nevertheless, the main obstacle on the way to their practical application is the excessively long computation time needed to match stereo images. This paper presents parallel algorithms for edge-based stereo suitable for depth computation. Edge-based stereo techniques produce only sparse depth maps. Thus, we present in addition an efficient parallel algorithm for dense stereo matching that can be employeddoi:10.1109/camp.1995.521045 fatcat:celjy37bqneevn3mdktpfs3nri