Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
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
214
views
0
downloads
Cite This
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
Suggestions
OpenMETU
Core
Video shot boundary detection by graph theoretic approaches
Aşan, Emrah; Alatan, Abdullah Aydın; Department of Electrical and Electronics Engineering (2008)
This thesis aims comparative analysis of the state of the art shot boundary detection algorithms. The major methods that have been used for shot boundary detection such as pixel intensity based, histogram-based, edge-based, and motion vectors based, are implemented and analyzed. A recent method which utilizes “graph partition model” together with the support vector machine classifier as a shot boundary detection algorithm is also implemented and analyzed. Moreover, a novel graph theoretic concept, “dominant...
Multiagent moving target search in fully visible grid environments with no speed difference
Eroğul, Can; Polat, Faruk; Department of Computer Engineering (2006)
In this thesis, a new real-time multi-agent moving target pursuit algorithm and a moving target algorithm are developed and implemented. The environment is a grid world, in which a coordinated team of agents cooperatively blocks the possible escape routes of an intelligent target in real-time. Most of the moving target search algorithms presume that the agents are faster than the targets, so the pursuit is sure to end in favor of the agents. In this work, we relax this assumption and assume that all the mov...
Video Shot Boundary Detection by Dominant Sets Approach
Asan, Emrah; Alatan, Abdullah Aydın (2009-04-11)
In this study, a video shot boundary detection algorithm based on the dominant sets concept is proposed. Dominant sets method is a graph theoretic clustering algorithm. Proposed method is based on a weighted undirected graph. Candidate shot boundaries are determined and graphs are constructed by taking 2 frames from the right of the candidate position and 4 frames from the left of the candidate position. Edge weights among the vertices are evaluated by using pairwise similarities of frames. By using the com...
Computational representation of protein sequences for homology detection and classification
Oğul, Hasan; Mumcuoğlu, Ünal Erkan; Department of Information Systems (2006)
Machine learning techniques have been widely used for classification problems in computational biology. They require that the input must be a collection of fixedlength feature vectors. Since proteins are of varying lengths, there is a need for a means of representing protein sequences by a fixed-number of features. This thesis introduces three novel methods for this purpose: n-peptide compositions with reduced alphabets, pairwise similarity scores by maximal unique matches, and pairwise similarity scores by...
Multi-camera video surveillance : detection, occlusion handling, tracking and event recognition
Akman, Oytun; Alatan, Abdullah Aydın; Department of Electrical and Electronics Engineering (2007)
In this thesis, novel methods for background modeling, tracking, occlusion handling and event recognition via multi-camera configurations are presented. As the initial step, building blocks of typical single camera surveillance systems that are moving object detection, tracking and event recognition, are discussed and various widely accepted methods for these building blocks are tested to asses on their performance. Next, for the multi-camera surveillance systems, background modeling, occlusion handling, tr...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
E. Asan and A. A. Alatan, “Video Shot Boundary Detection by Graph-theoretic Dominant Sets Approach,” 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37398.