Parallel stereo on fixed size arrays using zero crossings

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 square root P* square root 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>