Algorithm for the inexact matching of high-level 3-D polyhedric representations

Hans Peter Amann; Heinz Huegli

doi:10.1117/12.57121

1 February 1992 Algorithm for the inexact matching of high-level 3-D polyhedric representations

Hans Peter Amann, Heinz Huegli

Proceedings Volume 1609, Model-Based Vision Development and Tools; (1992) https://doi.org/10.1117/12.57121
Event: Robotics '91, 1991, Boston, MA, United States

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.

Citation Download Citation

Hans Peter Amann and Heinz Huegli "Algorithm for the inexact matching of high-level 3-D polyhedric representations", Proc. SPIE 1609, Model-Based Vision Development and Tools, (1 February 1992); https://doi.org/10.1117/12.57121

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available