Large-scale high-dimensional indexing by sparse hashing with l0 approximation
暂无分享,去创建一个
[1] João Magalhães,et al. High-Dimensional Indexing by Sparse Approximation , 2015, ICMR.
[2] Antonio Torralba,et al. Small codes and large image databases for recognition , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[3] João Magalhães,et al. Scalable Multimodal Search with Distributed Indexing by Sparse Hashing , 2015, ICMR.
[4] Shih-Fu Chang,et al. Spherical hashing , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.
[5] Bo Du,et al. Ensemble manifold regularized sparse low-rank approximation for multiview feature embedding , 2015, Pattern Recognit..
[6] D K Smith,et al. Numerical Optimization , 2001, J. Oper. Res. Soc..
[7] Jian Sun,et al. Joint Inverted Indexing , 2013, 2013 IEEE International Conference on Computer Vision.
[8] Geoffrey E. Hinton,et al. Reducing the Dimensionality of Data with Neural Networks , 2006, Science.
[9] Cordelia Schmid,et al. Product Quantization for Nearest Neighbor Search , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[10] Hervé Jégou,et al. Anti-sparse coding for approximate nearest neighbor search , 2011, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[11] Piotr Indyk,et al. Similarity Search in High Dimensions via Hashing , 1999, VLDB.
[12] Andrew Zisserman,et al. Near Duplicate Image Detection: min-Hash and tf-idf Weighting , 2008, BMVC.
[13] Petros Daras,et al. MSIDX: Multi-Sort Indexing for Efficient Content-Based Image Search and Retrieval , 2013, IEEE Transactions on Multimedia.
[14] A. Bruckstein,et al. K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .
[15] Cordelia Schmid,et al. Hamming Embedding and Weak Geometric Consistency for Large Scale Image Search , 2008, ECCV.
[16] Marc Teboulle,et al. A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..
[17] Peter N. Yianilos,et al. Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.
[18] Yihong Gong,et al. Learning to Search Efficiently in High Dimensions , 2011, NIPS.
[19] Y. C. Pati,et al. Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.
[20] Antonio Torralba,et al. Spectral Hashing , 2008, NIPS.
[21] Gonzalo Navarro. Searching in metric spaces by spatial approximation , 2002, The VLDB Journal.
[22] Emmanuel J. Candès,et al. Decoding by linear programming , 2005, IEEE Transactions on Information Theory.
[23] Antonio Torralba,et al. Ieee Transactions on Pattern Analysis and Machine Intelligence 1 80 Million Tiny Images: a Large Dataset for Non-parametric Object and Scene Recognition , 2022 .
[24] Pavel Zezula,et al. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.
[25] R. Schapire. The Strength of Weak Learnability , 1990, Machine Learning.
[26] Victor S. Lempitsky,et al. The Inverted Multi-Index , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[27] Dima Damen,et al. Recognizing linked events: Searching the space of feasible explanations , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.
[28] Shih-Fu Chang,et al. Semi-Supervised Hashing for Large-Scale Search , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[29] M. Elad,et al. $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation , 2006, IEEE Transactions on Signal Processing.
[30] David G. Lowe,et al. Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration , 2009, VISAPP.
[31] Nicole Immorlica,et al. Locality-sensitive hashing scheme based on p-stable distributions , 2004, SCG '04.
[32] Hans-Jörg Schek,et al. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces , 1998, VLDB.
[33] Svetlana Lazebnik,et al. Locality-sensitive binary codes from shift-invariant kernels , 2009, NIPS.
[34] Laurent Amsaleg,et al. Balancing clusters to reduce response time variability in large scale image search , 2010, 2011 9th International Workshop on Content-Based Multimedia Indexing (CBMI).
[35] Matthijs Douze,et al. Searching in one billion vectors: Re-rank with source coding , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[36] Antonio Torralba,et al. Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope , 2001, International Journal of Computer Vision.
[37] Michael Elad,et al. Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[38] Alexandr Andoni,et al. Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[39] Qi Tian,et al. Packing and Padding: Coupled Multi-index for Accurate Image Retrieval , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.