• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.868-876
• /
• 1999

In this paper, an efficient automatic video parsing technique on MPEG-compressed video that is fundamental for content-based indexing is described. The proposed method detects scene changes, regardless of IPB picture composition. To detect abrupt changes, the difference measure based on the dc coefficient in I picture and the macroblock reference feature in P and B pictures are utilized. For gradual scene changes, we use the macroblock reference information in P and B pictures. the process of scene change detection can be efficiently handled by extracting necessary data without full decoding of MPEG sequence. The performance of the proposed algorithm is analyzed based on precision and recall. the experimental results verified the effectiveness of the method for detecting scene changes of various MPEG sequences.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2001.06a
• /
• pp.265-268
• /
• 2001

In content-based video data retrieval, the representative-frame is usually used. To do that, the skill of detection for scene change is needed. Generally the color histogram comparison is used, but sensitive to light variation and tends to miss the scene change of similar color histogram. This paper shows how to use both color histogram comparison and entropy to prevent the false-positive of scene change occurred by light variation. At the experiments, il is more powerful to light variation to use both color histogram comparison entropy than to use only color histogram comparison.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.353-360
• /
• 2004

The study on scene change detection in the compressed MPEG videos has been done by various approaches. However, most of these approacher accomplished scene change detection by carrying out decoding processes and then by comparing pixels with pixels. This approach it not suitable for real time applications owing to much computing time of decoding processes. Recently, the study on scene change detection algorithms using only information of compressed domain is becoming Increasingly important. In this paper, we propose a sequential access method as an efficient scene change detection algorithm in the compressed domain. According to the type of pictures in the compressed MPEG video streams (divided in I-blocks and each I-block into P-blocks), the proposed algorithm provides effective scene change detection by applying sequential access and block by block mechanism. The proposed sequential access method provides fast and accurate detection operation by reducing checking procedures of unnecessary pictures due to molt of operations in compressed domain and checking by block units. Also, this approach uses optimal algorithm to provide fast and accurate detection operation.

• Journal of Korea Multimedia Society
• /
• v.11 no.6
• /
• pp.860-868
• /
• 2008

Human detection techniques in outdoor scenes have been studied for a long time to watch suspicious movements or to keep someone from danger. However there are few methods of human detection in overhead or near-field view scenes, while lots of human detection methods in far-field view scenes have been developed. In this paper, a set of five features useful for human detection in overhead view scenes and another set of four useful features in near-field view scenes are suggested. Eight feature-candidates are first extracted by analyzing geometrically varying characteristics of moving objects in samples of video sequences. Then highly contributed features for each view scene to classifying human from other moving objects are selected among them by using a neural network learning technique. Through experiments with hundreds of moving objects, we found that each set of features is very useful for human detection and classification accuracy for overhead view and near-field view scenes was over 90%. The suggested sets of features can be used effectively in a PTZ camera based surveillance system where both the overhead and near-field view scenes appear.

• Journal of Korea Multimedia Society
• /
• v.17 no.4
• /
• pp.420-432
• /
• 2014

In detection of moving objects from video sequences, an essential process for intelligent visual surveillance, the cast shadows accompanying moving objects are different from background so that they may be easily extracted as foreground object blobs, which causes errors in localization, segmentation, tracking and classification of objects. Most of the previous research results about moving cast shadow detection and removal usually utilize color information about objects and scenes. In this paper, we proposes a novel cast shadow removal method of moving objects in gray level video data for visual surveillance application. The proposed method utilizes observations about edge patterns in the shadow region in the current frame and the corresponding region in the background scene, and applies Laplacian edge detector to the blob regions in the current frame and the corresponding regions in the background scene. Then, the product of the outcomes of application determines moving object blob pixels from the blob pixels in the foreground mask. The minimal rectangle regions containing all blob pixles classified as moving object pixels are extracted. The proposed method is simple but turns out practically very effective for Adative Gaussian Mixture Model-based object detection of intelligent visual surveillance applications, which is verified through experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8C
• /
• pp.1193-1202
• /
• 2004

While the management of digital contents is getting more and more important, many researchers have studied about scene change detection algorithms to reduce similar scenes in the video contents and to efficiently summarize video data. The algorithms using histogram and pixel information are found out as being sensitive to light changes and motion. Therefore, visual rhythm gets used in recent work to solve this problem, which shows some characteristics of scenes and requires even less computational power. In this paper, a new scene detection algorithm using visual rhythm by direction is proposed. The proposed algorithm needs less computational power and is able to keep good performance even in the scenes with motion. Experimental results show the performance improvement of about 30% comparing with conventional methods with histogram. They also show that the proposed algorithm is able to keep the same performance even to music video contents with lots of motion.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.258-261
• /
• 2014

The era of realistic broadcast with high fidelity has come after the wide-spread distribution of UHD display and the transmission of UHD experimental broadcast in CATV. However, UHD broadcast now has constraint because it requires much amount of bandwidth and data in broadcasting transmission and production system. Not only HEVC(High Efficiency Video Codec) which has more than two times higher compression rate but also cloud-based editing system would be the key to solve the problems above. Also, fast scene change detection of videos is needed to index and search UHD videos smoothly. In this paper, therefore, a method is proposed to index and search the scene change information of large volume UHD videos compressed with high-efficiency codec. Application usages of fast detection of scene change information in various UHD video environments are considered by using this algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.37-43
• /
• 2016

This paper introduces a method for video shot group detection needed for efficient management and summary of video. The proposed method detects shots based on low-level visual properties and performs temporal and spatial clustering based on visual similarity of neighboring shots. Shot groups created from temporal clustering are further clustered into small groups with respect to visual similarity. A set of representative shot frames are selected from each cluster of the smaller groups representing a scene. Shots excluded from temporal clustering are also clustered into groups from which representative shot frames are selected. A number of video clips are collected and applied to the method for accuracy of shot group detection. We achieved 91% of accuracy of the method for shot group detection. The number of representative shot frames is reduced to 1/3 of the total shot frames. The experiment also shows the inverse relationship between accuracy and compression rate.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.357-358
• /
• 2021

Although many people watch the scene with multiple surveillance cameras, it is difficult to ensure that immediate action can be taken in the event of a crime. Therefore, there is a need for a "crime behavior detection system" that can analyze images in real time from multiple surveillance cameras installed in elevators, call immediate crime alerts, and track crime scenes and times effectively. In this paper, a study was conducted to detect violent scenes occurring in elevators using Scene Change Detection. For effective detection, an x2-color histogram combining color histogram and histogram was applied.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.10
• /
• pp.156-165
• /
• 1998

In this paper, the hybrid algorithm for the scene change detection of MPEG-based compressed video data is proposed. There have been two methods to detect scene changes of video data compressed using algorithms such as MPEG or motion-JPEG: analyzing the compressed data directly, and analyzing from the retrieved data. The former has the advantage of taking less time, while the latter can obtain detail results at the expense of time and memory. Thus by combining each algorithm we detect cuts from compressed sequence, retrieve data for some selected region, and detect gradual scene changes. Simulation results verify the superiorities of the proposed algorithm in analyzing time and accuracy.