The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Learning Local Feature Descriptors Using Convex Optimisation
Abstract
The objective of this work is to learn descriptors suitable for the sparse feature detectors used in viewpoint invariant matching. We make a number of novel contributions towards this goal. First, it is shown that learning the pooling regions for the descriptor can be formulated as a convex optimisation problem selecting the regions using sparsity. Second, it is shown that descriptor dimensionality reduction can also be formulated as a convex optimisation problem, using Mahalanobis matrix nuclear norm regularisation. Both formulations are based on discriminative large margin learning constraints. As the third contribution, we evaluate the performance of the compressed descriptors, obtained from the learnt real-valued descriptors by binarisation. Finally, we propose an extension of our learning formulations to a weakly supervised case, which allows us to learn the descriptors from unannotated image collections. It is demonstrated that the new learning methods improve over the state of the art in descriptor learning on the annotated local patches data set of Brown et al. and unannotated photo collections of Philbin et al.
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
Optimizing search engines using clickthrough data
Joachims, T. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775067 · Cited by 3,873
Robust wide-baseline stereo from maximally stable extremal regions
Matas, J., Chum, O., Urban, M., & Pajdla, T. (2004) · Image and Vision Computing · doi:10.1016/j.imavis.2004.02.006 · Cited by 3,686
BRIEF: Binary Robust Independent Elementary Features
Calonder, M., Lepetit, V., Strecha, C., & Fua, P. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15561-1_56 · Cited by 3,597
BRISK: Binary Robust invariant scalable keypoints
Leutenegger, S., Chli, M., & Siegwart, R. Y. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126542 · Cited by 3,450
Scale & Affine Invariant Interest Point Detectors
Mikolajczyk, K., & Schmid, C. (2004) · International Journal of Computer Vision · doi:10.1023/b:visi.0000027790.02288.f2 · Cited by 3,436
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-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
Self-citationAggregating local descriptors into a compact image representation
Jegou, H., Douze, M., Schmid, C., & Perez, P. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540039 · Cited by 2,692
Vlfeat: an open and portable library of computer vision algorithms
Vedaldi, A., & Fulkerson, B. (2010) · Proceedings of the 18th ACM international conference on Multimedia · doi:10.1145/1873951.1874249 · Cited by 2,664
Self-citationDistance Metric Learning for Large Margin Nearest Neighbor Classification
Weinberger, K. Q., Blitzer, J. C., & Saul, L. K. (2005) · neural information processing systems · Cited by 2,132
Self-Paced Learning for Latent Variable Models
Kumar, M., Packer, B., & Koller, D. (2010) · neural information processing systems · Cited by 1,708
Three things everyone should know to improve object retrieval
Arandjelovic, R., & Zisserman, A. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6248018 · Cited by 1,383
Self-citationAn Affine Invariant Interest Point Detector
Mikolajczyk, K., & Schmid, C. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47969-4_9 · Cited by 1,325
Iterative quantization: A procrustean approach to learning binary codes
Gong, Y., & Lazebnik, S. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995432 · Cited by 1,038
A rank minimization heuristic with application to minimum order system approximation
Fazel, M., Hindi, H., & Boyd, S. P. (2001) · Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148) · doi:10.1109/acc.2001.945730 · Cited by 956
Fast maximum margin matrix factorization for collaborative prediction
Rennie, J. D. M., & Srebro, N. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102441 · Cited by 939
Primal-dual subgradient methods for convex problems
Nesterov, Y. (2009) · Mathematical Programming · doi:10.1007/s10107-007-0149-x · Cited by 835
Photo tourism: exploring photo collections in 3D
Snavely, N., Seitz, S. M., & Szeliski, R. (2006) · ACM SIGGRAPH 2006 Papers on - SIGGRAPH '06 · doi:10.1145/1179352.1141964 · Cited by 696
Similarity estimation techniques from rounding algorithms
Charikar, M. (2002) · doi:10.1145/509961.509965 · Cited by 659
LDAHash: Improved Matching with Smaller Descriptors
Strecha, C., Bronstein, A. M., Bronstein, M. M., & Fua, P. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.103 · Cited by 605
Dual Averaging Method for Regularized Stochastic Learning and Online Optimization
Xiao, L. (2009) · Cited by 574
Multi-view Matching for Unordered Image Sets, or “How Do I Organize My Holiday Snaps?”
Schaffalitzky, F., & Zisserman, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47969-4_28 · Cited by 533
Self-citationVLFeat: An open and portable library of computer vision algorithms
Vedaldi, A., & Fulkerson, B. (2010) · Cited by 485
Self-citationA fast local descriptor for dense matching
Tola, E., Lepetit, V., & Fua, P. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587673 · Cited by 480
Discriminative Learning of Local Image Descriptors
Brown, M., Hua, G., & Winder, S. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.54 · Cited by 466
Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization
Xiaolin (2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1953017 · Cited by 233
Boosting Binary Keypoint Descriptors
Trzcinski, T., Christoudias, M., Fua, P., & Lepetit, V. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.370 · Cited by 174
Multiple Instance Metric Learning from Automatically Labeled Bags of Faces
Guillaumin, M., Verbeek, J., & Schmid, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15549-9_46 · Cited by 174
Kovačević, J., & Chebira, A. (2007) · now publishers, Inc. eBooks · doi:10.1561/2000000006 · Cited by 163
Descriptor Learning for Efficient Retrieval
Philbin, J. F., Isard, M., Šivic, J., & Zisserman, A. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15558-1_49 · Cited by 160
Self-citationEfficient Discriminative Projections for Compact Binary Descriptors
Trzcinski, T. P., & Lepetit, V. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33718-5_17 · Cited by 125
Learning Image Descriptors with the Boosting-Trick
Trzcinski, T. P., Christoudias, C. M., Lepetit, V., & Fua, P. (2012) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 87
Anti-sparse coding for approximate nearest neighbor search
Jeǵou, H., Furon, T., & Fuchs, J. (2012) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2012.6288307 · Cited by 82
Descriptor Learning Using Convex Optimisation
Simonyan, K., Vedaldi, A., & Zisserman, A. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33718-5_18 · Cited by 60
Self-citationSparse Quantization for Patch Description
Boix, X., Gygli, M., Roig, G., & Gool, L. V. (2013) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2013.366 · Cited by 18
Cited by
Parkhi, O. M., Vedaldi, A., & Zisserman, A. (2015) · Procedings of the British Machine Vision Conference 2015 · doi:10.5244/c.29.41 · Cited by 5,479
Self-citationReceptive Field Block Net for Accurate and Fast Object Detection
Liu, S., Huang, D., & Wang, Y. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01252-6_24 · Cited by 1,885
LIFT: Learned Invariant Feature Transform
Yi, K. M., Trulls, E., Lepetit, V., & Fua, P. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46466-4_28 · Cited by 1,202
D2-Net: A Trainable CNN for Joint Description and Detection of Local Features
Dusmanu, M., Rocco, I., Pajdla, T., Pollefeys, M., Sivic, J., Torii, A., & Sattler, T. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00828 · Cited by 1,179
Learning to compare image patches via convolutional neural networks
Zagoruyko, S., & Komodakis, N. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7299064 · Cited by 1,140
Metadata
- Authors
- Simonyan, K., Vedaldi, A., & Zisserman, A.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2014-08
- Volume
- 36
- Issue
- 8
- Pages
- 1573-1585
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2007178811
- Cited by
- 352
- References
- 37
- FWCI
- 43.32
- Type
- journal article
- 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.