Skip to main content
Log in

A new indexing method for complex similarity queries in immersive multimedia systems

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

This paper proposes a novel indexing method for complex similarity queries in high-dimensional image and video systems. In order to provide the indexing method with the flexibility in dealing with multiple features and multiple query objects, we treat every dimension independently. The efficiency of our method is realized by a specialized bitmap indexing that represents all objects in a database as a set of bitmaps. The percentage of data accessed in our indexing method is inversely proportional to the overall dimensionality, and thus the performance deterioration with the increasing dimensionality does not occur. To demonstrate the efficacy of our method we conducted extensive experiments and compared the performance with the VA-file-based index and the linear scan by using real image and video datasets, and obtained a remarkable speed-up over them.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Aggarwal CC, Yu PS (2000) The IGrid index: reversing the dimensionality curse for similarity indexing in high dimensional space. Proc ACM SIGKDD:119–129

  2. Aggarwal CC, Yu PS (2008) On indexing high dimensional data with uncertainty. Proc of the SIAM Conf on Data Mining:621–631

  3. Agrawal R, Gehrke J, Gunopulos D, Raghavan P (2000) Automatic subspace clustering of high dimensional data for data mining applications. Proc. ACM SIGMOD Conf

  4. Andoni A, Indyk P, Krauthgamer R, Nguyen HL (2009) Approximate line nearest neighbor in high dimensions. Proc. of the ACM-SIAM Symp. On Discrete Algorithm

  5. Arya S, et al, (1998) “An optimal algorithm for approximate nearest neighbor searching in fixed dimensions,” JACM, vol. 45, no. 6, pp. 891–923, Nov

  6. Berchtold S, Keim DA, Kriegel H-P (1996) The X-tree: an index structure for high-dimensional data. Proc VLDB Conf:28–39

  7. Beyer KS, Goldstein J, Ramakrishan R, Shaft U (2000) When is nearest neighbor meaningful? Proc Intl Conf on Database Theory:217–235

  8. Böhm K, Mlivoncic M, Schek H-J, Weber R (2001) Fast evaluation techniques for complex similarity queries. Proc. VLDB Conf.:211–220

  9. Budikova P, Batko M, Zezula P (2012) Query language for complex similarity queries. Advances in Database and Information Systems, LNCS 7503:85–98

    Article  Google Scholar 

  10. Cha G.-H, and Chung C.-W (2002) “The GC-tree: a high-dimensional index structure for similarity search in image databases,” IEEE Trans. on Multimedia, Vol. 4, No. 2, pp. 235–247, June

  11. Cha G.-H., Zhu X, Petkovic D, and Chung C.-W. (2002) “An efficient indexing method for nearest neighbor searches in high-dimensional image databases,” IEEE Trans on Multimedia, Vol. 4, No. 1, pp. 76–87, March

  12. Cha G-H, Chung C-W (1998) Object-oriented retrieval mechanism for Semistructured image collections. Proc. ACM Multimedia Conf.:323–332

  13. Chakrabarti K, Mehrotra S (2000) Local dimensionality reduction: a new approach to indexing high dimensional spaces. Proc of the Intl Conf on VLDB:89–100

  14. Chakrabarti K, Porkaew K, Mehrotra S (2000) Efficient query refinement in multimedia databases. Proc IntlConf on Data Engineering:211–220

  15. Chen MC, McNamee L, Matloff N (1990) Selectivity estimation using homogeneity measurement. Proc IEEE Data Engineering:304–310

  16. Fagin R (1996) Combining fuzzy information from multiple systems. Proc ACM Symp on PODS:216–226

  17. Ferhatosmanoglu H et al. (2000) Vector approximation based indexing for nonuniform high dimensional datasets. Proc ACM CIKM:202–209

  18. Haraty RA, Karaki R (2015) Query acceleration in multimedia database systems. Proc of the Intl Conf on Advances in Information Mining and Management:83–88

  19. Hinneburg A, Aggarwal C.C., and Keim D.A., (2000) “What is the nearest neighbor in high dimensional spaces?,” Proc. VLDB Conf

  20. Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. Proc of the ACM Symp Theory of Computing:604–613

  21. Kanth K.V.R., Agrawal D, and Singh A, (1998) A., “Dimensionality Reduction for Similarity Searching in Dynamic Databases,” Proc. of ACM SIGMOD Conf., pp. 166–176

  22. Kushilevitz E, Ostrovsky R, Rabani Y (2000) Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J Computing 30(2):457–474

    Article  MathSciNet  MATH  Google Scholar 

  23. Lai W-C, Chang C, Chang E, Cheng K-T, Crandell M (2002) PBIR-MM: multimodal image retrieval and annotation. Proc ACM Multimedia Conf:421–422

  24. MacQueen J, (1967) “Some methods for classification and analysis of multivariate observations,” Proc. 5th Berkeley Symp. Math. Statist, Prob., 1:281–297

  25. Muralikrichna M, DeWitt D (1988) Equi-depth histogram for estimating selectivity factors for multidimensional queries. Proc ACM SIGMOD Intl Conf:28–36

  26. O’Neil PE, Quass D (1997) Improved query performance with variant indexes. Proc. ACM SIGMOD Intl Conf.:38–49

  27. Nepal S, Ramakrishna MV (2000) Multi-feature query by multiple examples in image databases. Proc IntlConf on Management of Data:211–220

  28. Piatetsky SG, Connell G (1984) Accurate estimation of the number of tuples satisfying a condition. Proc. ACM SIGMOD Intl Conf.:256–276

  29. Siddiquie B, White B, Sharma A, Davis LS (2014) Multi-modal image retrieval for complex queries using small codes. Proc. of the ACM Intl Conf. on Multimedia Retrieval

  30. Tuncel E, Ferhatosmanoglu H, Rose K (2002) VQ-index: an index structure for similarity searching in multimedia databases. Proc. ACM Multimedia Conf.:543–552

  31. Weber R, Schek H-J, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. Proc of VLDB Conf:194–205

  32. White D, Jain R (1996) Similarity indexing with the SS-tree. Proc. IEEE Data Engineering:516–523

  33. Wu L, Faloutsos C, Sycara K, Payne TR (2000) FALCON: feedback adaptive loop for content-based retrieval. Proc. of VLDB Conf

Download references

Acknowledgments

This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (NRF-2014R1A1A2059306).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guang-Ho Cha.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cha, GH. A new indexing method for complex similarity queries in immersive multimedia systems. Multimed Tools Appl 76, 11331–11346 (2017). https://doi.org/10.1007/s11042-016-3675-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-016-3675-9

Keywords

Navigation