Skip to Main content Skip to Navigation
Conference papers

Dimensionality Reduction for Distance Based Video Clustering

Abstract : Clustering of video sequences is essential in order to perform video summarization. Because of the high spatial and temporal dimensions of the video data, dimensionality reduction becomes imperative before performing Euclidean distance based clustering. In this paper, we present non-adaptive dimensionality reduction approaches using random projections on the video data. Assuming the data to be a realization from a mixture of Gaussian distributions allows for further reduction in dimensionality using random projections. The performance and computational complexity of the K-means and the K-hyperline clustering algorithms are evaluated with the reduced dimensional data. Results show that random projections with an assumption of Gaussian mixtures provides the smallest number of dimensions, which leads to very low computational complexity in clustering.
Document type :
Conference papers
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, November 16, 2017 - 3:59:36 PM
Last modification on : Thursday, March 5, 2020 - 5:43:06 PM
Long-term archiving on: : Saturday, February 17, 2018 - 2:11:10 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Jayaraman J. Thiagarajan, Karthikeyan N. Ramamurthy, Andreas Spanias. Dimensionality Reduction for Distance Based Video Clustering. 6th IFIP WG 12.5 International Conference on Artificial Intelligence Applications and Innovations (AIAI), Oct 2010, Larnaca, Cyprus. pp.270-277, ⟨10.1007/978-3-642-16239-8_36⟩. ⟨hal-01060677⟩



Record views


Files downloads