By Topic

A Rotation and Translation Invariant Algorithm for Cut Detection Using Bipartite Graph Matching

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
$31 $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)
Guimaraes, S.J.F. ; Pontificia Univ. Catolica de Minas Gerais, Belo Horizonte ; do Patrocinio, Z.K.G. ; Paula, H.

Cut detection is part of the video segmentation problem, and consists in the identification of the boundary between consecutive shots. In this case, when two consecutive frames are similar, they are considered to be in the same shot. This work presents an approach to cut detection using a rotation and translation invariant algorithm based on the use of the maximum cardinality of a bipartite graph matching between two frames as the dissimilarity distance. Experimental results provides a comparison between the new approach and other popular algorithms from the literature, showing that the new algorithm is robust and has a high performance if compared to other methods of cut detection.

Published in:

Multimedia, 2008. ISM 2008. Tenth IEEE International Symposium on

Date of Conference:

15-17 Dec. 2008