Robust Parallel Computation Of Image Displacement Fields

P. Anandan; Mark F. Cullen

doi:10.1117/12.942744

19 February 1988 Robust Parallel Computation Of Image Displacement Fields

P. Anandan, Mark F. Cullen

Proceedings Volume 0848, Intelligent Robots and Computer Vision VI; (1988) https://doi.org/10.1117/12.942744
Event: Advances in Intelligent Robotics Systems, 1987, Cambridge, CA, United States

Abstract

This paper describes the implementation of a hierarchical multi-resolution algorithm for the computation of dense displacement fields on the Connection Machine'. The algorithm uses the pyramid representation of the images and a coarse-to-fine matching strategy. At each level of processing, a confidence measure is computed for the match of each pixel, and a smoothness con-straint is used to propagate the reliable displacements to their less reliable neighbors. The focus of this implementation is the use of the Connection Machine for pyramid processing and the implementation of the coarse to fine matching strategy. It will be shown that this technique can be used to successfully match pairs of real images in near real-time.

Citation Download Citation

P. Anandan and Mark F. Cullen "Robust Parallel Computation Of Image Displacement Fields", Proc. SPIE 0848, Intelligent Robots and Computer Vision VI, (19 February 1988); https://doi.org/10.1117/12.942744

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available