Cited by 605Advanced Image and Video Retrieval TechniquesImage Retrieval and Classification TechniquesFace and Expression Recognition

LDAHash: Improved Matching with Smaller Descriptors

Open access
Strecha, C., Bronstein, A. M., Bronstein, M. M., Fua, P.·2012·IEEE Transactions on Pattern Analysis and Machine Intelligence

Abstract

SIFT-like local feature descriptors are ubiquitously employed in computer vision applications such as content-based retrieval, video analysis, copy detection, object recognition, photo tourism, and 3D reconstruction. Feature descriptors can be designed to be invariant to certain classes of photometric and geometric transformations, in particular, affine and intensity scale transformations. However, real transformations that an image can undergo can only be approximately modeled in this way, and thus most descriptors are only approximately invariant in practice. Second, descriptors are usually high dimensional (e.g., SIFT is represented as a 128-dimensional vector). In large-scale retrieval and matching problems, this can pose challenges in storing and retrieving descriptor data. We map the descriptor vectors into the Hamming space in which the Hamming metric is used to compare the resulting representations. This way, we reduce the size of the descriptors by representing them as short binary strings and learn descriptor invariance from examples. We show extensive experimental validation, demonstrating the advantage of the proposed approach.

Integrity signals

Registry

Crossref · 10.1109/tpami.2011.103

Cites

39 of 39 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • The optimization approach transforms hash function learning into a regression problem with binary code B as the regression target, avoiding a relaxation strategy for nonconvex binary constraints.

    “More importantly, our optimization approach transforms the hash function learning into a regression problem with binary code B as the regression target, thus avoiding the use of a relaxation strategy to solve the nonconvex equation with binary constraints in most published works [3], [8], [18], [35], [48], [57], [58].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Strecha, C., Bronstein, A. M., Bronstein, M. M., & Fua, P.
Affiliations
  • École Polytechnique Fédérale de Lausanne (CH)
  • Technion – Israel Institute of Technology (IL)
Venue
IEEE Transactions on Pattern Analysis and Machine Intelligence
Published
2012-01
Volume
34
Issue
1
Pages
66-78
ISSN
  • 0162-8828 (ISSN-L)
  • 2160-9292
OpenAlex
W2134514757
Cited by
605
References
39
Citations by year
2026: 2 · 2025: 9 · 2024: 9 · 2023: 10 · 2022: 13 · 2021: 32 · 2020: 42 · 2019: 43 · 2018: 43 · 2017: 100 · 2016: 63 · 2015: 83 · 2014: 64 · 2013: 53 · 2012: 28
FWCI
53.50
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Pattern Analysis and Machine Intelligence (publishedVersion)
  • PubMed (publishedVersion)
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion, cc-by-nc-nd)
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne) (submittedVersion)
Funders
École Polytechnique Fédérale de Lausanne
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 › Face and Expression Recognition
Keywords
local descriptors, descriptor reduction, Hamming space, binary codes, image matching, content-based image retrieval, large-scale retrieval, affine invariance, scale invariance

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