skip to main content
research-article

Effective and Scalable Manifold Ranking-Based Image Retrieval with Output Bound

Published:07 April 2023Publication History
Skip Abstract Section

Abstract

Image retrieval keeps attracting a lot of attention from both academic and industry over past years due to its variety of useful applications. Due to the rapid growth of deep learning approaches, more better feature vectors of images could be discovered for improving image retrieval. However, most (if not all) existing deep learning approaches consider the similarity between two images locally without considering the similarity among a group of similar images globally, and thus could not return accurate results. In this article, we study the image retrieval with manifold ranking (MR) which considers both the local similarity and the global similarity, which could give more accurate results. However, existing best-known algorithms have one of the following issues: (1) they require to build a bulky index, (2) some of them do not have any theoretical bound on the output, and (3) some of them are time-consuming. Motivated by this, we propose two algorithms, namely Monte Carlo-based MR (MCMR) and MCMR+, for image retrieval, which do not have the above issues. We are the first one to propose an index-free manifold ranking image retrieval with the output theoretical bound. More importantly, our algorithms give the first best-known time complexity result of \(O(n \log n)\) where \(n\) is the total number of images in the database compared with the existing best-known result of \(O(n^2)\) in the literature of computing the exact top-\(k\) results with quality guarantee. Lastly, our experimental result shows that MCMR+ outperforms existing algorithms by up to four orders of magnitude in terms of query time.

