Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
Video Shot Boundary Detection by Graph-theoretic Dominant Sets Approach
Date
2009-09-16
Author
Asan, Emrah
Alatan, Abdullah Aydın
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
3
views
0
downloads
We present a video shot boundary detection algorithm based on the novel graph theoretic concept, namely dominant sets. Dominant sets are defined as a set of the nodes in a graph, mostly similar to each other and dissimilar to the others. In order to achieve this goal, candidate shot boundaries are determined by using simply pixelwise differences between consequent frames. For each candidate position, a testing sequence is constructed by considering 4 frames before the candidate position and 2 frames after the candidate position. Proposed method works on a weighted undirected graph, where the graphs are established by using the frames in the testing sequence. Each frame in the sequence corresponds to a node in the graph, whereas edge weights between the nodes are calculated by using pairwise similarities of frames. By utilizing the complete information of the graph, its dominant set is detected. The simulation results indicate that the proposed algorithm can be a promising approach for abrupt shot boundary detection.
Subject Keywords
Computer Science
URI
https://hdl.handle.net/11511/37398
DOI
https://doi.org/10.1109/iscis.2009.5291928
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar