2019
DOI: 10.1109/access.2019.2935879
|View full text |Cite
|
Sign up to set email alerts
|

Shape Matching Based on Multi-Scale Invariant Features

Abstract: Shape matching has been extensively used in various fields. The local feature-based or global feature-based algorithms can hardly describe the shape comprehensively due to their inherent defects. Combining the local and global feature to describe the shape has become a trend. In this paper, an improved discrete curve evolution algorithm is proposed which combines the discrete curve evolution with the uniform sampling and achieves a better description of the shape contour. Three simple and intuitive multi-scale… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 39 publications
0
2
0
Order By: Relevance
“…The effect of contour matching is closely related to the quality of the contour template [ 15 ]. This section describes the algorithm flow and the key points of contour template creation, including image preprocessing, calculating the number of adaptive pyramid layers, calculating the adaptive search angle step of the image pyramid, establishing the template image pyramid, and extracting the contour feature information of the template image.…”
Section: Design Of Contour Template Building Algorithmmentioning
confidence: 99%
“…The effect of contour matching is closely related to the quality of the contour template [ 15 ]. This section describes the algorithm flow and the key points of contour template creation, including image preprocessing, calculating the number of adaptive pyramid layers, calculating the adaptive search angle step of the image pyramid, establishing the template image pyramid, and extracting the contour feature information of the template image.…”
Section: Design Of Contour Template Building Algorithmmentioning
confidence: 99%
“…However, corner detection methods (e.g., FAST, SUSAN, MSFD and curvature scale-space (CSS) 11 – 13 ) can generate rich and accurate corners, but are susceptible to inaccuracies for images with homogenous backgrounds and are therefore unsuitable for low-contrast images. Spot detection methods such as Hessian’s determinant or maximum stable extreme region 14 – 16 and the feature detection algorithms SIFT 17 , 18 and SURF 19 rely on extreme points in a region to detect feature points. Aldana-Iuit et al introduced a feature detector named Sadder 20 .…”
Section: Introductionmentioning
confidence: 99%
“…The problem of registering point sets arises in a variety of applications, such as workpiece localization [1], digital elevation model generation [2], shape recognition [3], [4], and image registration [5], [6], thus laying a foundation for the implementation of many high-technology platforms. In general, the task of point set registration is to assign potential point-to-point correspondences and recover the underlying transformation that warps one point set to the other.…”
Section: Introductionmentioning
confidence: 99%