An algorithm for designing overcomplete dictionaries for sparse representation, TSP, vol.54, issue.11, pp.4311-4322, 2006. ,
New algorithms for learning incoherent and overcomplete dictionaries, 2013. ,
The inverted multi-index, CVPR, 2012. ,
Geometric Properties of Grassmannian Frames for ???2 and ???3, EURASIP Journal on Advances in Signal Processing, vol.24, issue.3, 2006. ,
DOI : 10.1155/ASP/2006/49850
When is nearest neighbor meaningful? Database Theory, pp.217-235, 1999. ,
Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, vol.13, issue.7, pp.422-426, 1970. ,
DOI : 10.1145/362686.362692
Nested Sparse Quantization for Efficient Feature Coding, ECCV, pp.744-758, 2012. ,
DOI : 10.1007/978-3-642-33709-3_53
On the resemblance and containment of documents, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171), 1997. ,
DOI : 10.1109/SEQUEN.1997.666900
Sparsity-Induced Similarity Measure and Its Applications, TCSVT, 2012. Nearest Neighbors Using Compact Sparse Codes Cherian, A., Morellas, V., and Papanikolopoulos, N. Robust sparse hashing, 2012. ,
DOI : 10.1109/TCSVT.2012.2225911
Large-Scale Discovery of Spatially Related Images, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.32, issue.2, pp.371-377, 2010. ,
DOI : 10.1109/TPAMI.2009.166
Scalable near identical image and shot detection, Proceedings of the 6th ACM international conference on Image and video retrieval, CIVR '07, 2007. ,
DOI : 10.1145/1282280.1282359
Near Duplicate Image Detection: min-Hash and tf-idf Weighting, Procedings of the British Machine Vision Conference 2008, 2008. ,
DOI : 10.5244/C.22.50
Least angle regression, Annals of Statistics, vol.32, issue.2, pp.407-451, 2004. ,
Semi-supervised learning in gigantic image collections, NIPS, 2009. ,
Iterative quantization: A procrustean approach to learning binary codes, CVPR 2011, 2011. ,
DOI : 10.1109/CVPR.2011.5995432
Asymmetric distances for binary embeddings, CVPR, 2011. ,
Monotonicity of the volume of intersection of balls. Geometrical Aspects of Functional Analysis, pp.1-4, 1987. ,
Approximate nearest neighbors, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.604-613, 1998. ,
DOI : 10.1145/276698.276876
Etude comparative de la distribution florale dans une portion des Alpes et du Jura, Bulletin de la Socit vaudoise des Sciences Naturelles, vol.37, pp.547-579, 1901. ,
Product Quantization for Nearest Neighbor Search, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.33, issue.1, pp.117-128, 2011. ,
DOI : 10.1109/TPAMI.2010.57
URL : https://hal.archives-ouvertes.fr/inria-00514462
Searching in one billion vectors: Re-rank with source coding, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.861-864, 2011. ,
DOI : 10.1109/ICASSP.2011.5946540
A non-monotonic method for large-scale non-negative least squares. Optimization Methods and Software, 2012. ,
A sparse coding based similarity measure, DMIN, 2009. ,
Kernelized locality-sensitive hashing for scalable image search, 2009 IEEE 12th International Conference on Computer Vision, 2009. ,
DOI : 10.1109/ICCV.2009.5459466
Incoherent dictionary learning for sparse representation, ICPR, 2012. ,
Hashing with graphs, ICML, 2011. ,
Supervised hashing with kernels, CVPR, 2012. ,
Online learning for matrix factorization and sparse coding, JMLR, vol.11, pp.19-60, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00408716
Scalable Recognition with a Vocabulary Tree, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Volume 2 (CVPR'06), 2006. ,
DOI : 10.1109/CVPR.2006.264
Minimal loss hashing for compact binary codes, ICML, 2011. ,
Cartesian K-Means, 2013 IEEE Conference on Computer Vision and Pattern Recognition, 2013. ,
DOI : 10.1109/CVPR.2013.388
Locality-sensitive binary codes from shift-invariant kernels, NIPS, 2009. ,
Classification and clustering via dictionary learning with structured incoherence and shared features, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2010. ,
DOI : 10.1109/CVPR.2010.5539964
LDAHash: Improved Matching with Smaller Descriptors, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.34, issue.1, pp.66-78, 2012. ,
DOI : 10.1109/TPAMI.2011.103
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit, IEEE Transactions on Information Theory, vol.53, issue.12, pp.4655-4666, 2007. ,
DOI : 10.1109/TIT.2007.909108
Vector Quantizing Feature Space with a Regular Lattice, 2007 IEEE 11th International Conference on Computer Vision, 2007. ,
DOI : 10.1109/ICCV.2007.4408924
URL : https://hal.archives-ouvertes.fr/inria-00548675
Locality-constrained Linear Coding for image classification, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2010. ,
DOI : 10.1109/CVPR.2010.5540018
Picking the best DAISY, 2009 IEEE Conference on Computer Vision and Pattern Recognition, 2009. ,
DOI : 10.1109/CVPR.2009.5206839
Structured and incoherent parametric dictionary design, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing, 2010. ,
DOI : 10.1109/ICASSP.2010.5495207
URL : https://hal.archives-ouvertes.fr/inria-00567534
Linear spatial pyramid matching using sparse coding for image classification, CVPR. IEEE, 2009. ,
Approximate nearest neighbors using sparse representations, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing, 2010. ,
DOI : 10.1109/ICASSP.2010.5496145
URL : https://hal.archives-ouvertes.fr/inria-00561778
Sparse hashing for fast multimedia search, ACM Transactions on Information Systems, vol.31, issue.2, p.319, 2013. ,
DOI : 10.1145/2457465.2457469