Circulant Binary Embedding
暂无分享,去创建一个
Shih-Fu Chang | Sanjiv Kumar | Felix X. Yu | Yunchao Gong | Sanjiv Kumar | Yunchao Gong | Shih-Fu Chang
[1] Moses Charikar,et al. Similarity estimation techniques from rounding algorithms , 2002, STOC '02.
[2] Fabrice Labeau,et al. Discrete Time Signal Processing , 2004 .
[3] Robert M. Gray,et al. Toeplitz and Circulant Matrices: A Review , 2005, Found. Trends Commun. Inf. Theory.
[4] Robert M. Gray,et al. Toeplitz And Circulant Matrices: A Review (Foundations and Trends(R) in Communications and Information Theory) , 2006 .
[5] Bernard Chazelle,et al. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform , 2006, STOC '06.
[6] Antonio Torralba,et al. Spectral Hashing , 2008, NIPS.
[7] Svetlana Lazebnik,et al. Locality-sensitive binary codes from shift-invariant kernels , 2009, NIPS.
[8] Li Fei-Fei,et al. ImageNet: A large-scale hierarchical image database , 2009, CVPR.
[9] Trevor Darrell,et al. Learning to Hash with Binary Reconstructive Embeddings , 2009, NIPS.
[10] Shih-Fu Chang,et al. Sequential Projection Learning for Hashing with Compact Codes , 2010, ICML.
[11] Jan Vyb'iral. A variant of the Johnson-Lindenstrauss lemma for circulant matrices , 2010, 1002.2847.
[12] Rachel Ward,et al. New and Improved Johnson-Lindenstrauss Embeddings via the Restricted Isometry Property , 2010, SIAM J. Math. Anal..
[13] Aicke Hinrichs,et al. Johnson‐Lindenstrauss lemma for circulant matrices* * , 2010, Random Struct. Algorithms.
[14] Anirban Dasgupta,et al. Fast locality-sensitive hashing , 2011, KDD.
[15] Cordelia Schmid,et al. Product Quantization for Nearest Neighbor Search , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[16] David J. Fleet,et al. Minimal Loss Hashing for Compact Binary Codes , 2011, ICML.
[17] Ping Li,et al. Hashing Algorithms for Large-Scale Learning , 2011, NIPS.
[18] Svetlana Lazebnik,et al. Asymmetric Distances for Binary Embeddings , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[19] Wei Liu,et al. Hashing with Graphs , 2011, ICML.
[20] Florent Perronnin,et al. High-dimensional signature compression for large-scale image classification , 2011, CVPR 2011.
[21] David J. Fleet,et al. Hamming Distance Metric Learning , 2012, NIPS.
[22] Sanjiv Kumar,et al. Angular Quantization-based Binary Codes for Fast Similarity Search , 2012, NIPS.
[23] Sanjiv Kumar,et al. Learning Binary Codes for High-Dimensional Data Using Bilinear Projections , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.
[24] Hui Zhang,et al. New bounds for circulant Johnson-Lindenstrauss embeddings , 2013, ArXiv.
[25] Svetlana Lazebnik,et al. Iterative quantization: A procrustean approach to learning binary codes , 2011, CVPR 2011.