2009 IEEE 12th International Conference on Computer Vision 2009
DOI: 10.1109/iccv.2009.5459443
|View full text |Cite
|
Sign up to set email alerts
|

An algebraic model for fast corner detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0
3

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(16 citation statements)
references
References 20 publications
0
12
0
3
Order By: Relevance
“…Certain characteristics can be assigned to these points such as intensity gradient and/or the intensity spread of adjacent pixels. Several corner point detecting algorithms can be used for that purpose including the most frequently used Harrisalgorithm [10,11]. If these characteristics are invariant to any magnification or rotation, there is a possibility for finding more corner points with similar characteristics in the overlapping point pair.…”
Section: Making 3d Models On Photogrammetric Basismentioning
confidence: 99%
“…Certain characteristics can be assigned to these points such as intensity gradient and/or the intensity spread of adjacent pixels. Several corner point detecting algorithms can be used for that purpose including the most frequently used Harrisalgorithm [10,11]. If these characteristics are invariant to any magnification or rotation, there is a possibility for finding more corner points with similar characteristics in the overlapping point pair.…”
Section: Making 3d Models On Photogrammetric Basismentioning
confidence: 99%
“…[7][8][9][10][11][12][13][14][15][16][17][18][19][20][21] Most of them are single-scale detectors. They can work well if the image has similar-size features, but are ineffective otherwise.…”
Section: Introductionmentioning
confidence: 99%
“…While the synthetic shape instances of the same object completely overlap one another, avoiding bias to the repeatability score (Willis and Sui 2009), the real stereo data contains occlusions (the underside of each object, which varied across instances, was not captured), as well as uneven sampling density and generally more sampling noise. The applicability to real applications of our performance evaluation using synthetic data will therefore be tested by comparing the results on the Mesh dataset with those on the Stereo dataset.…”
Section: Test Datamentioning
confidence: 99%
“…The Heaviside step function H (·) returns 1 when the input is positive, 0 otherwise. This repeatability measure favours dense interest points over accurate but sparse interest points (Willis and Sui 2009). However, the fairness of our evaluation is not affected because fully-overlapped object pairs are used in the experiments.…”
Section: Repeatabilitymentioning
confidence: 99%