By Topic

Fast landmark-based registration via deterministic and efficient processing, some preliminary results

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
$31 $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

1 Author(s)
DePiero, F. ; CalPoly State Univ., San Luis Obispo, CA, USA

Preliminary results of a 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 128×200 to 240×320. 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.

Published in:

3D Data Processing Visualization and Transmission, 2002. Proceedings. First International Symposium on

Date of Conference: