Fast and accurate hashing via iterative nearest neighbors expansion

IEEE Transactions on Cybernetics

Volumn 44, Issue 11, 2014, Pages 2167-2177

  Jin, Zhongming ^a   Zhang, Debing ^a   Hu, Yao ^a   Lin, Shiding ^b   Cai, Deng ^a   He, Xiaofei ^a  

^a ZHEJIANG UNIVERSITY   (China)

^b BAIDU INC   (China)

Author keywords

Hashing; indexing; KD tree; nearest neighbor (NN) search

Indexed keywords

HASHING; KD-TREE; NEAREST NEIGHBOR SEARCHES; NEAREST NEIGHBORS;

INDEXING (OF INFORMATION);

EID: 84908360030     PISSN: 21682267     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCYB.2014.2302018     Document Type: Article

References (53)

1. A. Andoni and P. Indyk, "Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions," Commun. ACM, vol. 51, no. 1, pp. 117-122, 2008.
2. L. Arge, M. Berg, H. Haverkort, and K. Yi, "The priority R-tree: A practically efficient and worst-case optimal R-tree," in Proc. ACM SIGMOD Int. Conf. Manag. Data, Jun. 2004, pp. 347-358.
3. S. Arya, D. Mount, N. Netanyahu, R. Silverman, and A. Wu, "An optimal algorithm for approximate nearest neighbor searching in fixed dimensions," J. ACM, vol. 45, no. 6, pp. 891-923, 1998.
4. K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, "When is 'nearest neighbor' meaningful?" in Proc. 7th Int. Conf. Database Theory, Jan. 1999, pp. 217-235.
5. P. Ciaccia, M. Patella, and P. Zezula, "M-tree: An efficient access method for similarity search in metric spaces," in Proc. 23rd Int. Conf. Very Large Data Bases, Aug. 1997, pp. 426-435.
6. S. Dasgupta and Y. Freund, "Random projection trees and low dimensional manifolds," in Proc. 40th Annu. ACM Symp. Theory Comput., May 2008, pp. 537-546.
7. J. Freidman, J. Bentley, and R. Finkel, "An algorithm for finding best matches in logarithmic expected time," ACM Trans. Math. Softw., vol. 3, no. 3, pp. 209-226, 1997.
8. Y. Gao, B. Zheng, G. Chen, Q. Li, and X. Guo, "Continuous visible nearest neighbor query processing in spatial databases," Very Large Databases J., vol. 20, no. 3, pp. 371-396, 2011.
9. D. G. Lowe, "Distinctive image features from scale invariant keypoints," Int. J. Comput. Vision, vol. 60, no. 2, pp. 91-110, 2004.
10. Y. Gong and S. Lazebnik, "Iterative quantization: A procrustean approach to learning binary codes," in Proc. IEEE Conf. Comput. Vision Pattern Recogn., Jun. 2011, pp. 817-824.
11. K. Hajebi, Y. Abbasi-Yadkori, H. Shahbazi, and H. Zhang, "Fast approximate nearest-neighbor search with k-nearest neighbor graph," in Proc. 22nd Int. Joint Conf. Artif. Intell., Jul. 2011, pp. 1312-1317.
12. J. He, R. Radhakrishnan, S. F. Chang, and C. Bauer, "Compact hashing with joint optimization of search accuracy and time," in Proc. IEEE Conf. Comput. Vision Pattern Recognit., Jun. 2011, pp. 753-760.
13. P. Jain, B. Kulis, and K. Grauman, "Fast similarity search for learned metrics," IEEE Trans. Pattern Anal. Machine Intell., vol. 31, no. 12, pp. 2143-2157, Dec. 2009.
14. Z. Jin, Y. Hu, Y. Lin, D. Zhang, S. Lin, D. Cai, et al., "Complmentary projection hashing," in Proc. IEEE Int. Conf. Comput. Vision, Dec. 2013, pp. 257-264.
15. Z. Jin, C. Li, Y. Lin, and D. Cai, "Density sensitive hashing," IEEE Trans. Cybern., vol. PP, no. 99, Oct. 2013.
16. W. Johnson and J. Lindenstrauss, "Extensions of Lipschitz mappings into a hilbert space," Contemporary Math., vol. 26, pp. 189-206, Jan. 1984.
17. A. Joly and O. Buisson, "A posteriori multi-probe locality sensitive hashing," in Proc. 16th Int. Conf. Multimedia, Oct. 2008, pp. 209-218.
18. A. Joly and O. Buisson, "Random maximum margin hashing," in Proc. IEEE Conf. Comput. Vision Pattern Recognit., Jun. 2011, pp. 873-880.
19. B. Kulis and T. Darrell, "Learning to hash with binary reconstructive embeddings," in Proc. Adv. Neural Inf. Process. Syst., Dec. 2008, pp. 1042-1050.
20. B. Kulis and K. Grauman, "Kernelized locality-sensitive hashing," IEEE Trans. Pattern Anal. Mach. Intell., vol. 34, no. 6, pp. 2130-2137, Jun. 2012.
21. Y. Lifshits and S. Zhang, "Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design," in Proc. ACM-SIAM Symp. Discrete Algorithms, Jan. 2009, pp. 318-326.
22. Y. Lin, R. Jin, D. Cai, and X. He, "Random projection with filtering for nearly duplicate search," in Proc. 26th AAAI Conf. Artif. Intell., Jul. 2012, pp. 641-647.
23. Y. Lin, R. Jin, D. Cai, S. Yan, and X. Li, "Compressed hashing," in Proc. IEEE Conf. Comput. Vision Pattern Recognit., Jun. 2013, pp. 446-451.
24. T. Liu, A. W. Moore, and A. Gray, "New algorithms for efficient high dimensional non-parametric classification," J. Mach. Learn. Res., vol. 7, pp. 1135-1158, 2006.
25. W. Liu, J. Wang, R. Ji, Y. Jiang, and S. F. Chang, "Supervised hashing with kernels," in Proc. IEEE Conf. Comput. Vision Pattern Recognit., Jun. 2012, pp. 2074-2081.
26. W. Liu, J. Wang, S. Kumar, and S. F. Chang, "Hashing with graphs," in Proc. 28th Int. Conf. Mach. Learn., Jun./Jul. 2011, pp. 1-8.
27. Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li, "Multi-probe LSH: Efficient indexing for high-dimensional similarity search," in Proc. 33rd Int. Conf. Very Large Data Bases, Sep. 2007, pp. 950-961.
28. Y. Mu, J. Shen, and S. Yan, "Weakly-supervised hashing in kernel space," in Proc. IEEE Conf. Comput. Vision Pattern Recognit., Jun. 2010, pp. 3344-3351.
29. M. Muja and D. G. Lowe, "Fast approxiamte nearest neighbors with automatic algorithm configuration," in Proc. Int. Conf. Vision Theory Applicat., Feb. 2009, pp. 331-340.
30. M. Muja and D. Lowe, FLANN: Fast Library for Approximate Nearest Neighbors User Manual Online]. Available: http://www.cs.ubc.ca/research/flann/uploads/FLANN/flann manual-1.8.4.pdf, 2009.
31. M. Norouzi and D. J. Fleet, "Minimal loss hashing for compact binary codes," in Proc. 28th Int. Conf. Mach. Learn., Jun./Jul. 2011, pp. 353-360.
32. A. Oliva and A. Torralba, "Modeling the shape of the scene: A holistic representation of the spatial envelope," Int. J. Comput. Vision, vol. 42, no. 3, pp. 145-175, 2001.
33. R. Panigrahy, "Entropy based nearest neighbor search in high dimensions," in Proc. 17th Annu. ACM-SIAM Symp. Discrete Algorithms, Jan. 2006, pp. 1186-1195.
34. R. Paredes and E. Chvez, "Using the k-nearest neighbor graph for proximity searching in metric spaces," in Proc. 12th Int. Conf. String Process. Inform. Retrieval, , Nov. 2005, pp. 127-138.
35. J. P. Heo, Y. Lee, J. He, S. F. Chang, and S. E. Yoon, "Spherical hashing," in Proc. IEEE Conf. Comput. Vision Pattern Recogn., Jun. 2012, pp. 2957-2964.
36. M. Raginsky and S. Lazebnik, "Locality sensitive binary codes from shift-invariant kernels," in Proc. Adv. Neural Inform. Process. Syst., Dec. 2009, pp. 1509-1517.
37. S. Ray, S. Bandyopadhyay, and S. Pal, "Dynamic range-based distance measure for microarray expressions and a fast gene-ordering algorithm," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 37, no. 3, pp. 742-749, Jun. 2007.
38. J. S. Beis and D. G. Lowe, "Shape indexing using approximate nearestneighbour search in high-dimensional spaces," in Proc. IEEE Conf. Comput. Vision Pattern Recognit., Jun. 1997, pp. 1000-1006.
39. C. Silpa-Anan and R. Hartley, "Optimised KD-trees for fast image descriptor matching," in Proc. IEEE Conf. Comput. Vision Pattern Recognit., Jun. 2008, pp. 1-8.
40. T. Trzcinski, V. Lepetit, and P. Fua, "Thick boundaries in binary space and their influence on nearest-neighbor search," Pattern Recognit. Lett., vol. 33, no. 16, pp. 2173-2180, 2012.
41. J. Wang, S. Kumar, and S.-F. Chang, "Sequential projection learning for hashing with compact codes," in Proc. 27th Int. Conf. Mach. Learn., Jun. 2010, pp. 1127-1134.
42. J. Wang, S. Kumar, and S. F. Chang, "Semi-supervised hashing for large scale search," IEEE Trans. Pattern Anal. Mach. Intell., vol. 34, no. 12, pp. 2074-2081, Dec. 2012.
43. J.-L. Wang and C.-Y. Chang, "Fast retrieval of electronic messages that contain mistyped words or spelling errors," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 27, no. 3, pp. 441-451, Jun. 1997.
44. 44] X. Wang, D. Shasha, and K. Zhang, "Metricmap: An embedding technique for processing distance-based queries in metric spaces," IEEE Trans. Systems, Man, Cybern. B, Cybern., vol. 35, no. 5, pp. 973-987, Oct. 2005.
45. Y. Weiss, A. Torralba, and R. Fergus, "Spectral hashing," in Proc. Adv. Neural Inform. Process. Syst., Dec. 2008, pp. 1753-1760.
46. C. Wu, J. Zhu, D. Cai, C. Chen, and J. Bu, "Semi-supervised nonlinear hashing using bootstrap sequential projection learning," IEEE Trans. Knowl. Data Eng., vol. 25, no. 6, pp. 1380-1393, Jun. 2013.
47. B. Xu, J. Bu, Y. Lin, C. Chen, X. He, and D. Cai, "Harmonious hashing," in Proc. 23rd Int. Joint Conf. Artif. Intell., Aug. 2013, pp. 1820-1826.
48. H. Xu, J. Wang, Z. Li, G. Zeng, S. Li, and N. Yu, "Complementary hashing for approximate nearest neighbor search," in Proc. IEEE Int. Conf. Comput. Vision, Nov. 2011, pp. 1631-1638.
49. P. Xu, C.-H. Chang, and A. Paplinski, "Self-organizing topological tree for online vector quantization and data clustering," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 35, no. 3, pp. 515-526, Jun. 2005.
50. M.-S. Yang and C.-H. Chen, "On the edited fuzzy k-nearest neighbor rule," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 28, no. 3, pp. 461-466, Jun. 1998.
51. Z. Yu, D. Cai, and X. He, "Error-correcting output hashing in fast similarity search," in Proc. 2nd Int. Conf. Internet Multimedia Comput. Service, Dec. 2010, pp. 7-10.
52. D. Zhang, G. Yang, Y. Hu, Z. Jin, D. Cai, and X. He, "A unified approximate nearest neighbor search scheme by combining data structure and hashing," in Proc. 23rd Int. Joint Conf. Artif. Intell., Aug. 2013, pp. 681-687.
53. S. Zhang, H.-S. Wong, Z. Yu, and H. Ip, "Hybrid associative retrieval of three-dimensional models," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 40, no. 6, pp. 1582-1595, Dec. 2010.