Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 233

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

Repeatability Is Not Enough: Learning Affine Regions via Discriminability

Open access
Mishkin, Dmytro, Radenović, Filip, Matas, Jiři·2018·Lecture Notes in Computer Science

Abstract

A method for learning local affine-covariant regions is presented. We show that maximizing geometric repeatability does not lead to local regions, a.k.a features, that are reliably matched and this necessitates descriptor-based learning. We explore factors that influence such learning and registration: the loss function, descriptor type, geometric parametrization and the trade-off between matchability and geometric accuracy and propose a novel hard negative-constant loss function for learning of affine regions. The affine shape estimator – AffNet – trained with the hard negative-constant loss outperforms the state-of-the-art in bag-of-words image retrieval and wide baseline stereo. The proposed training process does not require precisely geometrically aligned patches. The source codes and trained weights are available at https://github.com/ducha-aiki/affnet.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/978-3-030-01240-3_18

Cites

8 of 8 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 8 references

Cited by

See all 233

Metadata

Authors
Mishkin, D., Radenović, F., & Matas, J.
Venue
Lecture Notes in Computer Science
Published
2018
Pages
287-304
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W2884354140
Cited by
233
References
8
FWCI
6.85
Type
conference paper
Language
en
Open access
green

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Repeatability Is Not Enough: Learning Affine Regions via Discriminability. https://app.cochat.ai/papers/10.1007/978-3-030-01240-3_18
The paper
Mishkin, D., Radenović, F., & Matas, J. (2018). Repeatability Is Not Enough: Learning Affine Regions via Discriminability. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-01240-3_18

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.