Point matching in a time sequence of stereo image pairs and its parallel implementation on a multiprocessor.

Mun K. Leung*, Alok N. Choudhary, Janak H. Patel, Thomas S. Huang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations


An algorithm for finding point correspondences among stereo image pairs at two consecutive time instants (ti-1, ti) and its parallel implementation on an Intel ipsc/2 hypercube multiprocessor system are presented. There are 137 unambiguous matched-point pairs among the images used. This number of points may be not enough for generating the structure of the object in the images; however, for motion estimation using stereo imagery, only three pairs of points (for the ideal case) are required, which implies that the results are more than enough for the estimation of motion parameters. From the parallel implementation of the feature extraction and stereo match algorithms on a hypercube multiprocessor system, it is observed that if the computation is uniformly distributed across the image (feature extraction) then almost linear speed-ups can be obtained by partitioning the data equally among the processsor of the hypercube.

Original languageEnglish (US)
Title of host publicationProc Workshop Visual Motion
Editors Anon
Number of pages8
StatePublished - 1989
EventProceedings: Workshop on Visual Motion - Washington, DC, USA
Duration: Mar 28 1989Mar 31 1989

Publication series

NameProc Workshop Visual Motion


OtherProceedings: Workshop on Visual Motion
CityWashington, DC, USA

ASJC Scopus subject areas

  • General Engineering


Dive into the research topics of 'Point matching in a time sequence of stereo image pairs and its parallel implementation on a multiprocessor.'. Together they form a unique fingerprint.

Cite this