• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.11
• /
• pp.669-672
• /
• 2005

An algorithm detecting abrupt and gradual shot boundaries is proposed in this Paper. The conventional methods detect abrupt shot boundaries well, but do not show good performance on gradual shot boundaries. The proposed method Is based on the fact that the difference of the characteristic between frames is large when the shot conversion occurs. And the Proposed method detects abrupt and gradual shot boundaries with one algorithm. Moreover, it detects not only position where gradual shot conversion occurs, but also the exact duration where gradual shot conversion occurs.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.103-109
• /
• 2007

In this paper, we detect shot boundaries using $X^2$-histogram comparison method which have enough spatial information that is more robust to the camera or object motion and produce more precise results. Also, we present normalization method to change Log-Formula and constant that is used for contrast enhancement of image in image processing and apply in difference value. And, present shot boundary detection algorithm to detect shot boundary based on general shot and abrupt shot's characteristic.

• Journal of the Institute of Convergence Signal Processing
• /
• v.1 no.1
• /
• pp.58-63
• /
• 2000

This paper describes an efficient algorithm for shot boundary detection in MPEG video stream. There are two types of shot boundary: abrupt and gradual. The proposed algorithm for detecting the abrupt shot boundaries used DCT DC value in compressed domain. The proposed algorithm of the gradual change detection consists of two-pass mechanism. In the first pass, the expected positions of shot boundaries are extracted using ratio value of motion vectors. After decoding frames that are extracted in the first pass, we will make the dissolving image using (n)th and (n+2)th image of expected position. The gradual shot boundaries are selected by similarity of the dissolving image and the image of (n+1)th expected position. As applying the algorithm for detecting shot boundaries, the gradual changes as well as the abrupt changes are detected efficiently. Experimental results indicate that the proposed method is computationally fast for detecting shot boundaries and robust to the variation of the video characteristic that is different for the kind of videos.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.4
• /
• pp.304-308
• /
• 2001

The increase of video data makes the demand of efficient retrieval, storing, and browsing technologies necessary. In this paper, a video segmentation method (scene change detection method, or shot boundary detection method) for the development of such systems is proposed. For abrupt cut detection, inter-frame similarities are computed using luminance and edge histograms and a cut is declared when the similarities are under th predetermined threshold values. A gradual scene change detection is based on the similarities between the current frame and the previous shot boundary frame. A correlation method is used to obtain universal threshold values, which are applied to various video data. Experimental results show that propose method provides 90% precision and 98% recall rates for abrupt cut, and 59% precision and 79% recall rates for gradual change.

• KSCI Review
• /
• v.15 no.1
• /
• pp.197-201
• /
• 2007

비디오 분할은 샷 경계 검출이라고도 하는데, 비디오를 계층적이고 구조적인 형태로 표현하기 위하여 영상, 문자, 오디오와 같은 매체 속에 포함되어 있는 내용들을 특징별로 분석하여 계층별로 분류하는 작업을 말한다. 본 논문에서는 카메라와 객체의 모션에 보다 강건하고 보다 정확한 결과를 산출하여 충분한 공간 정보를 가지는 지역적 $X^2$-히스토그램 비교 방법을 이용하여 샷 경계를 검출한다. 또한 영상처리에서 영상의 명암 값 향상을 위하여 사용되는 로그함수와 상수를 변형하여 차이 값에 적용하는 정규화 방법을 제시한다. 그리고 샷 경계 검출 알고리즘을 제시하여 일반적인 샷과 갑작스런 샷의 특징을 기반으로 검출한다.

• Journal of KIISE:Software and Applications
• /
• v.27 no.3
• /
• pp.201-209
• /
• 2000

Recent works regarding video shot change detection algorithms show that abrupt shot changes are detected fairly well. However, gradual shot changes including wipes and dissolves are often missed or falsely detected. A robust shot change detection system, therefore, must include a shot verification step to further enhance the overall system performance. In this paper, we introduce the concept of the visual rhythm which is a single image, a subsampled version of a full video. On the visual rhythm, the different video edit effects such as cuts, wipes and dissolves manifest themselves as different patterns. Using this characteristic, it becomes possible, without sequentially playing the entire video, to find false positive shots as well as undetected shots. Thus, inclusion of the visual rhythm in the shot boundary verification process will aid the operator to exclude falsely detected shots as well as to find undetected shots fast and efficiently. For this purpose we have developed a new tool, a shot verifier incorporating the visual rhythm. The usefulness of the visual rhythm during the shot verification process will be presented.

• Journal of Intelligence and Information Systems
• /
• v.18 no.2
• /
• pp.47-60
• /
• 2012

