Share Email Print

Proceedings Paper

Robust Parallel Computation Of Image Displacement Fields
Author(s): P. Anandan; Mark F. Cullen
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 19 February 1988
PDF: 7 pages
Proc. SPIE 0848, Intelligent Robots and Computer Vision VI, (19 February 1988); doi: 10.1117/12.942744
Show Author Affiliations
P. Anandan, Yale University (United States)
Mark F. Cullen, Perkin-Elmer Corp. (United States)

Published in SPIE Proceedings Vol. 0848:
Intelligent Robots and Computer Vision VI
David P. Casasent; Ernest L. Hall, Editor(s)

© SPIE. Terms of Use
Back to Top