An unified transition detection based on bipartite graph matching approach

  • Authors:

  • Zenilton Kleber Gonçalves Do Patrocínio, Jr.;Silvio Jamil F. Guimaräes;Henrique Batista Da Silva;Kleber Jacques Ferreira De Souza

  • Affiliations:

  • Audio-Visual Information Processing Laboratory, Institute of Informatics, Pontifícia Universidade Católica de Minas Gerais, Belo Horizonte, MG, Brazil;Audio-Visual Information Processing Laboratory, Institute of Informatics, Pontifícia Universidade Católica de Minas Gerais, Belo Horizonte, MG, Brazil;Audio-Visual Information Processing Laboratory, Institute of Informatics, Pontifícia Universidade Católica de Minas Gerais, Belo Horizonte, MG, Brazil;Audio-Visual Information Processing Laboratory, Institute of Informatics, Pontifícia Universidade Católica de Minas Gerais, Belo Horizonte, MG, Brazil

  • Venue:
  • CIARP'10 Proceedings of the 15th Iberoamerican congress conference on Progress in pattern recognition, image analysis, computer vision, and applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper addresses transition detection which consists in identifying the boundary between consecutive shots. In this work, we propose an approach to cope with transition detection in which we define and use a new dissimilarity measure based on the size of the maximum cardinality matching calculated using a bipartite graph with respect to a sliding window. The experiments have used two video datasets which presents a variety of different video genres with 3079 transitions. Our method achieves performance measures similar to the best results found in the literature with a much simpler classification approach.