By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Silvio Jamil F. Guimaraes ; Pontifícia Universidade Católica de Minas Gerais (PUC Minas), Rua Walter Ianni, 255 - São Gabriel - 31980-110 - Belo Horizonte - MG - Brazil ; Zenilton K. G. do Patrocinio ; Hugo Bastos de Paula

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.

Published in:

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

Date of Conference:

8-11 Dec. 2008