By Topic

Structural indexing: efficient 2D object recognition

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

2 Author(s)
Stein, F. ; Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA ; Medioni, G.

The problem of recognition of multiple flat objects in a cluttered environment from an arbitrary viewpoint is addressed. The models are acquired automatically and approximated by polygons with multiple line tolerances for robustness. Groups of consecutive segments (super segments) are then encoded and entered into a table. This provides the essential mechanism for indexing and fast retrieval. Once the database of all models is built, the recognition proceeds by segmenting the scene into a polygonal approximation; the code for each super segment retrieves model hypotheses from the table. Hypotheses are clustered if they are mutually consistent and represent the instance of a model. Finally, the estimate of the transformation is refined. This methodology makes it possible to recognize models despite noise, occlusion, scale rotation translation, and a restricted range of weak perspective. A complexity bound is obtained

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:14 ,  Issue: 12 )