Sub-linear Indexing for Large Scale Object Recognition
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.
Integrity signals
Registry
Cites
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.
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
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
Video Google: a text retrieval approach to object matching in videos
Sivic, & Zisserman (2003) · Proceedings Ninth IEEE International Conference on Computer Vision · doi:10.1109/iccv.2003.1238663 · Cited by 6,367
A comparison of affine region detectors
Mikolajczyk, K., Tuytelaars, T., Schmid, C., Zisserman, A., Matas, J., Schaffalitzky, F., Kadir, T., & Gool, L. V. (2005) · International Journal of Computer Vision · doi:10.1007/s11263-005-3848-x · Cited by 2,939
Self-citationRobust Wide Baseline Stereo from Maximally Stable Extremal Regions
Matas, J., Chum, O., Urban, M., & Pajdla, T. (2002) · Procedings of the British Machine Vision Conference 2002 · doi:10.5244/c.16.36 · Cited by 1,350
Self-citation
Cited by
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
Kalal, Z., Mikolajczyk, K., & Matas, J. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.239 · Cited by 3,285
Self-citationObject retrieval with large vocabularies and fast spatial matching
Philbin, J., Chum, O., Isard, M., Sivic, J., & Zisserman, A. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383172 · Cited by 2,929
Kernelized locality-sensitive hashing for scalable image search
Kulis, B., & Grauman, K. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459466 · Cited by 890
Small codes and large image databases for recognition
Torralba, A., Fergus, R., & Weiss, Y. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587633 · Cited by 727
“Nister and Stewenius demonstrate the real-time specific object recognition using a database of 40,000 images [19]; Obdrzalek and Matas show sub-linear indexing time on the COIL dataset [20].”
MethodEfficient Visual Search of Videos Cast as Text Retrieval
Sivic, J., & Zisserman, A. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.111 · Cited by 499
Nonparametric Scene Parsing via Label Transfer
Liu, C., Yuen, J., & Torralba, A. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.131 · Cited by 368
Unifying Deep Local and Global Features for Image Search
Cao, B., Araujo, A., & Sim, J. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58565-5_43 · Cited by 366
Kernelized Locality-Sensitive Hashing
Kulis, B., & Grauman, K. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.219 · Cited by 331
A Linear Time Histogram Metric for Improved SIFT Matching
Pele, O., & Werman, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88690-7_37 · Cited by 305
Randomized Clustering Forests for Image Classification
Moosmann, F., Nowak, E., & Jurie, F. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70822 · Cited by 287
Efficient representation of local geometry for large scale object retrieval
Perd'och, M., Chum, O., & Matas, J. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206529 · Cited by 265
Self-citationGrauman, K., & Leibe, B. (2011) · Synthesis Lectures on Artificial Intelligence and Machine Learning · doi:10.2200/s00332ed1v01y201103aim011 · Cited by 126
“EFFICIENT SIMILARITY SEARCH 33 grating learning or the matching task into the tree construction, for example by using decision trees in which each internal node is associated with a weak classifier built with simple measurements from the feature patches (Lepetit et al. 2005, Obdrzalek & Matas 2005).”
Method
Metadata
- Authors
- Obdrzalek, S., & Matas, J.
- Venue
- Procedings of the British Machine Vision Conference 2005
- Publisher
- British Machine Vision Association
- 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.