Share Email Print

Proceedings Paper

Object identification and registration via sieve processes
Author(s): Jonathan Phillips; Junqing Huang; Stanley M. Dunn
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A fundamental problem in computer vision is establishing correspondence between features in two images of the same scene. The computational burden in this problem is solving for the optimal mapping and transformation between the two scenes. In this paper we present a sieve algorithm for efficiently estimating the transformation and correspondence. A sieve algorithm use approximations to generate a sequence of increasingly accurate estimates of the correspondence. Initially, the approximations are computationally inexpensive and are designed to quickly sieve through the space of possible solutions. As the space of possible solutions shrinks, greater accuracy is required and the complexity of the approximations increases. The features in the image are modeled as points in the plane, and the structure in the image is a planar graph between the features. By modeling the object in the image as a planar graph we allow the approximations to be designed with point- set matching algorithms, geometric invariants, and graph- processing algorithms. The sieve algorithm is demonstrated on three problems. The first is registering images of muscles taken with an electron microscope. The second is aligning images of geometric patterns taken with a charged- couple device (CCD) camera. The third is recognizing objects taken with a CCD camera.

Paper Details

Date Published: 14 June 1996
PDF: 12 pages
Proc. SPIE 2755, Signal Processing, Sensor Fusion, and Target Recognition V, (14 June 1996); doi: 10.1117/12.243152
Show Author Affiliations
Jonathan Phillips, US Army Research Lab. (United States)
Junqing Huang, Rutgers Univ. (United States)
Stanley M. Dunn, Rutgers Univ. (United States)

Published in SPIE Proceedings Vol. 2755:
Signal Processing, Sensor Fusion, and Target Recognition V
Ivan Kadar; Vibeke Libby, Editor(s)

© SPIE. Terms of Use
Back to Top