CoChat

Sub-linear Indexing for Large Scale Object Recognition

Obdrzalek, S., Matas, J. · 2005 · Procedings of the British Machine Vision Conference 2005
Cited by 85

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

Abstract

Realistic approaches to large scale object recognition, i.e. for detection and localisation of hundreds or more objects, must support sub-linear time indexing.In the paper, we propose a method capable of recognising one of N objects in log(N) time.The "visual memory" is organised as a binary decision tree that is built to minimise average time to decision.Leaves of the tree represent a few local image areas, and each non-terminal node is associated with a 'weak classifier'.In the recognition phase, a single invariant measurement decides in which subtree a corresponding image area is sought.The method preserves all the strengths of local affine region methodsrobustness to background clutter, occlusion, and large changes of viewpoints.Experimentally we show that it supports near real-time recognition of hundreds of objects with state-of-the-art recognition rates.After the test image is processed (in a second on a current PCs), the recognition via indexing into the visual memory requires milliseconds.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.5244/c.19.3

Cites

4 of 4 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.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Cited by

See all 85

Metadata

Authors
Obdrzalek, S., & Matas, J.
Venue
Procedings of the British Machine Vision Conference 2005
Published
2005
Pages
3.1-3.10
OpenAlex
W2083200674
Cited by
85
References
4
FWCI
10.68
Type
conference paper
Language
en
Open access
closed

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.