Optimized Cartesian K-Means
暂无分享,去创建一个
Heng Tao Shen | Shipeng Li | Jianfeng Wang | Jingdong Wang | Jingkuan Song | Xin-Shun Xu | H. Shen | Jingdong Wang | Shipeng Li | Jingkuan Song | Jianfeng Wang | Xin-Shun Xu
[1] P. Schönemann,et al. A generalized solution of the orthogonal procrustes problem , 1966 .
[2] J. MacQueen. Some methods for classification and analysis of multivariate observations , 1967 .
[3] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.
[4] S. P. Lloyd,et al. Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.
[5] Stéphane Mallat,et al. Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..
[6] Sunil Arya,et al. Approximate nearest neighbor queries in fixed dimensions , 1993, SODA '93.
[7] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[8] Nicole Immorlica,et al. Locality-sensitive hashing scheme based on p-stable distributions , 2004, SCG '04.
[9] Trevor Darrell,et al. Nearest-Neighbor Methods in Learning and Vision: Theory and Practice (Neural Information Processing) , 2006 .
[10] Richard I. Hartley,et al. Optimised KD-trees for fast image descriptor matching , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[11] Antonio Torralba,et al. Spectral Hashing , 2008, NIPS.
[12] Svetlana Lazebnik,et al. Locality-sensitive binary codes from shift-invariant kernels , 2009, NIPS.
[13] David G. Lowe,et al. Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration , 2009, VISAPP.
[14] Trevor Darrell,et al. Learning to Hash with Binary Reconstructive Embeddings , 2009, NIPS.
[15] Hans-Peter Kriegel,et al. Clustering high-dimensional data: A survey on subspace clustering, pattern-based clustering, and correlation clustering , 2009, TKDD.
[16] Winston H. Hsu,et al. Query expansion for hash-based image object retrieval , 2009, ACM Multimedia.
[17] Geoffrey E. Hinton,et al. Semantic hashing , 2009, Int. J. Approx. Reason..
[18] Hongbin Zha,et al. Optimizing kd-trees for scalable visual descriptor indexing , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[19] Wei Liu,et al. Scalable similarity search with optimized kernel hashing , 2010, KDD.
[20] Panos Kalnis,et al. Efficient and accurate nearest neighbor and closest pair search in high-dimensional space , 2010, TODS.
[21] Shuicheng Yan,et al. Non-Metric Locality-Sensitive Hashing , 2010, AAAI.
[22] Zi Huang,et al. Multiple feature hashing for real-time large scale near-duplicate video retrieval , 2011, ACM Multimedia.
[23] Nenghai Yu,et al. Complementary hashing for approximate nearest neighbor search , 2011, 2011 International Conference on Computer Vision.
[24] Cordelia Schmid,et al. Product Quantization for Nearest Neighbor Search , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[25] David J. Fleet,et al. Minimal Loss Hashing for Compact Binary Codes , 2011, ICML.
[26] Svetlana Lazebnik,et al. Iterative quantization: A procrustean approach to learning binary codes , 2011, CVPR 2011.
[27] David J. Fleet,et al. Hamming Distance Metric Learning , 2012, NIPS.
[28] Shih-Fu Chang,et al. Mobile product search with Bag of Hash Bits and boundary reranking , 2012, CVPR.
[29] Di Liu,et al. Compact kernel hashing with multiple features , 2012, ACM Multimedia.
[30] Pascal Fua,et al. LDAHash: Improved Matching with Smaller Descriptors , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[31] Qi Tian,et al. Super-Bit Locality-Sensitive Hashing , 2012, NIPS.
[32] Wu-Jun Li,et al. Isotropic Hashing , 2012, NIPS.
[33] Kristen Grauman,et al. Kernelized Locality-Sensitive Hashing , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[34] Rongrong Ji,et al. Supervised hashing with kernels , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.
[35] Shih-Fu Chang,et al. Mobile product search with Bag of Hash Bits and boundary reranking , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.
[36] Shipeng Li,et al. Query-driven iterated neighborhood graph search for large scale indexing , 2012, ACM Multimedia.
[37] Shih-Fu Chang,et al. Submodular video hashing: a unified framework towards video pooling and indexing , 2012, ACM Multimedia.
[38] David J. Fleet,et al. Cartesian K-Means , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.
[39] Longbing Cao,et al. Coupled clustering ensemble: Incorporating coupling relationships both between base clusterings and objects , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).
[40] Cordelia Schmid,et al. Event Retrieval in Large Video Collections with Circulant Temporal Encoding , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.
[41] Zi Huang,et al. Inter-media hashing for large-scale retrieval from heterogeneous data sources , 2013, SIGMOD '13.
[42] Zi Huang,et al. Sparse hashing for fast multimedia search , 2013, TOIS.
[43] Nenghai Yu,et al. Order preserving hashing for approximate nearest neighbor search , 2013, ACM Multimedia.
[44] Guosheng Lin,et al. Learning Hash Functions Using Column Generation , 2013, ICML.
[45] Zi Huang,et al. Linear cross-modal hashing for efficient multimedia search , 2013, ACM Multimedia.
[46] Jing Wang,et al. Fast Neighborhood Graph Search Using Cartesian Concatenation , 2013, 2013 IEEE International Conference on Computer Vision.
[47] Hongbin Zha,et al. Trinary-Projection Trees for Approximate Nearest Neighbor Search , 2014, IEEE Trans. Pattern Anal. Mach. Intell..