By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Leung, M.K. ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA ; Choudhary, A.N. ; Patel, J.H. ; Huang, T.S.

An algorithm for finding point correspondences among stereo image pairs at two consecutive time instants (ti-1,t i) 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 processor of the hypercube

Published in:

Visual Motion, 1989.,Proceedings. Workshop on

Date of Conference:

20-22 Mar 1989