A time series clustering based framework for multimedia mining and summarization using audio features

  • Authors:
  • Regunathan Radhakrishnan;Ajay Divakaran;Ziyou Xiong

  • Affiliations:
  • Mitsubishi Electric Research Laboratory, Cambridge, MA;Mitsubishi Electric Research Laboratory, Cambridge, MA;Mitsubishi Electric Research Laboratory, Cambridge, MA

  • Venue:
  • Proceedings of the 6th ACM SIGMM international workshop on Multimedia information retrieval
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Past work on multimedia analysis has shown the utility of detecting specific temporal patterns for different content genres. In this paper, we propose a unified, content-adaptive, unsupervised mining framework to bring out such temporal patterns from different multimedia genres. We formulate the problem of pattern discovery from video as a time series clustering problem. We treat the sequence of low/mid level audio-visual features extracted from the video as a time series and perform a temporal segmentation. The segmentation is based on eigenvector analysis of the affinity matrix constructed from statistical models estimated from the subsequences of the time series. We are thus able to detect transitions and outliers from a sequence of observations from a stationary background process. We define a confidence measure on each of the detected outliers as the probability that it is an outlier. Then, we establish a relationship between the mining parameters and the confidence measure. Furthermore the confidence measure can be used to rank the detected outliers in terms of their departures from the back-ground process. Our experimental results with sequences of low and mid level audio features extracted from sports video show that "highlight" events can be extracted effectively as outliers from a background process using the proposed framework. We proceed to show the effectiveness of the proposed framework in bringing out patterns from surveillance videos without any a priori knowledge. Finally, we show that such temporal segmentation into background and outliers, along with the ranking based on the departure from the background, can be used to generate content summaries of any desired length