Share Email Print

Proceedings Paper

Algorithm for the inexact matching of high-level 3-D polyhedric representations
Author(s): Hans Peter Amann; Heinz Huegli
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper describes a powerful inexact matching algorithms which has been applied with success to high-level 3D object representations in a 3D object recognition system. The algorithm combines in a promising way several approaches proposed in the past couple of years: an extension to the backtrack strategies for inexact matching of attributed relational sub- graphs, error correction isomorphism, determination of local attribute similarity, and global transformation fitting, features which are efficiently used for search-tree pruning. The algorithm was tested successfully in a series of experiments involving scenes with single and multiple objects.

Paper Details

Date Published: 1 February 1992
PDF: 7 pages
Proc. SPIE 1609, Model-Based Vision Development and Tools, (1 February 1992); doi: 10.1117/12.57121
Show Author Affiliations
Hans Peter Amann, Univ. of Neuchatel (Switzerland)
Heinz Huegli, Univ. of Neuchatel (Switzerland)

Published in SPIE Proceedings Vol. 1609:
Model-Based Vision Development and Tools
Rodney M. Larson; Hatem N. Nasr, Editor(s)

© SPIE. Terms of Use
Back to Top