Machine Learning for High-Speed Corner Detection
The DOI matches its Crossref record; 32 of the 33 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Moreover, the efficiency of HF-net2 was tested and compared with several wellknown handcrafted algorithms for keypoint detection and description including Harris [4], FAST [6], SIFT [9] and ORB [8].”
From Keypoint Detection and Description through Deep Learning in Unstructured Environments (2023) · cites this paper as [6]
In the citing paper
“As the mission distance increase, the planetary rovers increasingly require safer, more real-time, and more accurate navigation systems [29,86,87].”
From Semantic Terrain Segmentation in the Navigation Vision of Planetary Rovers—A Systematic Literature Review (2022) · cites this paper as [86]
In the citing paper
“This transition marked a new era, where we moved beyond the classic approaches and task-specific feature engineering of earlier days [Lowe 2004; Bay et al. 2006; Rosten and Drummond 2006] towards models that could be trained once over large amounts of data, and then adapted for a broad variety of tasks, such as image recognition, object detection, and image segmentation [Krizhevsky et al. 2012; Sz”
From On the Opportunities and Risks of Foundation Models (2021) · cites this paper as Rosten and Drummond 2006
Citations
Cites
Distinctive Image Features from Scale-Invariant Keypoints
Lowe, D. G. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000029664.99615.94 · Cited by 55,589 · cited 1×
“Lowe [12] obtains scale invariance by convolving the image with a Difference of Gaussians (DoG) kernel at multiple scales, retaining locations which are optima in scale as well as space.”
MethodQuinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439 · cited 1×
“Stage 2 employs the algorithm used in ID3[31] and begins by selecting the x which yields the most information about whether the candidate pixel is a corner, measured by the entropy of Kp.”
MethodA Combined Corner and Edge Detector
Harris, C., & Stephens, M. (1988) · Procedings of the Alvey Vision Conference 1988 · doi:10.5244/c.2.23 · Cited by 12,901 · cited 2×
“A number of suggestion have [5,7,8,9] been made for how to compute the corner strength from H and these have been all shown [10] to be equivalent to various matrix norms of H Zheng et al.”
MethodResultShi, J., & Tomasi (1994) · Proceedings of IEEE Conference on Computer Vision and Pattern Recognition CVPR-94 · doi:10.1109/cvpr.1994.323794 · Cited by 7,724 · cited 5×
“Based on the assumption of affine image deformation, a mathematical analysis led Shi and Tomasi[7] conclude that it is better to use the smallest eigen value of H as the corner strength function: C = min (λ1, λ2).”
BackgroundMethodResultInfluentialHaralock, R. M., & Shapiro, L. G. (1991) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 3,933
SUSAN—a new approach to low level image processing
Smith, S. M., & Brady, J. M. (1997) · International Journal of Computer Vision · doi:10.1023/a:1007963824710 · Cited by 3,333 · cited 2×
“Smith and Brady[27] claim that the SUSAN corner detector performs well in the presence of noise since it does not compute image derivatives, and hence, does not amplify noise.”
BackgroundMethodEvaluation of Interest Point Detectors
Schmid, C., Mohr, R., & Bauckhage, C. (2000) · International Journal of Computer Vision · doi:10.1023/a:1008199403446 · Cited by 1,484 · cited 4×
“When measuring reliability, what is important is if the same real-world features are detected from multiple views [1] This is the definition which will be used here.”
BackgroundMethodInfluentialAn Affine Invariant Interest Point Detector
Mikolajczyk, K., & Schmid, C. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47969-4_9 · Cited by 1,325 · cited 2×
“Recently, scale invariance has been extended to consider features which are invariant to affine transformations [14,16,17].”
BackgroundFusing points and lines for high performance tracking
Rosten, E., & Drummond, T. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.104 · Cited by 1,119 · cited 2×
“In addition, the approach allows the detector to be generalised, producing a suite of high-speed detectors which we currently use for real-time tracking [2] and AR label placement [3].”
BackgroundSelf-citationIndexing based on scale invariant interest points
Mikolajczyk, K., & Schmid, C. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937561 · Cited by 1,101 · cited 3×
“Scale-space techniques have also been combined with the Harris approach in [15] which computes Harris corners at multiple scales and retains only those which are also optima of the LoG response across scales.”
Method
Research works printed but not linked: 3
- Noble, A.: Descriptions of image surfaces. PhD thesis, Department of Engineering Science, University of Oxford (1989)
- James, L., Crowley, O.R.: Fast computation of characteristic scale using a half octave pyramid. In: Scale Space 2003: 4th International Conference on Scale-Space theories in Computer Vision, Isle of Skye, Scotland (2003)
- Performenace Evaluation of Corner Detection Algorithms under Affine and Similarity Transforms. In: Cootes, T.F., Taylor, C. (eds.) 12th British Machine Vision Conference, Manchester, British Machine Vision Assosciation (2001)
Cited by
Items 1,001–1,007 of 1,007
Kamoona, A. M., Gostar, A. K., Bab-Hadiashar, A., & Hoseinnezhad, R. (2021) · arXiv · doi:10.48550/arxiv.2108.12159 · Cited by 19
“Different works have been proposed earlier to extend FAST by either optimizing it [53], or adding a descriptor and adding orientation estimation [54].”
MethodKuang, B., Gu, C., Rana, Z. A., Zhao, Y., Sun, S., & Nnabuife, S. G. (2022) · Sensors · doi:10.3390/s22218393 · Cited by 15
“As the mission distance increase, the planetary rovers increasingly require safer, more real-time, and more accurate navigation systems [29,86,87].”
Self-Supervised 3D Keypoint Learning for Ego-motion Estimation
Tang, J., Ambrus, R., Guizilini, V., Pillai, S., Kim, H., Jensfelt, P., & Gaidon, A. (2019) · arXiv · doi:10.48550/arxiv.1912.03426 · Cited by 14
“Learning-Based Methods for Keypoint Estimation Rosten and Drummond [42, 43] pioneered the detection of learning-based image features by learning a decision tree over image patches and accurately classifying corner features with real-time considerations.”
Considering Race a Problem of Transfer Learning
Khan, A., & Mahmoud, M. (2019) · 2019 IEEE Winter Applications of Computer Vision Workshops (WACVW) · doi:10.1109/wacvw.2019.00022 · Cited by 12
Spacecraft Homography Pose Estimation with Single-Stage Deep Convolutional Neural Network
Chen, S., Yang, W., Wang, W., Mai, J., Liang, J., & Zhang, X. (2024) · Sensors · doi:10.3390/s24061828 · Cited by 12
“Examples of such feature extraction methods include SIFT [5], FAST [6], SURF [7], ORB [8], FPFH [9], etc.”
MethodKeypoint Detection and Description through Deep Learning in Unstructured Environments
Petrakis, G., & Partsinevelos, P. (2023) · Robotics · doi:10.3390/robotics12050137 · Cited by 10
“The handcrafted and well-known keypoint detectors including Harris [4], Shi-Tomasi [5], FAST [6], AKAZE [7] and keypoint descriptors such as ORB [8], SIFT [9] and SURF [10] have been widely investigated and used in multiple applications of computer vision and photogrammetry for more than three…”
Quantitative evaluation of footwear evidence: Initial workflow for an end‐to‐end system
Venkatasubramanian, G., Hegde, V., Lund, S. P., Iyer, H., & Herman, M. (2021) · Journal of Forensic Sciences · doi:10.1111/1556-4029.14802 · Cited by 8
“The method of corner detection used here is discussed in Venkatasubramanian et al. [24], which is a minor modification we made to the FAST algorithm [27].”
Method
Metadata
- Authors
- Rosten, E., & Drummond, T.
- Affiliations
- University of Cambridge (GB)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 430-443
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1532362218
- Cited by
- 4,555
- References
- 33
- Citations by year
- 2026: 90 · 2025: 201 · 2024: 241 · 2023: 268 · 2022: 328 · 2021: 346 · 2020: 311 · 2019: 335 · 2018: 350 · 2017: 333 · 2016: 301 · 2015: 339 · 2014: 298 · 2013: 245 · 2012: 184
- FWCI
- 37.10
- Type
- conference paper
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image and Video Retrieval Techniques
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image and Object Detection Techniques
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Vision and Imaging
- Keywords
- corner detection, feature detection, real-time video processing, computational efficiency, SIFT, Harris corner detector
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.