# Efficient Shot Boundary Detection with Multiple Visual Representations

Authors: Jasmin T. Jose; S. Rajkumar; Muhammad Rukunuddin Ghalib; Achyut Shankar; Pavika Sharma; Mohammad R. Khosravi
Journal: Mobile Information Systems
 (2022)

---

## Abstract

Due to the unlimited growth of video-capturing devices and media, searching and finding a particular video in this huge database becomes a laborious as well as expensive task. Information-rich shots are the inevitable factor of the content-based video processing (CBVP) system. Hence, shot boundary detection (SBD) becomes the basic step of all content-based video retrieval processes. The accuracy of the existing SBD methods highly suffers from false positives and false negatives due to the presence of multiple variants. An efficient SBD method with multiple invariant features is proposed in this paper. A right combination of invariant features such as edge change ratio (ECR), colour layout descriptor (CLD), and scale-invariant feature transform (SIFT) key point descriptors helped to improve the accuracy level of SBD. As the selected features are invariant to most of the variants in video frames, such as illuminance changes, motion, scaling, and rotation, a markable reduction in false detection is possible. Support vector machine (SVM) classifier is used for the classification of frames into transition frames and shot frames. This proposed method is experimented and analysed with the standard SBD dataset TRECVid 2007 videos. The experimental results are compared with some state-of-art methods, and our method shows better performance with a 97% of F1 score.


---

## Body

## 1. Introduction

The uncontrolled growth of videos due to the mushrooming of multimedia devices has brought the importance of video processing techniques to the concentration of current researchers. So, most of the researchers in the area of video processing are concentrated on CBVP. Content-based image processing (CBIP) techniques can be extended to CBVP[1] by considering the extra useful information in the video such as visual content and audio. CBVP includes the subareas such as video content analysis, video deconstruction into shots or scenes, video summarizing, and video indexing. Both image and video processing systems are working on the basis of different features, which are reflected in the input image or video. The selection of a pertaining feature is the most important factor in both image as well as video processing [2]. Even though CBVP is the prolongation of CBIP, it treats each contiguous frame of video as an image. In CBIP, consistently used features are texture features, colour features, edge features etc. Apart from these conventional basic features, CBVP will consider the visual content features, which will give the continuity details of the video.As the shot is the basic temporal building block of a video, it will be more powerful, if we could do the processing in this shot [1], rather than working directly with the entire video. Though we are segregating the video into its small patches named shots, it is again a group of image frames with some common features in it. Obviously, processing shots would be much harder and more complicated than processing an image [3]. This makes the CBVP a challenging task. Researchers working on video are having a concept in their mind that a constant feature value exists within a shot, but it will be different in intershots. Shot boundary detection aims to identify the frames with considerable discontinuities in different aspects of their visual contents. These different aspects of visual content are depicted by the features of the frames in the input video. Hence, the selection and extraction of features from video frames should be taken care of.Illumination, rotation, and scale-variant temporal and spatial features are the greatest challenges in video processing. Miss prediction of shots is possible when the object or camera motion is high in the video [4]. The most commonly used features in video processing are colour, texture, edge, etc. [5]. While considering a video, temporal features, which give more details about the continuity/discontinuity between the frames of the video, are more important. Motion strength, ECR etc. are some of the motion features. Each feature may face one or more factors that lead to some false detection. Eliminating this false detection with the use of invariant features is a big challenge [6].Video shots or shot transition is of two types [7], abrupt transition (AT) or hard cut and gradual transition (GT) or soft cut. The shot boundaries will be two consecutive frames in the case of AT, i.e., ft and ft + 1, and there will be a large difference in the visual contents of those frames as shown in Figure 1, in which two different shot cuts are visible. But, in the latter one, as the name indicates the transition which is happening gradually throughout several consecutive frames as shown in Figure 2, the natural transition due to the camera close is an abrupt transition, and the gradual transition is due to the visual effects that are applied to the video at the time of video editing. GT is in three different forms, dissolve, fade, and wipe.Figure 1
Frames of abrupt transition (CUT) from the video BG 37822 (TRECVid).Figure 2
Frames of gradual transition (dissolve type).As the characteristics of each video are different, the visual contents also will be different. Hence, using a single feature descriptor to represent the whole video will not be sufficient, and it will not give an accurate result. So, in our approach, we are using multiple invariant feature descriptors, and each will extract different representations of visual content. Descriptors, for colour details, texture details, edge, and motion details, are used in our approach. A continuity signal is generated by comparing feature values of adjacent frames of the video. Finally, the classification is done with the help of a well-known supervised classifier, SVM.The flow of this paper is as follows: Section2 gives a small review of some of the research works, which are used for getting an idea about the current technologies in the area of the SBD process. The proposed work is explained in Section 3, followed by the experimental results of our work in Section 4. Finally, the paper is concluded by Section 5, with a small description of future work.


## 2. Literature Review