Video data comes in the form of the unstructured and the complex structure. As the importance of efficient management and retrieval for video data increases, studies on the video parsing based on the visual features contained in the video contents are researched to reconstruct video data as the meaningful structure. The early studies on video parsing are focused on splitting video data into shots, but detecting the shot boundary defined with the physical boundary does not cosider the semantic association of video data. Recently, studies on structuralizing video shots having the semantic association to the video scene defined with the semantic boundary by utilizing clustering methods are actively progressed. Previous studies on detecting the video scene try to detect video scenes by utilizing clustering algorithms based on the similarity measure between video shots mainly depended on color features. However, the correct identification of a video shot or scene and the detection of the gradual transitions such as dissolve, fade and wipe are difficult because color features of video data contain a noise and are abruptly changed due to the intervention of an unexpected object. In this paper, to solve these problems, we propose the Scene Detector by using Color histogram, corner Edge and Object color histogram (SDCEO) that clusters similar shots organizing same event based on visual features including the color histogram, the corner edge and the object color histogram to detect video scenes. The SDCEO is worthy of notice in a sense that it uses the edge feature with the color feature, and as a result, it effectively detects the gradual transitions as well as the abrupt transitions. The SDCEO consists of the Shot Bound Identifier and the Video Scene Detector. The Shot Bound Identifier is comprised of the Color Histogram Analysis step and the Corner Edge Analysis step. In the Color Histogram Analysis step, SDCEO uses the color histogram feature to organizing shot boundaries. The color histogram, recording the percentage of each quantized color among all pixels in a frame, are chosen for their good performance, as also reported in other work of content-based image and video analysis. To organize shot boundaries, SDCEO joins associated sequential frames into shot boundaries by measuring the similarity of the color histogram between frames. In the Corner Edge Analysis step, SDCEO identifies the final shot boundaries by using the corner edge feature. SDCEO detect associated shot boundaries comparing the corner edge feature between the last frame of previous shot boundary and the first frame of next shot boundary. In the Key-frame Extraction step, SDCEO compares each frame with all frames and measures the similarity by using histogram euclidean distance, and then select the frame the most similar with all frames contained in same shot boundary as the key-frame. Video Scene Detector clusters associated shots organizing same event by utilizing the hierarchical agglomerative clustering method based on the visual features including the color histogram and the object color histogram. After detecting video scenes, SDCEO organizes final video scene by repetitive clustering until the simiarity distance between shot boundaries less than the threshold h. In this paper, we construct the prototype of SDCEO and experiments are carried out with the baseline data that are manually constructed, and the experimental results that the precision of shot boundary detection is 93.3% and the precision of video scene detection is 83.3% are satisfactory.

• Journal of Korea Multimedia Society
• /
• v.14 no.10
• /
• pp.1252-1261
• /
• 2011

In this paper, we propose the comparison method of pattern similarity for video segmentation algorithm. The shot boundary type is categorized as 2 types, abrupt change and gradual change. The representative examples of gradual change are dissolve, fade-in, fade-out or wipe transition. The proposed method consider the problem to detect shot boundary as 2-class problem. We concentrated if the shot boundary event happens or not. It is essential to define similarity between frames for shot boundary detection. We proposed 2 similarity measures, within similarity and between similarity. The within similarity is defined by feature comparison between frames belong to same shot. The between similarity is defined by feature comparison between frames belong to different scene. Finally we calculated the statistical patterns comparison between the within similarity and between similarity. Because this measure is robust to flash light or object movement, our proposed algorithm make contribution towards reducing false positive rate. We employed color histogram and mean of sub-block on frame image as frame feature. We performed the experimental evaluation with video dataset including set of TREC-2001 and TREC-2002. The proposed algorithm shows the performance, 91.84% recall and 86.43% precision in experimental circumstance.

• Journal of KIISE:Software and Applications
• /
• v.36 no.2
• /
• pp.169-177
• /
• 2009

In this paper, we propose a new shot boundary detection method which is optimized for news video story parsing. This new news shot boundary detection method was designed to satisfy all the following requirements: 1) minimizing the incorrect data in data set for anchor shot detection by improving the recall ratio 2) detecting abrupt cuts and gradual transitions with one single algorithm so as to divide news video into shots with one scan of data set; 3) classifying shots into static or dynamic, therefore, reducing the search space for the subsequent stage of anchor shot detection. The proposed method, based on singular value decomposition with incremental clustering and mercer kernel, has additional desirable features. Applying singular value decomposition, the noise or trivial variations in the video sequence are removed. Therefore, the separability is improved. Mercer kernel improves the possibility of detection of shots which is not separable in input space by mapping data to high dimensional feature space. The experimental results illustrated the superiority of the proposed method with respect to recall criteria and search space reduction for anchor shot detection.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06b
• /
• pp.92-97
• /
• 1998

For the efficient searching and browsing of digital video, it is essential to extract the internal structure of the video contents. As an example, a news video consists of several sections such as politics, economics, sports and others, and also each section consists of individual topics. With this information in hand, users can ore easily access the required video frames. This paper addresses the problem of automatic shot boundary detection and selection of representative frames (R-frames), which are the essential step in recognizing the internal structure of video contents. In the shot boundary detection, a new algorithm that have dual detectors which are designed specifically for the abrupt boundaries (cuts) and gradually changing bounaries respectively is proposed. Compared to the existing 미algorithms that mostly have tried to detect both types by a single mechanism, the proposed algorithm is proved to be more robust and accurate. Also in the problem of R-frame selection, simple mechanical approaches such as selecting one frame every other second have been adopted. However this approach often selects too many R-frames in static short, while drops important frames in dynamic shots. To improve the selection mechanism, a new R-frame selection algorithm that uses motion information extracted from pixel difference is proposed.