Issue No. 12 - December (1992 vol. 14)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.177385
<p>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.</p>
structural indexing; consecutive segment groups; scene segmentation; scale-insensitivity; rotation-insensitivity; translation-insensitivity; efficient 2D object recognition; multiple flat objects; cluttered environment; multiple line tolerances; robustness; super segments; database; polygonal approximation; noise; occlusion; weak perspective; complexity bound; computational complexity; database management systems; image recognition; image segmentation
F. Stein and G. Medioni, "Structural Indexing: Efficient 2D Object Recognition," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 14, no. , pp. 1198-1204, 1992.