As the number of videos is increasing rapidly, researchers are more attracted to video processing as well as the SBD process. TRECVid, introduced by the National Institute of Standards and Technology (NIST), is a benchmark for content-based video retrieval (CBVD) processes. SBD was also one of the activities under those workshops. So many researchers participated [1, 4, 8] and contributed a lot to this area of SBD through TRECVid workshops. Multiple datasets were introduced by this TRECVid, which is useful for our SBD experiments. Smeaton et al. [1] have given a detailed overview of the different SBD experiments under this TRECVid workshop. Most of the researchers were using this dataset for their SBD experiments.Enormous researchers are working on the SBD scheme, with different feature sets and different classification methods. Some of the important research, which helped us to reach this approach, is discussed here. Abdulhussain et al. [2] have done a very good survey on different SBD methods. They have gone through all subsections of SBD processes. Feature selection is very important in the SBD, and a wide variety of local and global features are available. The feature sets start from simple pixel difference and statistical approaches, and now, convolutional neural networks are also used to identify the boundary.Gargi et al. [3] have given a comparison of different SBD schemes with the colour histogram as a feature. The histogram intersection method is the highlight of their paper. A texture-based SBD approach is proposed by Teng et al. [9], in which they used the local binary pattern as a texture feature. Only with this local feature, it is difficult to get the temporal relationship between the consequent frames. Cosine difference is used as the dissimilarity measure to find the frame difference. In [10], a multilevel difference in the histogram is used for the SBD process. HSV histogram with a single level difference for abrupt transition detection and 5 level differences for gradual transition detection was used. The voting mechanism for the final decision is used. With this multilevel approach, the illumination problems could be minimized in a better way.Presently, so many researchers were approaching SBD with multiple features, a combination of features. Tippayya et al. [6] and Lin et al. [11] used multiple features. In the first one, a histogram with SURF is used and later, and a histogram as a colour feature and a histogram of gradient as a texture feature were used. Results show better performance in multiple feature models. We have tried a combination of three greyscale features, GLCM (gray level co-occurrence matrix), histogram, and SIFT features in different levels [12] to detect the abrupt transition. The results of the experiment show better performance when compared to the existing single feature-based approaches.Kumar et al. [13] used the SIFT for SBD and keyframe extraction with some frame elimination to reduce the time complexity. CIEDE2000 colour difference and mean luminance pattern are used in [14] for AT and GT detection, respectively. Lab colour space, in which the approximation of all colours is possible, is used in this work. They have achieved good accuracy by eliminating the effects of illuminance changes. But, no other challenges are considered here.Image projection and optical flow estimation are used as the features for SBD in [15]. Image projection can consider the shape information, so it is useful for object detection. Segmenting the video into visual scenes, a group of similar shots, is achieved [16] by the use of the bag of visual word model. Keyframes are selected based on this feature, and then, the feature difference is calculated to identify the similar shots to generate the segment. Better performance in accuracy is achieved by this approach.Not only the histogram-based or texture-based features used in the SBD process but also edge-based features were used by many of the researchers [5, 17] in this area. Lakshmi and Domnic [5] made use of multiple features such as texture strength, colour strength, and edge strength combined with motion strength in the Walsh Hadamard transformed domain. Motion strength is calculated by the block matching algorithm, which increases the computational cost. The accuracy rate is comparable with top researchers of the TRECVid 2007 workshop. Zhou et al. [18] proposed an SBD with multiple feature sets, such as SURF, colour histogram difference, pixel difference, SIFT along with slice matching. Time complexity is reduced in this approach with the use of candidate frame selection.Further, finding the similarity/dissimilarity measures for continuity signal generation is important. Selecting a suitable measure is a key point for the SBD scheme. A comparative study on different similarity measures for CBVR is given by [2]. Euclidean distance and city block distance are the commonly used measures in the CBVR system.Finally, the classification of video frames into different categories, such as cut frames, gradual transition frames, and transition frames, is done with different approaches. Threshold-based approaches and machine learning approaches were used. In threshold-based approaches, adaptive threshold, global threshold, or combined threshold were used by multiple researchers. Most of the aforementioned researchers used different types of threshold mechanisms. Recently, researchers are more interested in machine learning classifications. Zhao and Cai [19] proposed an SBD method with the combination of fuzzy logic and the AdaBoost algorithm for shot classification. The result shows a high precision rate when compared to double-threshold approaches.Idan et al. [20] proposed a fast SBD method with separable moments and SVM classifiers. Orthogonal polynomial-based moments are used as feature sets on candidate frames, and final classification is done with SVM. Zheng and Zhang [21] have proposed a combined version of the threshold classifier and SVM classifier. The initial classification is done by the threshold approach. Then, SVM is used for confirmation. Researchers on this SBD scheme are more interested in supervised learning classification than unsupervised learning classifiers, as the output classes are well known.An efficient and accurate SBD method is very important for subsequent CBVP and CBVR. Appropriate selection of features which are invariant to illuminance changes, issues from camera/object motion, scaling, rotation, and new object entry is the major challenge of the SBD process. In fact, existing SBD models are handling a few of the above-mentioned challenges, and they are only able to overcome some of the challenges, but they failed to solve other issues. So, it is essential to identify some set of features which can handle all those issues. Based on this analysis, we have selected some sets of invariant features for an efficient SBD process. We have used three optimal features such as CLD, ECR, and SIFT in our proposed SBD model. The proposed SBD method is explained in Section3.


## 3. Proposed SBD Method

Generally, a shot boundary detection process will have three phases: first, feature extraction (representation of visual contents), followed by continuity signal generation from the extracted features, and finally, classification (shot frames and boundary frames) of frames. Video is the amalgamation of contiguous frames, and each frame can be treated the same as an image. Initially, the frames will be extracted from the input video for further processing. Then, these contiguous frames are processed to extract the features. While processing a video, it is important to consider both image content details (spatial) and temporal details of the video. The block diagram of the proposed method is shown in Figure3. The three phases of our SBD process are as follows.Figure 3
Multiple feature-based SBD process.


### 3.1. Feature Extraction

As mentioned above, our approach used three different features: colour, texture, and edge with motion features. Most of the existing SBD approaches are using any one or two of the features in their SBD process. An efficient SBD method should use features which are invariant to the effects of illumination changes, slow/fast motion in video, scaling, and rotation. Unfortunately, no features are invariant to all these effects. In fact, a combination of features may help to solve this issue. From the research, we have identified a combination of features, which can cover most of the above-mentioned effects. Colour layout descriptor (CLD) is used for colour feature extraction, edge change ratio for motion features, and scale-invariant feature transform (SIFT) for extracting texture features. Each descriptor is described in the following sessions.


#### 3.1.1. Colour Layout Descriptor

The spatial distribution of colour of visual signals can be represented effectively in a compact form by a colour descriptor called colour layout descriptor [7, 22]. It is proven that this CLD is very efficient in the processing of both still images and video. CLD is considered the most precise and fast colour descriptor, and it can describe the colour relation between a group of images. Frames that have a high colour relationship will be coming under the same shot. The discriminability and robustness of CLD make this descriptor optimal for the SBD process. Invariants of CLD under light changes are an added advantage in our algorithm.Different steps in CLD extraction are shown in Figure4. The extraction of the CLD feature is performed in four steps. First is the partitioning of frames into 8 × 8 blocks. Secondly, the dominant colour of each block will be selected, using the average colour method. In the third stage, the colour space of tiny blocks with dominant colour (8 × 8) is converted to YCbCr colour space, and each of these colour space components will be transformed using DCT (8 × 8 DCT).Figure 4
CLD feature extraction.The output of this transformation is 3 sets (Y, Cb, and Cr separately) of 64 DCT coefficients. To get the feature vector, a zigzag scanning will be performed on these 3 sets of DCT coefficients, so that all low-frequency coefficients can be grouped. Six from the Y component and 3 from each Cb and Cr, a total of 12 DCT coefficients will be extracted. The main advantage of this descriptor is its less storage cost. CLD extracts only 12 DCT coefficients out of 192 coefficients (64∗ 3) from a frame, and the coefficient size is very small. This highlights the CLD among all other colour descriptors. Storage cost is the main challenge of the CBVR system, as it deals with videos, which have more frames, and it will occupy more storage space. Hence, this less storage cost with DLD is very useful in the fast SBD process [22].


#### 3.1.2. Edge Change Ratio

The edge change ratio is a measure that differentiates two consecutive frames in a video. So, this feature can be used to identify the shot transition in the video. Zabih et al. [23] introduced ECF (edge change factor) in their work. Recently, researchers are using this same concept with some slight changes in ECR in their work. ECR is invariant to illumination changes, and it can also minimize the false shot boundary detection due to the camera or object motion in the video. Moreover, it gives the edge change ratio between the consecutive frames, from which the temporal aspects of the video can be extracted. Due to these characteristics, ECR is chosen as an edge feature in our proposed method.The steps to calculate the ECR from two consecutive frames are as follows:(1)
Extract two consecutive framesFi and Fi+1 from the input video.(2)
Convert the RGB frames into YCbCr colour space,Fi and Fi+1.(3)
Apply canny edge detection only on the luminance element of YCbCr colour space. Output frames areFci and Fci+1.(4)
Count the number of edge pixels inFci and Fci+1. Counts are Pi and Pi+1 respectively.(5)
Apply dilation then inversion onFci and Fci+1, and get Fci′ and Fci+1′.(6)
Perform subtraction (set subtraction) between the output images to calculate the exiting edge pixels (Pout) and entering edge pixels (Pin), as follows [23]:(1)Pout=Fci′−Fci+1′,Pin=Fci+1′−Fci′.(7)
Calculate the ECR using the following equation:(2)ECRi,k=MaxPoutPi,PinPi+1,in which Pi and Pi+1 are the number of edge pixels in the consequent frames Fi and Fi+1, respectively and, k is 1 for two consecutive frames. The ECR value is in the range of 0 to 1.


#### 3.1.3. SIFT Key Point Matching

As the name indicates, SIFT descriptor takes the image as an input and transforms it into a large collection of local feature vectors, and these vectors are invariant to the scaling and rotation of images. SIFT can provide correct correspondences between two images. Moreover, SIFT provides information on the content elements. The output of this SIFT algorithm will be a descriptor vector of all SIFT key points. The process of SIFT key point extraction and key point matching is as follows.SIFT key point extraction:Input:Nc, number of frames (Nc)Output: Number of SIFT key pointsS = cell (1, 1) Key points extractionfort = 1 to Nc doFind the location and scale of key pointsStrong key point selectionConsistent orientation of key pointskp(t) = key point descriptorS{t, 1} = kp(ft)S{t, 2} = Pkp(ft) = count(S{t, 1}); number of key pointsend forSIFT key point matching:fort = 1 to Nc − 1 doS{t, 3} = match(S{t, 1}, S{t + 1, 1})S{t, 4} = Pmkp(ft, ft+1) = count(S{t, 3})end forwhereNc is the number of candidate frames, kp(ft) is the key points of frame t, Pkp(ft) is the number of the keyframe in frame t, and Pmkp is the number of matching key point between ft and ft+1. This number of matching key points of consecutive frames is considered for the continuity signal generation.


### 3.2. Continuity Signal Generation

The feature difference vector for all these aforementioned descriptors is generated by comparing the feature values of adjacent frames of video. Colour layout descriptor, edge change ratio, and SIFT key point matching are used. In CLD, the matching of feature vectors of consecutive frames can be done with the (3). Let us consider CLDs of two consecutive frames (DY, DCb, DCr) and (DY′, DCb’, DCr’). Then, the frame difference CLDDist is [24](3)CLDDist=∑iwyiDYi−DYi′2+∑iwcbiDCbi−DCbi′2+∑iwcriDCri−DCri′2,where DYi, DCbi, DCri are the ith coefficients of Y, Cb, Cr colour components, respectively. wyi, wcbi, wcri denote the weighting factor of the ith coefficient.Equation (2) gives the ECR between two consecutive frames of video. This ratio is considered the continuity signal. In the case of SIFT feature, the number of matching key points (Pmkp from the algorithm), between consecutive frames, is considered for continuity signal. This is calculated by comparing the adjacent frames of the input video. These three continuity signals are considered feature difference vectors for classification. Each feature vector value is normalized in the range of 0 to1. These vectors are given to the SVM as input vectors for classification purposes.


### 3.3. Classification of Video Frames

Finally, the classification of video frames into two different classes is done, using these aforementioned feature vectors with an SVM classifier. SVM is useful in image classification and segmentation as well [25]. The suitability of SVM in noisy and noise-free environments, less training time due to the use of fewer parameters, and less complexity makes the SVM the best model in our SBD method [20]. This modal can be used not only for linearly separable data but also for nonlinear separable data sets with the help of some known kernel tricks. Most of the researchers are using radial basis function (RBF) (4) as the kernel in SVM [9]. The nonlinear mapping and less complexity of the RBF kernel make it a better choice [20, 25] for SBD. The expression of the RBF kernel with the training vectors vi,vj and the kernel parameter γ is as follows:(4)Kvi,vj=exp−γvi−vj2;γ>0.A set of videos from the TRECVid 2007 data set is used for training the SVM. In this data set, the ratio between the boundary frames and shot frames is very high (around 1 : 1200), and it will affect the result. So, a custom data set is constructed from this original data set by removing the redundant frames. SVM of OpenCV library is used for the implementation. 8 videos, which are described in Table1 (these videos are not considered in training), are used for classification. The cost parameter is tuned with X-fold cross-validation. Binary classification of video frames into shot frames and boundary frames is done with an SVM classifier.Table 1
Acronyms and notations used in paper.
Acronyms and notations usedCBVPContent based video processingSBDShot boundary detectionCLDColour layout descriptorECREdge change ratioSIFTScale invariant feature transformATAbrupt transitionGTGradual transitionSVMSupport vector machineGLCMGray level co-occurrence matrixKvi,vjRBF kernelγKernel parameterPiNumber of edge pixels inftNcNumber of framesKP (ft)Key points offtPkp (ft)Number of key points offtPmkp (ft)Number of matching key points betweenft and ft+1CLDdistCLD difference betweenft and ft+1The notations and abbreviations used in this paper are given in Table1.


## 3.1. Feature Extraction

As mentioned above, our approach used three different features: colour, texture, and edge with motion features. Most of the existing SBD approaches are using any one or two of the features in their SBD process. An efficient SBD method should use features which are invariant to the effects of illumination changes, slow/fast motion in video, scaling, and rotation. Unfortunately, no features are invariant to all these effects. In fact, a combination of features may help to solve this issue. From the research, we have identified a combination of features, which can cover most of the above-mentioned effects. Colour layout descriptor (CLD) is used for colour feature extraction, edge change ratio for motion features, and scale-invariant feature transform (SIFT) for extracting texture features. Each descriptor is described in the following sessions.


### 3.1.1. Colour Layout Descriptor

The spatial distribution of colour of visual signals can be represented effectively in a compact form by a colour descriptor called colour layout descriptor [7, 22]. It is proven that this CLD is very efficient in the processing of both still images and video. CLD is considered the most precise and fast colour descriptor, and it can describe the colour relation between a group of images. Frames that have a high colour relationship will be coming under the same shot. The discriminability and robustness of CLD make this descriptor optimal for the SBD process. Invariants of CLD under light changes are an added advantage in our algorithm.Different steps in CLD extraction are shown in Figure4. The extraction of the CLD feature is performed in four steps. First is the partitioning of frames into 8 × 8 blocks. Secondly, the dominant colour of each block will be selected, using the average colour method. In the third stage, the colour space of tiny blocks with dominant colour (8 × 8) is converted to YCbCr colour space, and each of these colour space components will be transformed using DCT (8 × 8 DCT).Figure 4
CLD feature extraction.The output of this transformation is 3 sets (Y, Cb, and Cr separately) of 64 DCT coefficients. To get the feature vector, a zigzag scanning will be performed on these 3 sets of DCT coefficients, so that all low-frequency coefficients can be grouped. Six from the Y component and 3 from each Cb and Cr, a total of 12 DCT coefficients will be extracted. The main advantage of this descriptor is its less storage cost. CLD extracts only 12 DCT coefficients out of 192 coefficients (64∗ 3) from a frame, and the coefficient size is very small. This highlights the CLD among all other colour descriptors. Storage cost is the main challenge of the CBVR system, as it deals with videos, which have more frames, and it will occupy more storage space. Hence, this less storage cost with DLD is very useful in the fast SBD process [22].


### 3.1.2. Edge Change Ratio

The edge change ratio is a measure that differentiates two consecutive frames in a video. So, this feature can be used to identify the shot transition in the video. Zabih et al. [23] introduced ECF (edge change factor) in their work. Recently, researchers are using this same concept with some slight changes in ECR in their work. ECR is invariant to illumination changes, and it can also minimize the false shot boundary detection due to the camera or object motion in the video. Moreover, it gives the edge change ratio between the consecutive frames, from which the temporal aspects of the video can be extracted. Due to these characteristics, ECR is chosen as an edge feature in our proposed method.The steps to calculate the ECR from two consecutive frames are as follows:(1)
Extract two consecutive framesFi and Fi+1 from the input video.(2)
Convert the RGB frames into YCbCr colour space,Fi and Fi+1.(3)
Apply canny edge detection only on the luminance element of YCbCr colour space. Output frames areFci and Fci+1.(4)
Count the number of edge pixels inFci and Fci+1. Counts are Pi and Pi+1 respectively.(5)
Apply dilation then inversion onFci and Fci+1, and get Fci′ and Fci+1′.(6)
Perform subtraction (set subtraction) between the output images to calculate the exiting edge pixels (Pout) and entering edge pixels (Pin), as follows [23]:(1)Pout=Fci′−Fci+1′,Pin=Fci+1′−Fci′.(7)
Calculate the ECR using the following equation:(2)ECRi,k=MaxPoutPi,PinPi+1,in which Pi and Pi+1 are the number of edge pixels in the consequent frames Fi and Fi+1, respectively and, k is 1 for two consecutive frames. The ECR value is in the range of 0 to 1.


### 3.1.3. SIFT Key Point Matching

As the name indicates, SIFT descriptor takes the image as an input and transforms it into a large collection of local feature vectors, and these vectors are invariant to the scaling and rotation of images. SIFT can provide correct correspondences between two images. Moreover, SIFT provides information on the content elements. The output of this SIFT algorithm will be a descriptor vector of all SIFT key points. The process of SIFT key point extraction and key point matching is as follows.SIFT key point extraction:Input:Nc, number of frames (Nc)Output: Number of SIFT key pointsS = cell (1, 1) Key points extractionfort = 1 to Nc doFind the location and scale of key pointsStrong key point selectionConsistent orientation of key pointskp(t) = key point descriptorS{t, 1} = kp(ft)S{t, 2} = Pkp(ft) = count(S{t, 1}); number of key pointsend forSIFT key point matching:fort = 1 to Nc − 1 doS{t, 3} = match(S{t, 1}, S{t + 1, 1})S{t, 4} = Pmkp(ft, ft+1) = count(S{t, 3})end forwhereNc is the number of candidate frames, kp(ft) is the key points of frame t, Pkp(ft) is the number of the keyframe in frame t, and Pmkp is the number of matching key point between ft and ft+1. This number of matching key points of consecutive frames is considered for the continuity signal generation.


## 3.1.1. Colour Layout Descriptor

The spatial distribution of colour of visual signals can be represented effectively in a compact form by a colour descriptor called colour layout descriptor [7, 22]. It is proven that this CLD is very efficient in the processing of both still images and video. CLD is considered the most precise and fast colour descriptor, and it can describe the colour relation between a group of images. Frames that have a high colour relationship will be coming under the same shot. The discriminability and robustness of CLD make this descriptor optimal for the SBD process. Invariants of CLD under light changes are an added advantage in our algorithm.Different steps in CLD extraction are shown in Figure4. The extraction of the CLD feature is performed in four steps. First is the partitioning of frames into 8 × 8 blocks. Secondly, the dominant colour of each block will be selected, using the average colour method. In the third stage, the colour space of tiny blocks with dominant colour (8 × 8) is converted to YCbCr colour space, and each of these colour space components will be transformed using DCT (8 × 8 DCT).Figure 4
CLD feature extraction.The output of this transformation is 3 sets (Y, Cb, and Cr separately) of 64 DCT coefficients. To get the feature vector, a zigzag scanning will be performed on these 3 sets of DCT coefficients, so that all low-frequency coefficients can be grouped. Six from the Y component and 3 from each Cb and Cr, a total of 12 DCT coefficients will be extracted. The main advantage of this descriptor is its less storage cost. CLD extracts only 12 DCT coefficients out of 192 coefficients (64∗ 3) from a frame, and the coefficient size is very small. This highlights the CLD among all other colour descriptors. Storage cost is the main challenge of the CBVR system, as it deals with videos, which have more frames, and it will occupy more storage space. Hence, this less storage cost with DLD is very useful in the fast SBD process [22].


## 3.1.2. Edge Change Ratio

The edge change ratio is a measure that differentiates two consecutive frames in a video. So, this feature can be used to identify the shot transition in the video. Zabih et al. [23] introduced ECF (edge change factor) in their work. Recently, researchers are using this same concept with some slight changes in ECR in their work. ECR is invariant to illumination changes, and it can also minimize the false shot boundary detection due to the camera or object motion in the video. Moreover, it gives the edge change ratio between the consecutive frames, from which the temporal aspects of the video can be extracted. Due to these characteristics, ECR is chosen as an edge feature in our proposed method.The steps to calculate the ECR from two consecutive frames are as follows:(1)
Extract two consecutive framesFi and Fi+1 from the input video.(2)
Convert the RGB frames into YCbCr colour space,Fi and Fi+1.(3)
Apply canny edge detection only on the luminance element of YCbCr colour space. Output frames areFci and Fci+1.(4)
Count the number of edge pixels inFci and Fci+1. Counts are Pi and Pi+1 respectively.(5)
Apply dilation then inversion onFci and Fci+1, and get Fci′ and Fci+1′.(6)
Perform subtraction (set subtraction) between the output images to calculate the exiting edge pixels (Pout) and entering edge pixels (Pin), as follows [23]:(1)Pout=Fci′−Fci+1′,Pin=Fci+1′−Fci′.(7)
Calculate the ECR using the following equation:(2)ECRi,k=MaxPoutPi,PinPi+1,in which Pi and Pi+1 are the number of edge pixels in the consequent frames Fi and Fi+1, respectively and, k is 1 for two consecutive frames. The ECR value is in the range of 0 to 1.


## 3.1.3. SIFT Key Point Matching

As the name indicates, SIFT descriptor takes the image as an input and transforms it into a large collection of local feature vectors, and these vectors are invariant to the scaling and rotation of images. SIFT can provide correct correspondences between two images. Moreover, SIFT provides information on the content elements. The output of this SIFT algorithm will be a descriptor vector of all SIFT key points. The process of SIFT key point extraction and key point matching is as follows.SIFT key point extraction:Input:Nc, number of frames (Nc)Output: Number of SIFT key pointsS = cell (1, 1) Key points extractionfort = 1 to Nc doFind the location and scale of key pointsStrong key point selectionConsistent orientation of key pointskp(t) = key point descriptorS{t, 1} = kp(ft)S{t, 2} = Pkp(ft) = count(S{t, 1}); number of key pointsend forSIFT key point matching:fort = 1 to Nc − 1 doS{t, 3} = match(S{t, 1}, S{t + 1, 1})S{t, 4} = Pmkp(ft, ft+1) = count(S{t, 3})end forwhereNc is the number of candidate frames, kp(ft) is the key points of frame t, Pkp(ft) is the number of the keyframe in frame t, and Pmkp is the number of matching key point between ft and ft+1. This number of matching key points of consecutive frames is considered for the continuity signal generation.


## 3.2. Continuity Signal Generation

The feature difference vector for all these aforementioned descriptors is generated by comparing the feature values of adjacent frames of video. Colour layout descriptor, edge change ratio, and SIFT key point matching are used. In CLD, the matching of feature vectors of consecutive frames can be done with the (3). Let us consider CLDs of two consecutive frames (DY, DCb, DCr) and (DY′, DCb’, DCr’). Then, the frame difference CLDDist is [24](3)CLDDist=∑iwyiDYi−DYi′2+∑iwcbiDCbi−DCbi′2+∑iwcriDCri−DCri′2,where DYi, DCbi, DCri are the ith coefficients of Y, Cb, Cr colour components, respectively. wyi, wcbi, wcri denote the weighting factor of the ith coefficient.Equation (2) gives the ECR between two consecutive frames of video. This ratio is considered the continuity signal. In the case of SIFT feature, the number of matching key points (Pmkp from the algorithm), between consecutive frames, is considered for continuity signal. This is calculated by comparing the adjacent frames of the input video. These three continuity signals are considered feature difference vectors for classification. Each feature vector value is normalized in the range of 0 to1. These vectors are given to the SVM as input vectors for classification purposes.


## 3.3. Classification of Video Frames

Finally, the classification of video frames into two different classes is done, using these aforementioned feature vectors with an SVM classifier. SVM is useful in image classification and segmentation as well [25]. The suitability of SVM in noisy and noise-free environments, less training time due to the use of fewer parameters, and less complexity makes the SVM the best model in our SBD method [20]. This modal can be used not only for linearly separable data but also for nonlinear separable data sets with the help of some known kernel tricks. Most of the researchers are using radial basis function (RBF) (4) as the kernel in SVM [9]. The nonlinear mapping and less complexity of the RBF kernel make it a better choice [20, 25] for SBD. The expression of the RBF kernel with the training vectors vi,vj and the kernel parameter γ is as follows:(4)Kvi,vj=exp−γvi−vj2;γ>0.A set of videos from the TRECVid 2007 data set is used for training the SVM. In this data set, the ratio between the boundary frames and shot frames is very high (around 1 : 1200), and it will affect the result. So, a custom data set is constructed from this original data set by removing the redundant frames. SVM of OpenCV library is used for the implementation. 8 videos, which are described in Table1 (these videos are not considered in training), are used for classification. The cost parameter is tuned with X-fold cross-validation. Binary classification of video frames into shot frames and boundary frames is done with an SVM classifier.Table 1
Acronyms and notations used in paper.
Acronyms and notations usedCBVPContent based video processingSBDShot boundary detectionCLDColour layout descriptorECREdge change ratioSIFTScale invariant feature transformATAbrupt transitionGTGradual transitionSVMSupport vector machineGLCMGray level co-occurrence matrixKvi,vjRBF kernelγKernel parameterPiNumber of edge pixels inftNcNumber of framesKP (ft)Key points offtPkp (ft)Number of key points offtPmkp (ft)Number of matching key points betweenft and ft+1CLDdistCLD difference betweenft and ft+1The notations and abbreviations used in this paper are given in Table1.


## 4. Experimental Results and Analysis

In this section, we have done the experimental analysis on the data set TRECVid 2007, which is the standard dataset, particularly for SBD. We have used 8 different videos from 17 video data sets, which are named V1 through V8 in this paper. Table2 shows a detailed description of those input videos. The abrupt transitions observed by humans are given as the ground truth value. Different types of aberrations such as illumination changes, view changes, scaling, zooming, rotation, etc., are there in the selected videos.Table 2
Description of input video dataset (TRECVid 2007).
Video representationVideo nameNo. of framesNo. of cutsV1BG 240835892101V2BG 94015004981V3BG 1421383115106V4BG 350503699991V5BG 361822961096V6BG 374172300476V7BG 3782221960119V8BG 3815052650216Recall and precision are the important model evaluation metrics usually used in the SBD process. In this paper, we have used these metrics for evaluation along with theF1 score, which is the harmonic mean of precision and recall [5]. These metrics can be calculated as follows:(5)Recall=TruepositiveTruepositive+falsenegative,Precision=TruepositiveTruepositive+falsepositive,F1score=2∗Precision∗RecallPrecision+Recall.Table3 shows the recall, precision, and F1 score values for the 8 videos selected for the SBD experiment. Our approach to the SBD process obtained high performance with the use of multiple features and an SVM classifier. As we have used important features such as colour feature, edge feature, and motion feature, we could overcome most of the variance such as illumination changes, rotation variance, scaling, motion effects due to camera motion, object motion etc.Table 3
Average precision and recall values of input videos.
Video inputTotal no. of cutsNo. of cuts detectedProposed methodTP + FNTP + FPRecallPrecisionF1 scoreV1101990.970.990.979V281820.9750.980.977V31061050.980.990.985V491930.9780.980.979V596980.980.980.98V676750.940.9330.936V71191180.960.980.97V82162160.9720.9720.972Total/Average8868860.9690.9760.972Table 3 shows the recall, precision, and F1 score values of selected input videos. The total number of actual cuts, number of cuts detected by the proposed method, and average values of recall, precision, and F1 score achieved by the proposed method are shown in bold. These score shows the better performance of our SBD method. This high performance is achieved by the use of multiple invariant features and the SVM classifier. As we have used important features such as color feature, edge feature, and motion feature, we could overcome most of the variance such as illumination changes, rotation variance, scaling, motion effects due to camera motion, and object motion.The number of shot frames is very high when compared to the number of cut frames in our data set.F1 score is not considering the true negative (TN) cases in the classification. Though we are giving more attention to the positive cases in SBD, as negative cases are very high in the data set, we should consider TN cases also. A metric which gives attention to the TN cases known as balanced accuracy is also calculated for analysis. This metric is calculated as follows:(6)BalancedAccuracy=sensitivity+Specificity2,SensitivityRecall=TruepositiveTruepositive+falsenegative,Specificity=TruenegativeTruenegative+falsepositive.Table4 shows the balanced accuracy values for each input video sequence. As the proposed method can reduce the number of false positives at a markable rate, the balanced accuracy is very close to the F1 score.Table 4
Balanced accuracy values.
Video sequenceRecall (sensitivity)SpecificityBalanced accuracyV10.9410.9870.964V20.9750.9910.983V30.9811.0000.991V40.9780.9880.983V50.9790.9800.980V60.9211.0000.960V70.9330.9770.955V80.9720.9910.982Sample cut frames detected by the proposed method are shown in Figure5. Figure 6 shows the feature difference plot for those frames. The sudden hikes in feature difference value represent the cut transition. The confusion matrices for each input video are depicted in Figure 7 for more clarification.Figure 5
Sample shot cut frames from TRECVid dataset.Figure 6
Feature difference value plot for the cut frames in Figure5.Figure 7
(a). General confusion matrix. (b). Confusion matrices for the results of each video.
(a)(b)To show the comparative performance of our approach, we compared our results with the top three researchers of TRECVid 2007. They are AT & T research [8], THU-ICRC [4], and the University of Marburg [1]. We have also compared our approach with a multifeature-based SBD model [6], and our method performs well. Figure 8 shows the comparison result of the recall, precision, and F1 score. The F1 score of our approach shows that our approach outperforms in SBD process.Figure 8
Result comparison: (a) recall, (b) precision, and (c)F1 score.
(a)(b)(c)The use of ECR and CLD features has great significance in the SBD process. To prove this, we have compared the proposed method with our multiple grey scale features-based SBD method [26]. Gray level cooccurrence matrix (GLCM), histogram, and SIFT key point matching are used as features in [26]. Table 5 shows the comparison results. The average values of recall, precision, and F1 score depict the significance of CLD and ECR in the SBD method. The comparison of average values of precision, recall, and F1 score in Figure 9 shows the better performance of the proposed method. This difference is only due to the use of CLD and ECR.Table 5
Comparison of gray feature method and proposed method.
Video sequenceGray feature methodProposed methodRecallPrecisionF1 scoreRecallPrecisionF1 scoreV10.960.9510.9560.970.990.979V20.9380.950.9440.9750.980.977V40.9450.9560.950.9780.980.979V50.9180.9440.9310.980.980.98Average0.940.950.9450.9750.9820.978Figure 9
Comparison of gray feature method and proposed method.Further, to show the superior performance of our method, the result is compared with some recent SBD methods. SBD with nonsubsampled contourlet transform [27], separable moments, and SVM based SBD [20], SBD using block-based cumulative approach [7], local binary pattern histogram Fourier based SBD [24], SBD using pyramidal opponent colour shape [28], and a bifold-stage SBD [29] are considered for comparison. Table 6 shows the comparison result of the recall, precision, and F1 score. The average precision rate of the SM-SVM [20] method is higher than the proposed method. A small variation is there in the recall rate between the proposed method and the NSCT [27] method. However, the proposed SBD method has achieved the highest average F1 score when compared to other SBD methods which are shown in Figure 10. The selection of invariant features leads the proposed method to overcome the issues such as small level of motion, illuminance changes, rotation, scaling.Table 6
Comparison of the proposed system with the latest SBD methods.
AlgorithmPrecisionRecallF1 scoreNSCT [27]96.3697.6697.01SM-SVM [20]99.3494.7196.97BBC [7]94.794.294.45LBP-HF [24]959494POCS [28]949493.67BIFOLD-STAGE [29]98.7595.3796.97PROPOSED METHOD97.696.997.2Table 6 shows the comparison result of the recall, precision, and F1 score. The dominant values in each metrics among different SBD methods are highlighted. The average precision rate of the SM-SVM [20] method is higher than the proposed method. A small variation is there in the recall rate between the proposed method and the NSCT [27] method.Figure 10
Result comparison: Recall, Precision, andF1 score.New object entry is an unavoidable challenge in the SBD process. Most of the researchers are compromising their accuracy due to the false detection from this new object entry. If the object size is very small compared to the frame size, then it can be managed. But, large-sized object entries will definitely give false positives. Some sample frames are shown in Figure11(a). As a new object enters the adjacent frame, the possibility of getting high ECR and CLD values is high. It may lead to false detection. From the analysis, it is observed that the use of SIFT matching key points in the proposed method avoids false positives due to the new object entry.Figure 11
Correct detection in new object entry. (a) Consequent frames of video, (b) feature difference plot for the frames in (a), (c) SIFT matching key points.
(a)(b)(c)The new object entry is very common in most of the videos. If the new object size is lesser than the frame size, then the SIFT can identify the key points from the remaining area of the frame. A sample set of frames, which avoids the false detection with the new object entry, is shown in Figure11. Consider the adjacent frames 461 and 462 from TRECVid 2007 videos, a new object is entered into frame 462. Even though the CLD feature difference between those two frames is high as shown in Figure 11(b), the number of SIFT matching key points between those two frames is also very high as shown in Figure 11(c). Because of this, a very high value for SIFT key point matching SVM classifies these frames as shot frames.Analysis shows that the ECR is invariant to a certain level of camera/object motion. However, the fast motion of the camera/object in a video may give a false alarm. Figure12 shows some sample frames of video, which is a false detection in this SBD process due to the fast movement of the camera. Both ECR value and number of SIFT key point matching in Figures 12(b) and 12(c) show that frames 565 and 566 of Figure 12(a) are boundary frames. It is a false detection due to the fast movement of the camera. Hence, it is required to consider some motion features to handle the fast motion of the camera/object in the video. This may be considered in our future work.Figure 12
False positive case in the proposed method. (a) Consequent frames of video, (b) ECR plot for the frames in (a), (c) SIFT matching key points.
(a)(b)(c)Shot boundary detection is a basic step for any CBVR algorithm. A quality SBD process will directly come up with quality CBVR results. So, our proposed method can be used in any CBVR algorithm as a preprocessing stage. Specifically, the algorithms such as video summarisation and video segmentation can use our SBD method for better performance. Gradual transition (GT) detection is not been considered in this approach. Most of the existing methods are utilizing different features for AT and GT detection. The same set of features for both AT and GT detection would be better to reduce the computational complexity. This case also would be considered in future.A remarkable accuracy improvement in the proposed method is noticed in the results. The main challenge of the SBD process is the multiple variants existing in the video frames. The proposed method achieved this better accuracy by the selection of optimal invariant features as follows.(1)
The discriminability and robustness of CLD help to reduce the false detection due to the illuminance changes. As CLD is selecting only 12 DC coefficients from a frame, the storage cost is very less, and it is useful for a fast SBD model. Further, miss prediction due to the similarity in adjacent frames is reduced by the discriminability nature of CLD.(2)
The invariants of ECR towards illuminance changes and object/camera motion lead to a higher accuracy rate. Moreover, ECR is giving the temporal aspects of the video.(3)
SIFT descriptor is highly invariant to the scaling and rotation effects in the video sequences. SIFT key point matching helped to reduce the false detection due to new object entries in the video frames.


## 5. Conclusion

An SBD model with an optimal feature set is proposed. The feature vector includes the feature difference from multiple features such as texture, edge/motion, and colour. Colour layout descriptor with DC coefficients, edge change ratio with canny edge detector, and SIFT key point are used as the features. These feature difference vectors are used as the input for the SVM classifier, which classifies the video frames into transition or no-transition frames. Video data from TRECVid, a standard dataset for the SBD process, are used for experiments. Our approach shows a 97.6%F1 score, which is a comparatively better result. A comparison of our experimental results with existing methods reveals that the proposed method outperforms in SBD process by reducing the false positives. Some basic materials of this paper have been presented at a 2021 event [26], but the readers should consider the current version as our final work.



---

*Source: 4195905-2022-10-10.xml*