Matching: Invariant to translations, rotations and scale changes
作者:
Highlights:
•
摘要
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.
论文关键词:Attributed relational structures,Invariance,Pattern recognition,Relaxation labelling,Sub-graph matching
论文评审过程:Received 28 November 1990, Revised 12 September 1991, Accepted 20 September 1991, Available online 19 May 2003.
论文官网地址:https://doi.org/10.1016/0031-3203(92)90075-T