The ordinal relation preserving binary codes

Pattern Recognition

Volumn 48, Issue 10, 2015, Pages 3169-3179

  Zhao, Hongwei ^a,b   Wang, Zhen ^a   Liu, Pingping ^a,b  

^a JILIN UNIVERSITY   (China)

^b BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

Approximate nearest neighbor search; Binary codes; Hashing algorithm; Image retrieval

Indexed keywords

BINARY CODES; IMAGE RETRIEVAL;

APPROXIMATE NEAREST NEIGHBORS (ANN); DATA DISTRIBUTION; HASHING ALGORITHMS; HASHING FUNCTIONS; OPTIMAL BINARY CODES; PROJECTION FUNCTION; SIMILARITY PRESERVING; STATE-OF-THE-ART METHODS;

NEAREST NEIGHBOR SEARCH;

EID: 84931577529     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2015.02.011     Document Type: Article

References (50)

1. D.G. Lowe Distinctive image features from scale-invariant keypoints Int. J. Comput. Vis. 60 2 2004 91 110
2. A. Oliva, and A. Torralba Modeling the shape of the scene a holistic representation of the spatial envelope Int. J. Comput. Vis. 42 3 2001 145 175
3. Z. Jiang, Z. Lin, L.S. Davis, Learning a discriminative dictionary for sparse coding via label consistent k-svd, in: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Colorado Springs, 2011, pp. 1697-1704.
4. Z. Jiang, G. Zhang, L.S. Davis, Submodular dictionary learning for sparse coding, in: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Providence, Rhode Island, 2012, pp. 3418-3425.
5. F. Zhu, and L. Shao Weakly-supervised cross-domain dictionary learning for visual recognition Int. J. Comput. Vis. 109 1-2 2014 42 59
6. L. Shao, D. Wu, and X. Li Learning deep and wide a spectral method for learning deep networks IEEE Trans. Neural Netw. Learn. Syst. 25 12 2014 2303 2308 10.1109/TNNLS.2014.2308519
7. M. Calonder, V. Lepetit, C. Strecha, P. Fua, Brief: binary robust independent elementary features, in: European Conference on Computer Vision (ECCV) 2010, Springer, Heraklion, GREECE, 2010, pp. 778-792.
8. E. Rublee, V. Rabaud, K. Konolige, G. Bradski, Orb: an efficient alternative to sift or surf, in: IEEE International Conference on International Conference on Computer Vision (ICCV), IEEE, Barcelona, Spain, 2011, pp. 2564-2571.
9. A. Alahi, R. Ortiz, P. Vandergheynst, Freak: fast retina keypoint, in: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Providence, Rhode Island; IEEE, 2012, pp. 510-517.
10. S. Leutenegger, M. Chli, R.Y. Siegwart, Brisk: Binary robust invariant scalable keypoints, in: IEEE International Conference on Computer Vision (ICCV), IEEE, Barcelona, Spain, 2011, pp. 2548-2555.
11. T. Trzcinski, M. Christoudias, P. Fua, V. Lepetit, Boosting binary keypoint descriptors, in: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Portland, Oregon, 2013, pp. 2874-2881.
12. J. He, J. Feng, X. Liu, T. Cheng, T.-H. Lin, H. Chung, S.-F. Chang, Mobile product search with bag of hash bits and boundary reranking, in: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Providence, Rhode Island, 2012, pp. 3005-3012.
13. A. Torralba, R. Fergus, Y. Weiss, Small codes and large image databases for recognition, in: IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2008, IEEE, Anchorage, Alaska, USA, 2008, pp. 1-8.
14. Y. Weiss, A. Torralba, R. Fergus, Spectral hashing, in: Advances in Neural Information Processing Systems, 2009, pp. 1753-1760.
15. H. Jégou, M. Douze, C. Schmid, P. Pérez, Aggregating local descriptors into a compact image representation, in: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, San Francisco, 2010, pp. 3304-3311.
16. J. Wang, H.T. Shen, J. Song, J. Ji, Hashing for Similarity Search: A Survey, CoRR abs/1408.2927, 2014, (http://arxiv.org/abs/1408.2927).
17. C.L. Zitnick, Binary coherent edge descriptors, in: European Conference on Computer Vision (ECCV), Springer, Heraklion, GREECE, 2010, pp. 170-182.
18. L. Shao, L. Liu, and X. Li Feature learning for image classification via multiobjective genetic programming IEEE Trans. Neural Netw. Learn. Syst. 25 7 2014 1359 1371 10.1109/TNNLS.2013.2293418
19. A. Andoni, P. Indyk, Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions, in: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2006, IEEE, Berkeley, 2006, pp. 459-468.
20. R. Salakhutdinov, and G. Hinton Semantic hashing Int. J. Approx. Reason. 50 7 2009 969 978
21. Y. Gong, S. Lazebnik, Iterative quantization: A procrustean approach to learning binary codes, in: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Colorado Springs, 2011, pp. 817-824.
22. M. Raginsky, S. Lazebnik, Locality-sensitive binary codes from shift-invariant kernels, in: Advances in Neural Information Processing Systems, 2009, pp. 1509-1517.
23. M. Norouzi, D.M. Blei, Minimal loss hashing for compact binary codes, in: Proceedings of the 28th International Conference on Machine Learning (ICML-11), 2011, pp. 353-360.
24. J. Wang, J. Wang, N. Yu, S. Li, Order preserving hashing for approximate nearest neighbor search, in: Proceedings of the 21st ACM international conference on Multimedia, ACM, Barcelona, Spain, 2013, pp. 133-142.
25. M. Norouzi, D.M. Blei, R. Salakhutdinov, Hamming distance metric learning, in: Advances in Neural Information Processing Systems, 2012, pp. 1061-1069.
26. J. Wang, W. Liu, A.X. Sun, Y.-G. Jiang, Learning hash codes with listwise supervision, in: IEEE International Conference on International Conference on Computer Vision (ICCV), IEEE, Sydney, Australia, 2013, pp. 3032-3039.
27. L. Zhang, Y. Zhang, J. Tang, X. Gu, J. Li, Q. Tian, Topology preserving hashing for similarity search, in: Proceedings of the 21st ACM International conference on Multimedia, ACM, Barcelona, Spain, 2013, pp. 123-132.
28. K. He, F. Wen, J. Sun, K-means hashing: an affinity-preserving quantization method for learning binary compact codes, in: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Portland, Oregon, 2013, pp. 2938-2945.
29. A. Torralba, R. Fergus, and W.T. Freeman 80 million tiny images A large data set for nonparametric object and scene recognition IEEE Trans. Pattern Anal. Mach. Intell. 30 11 2008 1958 1970
30. T. Ge, K. He, Q. Ke, and J. Sun Optimized product quantization IEEE Trans. Pattern Anal. Mach. Intell. 36 4 2014 744 755 10.1109/TPAMI.2013.240
31. H. Jegou, M. Douze, and C. Schmid Product quantization for nearest neighbor search IEEE Trans. Pattern Anal. Mach. Intell. 33 1 2011 117 128
32. W. Liu, J. Wang, S. Kumar, S.-F. Chang, Hashing with graphs, in: Proceedings of the 28th International Conference on Machine Learning (ICML-11), 2011, pp. 1-8.
33. B. Kulis, K. Grauman, Kernelized locality-sensitive hashing for scalable image search, in: IEEE Conference on International Conference on Computer Vision (ICCV), IEEE, Kyoto, Japan, 2009, pp. 2130-2137.
34. D. Zhang, J. Wang, D. Cai, J. Lu, Self-taught hashing for fast similarity search, in: Proceedings of the 33rd International ACM SIGIR Conference on Research and Development In information Retrieval, ACM, Geneva, Switzerland, 2010, pp. 18-25.
35. G. Lin, C. Shen, D. Suter, A.v.d. Hengel, A general two-step approach to learning-based hashing, in: IEEE International Conference on International Conference on Computer Vision (ICCV), IEEE, Sydney, Australia, 2013, pp. 2552-2559.
36. G. Lin, C. Shen, Q. Shi, A. van den Hengel, D. Suter, Fast Supervised Hashing with Decision Trees for High-dimensional Data, 2014, CoRR abs/1404.1561, (http://arxiv.org/abs/1404.1561).
37. X. Zhu, Z. Huang, H. Cheng, J. Cui, and H.T. Shen Sparse hashing for fast multimedia search ACM Trans. Inf. Syst. 31 2 2013 9
38. K. Terasawa, Y. Tanaka, Spherical lsh for approximate nearest neighbor search on unit hypersphere, in: Algorithms and Data Structures, Springer, Halifax, CANADA, 2007, pp. 27-38.
39. C. Strecha, A.M. Bronstein, M.M. Bronstein, and P. Fua Ldahash improved matching with smaller descriptors IEEE Trans. Pattern Anal. Mach. Intell. 34 1 2012 66 78
40. J. Wang, S. Kumar, S.-F. Chang, Sequential projection learning for hashing with compact codes, in: Proceedings of the 27th International Conference on Machine Learning (ICML-10), 2010, pp. 1127-1134.
41. J. MacQueen, et al., Some methods for classification and analysis of multivariate observations, in: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, California, USA, 1967, pp. 281-297.
42. K. Arai, and A.R. Barakbah Hierarchical k-means an algorithm for centroids initialization for k-means Rep. Faculty Sci. Eng. 36 1 2007 25 31
43. L. Paulevé, H. Jégou, and L. Amsaleg Locality sensitive hashing a comparison of hash function types and querying mechanisms Pattern Recognit. Lett. 31 11 2010 1348 1358
44. X. Liu, J. He, C. Deng, B. Lang, Collaborative hashing, in: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Columbus, Ohio, 2014, pp. 2147-2154.
45. A. Vedaldi, B. Fulkerson, Vlfeat: An open and portable library of computer vision algorithms, in: Proceedings of the International Conference on Multimedia, ACM, Firenze, Italy, 2010, pp. 1469-1472.
46. J. Wang, S. Kumar, S.-F. Chang, Semi-supervised hashing for scalable image retrieval, in: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, San Francisco, 2010, pp. 3424-3431.
47. A. Krizhevsky, G. Hinton, Learning Multiple Layers of Features From Tiny Images, Technical Report, Computer Science Department, University of Toronto.
48. J. Philbin, O. Chum, M. Isard, J. Sivic, A. Zisserman, Object retrieval with large vocabularies and fast spatial matching, in: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Minneapolis, MN, 2007, pp. 1-8.
49. Y. Matsushita, T. Wada, Principal component hashing: an accelerated approximate nearest neighbor search, in: Advances in Image and Video Technology, Springer, Tokyo, JAPAN, 2009, pp. 374-385.
50. P.H. Schönemann A generalized solution of the orthogonal procrustes problem Psychometrika 31 1 1966 1 10