An approach for video cut detection using bipartite graph matching as dissimilarity distance

Author

Guimarães, Silvio Jamil F ; Do Patrocínio, Zenilton K G, Jr. ; De Paula, Hugo Bastos

Author_Institution

Pontificia Univ. Catolica de Minas Gerais, Belo Horizonte, Brazil

fYear

2008

fDate

8-11 Dec. 2008

Firstpage

1

Lastpage

4

Abstract

The video segmentation problem consists in the identification of the boundary between consecutive shots. When two consecutive frames are similar, they are considered to be in the same shot. In this work, we use the maximum cardinality of the bipartite graph matching between two frames as the dissimilarity distance in order to identify the cut locations. Thus, if two frames are similar then the maximum cardinality is high. We present some experiments to show the high performance of this distance.

Keywords

graph theory; image matching; image segmentation; object detection; video signal processing; bipartite graph matching; dissimilarity distance; video cut detection; video segmentation problem; Bipartite graph; Gunshot detection systems; Histograms; Image sampling; Motion detection; Object detection; Performance analysis; Performance evaluation; Rhythm; Sampling methods;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 2008. ICPR 2008. 19th International Conference on

Conference_Location

Tampa, FL

ISSN

1051-4651

Print_ISBN

978-1-4244-2174-9

Electronic_ISBN

1051-4651

Type

conf

DOI

10.1109/ICPR.2008.4761142

Filename

4761142