Invariant Features from Interest Point Groups
Abstract
This paper approaches the problem of finding correspondences between images in which there are large changes in viewpoint, scale and illumination. Recent work has shown that scale-space ‘interest points ’ may be found with good repeatability in spite of such changes. Furthermore, the high entropy of the surrounding image regions means that local descriptors are highly discriminative for matching. For descriptors at interest points to be robustly matched between images, they must be as far as possible invariant to the imaging process. In this work we introduce a family of features which use groups of interest points to form geometrically invariant descriptors of image regions. Feature descriptors are formed by resampling the image relative to canonical frames defined by the points. In addition to robust matching, a key advantage of this approach is that each match implies ahypothesis of the local 2D (projective) transformation. This allows us to immediately reject most of the false matches using a Hough transform. We reject remaining outliers using RANSAC and the epipolar constraint. Results show that dense feature matching can be achieved in a few seconds of computation on 1GHz Pentium III machines. 1
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The citation lists haven’t been fetched yet
References 13 · Cited by 611
- Authors
- Brown, M., & Lowe, D.
- Affiliations
- University of British Columbia (CA)
- ORCID
- Lowe, D.
- Venue
- Procedings of the British Machine Vision Conference 2002
- Publisher
- British Machine Vision Association
- Published
- 2002
- Pages
- 23.1-23.10
- OpenAlex
- W2012778485
- Cited by
- 611
- References
- 13
- Citations by year
- 2025: 8 · 2024: 9 · 2023: 11 · 2022: 17 · 2021: 20 · 2020: 14 · 2019: 22 · 2018: 26 · 2017: 29 · 2016: 33 · 2015: 37 · 2014: 35 · 2013: 50 · 2012: 50
- FWCI
- 6.02
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- British Machine Vision Conference (BMVC) (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 Retrieval and Classification Techniques
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Vision and Imaging
- Keywords
- interest points, scale space, invariant features, local descriptors, image matching, viewpoint variation, scale variation, illumination variation, repeatability, feature matching
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