[1] R. Xia, Y. Pan, H. Lai, C. Liu,S. Yan, “Supervised Hashing for Image Retrieval via Image Representation Learning,” inProceedings of AAAI Conference on Artificial Intelligence, 2012 [2] T. Dean, M. A. Ruzon, M. Segal, J. Shlens, S. Vijayanarasimhan,J. Yagnik, “Fast, Accurate Detection of 100,000 Object Classes on A Single Machine,” inProceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 1814-1821, 2013 [3] C. Strecha, A. M. Bronstein, M. M. Bronstein,P. Fua, “LDAHash: Improved Matching with Smaller Descriptors,” IEEE Transactions on Pattern Analysis & Machine Intelligence, Vol. 34, No. 1, pp. 66-78, 2012 [4] M. Charikar, “Similarity Estimation Techniques from Rounding Algorithm,” inProceedings of ACM Symposium on Theory of Computing, pp. 380-388, 2002 [5] Y. Liu, P. Yan,R. K. Xia, et al, “FP-CNNH: A Fast Image Hashing Algorithm Based on Deep Convolutional Neural Network,” Computer Science, Vol. 43, No. 9, pp. 39-51,2016 [6] J. Heo, Y. Lee, J. He, S. Chang,S. Yoon, “Spherical Hashing,” inProceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 2957-2964, 2012 [7] B. Kulis and K. Grauman, “Kernelized Locality-Sensitive Hashing for Scalable Image Search,” inProceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 2130-2137, 2009 [8] M. Norouzi and D. J. Fleet, “Minimal Loss Hashing for Compact Binary Codes,” inProceedings of International Conference on International Conference on Machine Learning Omnipress, pp. 353-360, 2011 [9] A. Rahimi and B. Recht, “Random Features for Large-Scale Kernel Machines,” inProceedings of International Conference on Neural Information Processing Systems, pp. 1177-1184, 2007 [10] M. Raginsky and S. Lazebnik, “Locality Sensitive Binary Codes from Sift-Invariant Kernels,”Advances in Neural Information Processing Systems, 2009 [11] J. Wang, S. Kumar,S. F. Chang, “Semi-Supervised Hashing for Scalable Image Retrieval,” inProceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 3424-3431, 2010 [12] Y. Weiss, A. Torralba,R. Fergus, “Spectral Hashing,” inAdvances in Neural Information Processing Systems, 2008 [13] S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman,A. Y. Wu, “An Optimal Algorithm for Approximate Nearest Neighbor Searching,” inProceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 573-582, 1994 [14] J. H. Friedman, J. L. Bentley,R. A. Finkel, “An Algorithm for Finding Best Matches in Logarithmic Expected Time,” ACM, Vol. 3, No. 3, pp. 209-226, 1977 [15] N. Kumar, L. Zhang,S. Nayar, “What is A Good Nearest Neighbors Algorithm for Finding Similar Paths in Images?” inProceedings of the 10th European Conference on Computer Vision, pp. 364-378, 2008 [16] M. Muja and D. G. Lowe, “Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration,” inProceedings of VISAPP International Conference on Computer Vision Theory and Applications, pp. 331-340, 2009 [17] C. Silpa-Anan and R. Hartley, “Optimised KD-Trees for Fast Image Descriptor Matching,” inProceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp. 1-8, 2008 [18] K. He, F. Wen,J. Sun, “K-Means Hashing: An Affinity-Preserving Quantization Method for Learning Binary Compact Codes,” inProceedings of IEEE Conference on Computer Vision and Pattern Recognition, 2013 [19] W. Kong and J. W. Li, “Isotropic Hashing,” inAdvances in Neural Information Processing Systems, 2012 [20] C. Leng, J. Cheng,H. Lu, “Random Subspace for Binary Codes Learning in Large Scale Image Retrieval,” inProceedings of ACM SIGIR Conference, 2014 [21] W. Liu, J. Wang, S. Kumar,S. F. Chang, “Hashing with Graphs,” inProceedings of International Conference on Machine Learning (ICML), pp. 1-8, Bellevue, Washington, USA, 2011 [22] D. Zhang, J. Wang, D. Cai,J. Lu, “Self-Taught Hashing for Fast Similarity Search,” inProceedings of International ACM SIGIR Conference, 2010 [23] A. Shrivastava and P. Li, “In Defense of MinHash over SimHash,” inProceedings of International Conference on Artificial Intelligence and Statistics, 2014 [24] H. Abdi and L. J. Williams, “Principal Component Analysis,” Wiley Interdisciplinary Reviews Computational Statistics, Vol. 2, No. 4, pp. 433-459, 2010 [25] X. He and P. Niyogi, “Locality Preserving Projections,” Advances in Neural Information Processing Systems, Vol. 16, No. 1, pp. 186-197, 2003 [26] C. Leng, J. Cheng, T. Yuan, X. Bai,H. Lu, “Learning Binary Codes with Bagging PCA,” inProceedings of European Conference on Machine Learning, pp. 177-192, 2014 [27] P. Li and P. Ren, “R2PCAH: Hashing with Two-Fold Randomness on Principal Projections,”Neurocomputing, pp. 236-244, 2017 [28] J. Wang, S. Kumar,S. F. Chang, “Sequential Projection Learning for Hashing with Compact Codes,” inProceedings of International Conference on Machine Learning, pp. 1127-1134, 2010 [29] B. Xu, J. Bu, Y. Lin, C. Chen, X. He,D. Cai, “Harmonious Hashing,” inProceedings of International Joint Conference on Artificial Intelligence, 2013 [30] G. Irie, Z. Li, X. M. Wu,S. F. Chang, “Locally Linear Hashing for Extracting Non-Linear Manifolds,” inProceedings of IEEE Conference on Computer Vision and Pattern Recognition & IEEE Computer Society, pp. 2123-2130, 2014 |