Skip to main content

A New Parallel Hierarchical K-Means Clustering Algorithm for Video Retrieval

  • Conference paper
  • First Online:
Advanced Graphic Communications and Media Technologies (PPMT 2016)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 417))

Included in the following conference series:

Abstract

The K-means clustering algorithm has been widely adopted to build vocabulary in image retrieval. But, the speed and accuracy of K-means still need to be improved. In the manuscript, we propose a New Parallel Hierarchical K-means Clustering (PHKM) Algorithm for Video Retrieval. The PHKM algorithm improves on the K-means as the following ways. First, the Hellinger kernel is used to replace the Euclidean kernel, which improves the accuracy. Second, the multi-core processors based parallel clustering algorithm is proposed. The experiment results show that the proposed PHKM algorithm is very faster and effective than K-means.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Nister, D. and H. Stewenius. Scalable recognition with a vocabulary tree. in IEEE Computer Society Conference on Computer Vision and Pattern Recognition 2006. IEEE.

    Google Scholar 

  2. MacQueen, J. Some methods for classification and analysis of multivariate observations. in 5th Berkeley Symp. 1967. California, USA.

    Google Scholar 

  3. Arandjelovic, R. and A. Zisserman. Three things everyone should know to improve object retrieval. in Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference on. 2012. IEEE.

    Google Scholar 

  4. Malik, H.H., et al., Hierarchical document clustering using local patterns. Data Mining and Knowledge Discovery, 2010. 21(1): p. 153–185.

    Google Scholar 

  5. Hu, X., et al. Exploiting Wikipedia as external knowledge for document clustering. in Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. 2009. ACM.

    Google Scholar 

  6. Zhao, Y. and G. Karypis, Hierarchical clustering algorithms for document datasets. Data Mining and Knowledge Discovery, 2005. 10(2): p. 141–168.

    Google Scholar 

  7. Liao, K., et al., A sample-based hierarchical adaptive K-means clustering method for large-scale video retrieval. Knowledge-Based Systems, 2013.

    Google Scholar 

Download references

Acknowledgements

This work is supported by the National Natural Science Foundation of China Project No. 61671376, 11272253 and Natural Science Foundation of Shaanxi Province No. 2016JM6022.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kaiyang Liao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Liao, K., Tang, Z., Cao, C., Zhao, F., Zheng, Y. (2017). A New Parallel Hierarchical K-Means Clustering Algorithm for Video Retrieval. In: Zhao, P., Ouyang, Y., Xu, M., Yang, L., Ouyang, Y. (eds) Advanced Graphic Communications and Media Technologies . PPMT 2016. Lecture Notes in Electrical Engineering, vol 417. Springer, Singapore. https://doi.org/10.1007/978-981-10-3530-2_23

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3530-2_23

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3529-6

  • Online ISBN: 978-981-10-3530-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics