SURF: Speeded Up Robust Features
Open accessThe DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index; none of the 18 sources its claims cite is checked for support yet.
Overview
CoChat Summary
TL;DR
SURF is a scale- and rotation-invariant interest point detector and descriptor that uses integral images, Hessian-based detection, and Haar-wavelet responses to be faster than prior methods while matching or exceeding their repeatability and distinctiveness. It reports strong results on standard benchmarks and a museum object recognition task.
Key findings
- The Fast-Hessian detector is more than 3× faster than DoG and 5× faster than Hessian-Laplace, with comparable or better repeatability on Graffiti, Leuven, Boat, and Wall; on the first Graffiti image (800×640), computation times were 120 ms for Fast-Hessian, 400 ms for DoG, 650 ms for Hessian-Laplace, and 1800 ms for Harris-Laplace.
- SURF’s 64-dimensional descriptor outperformed GLOH, SIFT, and PCA-SIFT in most comparisons, sometimes by more than 10% improvement in recall for the same precision; SURF-128 was slightly better but slower to match.
- Joint detector-descriptor computation times on the first Graffiti image were 255 ms for U-SURF, 354 ms for SURF, 391 ms for SURF-128, and 1036 ms for SIFT.
- In museum object recognition, recognition rates were 85.7% for SURF-128, 83.8% for U-SURF, 82.6% for SURF, 78.3% for GLOH, 78.1% for SIFT, and 72.3% for PCA-SIFT.
Methods
- Design: a scale- and rotation-invariant detector/descriptor. The detector uses the determinant of the Hessian with box-filter approximations evaluated via integral images; the descriptor uses Haar-wavelet responses in a 4×4 subregion grid, producing a 64-dimensional vector, with an upright U-SURF variant and an extended SURF-128 variant.
- Data: standard evaluation sequences from Mikolajczyk (including Graffiti, Wall, Boat, Leuven, Bikes, Trees, and Ubc; Bark excluded from descriptor evaluations) and a real-life museum object recognition database of 216 images of 22 objects, with 116 test images at 320×240.
- Analysis: detector repeatability scores, descriptor recall-(1-precision) graphs under similarity-threshold and nearest-neighbour-ratio matching, recognition rates, and computation timings on a standard Linux PC (Pentium IV, 3 GHz).
Limitations
- The paper has no explicit limitations section. It states that space limitations prevent showing results on all sequences, and it assumes skew, anisotropic scaling, and perspective effects are second-order effects covered only by overall descriptor robustness.
- Evident from the text: the method is scale- and rotation-invariant but not affine-invariant; Fig. 4 notes the interest points are not affine invariant, and the descriptor does not use colour.
- Evident from the text: the object recognition experiment uses small 320×240 test images and matching without additional geometric constraints, which the authors say would reduce false positives but were omitted for comparison purposes.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures








Verification
Claims the paper makes
0 Valid · 2 Not valid · 12 Not checked · 30 Own results and interpretations
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The number of interest points found is on average very similar for all detectors.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The 4 × 4 sub-region division solution provided the best results.”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“SURF outperformed the other descriptors for almost all the comparisons.”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The SURF descriptor outperforms the other descriptors in a systematic and significant way, with sometimes more than 10% improvement in recall for the same level of precision.”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As shown in the results section, the performance is comparable to the one using the discretised and cropped Gaussians.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
8 more claims
Create a free account to see all 44 claims and every source verdict.
- It may state two separate claims as one. 24
- Probably not a substantial claim. 13
- The quote only partly states this claim. 1
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
“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 Bay et al. 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
Rapid object detection using a boosted cascade of simple features
Viola, P., & Jones, M. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990517 · Cited by 18,300
Object recognition from local scale-invariant features
Lowe, D. G. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790410 · Cited by 16,472
A 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
A performance evaluation of local descriptors
Mikolajczyk, K., & Schmid, C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.188 · Cited by 6,723 · cited 14×
“This PCA-SIFT yields a 36-dimensional descriptor which is fast for matching, but proved to be less distinctive than SIFT in a second comparative study by Mikolajczyk et al. [8] and slower feature computation reduces the effect of fast matching.”
BackgroundMethodResultInfluentialMarr, D., & Hildreth, E. (1980) · Proceedings of the Royal Society of London. Series B. Biological Sciences · doi:10.1098/rspb.1980.0020 · Cited by 6,510
PCA-SIFT: a more distinctive representation for local image descriptors
Ke, Y., & Sukthankar, R. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.183 · Cited by 3,932
Robust wide-baseline stereo from maximally stable extremal regions
Matas, J., Chum, O., Urban, M., & Pajdla, T. (2004) · Image and Vision Computing · doi:10.1016/j.imavis.2004.02.006 · Cited by 3,686
Scalable Recognition with a Vocabulary Tree
Nister, D., & Stewenius, H. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (CVPR'06) · doi:10.1109/cvpr.2006.264 · Cited by 3,579
Scale & Affine Invariant Interest Point Detectors
Mikolajczyk, K., & Schmid, C. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000027790.02288.f2 · Cited by 3,436
Cited by
Items 14,701–14,752 of 14,752
CA-Safe DP: Integrating Coordinate Attention and Overshoot Recovery for Robotic Manipulation
Wu, Z., Shi, Y., Wang, Y., Cheng, R., Liu, W., & 张宗达 (2026) · IEEE Conference on Cybernetics and Intelligent Systems · doi:10.1109/cis-ram71614.2026.11668489
“Feature extraction has evolved from handcrafted descriptors (e.g., SIFT and SURF) [28], [29] to learned CNN representations [12].”
Akan, T., Aishwarya, R., Bhuiyan, M. S., & Bhuiyan, M. A. N. (2026) · Diagnostic Pathology · doi:10.1186/s13000-026-01815-6
Cui, J., Wang, W., Fan, L., et al. (2026) · Remote Sensing · doi:10.3390/rs18173055
Raycasting-Based Stereo-to-CAD Registration for Industrial Inspection
Kaune, A., Hinz, L., & Reithmeier, E. (2026) · IEEE Sensors Letters · doi:10.1109/lsens.2026.3731486
“( This implementation uses a SURF-128 descriptor [11].”
Xu, Z., Saputro, A. H., Ibrahim, A. A., & Zulkifley, M. A. (2026) · IEEE Access · doi:10.1109/access.2026.3731988
“…feature techniques: Histogram of Oriented Gradients (HOG) [14], Scale-Invariant Feature Transform (SIFT) [15], Speeded-Up Robust Features (SURF) [16], Local Binary Patterns (LBP) [17], Local Directional Pattern (LDP) [18], and Gabor [19] filters, followed by the application of shallow machine…”
Saleem, M. U., Peng, B., Mastoi, M. S., Hassan, M., & Rafique, M. Z. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-31236-5_21
Sardou, A., Rouigueb, A., Demim, F., Amamra, A., & Belaıdı, H. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-26031-4_12
Real-World UAV Image Stitching Guided by Deep Learning Depth Estimation
Zhang, G., Li, M., Xu, Z., et al. (2026) · Springer proceedings in physics · doi:10.1007/978-981-92-4349-5_49
Research on Image Stitching Technology for Multiple Surface Defects of Concrete Bridges
Zhao, L., Liu, A., & Huang, J. (2026) · Lecture notes in electrical engineering · doi:10.1007/978-981-92-3574-2_33
EVEE: Event-Based Online Adaptation for Matching on Unknown Targets
Zhao, Z., Ju, C., Zhang, Y., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37174-4_21
Yu, W. U., Wenhao, L. I. N., Ren, K., et al. (2026) · Chinese Journal of Aeronautics · doi:10.1016/j.cja.2026.104492
Cross-view geo-localization through consistency-guided transformer and adversarial feature alignment
Chen, J., He, Y., Xiong, L., Yang, Y., & Fu, B. (2026) · International Journal of Remote Sensing · doi:10.1080/01431161.2026.2731638
Li, C., Li, S., Cheng, Z., Yang, J., Yang, Z., & Zhao, H. (2026) · Remote Sensing · doi:10.3390/rs18193332
Multi-grained global–regional aggregation for visual place recognition
Huang, X., Zheng, H., & Xu, Y. (2026) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2026.104989
Kovács, B. G., Budyianto, H., Domonkos, M., et al. (2026) · doi:10.1145/3831600.3831612
Integrating Cue Descriptors in Bubble Space for Place Recognition
Erkent, Ö., & Bozma, I. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39402-7_32
“We conduct a comparative study similar to [17] including three other representations - bubble space (BuS) [21], extended-HCT (e-HCT) [17] and CPAM [22] that have been shown to have better performance in comparison to SURF [23] used together with HIST [24] or classic BoW [25] [17].”
MethodPerformance Evaluation of Local Features for Large-scale Image Recognition
Hondo, T., & Kise, K. (2008)
Poudel, R. P. K. (2014) · Bournemouth University Research Online (Bournemouth University) · Cited by 3
Relative Spatial Weighting of Features for Localizing Parts of Faces
Bellati, J., & Borges, D. L. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-41827-3_52
“Matching would be done for ORB and SURF features as originally proposed [1] [15], although the results presented here open the path for exploring multiple face parts localization and hybrid matching schemes for binary and real valued features possibly.”
BackgroundMethodInfluentialApproximation and Relaxation Approaches for Parallel and Distributed Machine Learning
Tyree, S. (2014) · Open Scholarship Institutional Repository (Washington University in St. Louis) · doi:10.7936/k70863fb
Multi-Object Classification using local features and SVDD
Mansoor, S. B. (2008)
Part-based object retrieval with binary partition trees
Giró-i-Nieto, X. (2012) · doi:10.5821/dissertation-2117-94762
Klein, M. A. (2011) · doi:10.7936/k7jh3jdh
Improved Tower Cranes Operation Using Integrated 3D BIM Model and GPS Technology
Maghzi, S. (2014) · Spectrum Research Repository (Concordia University)
LOCALIZAÇÃO AUTOMÁTICA DE PONTOS DE CONTROLE EM IMAGENS AÉREAS BASEADA EM CENAS TERRESTRES VERTICAIS
Berveglieri, A. (2014) · Americanae (AECID Library)
Enhancing low-level features with mid-level cues
Trulls, E. (2015) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-95639 · Cited by 1
“, 2005) or SURF (Bay et al., 2008), as well as binary descriptors and binarization techniques (see Sec.”
InfluentialBarquero, I. G., González, P. S., Serrano, M. L., et al. (2012)
HUMAN INSPIRED PATTERN RECOGNITION VIA LOCAL INVARIANT FEATURES
Maestas, D. R. (2013) · UNM’s Digital Repository (University of New Mexico)
Caméras 3D pour la localisation d'un système mobile en environnement urbain
Mittet, M.-A. (2015) · theses.fr (ABES) · doi:10.70675/4c744402za020z41d2za3d1z29b2fafea495 · Cited by 3
“6(a)), — les détecteurs basés sur les différences d’intensités également nommés "blob detector" en anglais, tels que [Lowe, 2004],[Bay et al., 2006],[Rublee et al.”
BackgroundInfluentialForensic Tracking and Surveillance: Algorithms for Homogeneous and Heterogeneous Settings
Al-Kuwari, S. M. (2011)
3D reconstruction of dynamic scenes
Özden, K. E. (2007)
Procesamiento y Reconocimiento de Patrones en Video Digital
Iparraguirre, J., & Delrieux, C. A. (2010) · El Servicio de Difusión de la Creación Intelectual (National University of La Plata)
Non-negative Sparse Coding Using Independent Multi-Codebooks for Near-Duplicate Image Detection
Zhou, S. Y., Li, J., Xing, J., et al. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-42057-3_20
“Moreover, the dimensionality of a SURF descriptor is 64, which is merely half of a SIFT.”
MethodInfluentialThe Extraction of Spatial Information and Object Location Information from Video
Park, K.-J., Moon, M.-S., & Lee, K. (2013) · Lecture notes in electrical engineering · doi:10.1007/978-3-642-41671-2_50
“1 Feature Extraction and Matching To use the algorithm of Speeded up Robust Features (SURF) [4] in extracting features.”
MethodSIMULTANEOUSLY ACQUIRING THE SYNTAX AND SEMANTICS OF SPATIAL REFERRING EXPRESSIONS
Wright, J. B. (2014) · UA Campus Repository (The University of Arizona)
Local Feature Evaluation for a Constrained Local Model Framework
Hori, M., Kawai, S., Yoshimura, H., & Iwai, Y. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-13737-7_2
“As features, the gray scaled patch, image gradient, Local Binary Patterns (LBP) [5], Local Directional Pattern (LDP) [6], Local Phase Quantization (LPQ) [7], SIFT [8], SURF [9] and HOG [10] were used for producing the likelihood maps.”
MethodRotation Invariant Registration of 2D Aerial Images Using Local Phase Correlation
Lü, P. (2013) · KTH Publication Database DiVA (KTH Royal Institute of Technology)
Kraft, M. (2010) · Pomiary, Automatyka, Robotyka
Human body analysis using depth data
Cuadros, X. S. (2013) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-95252 · Cited by 1
Building blocks for tomorrow's mobile app store
Choudhury, R. R., & Manweiler, J. (2012)
A New DEM Extraction Method for Hexagon Spy Imagery and Application to Bhutan Glaciers
Maurer, J. A., & Rupper, S. (2014) · Digital Commons - USU (Utah State University)
View-Tuned Approximate Partial Matching Kernel from Hierarchical Growing Neural Gases
Kortkamp, M., & Wachsmuth, S. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21738-8_56
“SURF [1]).”
MethodResultInfluentialLocalization and Mapping Corrections
Gentile, C., Alsindi, N., Raulefs, R., et al. (2012) · Springer eBooks · doi:10.1007/978-1-4614-1836-8_9
Sampling of Web Images with Dictionary Coherence for Cross-Domain Concept Detection
Sun, Y., Sudo, K., Taniguchi, Y., et al. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-35728-2_27
Easy Domain Processing over Heterogeneous Databases: A Unified Programming Paradigm
Liu, R., Wang, W., Li, Q., et al. (2010) · Communications in computer and information science · doi:10.1007/978-3-642-11618-6_11
Photo Indexing and Retrieval based on Content and Context
Broilo, M. (2011) · Unitn-eprints PhD (University of Trento) · doi:10.15168/11572_369243
Correspondencia de caracterısticas utilizando esquemas clásicos en el espectro visible
Carrasco, C. A., Burgos, B. V., Arias, P. A. R., et al. (2014)
Optimal Object Categorization Under Application Specific Conditions
Puttemans, S., & Goedemé, T. (2015) · doi:10.13140/rg.2.2.20580.37768
System wizyjnej lokalizacji wzorców naturalnych
Harasymowicz-Boggio, B., & Siemiątkowska, B. (2012) · Prace Naukowe Politechniki Warszawskiej. Elektronika
Image Mosaic Based on SURF and Results Optimization
Tie, J., & Zhu, G. (2013) · Lecture notes in electrical engineering · doi:10.1007/978-3-642-38466-0_83
Combinação de descritores locais e globais para recuperação de imagens e vídeos por conteúdo
de Andrade, F. D. S. P. (2012) · doi:10.47749/t/unicamp.2012.903641
Metadata
- Authors
- Bay, H., Tuytelaars, T., & Van Gool, L.
- Affiliations
- ETH Zurich (CH)
- KU Leuven (BE)
- ORCID
- Tuytelaars, Tinne
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- Pages
- 404-417
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1677409904
- Semantic Scholar
- 9ad3179098eb9ac7f0c81bf89b6bdcde91752880
- Cited by
- 14,955
- References
- 39
- Citations by year
- 2026: 210 · 2025: 519 · 2024: 727 · 2023: 757 · 2022: 878 · 2021: 975 · 2020: 978 · 2019: 1036 · 2018: 968 · 2017: 976 · 2016: 930 · 2015: 1079 · 2014: 1006 · 2013: 982 · 2012: 884
- FWCI
- 196.80
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Lecture notes in computer science (publishedVersion)
- Lirias (KU Leuven) (submittedVersion, other-oa)
- Funders
- Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
- 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 Retrieval and Classification Techniques
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image and Object Detection Techniques
- Keywords
- SURF, keypoint detection, feature descriptors, scale invariance, rotation invariance, integral image, Hessian matrix, feature matching, object recognition, repeatability
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.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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.