Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4961090 | Procedia Computer Science | 2017 | 6 Pages |
Abstract
Curve Matching plays a significant role in object recognition, target tracking and fragment reassembling. This paper presents a representation and matching algorithm for planar curve based on sub-matrix and concentric circles. The algorithm includes two steps, namely rough matching and exact matching. The rough matching uses a sub-matrix matching method. As for exact matching, first, the representation of curve uses concentric circles and then measures their similarity through two curve representation sets of concentric circles. Our algorithm which is robust to the translation, rotation and scaling, can be used to match block objects and SAR image registration. The experiment results show us the effectiveness and feasibility of algorithm.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jin Changjiang, Li Mingfu, Wang Jin, Liu Xiupeng,