REFERENCES

  1. [1] Abbasbandy S., Ezzati R., and Jafarian A.. 2006. LU decomposition method for solving fuzzy system of linear equations. Applied Mathematics and Computation 172, 1 (2006), 633643.Google ScholarGoogle ScholarCross RefCross Ref
  2. [2] Audibert J. Y., Munos R., and Szepesvári C.. 2007. Tuning bandit algorithms in stochastic environments. In Proceedings of the International Conference on Algorithmic Learning Theory.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. [3] Bai S., Bai X., and Tian Q.. 2017. Scalable person re-identification on supervised smoothed manifold. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition.Google ScholarGoogle ScholarCross RefCross Ref
  4. [4] Beygelzimer A., Kakade S., and Langford J.. 2006. Cover trees for nearest neighbor. In Proceedings of the 23rd International Conference on Machine Learning.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. [5] Datta R., Joshi D., Li J., and Wang J. Z.. 2008. Image retrieval: Ideas, influences, and trends of the new age. ACM Computing Surveys 40, 2 (2008), 1–60.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. [6] Datta R., Li J., and Wang J. Z.. 2005. Content-based image retrieval: Approaches and trends of the new age. In Proceedings of the 7th ACM SIGMM International Workshop on Multimedia Information Retrieval.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. [7] Dong W., Moses C., and Li K.. 2011. Efficient k-nearest neighbor graph construction for generic similarity measures. In Proceedings of the 20th International Conference on World Wide Web.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. [8] Fujiwara Y., Irie G., Kuroyama S., and Onizuka M.. 2014. Scaling manifold ranking based image retrieval. Proceedings of the VLDB Endowment 8, 4 (2014), 341–352.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. [9] Fujiwara Y., Nakatsuji M., Shiokawa H., Mishima T., and Onizuka M.. 2013. Efficient ad-hoc search for personalized PageRank. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. ACM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. [10] Gilmer J., Schoenholz S. S., Riley P. F., Vinyals O., and Dahl G. E.. 2017. Neural message passing for quantum chemistry. In Proceedings of the 34th International Conference on Machine Learning-Volume 70. JMLR. org.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. [11] Golub G. H. and Reinsch C.. 1971. Singular value decomposition and least squares solutions. In Linear Algebra. F. L. Bauer (ed.), Springer, Berlin, 134151.Google ScholarGoogle ScholarCross RefCross Ref
  12. [12] Goodall C. R.. 1993. 13 computation using the QR decomposition. (1993).Google ScholarGoogle Scholar
  13. [13] He J., Li M., Zhang H. J., and Tong H.. 2004. Manifold-ranking based image retrieval. In Proceedings of the 12th Annual ACM International Conference on Multimedia.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. [14] He K., Zhang X., Ren S., and Sun J.. 2016. Deep residual learning for image recognition. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition.Google ScholarGoogle ScholarCross RefCross Ref
  15. [15] He R., Zhu Y., and Zhan W.. 2009. Fast manifold-ranking for content-based image retrieval. In Proceedings of the 2009 ISECS International Colloquium on Computing, Communication, Control, and Management.Google ScholarGoogle ScholarCross RefCross Ref
  16. [16] Hou Guanhao, Chen Xingguang, Wang Sibo, and Wei Zhewei. 2021. Massively parallel algorithms for personalized PageRank. Proceedings of the VLDB Endowment 14, 9 (2021), 16681680.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. [17] Huiskes M. J. and Lew M. S.. 2008. The MIR flickr retrieval evaluation. In Proceedings of the 1st ACM International Conference on Multimedia Information Retrieval. ACM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. [18] Jeh Glen and Widom Jennifer. 2002. Simrank: A measure of structural-context similarity. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 538543.Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. [19] Jian M., Wu L., Zhang X., and He Y.. 2018. Manifold ranking-based kernel propagation for saliency estimation. In Proceedings of the 2018 4th International Conference on Control, Automation and Robotics. IEEE.Google ScholarGoogle ScholarCross RefCross Ref
  20. [20] Jiang M., Fu A. W.-C., and Wong R. C.-W.. 2017. READS: A random walk approach for efficient and accurate dynamic SimRank. Proceedings of the VLDB Endowment 10, 9 (2017), 937948.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. [21] Klicpera J., Bojchevski A., and Günnemann S.. 2019. Predict then propagate: Graph neural networks meet personalized PageRank.In Proceedings of the International Conference on Learning Representations.Google ScholarGoogle Scholar
  22. [22] Krizhevsky A., Sutskever I., and Hinton G. E.. 2012. Imagenet classification with deep convolutional neural networks. In Proceedings of the 25th International Conference on Neural Information Processing Systems.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. [23] Kumar N., Berg A. C., Belhumeur P. N., and Nayar S. K.. 2009. Attribute and simile classifiers for face verification. In Proceedings of the 2009 IEEE 12th International Conference on Computer Vision. IEEE.Google ScholarGoogle ScholarCross RefCross Ref
  24. [24] Lanchantin J., Sekhon A., and Qi Y.. 2019. Neural message passing for multi-label classification. arXiv:1904.08049. Retrieved from https://arxiv.org/abs/1904.08049.Google ScholarGoogle Scholar
  25. [25] Lee P., Lakshmanan L. V. S., and Yu J. X.. 2012. On top-k structural similarity search. In Proceedings of the 2012 IEEE 28th International Conference on Data Engineering. IEEE, 774785.Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. [26] Li Y., Wu Z., Lin S., Xie H., Lv Min, Xu Y., and Lui J. C. S.. 2019. Walking with perception: Efficient random walk sampling via common neighbor awareness. In Proceedings of the 2019 IEEE 35th International Conference on Data Engineering.Google ScholarGoogle Scholar
  27. [27] Liben-Nowell D. and Kleinberg J.. 2007. The link-prediction problem for social networks. Journal of the American Society for Information Science and Technology 58, 7 (2007), 10191031.Google ScholarGoogle ScholarCross RefCross Ref
  28. [28] Lin D., Wei V. J., and Wong R. C.-W.. 2019. First index-free manifold ranking-based image retrieval with output bound. In Proceedings of the 2019 IEEE International Conference on Data Mining. IEEE, 12161221.Google ScholarGoogle ScholarCross RefCross Ref
  29. [29] Lin D., Wong R. C.-W., Xie M., and Wei V. J.. 2020. Index-free approach with theoretical guarantee for efficient random walk with restart query. In Proceedings of the 2020 IEEE 36th International Conference on Data Engineering. IEEE, 913924.Google ScholarGoogle ScholarCross RefCross Ref
  30. [30] Lin W.. 2019. Distributed algorithms for fully personalized PageRank on large graphs. In Proceedings of the World Wide Web Conference. 10841094.Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. [31] Liu Y., Zheng B., He X., Wei Z., Xiao X., Zheng K., and Lu J.. 2017. Probesim: Scalable single-source and top-k simrank computations on dynamic graphs. Proceedings of the VLDB Endowment 11, 1 (2017), 1426.Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. [32] Lofgren P., Banerjee S., and Goel A.. 2016. Personalized PageRank estimation and search: A bidirectional approach. In Proceedings of the 9th ACM International Conference on Web Search and Data Mining. ACM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. [33] Lowe D. G.. 2004. Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision 60, 2 (2004), 91–110.Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. [34] Loy C. C., Liu C., and Gong S.. 2013. Person re-identification by manifold ranking. In Proceedings of the 2013 IEEE International Conference on Image Processing.Google ScholarGoogle ScholarCross RefCross Ref
  35. [35] Motwani R. and Raghavan P.. 2010. Chap. Randomized algorithms.Google ScholarGoogle Scholar
  36. [36] Nayar S., Nene S., and Murase H.. 1996. Columbia Object Image Library (COIL 100). Technical Report CUCS-006-96. Department of Comp. Science, Columbia University.Google ScholarGoogle Scholar
  37. [37] Page L., Brin S., Motwani R., and Winograd T.. 1999. The PageRank Citation Ranking: Bringing Order to the Web.Technical Report. Stanford InfoLab.Google ScholarGoogle Scholar
  38. [38] Qi W., Cheng M. M., Borji A., Lu H., and Bai L. F.. 2015. SaliencyRank: Two-stage manifold ranking for salient object detection. Computational Visual Media 1, 4 (2015), 309–320.Google ScholarGoogle ScholarCross RefCross Ref
  39. [39] Quan R., Han J., Zhang D., and Nie F.. 2016. Object co-segmentation via graph optimized-flexible manifold ranking. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition.Google ScholarGoogle ScholarCross RefCross Ref
  40. [40] Radenović F., Tolias G., and Chum O.. 2016. CNN image retrieval learns from BoW: Unsupervised fine-tuning with hard examples. In Proceedings of the European Conference on Computer Vision. Springer.Google ScholarGoogle ScholarCross RefCross Ref
  41. [41] Radenović F., Tolias G., and Chum O.. 2018. Fine-tuning CNN image retrieval with no human annotation. IEEE Transactions on Pattern Analysis and Machine Intelligence 41, 7 (2018), 1655–1668.Google ScholarGoogle Scholar
  42. [42] Shen L., Xu D. Cao, Q., Huang X., Xiao N., and Liang Y.. 2016. A novel local manifold-ranking based K-NN for modeling the regression between bioactivity and molecular descriptors. Chemometrics and Intelligent Laboratory Systems 151 (2016), 71–77.Google ScholarGoogle ScholarCross RefCross Ref
  43. [43] Shin K., Jung J., Lee S., and Kang U.. 2015. Bear: Block elimination approach for random walk with restart on large graphs. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. ACM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. [44] Simonyan K. and Zisserman A.. 2014. Very deep convolutional networks for large-scale image recognition. arXiv:1409.1556. Retrieved from https://arxiv.org/abs/1409.1556.Google ScholarGoogle Scholar
  45. [45] Skiena S.. 1991. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Addison-Wesley Longman Publishing Co., Inc.Google ScholarGoogle Scholar
  46. [46] Song J., Yang Y., Yang Y., Huang Z., and Shen H. T.. 2013. Inter-media hashing for large-scale retrieval from heterogeneous data sources. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. ACM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. [47] Tao D., Cheng J., Song M., and Lin X.. 2016. Manifold ranking-based matrix factorization for saliency detection. IEEE Transactions on Neural Networks and Learning Systems 27, 6 (2016), 1122–1134.Google ScholarGoogle ScholarCross RefCross Ref
  48. [48] Walker A. J.. 1974. New fast method for generating discrete random numbers with arbitrary frequency distributions. Electronics Letters 8, 10 (1974), 127–128.Google ScholarGoogle ScholarCross RefCross Ref
  49. [49] Wan J., Wang D., Hoi S. Chu Hong, Zhu P. Wu, J., Zhang Y., and Li J.. 2014. Deep learning for content-based image retrieval: A comprehensive study. In Proceedings of the 22nd ACM International Conference on Multimedia. ACM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. [50] Wan X., Yang J., and Xiao J.. 2008. Towards a unified approach to document similarity search using manifold-ranking of blocks. Information Processing & Management 44, 3 (2008), 1032–1048.Google ScholarGoogle ScholarDigital LibraryDigital Library
  51. [51] Wang H., Cai Y., Zhang Y., Pan H., Lv W., and Han H.. 2015. Deep learning for image retrieval: What works and what doesn’t. In Proceedings of the 2015 IEEE International Conference on Data Mining Workshop. IEEE.Google ScholarGoogle ScholarDigital LibraryDigital Library
  52. [52] Wang H., He M., Wei Z., Wang S., Yuan Y., Du X., and Wen J.-R.. 2021. Approximate graph propagation. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 16861696.Google ScholarGoogle ScholarDigital LibraryDigital Library
  53. [53] Wang H., Wei Z., Liu Y., Yuan Y., Du X., and Wen J.-R.. 2021. ExactSim: Benchmarking single-source SimRank algorithms with high-precision ground truths. The VLDB Journal 30, 6 (2021), 9891015.Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. [54] Wang J., Huang P., Zhao H., Zhang Z., Zhao B., and Lee D. L.. 2018. Billion-scale commodity embedding for e-commerce recommendation in alibaba. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. ACM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  55. [55] Wang Q., Lin J., and Yuan Y.. 2016. Salient band selection for hyperspectral image classification via manifold ranking. IEEE Transactions on Neural Networks and Learning Systems 27, 6 (2016), 1279–1289.Google ScholarGoogle ScholarCross RefCross Ref
  56. [56] Wang S., Tang Y., Xiao X., Yang Y., and Li Z.. 2016. HubPPR: Effective indexing for approximate personalized PageRank. Proceedings of the VLDB Endowment 10, 3 (2016), 205–216.Google ScholarGoogle ScholarDigital LibraryDigital Library
  57. [57] Wang S., Yang R., Xiao X., Wei Z., and Yang Y.. 2017. FORA: Simple and effective approximate single-source personalized PageRank. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  58. [58] Wei Z., He X., Xiao X., Wang S., Liu Y., Du X., and Wen J.-R.. 2019. PRSim: Sublinear time simrank computation on large power-law graphs. In Proceedings of the 2019 International Conference on Management of Data. 10421059.Google ScholarGoogle ScholarDigital LibraryDigital Library
  59. [59] Wei Z., He X., Xiao X., Wang S., Shang S., and Wen J. R.. 2018. TopPPR: Top-k personalized PageRank queries with precision guarantees on large graphs. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  60. [60] Wu J., He Y., Guo X., Zhang Y., and Zhao N.. 2017. Heterogeneous manifold ranking for image retrieval. IEEE Access 5 (2017), 16871–16884.Google ScholarGoogle Scholar
  61. [61] Wu Z., Pan S., Chen F., Long G., Zhang C., and Yu P. S.. 2019. A comprehensive survey on graph neural networks. arXiv:1901.00596. Retrieved from https://arxiv.org/abs/1901.00596.Google ScholarGoogle Scholar
  62. [62] Xu B., Bu J., Chen C., Cai D., He X., Liu W., and Luo J.. 2011. Efficient manifold ranking for image retrieval. In Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  63. [63] Zhang Y., Pan P., Zheng Y., Zhao K., Zhang Y., Ren X., and Jin R.. 2018. Visual search at Alibaba. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. ACM.Google ScholarGoogle ScholarDigital LibraryDigital Library
  64. [64] Zheng L., Yang Y., and Tian Q.. 2018. SIFT meets CNN: A decade survey of instance retrieval. IEEE Transactions on Pattern Analysis and Machine Intelligence 40, 5 (2018), 1224–1244.Google ScholarGoogle ScholarCross RefCross Ref
  65. [65] Zhou D., Bousquet O., Lal Thomas N., Weston J., and Schölkopf B.. 2004. Learning with local and global consistency. In Proceedings of the International Conference on Neural Information Processing Systems.Google ScholarGoogle Scholar
  66. [66] Zhou D., Weston J., Gretton A., Bousquet O., and Schölkopf B.. 2004. Ranking on data manifolds. In Proceedings of the International Conference on Neural Information Processing Systems.Google ScholarGoogle Scholar
  67. [67] Zhou W., Li H., and Tian Q.. 2017. Recent advance in content-based image retrieval: A literature survey. arXiv:1706.06064. Retrieved from https://arxiv.org/abs/1706.06064.Google ScholarGoogle Scholar

Index Terms

  1. Effective and Scalable Manifold Ranking-Based Image Retrieval with Output Bound

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM Transactions on Knowledge Discovery from Data
        ACM Transactions on Knowledge Discovery from Data  Volume 17, Issue 5
        June 2023
        386 pages
        ISSN:1556-4681
        EISSN:1556-472X
        DOI:10.1145/3583066
        Issue’s Table of Contents

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 7 April 2023
        • Online AM: 14 October 2022
        • Accepted: 18 September 2022
        • Revised: 19 August 2022
        • Received: 16 September 2019
        Published in tkdd Volume 17, Issue 5

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
      • Article Metrics

        • Downloads (Last 12 months)119
        • Downloads (Last 6 weeks)6

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Full Text

      View this article in Full Text.

      View Full Text

      HTML Format

      View this article in HTML Format .

      View HTML Format