Stereo and image matching on fixed size linear arrays

The authors present parallel techniques to implement two vision tasks; stereo matching and image matching using linear features as primitives. The implementations are performed on a fixed size linear array and achieve processor-time optimal performance. For stereo matching, they propose an O(Nn/sup 3//P) time algorithm on a P-processor linear array, where N is the number of line segments in one image, n is the number of line segments in a window determined by the object size, and P>