Skip to main content

An Efficient Clustering and Indexing Approach over Large Video Sequences

  • Conference paper
Advances in Multimedia Information Processing - PCM 2006 (PCM 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4261))

Included in the following conference series:

  • 750 Accesses

Abstract

In a video database, the similarity between video sequences is usually measured by the percentages of similar frames shared by both video sequences, where each frame is represented as a high-dimensional feature vector. The direct computation of the similarity measure involves time-consuming sequential scans over the whole dataset. On the other hand, adopting existing indexing technique to high-dimensional datasets suffers from the “Dimensionality Curse”. Thus, an efficient and effective indexing method is needed to reduce the computation cost for the similarity search. In this paper, we propose a Multi-level Hierarchical Divisive Dimensionality Reduction technique to discover correlated clusters, and develop a corresponding indexing structure to efficiently index the clusters in order to support efficient similarity search over video data. By using dimensionality reduction techniques as Principal Component Analysis, we can restore the critical information between the data points in the dataset using a reduced dimension space. Experiments show the efficiency and usefulness of this approach.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Girgensohn, A., Boreczky, J.: Time-constrained keyframe selection technique. Multimedia Tools and Applications 11(3), 347–358 (2000)

    Article  MATH  Google Scholar 

  2. Shen, H.T., Ooi, B.C., Zhou, X.: Towards effective indexing for very large video sequence database. In: SIGMOD 2005: Proceedings of the 2005 ACM SIGMOD international conference on Management of data, pp. 730–741. ACM Press, New York (2005)

    Chapter  Google Scholar 

  3. Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is “nearest neighbor” meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 217–235. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proc. 24th Int. Conf. Very Large Data Bases, pp. 194–205 (1998)

    Google Scholar 

  5. Fukunaga, K.: Introduction to Statistical Pattern Recognition, 2nd edn. Academic Press, London (1990)

    MATH  Google Scholar 

  6. Chang, H.S., Sull, S., Lee, S.U.: Efficient video indexing scheme for content-based retrieval. Circuits and Systems for Video Technology, IEEE Transactions on 9(8), 1269–1279 (1999)

    Article  Google Scholar 

  7. Cheung, S.S., Zakhor, A.: Efficient video similarity measurement with video signature. Circuits and Systems for Video Technology, IEEE Transactions on 13(1), 59–74 (2003)

    Article  Google Scholar 

  8. Indyk, G.I.P., Shivakumar, N.: Finding pirated video sequences on the internet. Tech. Rep., Stanford Infolab (1999)

    Google Scholar 

  9. Kashino, K., Kurozumi, T., Murase, H.: A quick search method for audio and video signals based on histogram pruning. Multimedia, IEEE Transactions 5(3), 348–357 (2003)

    Article  Google Scholar 

  10. Yuan, J., Tian, Q., Ranganath, S.: Fast and robust search method for short video clips from large video collection. In: Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference, vol. 3, pp. 866–869 (2004)

    Google Scholar 

  11. Jolliffe, I.T.: Principle component analysis. Springer, Heidelberg (1986)

    Google Scholar 

  12. Chakrabarti, K., Mehrotra, S.: Local dimensionality reduction: A new approach to indexing high dimensional spaces. In: VLDB 2000: Proceedings of the 26th International Conference on Very Large Data Bases, pp. 89–100. Morgan Kaufmann Publishers Inc., San Francisco (2000)

    Google Scholar 

  13. Jin, H., Ooi, B., Shen, H., Yu, C., Zhou, A.: An adaptive and efficient dimensionality reduction algorithm for high-dimensional indexing. In: Proc. of International Conference on Data Engineering (ICDE), pp. 87–98 (2003)

    Google Scholar 

  14. Aggarwal, C.C., Wolf, J.L., Yu, P.S., Procopiuc, C., Park, J.S.: Fast algorithms for projected clustering. In: SIGMOD 1999: Proceedings of the 1999 ACM SIGMOD international conference on Management of data, pp. 61–72. ACM Press, New York (1999)

    Chapter  Google Scholar 

  15. Kaufman, L., Rousseuw, P.: Finding Groups in Data - An Introduction to Cluster Analysis. Wiley Series in Probability and Mathematical Statistics (1990)

    Google Scholar 

  16. Hinneburg, A., Keim, D.A.: An optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering. The VLDB Journal, 506–517 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, Y., Li, Q. (2006). An Efficient Clustering and Indexing Approach over Large Video Sequences. In: Zhuang, Y., Yang, SQ., Rui, Y., He, Q. (eds) Advances in Multimedia Information Processing - PCM 2006. PCM 2006. Lecture Notes in Computer Science, vol 4261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11922162_109

Download citation

  • DOI: https://doi.org/10.1007/11922162_109

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48766-1

  • Online ISBN: 978-3-540-48769-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics