Shot boundary detection and label propagation for spatio-temporal video segmentation

Author(s):  
Sankaranaryanan Piramanayagam ◽  
Eli Saber ◽  
Nathan D. Cahill ◽  
David Messinger

Temporal video segmentation is the primary step of content based video retrieval. The whole processes of video management are coming under the focus of content based video retrieval, which includes, video indexing, video retrieval, and video summarization etc. In this paper, we proposed a computationally efficient and discriminating shot boundary detection method, which uses a local feature descriptor named local Contrast and Ordering (LCO) for feature extraction. The results of the experiments, which are conducted on the video dataset TRECVid, analyzed and compared with some existing shot boundary detection methods. The proposed method has given a promising result, even in the cases of illumination changes, rotated images etc.


Author(s):  
Shanmukhappa Angadi ◽  
Vilas Naik

The Shot Boundary Detection (SBD) is an early step for most of the video applications involving understanding, indexing, characterization, or categorization of video. The SBD is temporal video segmentation and it has been an active topic of research in the area of content based video analysis. The research efforts have resulted in a variety of algorithms. The major methods that have been used for shot boundary detection include pixel intensity based, histogram-based, edge-based, and motion vectors based, technique. Recently researchers have attempted use of graph theory based methods for shot boundary detection. The proposed algorithm is one such graph based model and employs graph partition mechanism for detection of shot boundaries. Graph partition model is one of the graph theoretic segmentation algorithms, which offers data clustering by using a graph model. Pair-wise similarities between all data objects are used to construct a weighted graph represented as an adjacency matrix (weighted similarity matrix) that contains all necessary information for clustering. Representing the data set in the form of an edge-weighted graph converts the data clustering problem into a graph partitioning problem. The algorithm is experimented on sports and movie videos and the results indicate the promising performance.


Author(s):  
Ruxandra Tapu ◽  
Titus Zaharia

This paper introduces a complete framework for temporal video segmentation. First, a computationally efficient shot extraction method is introduced, which adopts the normalized graph partition approach, enriched with a non-linear, multiresolution filtering of the similarity vectors involved. The shot boundary detection technique proposed yields high precision (90%) and recall (95%) rates, for all types of transitions, both abrupt and gradual. Next, for each detected shot, the authors construct a static storyboard by introducing a leap keyframe extraction method. The video abstraction algorithm is 23% faster than existing techniques for similar performances. Finally, the authors propose a shot grouping strategy that iteratively clusters visually similar shots under a set of temporal constraints. Two different types of visual features are exploited: HSV color histograms and interest points. In both cases, the precision and recall rates present average performances of 86%.


2020 ◽  
Vol 13 (4) ◽  
pp. 798-807
Author(s):  
J. Kavitha ◽  
P. Arockia Jansi Rani ◽  
P. Mohamed Fathimal ◽  
Asha Paul

Background:: In the internet era, there is a prime need to access and manage the huge volume of multimedia data in an effective manner. Shot is a sequence of frames captured by a single camera in an uninterrupted space and time. Shot detection is suitable for various applications such that video browsing, video indexing, content based video retrieval and video summarization. Objective:: To detect the shot transitions in the video within a short duration. It compares the visual features of frames like correlation, histogram and texture features only in the candidate region frames instead of comparing the full frames in the video file. Methods: This paper analyses candidate frames by searching the values of frame features which matches with the abrupt detector followed by the correct cut transition frame with in the datacube recursively until it detects the correct transition frame. If they are matched with the gradual detector, then it will give the gradual transition ranges, otherwise the algorithm will compare the frames within the next datacube to detect shot transition. Results:: The total average detection rates of all transitions computed in the proposed Data-cube Search Based Shot Boundary Detection technique are 92.06 for precision, 96.92 for recall and 93.94 for f1 measure and the maximum accurate detection rate. Conclusion:: Proposed method for shot transitions uses correlation value for searching procedure with less computation time than the existing methods which compares every single frame and uses multi features such as color, edge, motion and texture features in wavelet domain.


Sign in / Sign up

Export Citation Format

Share Document