A simple parallel algorithm for calculating depth from motion stereo is implemented. It makes the assumption that the incremental disparity is less than the minimum distance between edges. To relax this constraint, a more general multiscale pyramidal algorithm is developed. The two algorithms are tested on the Simon Fraser University pyramidal vision machine for real-time computer vision applications. The total processing time is 50 ms/image for the simple algorithm and approximately 0.5 s/image for the multiscale algorithm.<>
Real-time motion stereo
1993-01-01
466294 byte
Conference paper
Electronic Resource
English
Real-Time Detection of Independent Motion using Stereo
IEEE | 2005
|Video-based, real-time multi-view stereo
British Library Online Contents | 2011
|A Real-Time Multiresolutional Stereo Matching Algorithm
British Library Conference Proceedings | 2005
|Color Motion Stereo Based on Improved Stereo Matching
British Library Online Contents | 2002
|