An improved algorithm for anchor shot detection

Authors:
M. De Santo;G. Percannella;C. Sansone;M. Vento
Affiliations:
Dipartimento di Ingegneria dell'Informazione e di Ingegneria Elettrica, Università di Salerno, Fisciano, (SA), Italy;Dipartimento di Ingegneria dell'Informazione e di Ingegneria Elettrica, Università di Salerno, Fisciano, (SA), Italy;Dipartimento di Informatica e Sistemistica, Università di Napoli “Federico II”, Napoli, Italy;Dipartimento di Ingegneria dell'Informazione e di Ingegneria Elettrica, Università di Salerno, Fisciano, (SA), Italy
Venue:
ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing
Year:
2005

Citing 6
Cited 0

Video and image processing in multimedia systems

Video and image processing in multimedia systems
Content-based indexing and retrieval of TV news

Pattern Recognition Letters - Special issue on image/video indexing and retrieval
A Multi-Modal Approach to Story Segmentation for News Video

World Wide Web
A Graph-Theoretical Clustering Based Anchorperson Shot Detection for News Video Indexing

ICCIMA '03 Proceedings of the 5th International Conference on Computational Intelligence and Multimedia Applications
Performance characterization of video-shot-change detection methods

IEEE Transactions on Circuits and Systems for Video Technology
Unsupervised video-shot segmentation and model-free anchorperson detection for news video story parsing

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Segmentation of news videos into stories is among key issues for achieving efficient treatment of news-based digital libraries. Indeed, anchor shot detection is a fundamental step for segmenting news into stories. In this paper we present an improved algorithm for anchor shot detection. It is based on a graph theoretical clustering method and exploits the idea of the cluster lifetime for improving the performance. Moreover, a method for automatically fixing all the thresholds required by the original version of the algorithm is also proposed, so making it fully unsupervised. The proposed algorithm has been tested on a database significantly wider than those typically used in the field, demonstrating its advantages with respect to the original version.