Title :
Parallel stereo on fixed size arrays using zero crossings
Author :
Chakrapani, Pani N. ; Khokhar, Ashfaq A. ; Prasanna, Viktor K.
Author_Institution :
Dept. of Comput. Sci., Redlands Univ., CA, USA
fDate :
30 Aug-3 Sep 1992
Abstract :
Presents a processor-time optimal partitioned implementation of a stereo matching algorithm using zero crossing points as matching primitives. The authors provide O(nm/P) time algorithm on √P×√P processor mesh array, where n is the number of zero crossing points in the left image, m is the set of possible candidate points in the right image for a given zero crossing point, and 1⩽P⩽ n. The sequential algorithm takes O(nm2 ) time while the faster sequential algorithm shown in the paper runs in O(nm) time
Keywords :
algorithm theory; computational complexity; image processing; parallel algorithms; fixed size arrays; partitioned implementation; processor mesh array; processor-time optimal; sequential algorithm; stereo matching algorithm; zero crossings; Arithmetic; Contracts; Logic; Pattern matching; Relaxation methods; Terminology;
Conference_Titel :
Pattern Recognition, 1992. Vol. IV. Conference D: Architectures for Vision and Pattern Recognition, Proceedings., 11th IAPR International Conference on
Conference_Location :
The Hague
Print_ISBN :
0-8186-2925-8
DOI :
10.1109/ICPR.1992.202135
