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. © 2010 Springer-Verlag.
CITATION STYLE
Do Patrocínio, Z. K. G., Guimaräes, S. J. F., Da Silva, H. B., & De Souza, K. J. F. (2010). An unified transition detection based on bipartite graph matching approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6419 LNCS, pp. 184–192). https://doi.org/10.1007/978-3-642-16687-7_28
Mendeley helps you to discover research relevant for your work.