Abstract

Preliminary results of a new method for range view registration are presented. The method incorporates the LeRP Algorithm, which is a deterministic means to approximate subgraph isomorphisms. Graphs are formed that describe salient scene features. Graph matching then provides the scene-to-scene correspondence necessary for registration. A graphical representation is invariant with respect to sensor standoff. Test results from real and synthetic images indicate that a reasonable tradeoff between speed and accuracy is achievable. A mean rotational error of ~1 degree was found for a variety of test cases. Mean compute times were found to be better than 2 Hz, with image sizes varying from 128x200 to 240x320. These tests were run on a 900 MHz PC. The greatest challenge to this approach is the stable localization and invariant characterization of image features via fast, deterministic techniques.

Disciplines

Electrical and Computer Engineering

Publisher statement

Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

Share

COinS
 

URL: http://digitalcommons.calpoly.edu/eeng_fac/8