Matching: Invariant to translations, rotations and scale changes

An optimization approach to invariant matching is proposed. In this approach, an object or a pattern is invariantly represented by an object-centred description called an attributed relational structure (ARS) embedding invariant properties and relations between the primitives of the pattern such as...

Full description

Saved in:
Bibliographic Details
Published in:Pattern recognition 1992, Vol.25 (6), p.583-594
Main Author: Li, S.Z.
Format: Article
Language:English
Subjects:
Applied sciences
Artificial intelligence
Attributed relational structures
Computer science
control theory
systems
Exact sciences and technology
Invariance
Pattern recognition
Pattern recognition. Digital image processing. Computational geometry
Relaxation labelling
Sub-graph matching
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:An optimization approach to invariant matching is proposed. In this approach, an object or a pattern is invariantly represented by an object-centred description called an attributed relational structure (ARS) embedding invariant properties and relations between the primitives of the pattern such as line segments and points. Noise effect is taken into account such that a scene can consist of noisy sub-parts of a model. The matching is then to find the optimal mapping between the ARSs of the scene and the model. A gain functional is formulated to measure the goodness of fit and is to be maximized by using the relaxation labelling method. Experiments are shown to illustrate the matching algorithm and to demonstrate that the approach is truly invariant to arbitrary translations, rotations, and scale changes under noise.
ISSN:0031-3203
1873-5142
DOI:10.1016/0031-3203(92)90075-T