2012 International Conference on Computer Science and Service System 2012
DOI: 10.1109/csss.2012.572
|View full text |Cite
|
Sign up to set email alerts
|

Comparison and Study of Classic Feature Point Detection Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
4
0
1

Year Published

2013
2013
2022
2022

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(5 citation statements)
references
References 4 publications
0
4
0
1
Order By: Relevance
“…Wang, Panda et al design an improved SIFT (Scale Invariant Feature Transform) algorithm to realize object segmentation and localization [7,8]. Although these methods are feasible in certain cases, they depend on image features and are sensitive to image noise [9]. To satisfy the requirements of these methods, the robot operating workspace needs to be strictly controlled, hence these methods are not generally applicable.…”
Section: Object Classification and Detectionmentioning
confidence: 99%
“…Wang, Panda et al design an improved SIFT (Scale Invariant Feature Transform) algorithm to realize object segmentation and localization [7,8]. Although these methods are feasible in certain cases, they depend on image features and are sensitive to image noise [9]. To satisfy the requirements of these methods, the robot operating workspace needs to be strictly controlled, hence these methods are not generally applicable.…”
Section: Object Classification and Detectionmentioning
confidence: 99%
“…(4) Extract edge feature points. the feature points in the edge are determined by the characteristics of the the Hessian matrix's Eigen values ,which are proportional to the main curvature values of the Gaussian difference function D. The Hessian matrix is as shown in Equation (5).…”
Section: D2og Feature Detection Stepsmentioning
confidence: 99%
“…Although, the algorithm can detect corners in a single scale, the positioning accuracy of detection is poor [4]. According to different scenarios, Mikolajczyk etc take a test for a variety of the most representative descriptors [5]. The SIFT descriptor performance is good, but the complexity of the algorithm is high, and the calculation of the algorithm is large.…”
Section: Introductionmentioning
confidence: 99%
“…It is not suitable for images with detailed information. Scale-Invariant Feature Transform (SIFT) algorithm has been widely used as the mainstream algorithm for image matching because of its strong robustness to illumination and scale rotation [9,14]. However, the cost is an increase in computation time [8,22].…”
Section: Introductionmentioning
confidence: 99%