• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.331-333
• /
• 2012

동영상 데이터에는 요약을 통하여 한눈에 알 수 있도록 하는 기술을 필요로 한다. 그 중 방송용 스트림(stream) 서비스의 경우 그 활용을 더욱 필요로 하고 있다. 여러 채널을 공유하는 TV에서는 각 채널이 무슨 방송을 하고 있는지 중요한 이슈가 된다. 이런 동영상 요약에서 키 프레임(key frame)을 찾는 기술이나 키 프레임과 거리가 먼 프레임을 찾아내는 기술이 필요하다. 이 논문에서는 키 프레임과 비 중요 프레임을 정의하고 그 프레임들을 검출하는 연구에 대하여 소개한다. 비 중요 프레임의 경우 칼라 히스토그램(color histogram)을 분석하여 실제 테스트 이미지들과의 차이점을 분석한다. 키 프레임의 경우 얼굴 검출(face detection)과 샷 변경 검출(shot change detection)의 기술을 이용하여 자동으로 추출하도록 하고 그 성능을 측정하도록 한다.

• 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:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.778-786
• /
• 2002

Scene boundary detection is important in the understanding of semantic structure from video data. However, it is more difficult than shot change detection because scene boundary detection needs to understand semantics in video data well. In this paper, we propose a new approach to scene segmentation using contextual information in video data. The contextual information is divided into two categories: local and global contextual information. The local contextual information refers to the foreground regions' information, background and shot activity. The global contextual information refers to the video shot's environment or its relationship with other video shots. Coherence, interaction and the tempo of video shots are computed as global contextual information. Using the proposed contextual information, we detect scene boundaries. Our proposed approach consists of three consecutive steps: linking, verification, and adjusting. We experimented the proposed approach using TV dramas and movies. The detection accuracy of correct scene boundaries is over than 80%.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.5
• /
• pp.58-64
• /
• 2001

Recently many informations are transmitted ,md stored as video data, and they are on the rapid increase because of popularization of high performance computer and internet. In this paper, to retrieve video data, shots are found through analysis of video stream and the method of detection of key frame is studied. Finally users can retrieve the video efficiently. This Paper suggests a new feature that is robust to object movement in a shot and is not sensitive to change of color in boundary detection of shots, and proposes the characterizing value that reflects the characteristic of kind of video (movie, drama, news, music video etc,). The key frames are pulled out from many frames by using the local minima and maxima of differential of the value. After original frame(not de image) are reconstructed for key frame, indexing process is performed through computing parameters. Key frames that arc similar to user's query image arc retrieved through computing parameters. It is proved that the proposed methods are better than conventional method from experiments. The retrieval accuracy rate is so high in experiments.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.625-628
• /
• 2002

동영상의 장면 전환의 검출은 특정 객체의 검출, 비디오 압축 또는 비디오 문서의 군집화, 비디오 데이터베이스 시스템 등 많은 응용프로그램에서 유용하게 다루어진다. 특히 멀티미디어 데이터베이스에서 이미지를 검출하는 처음 단계로서 Shot Change 검출은 아주 중요하다. 이미 장면 전환의 검출을 위한 여러 알고리즘이 개발되어 발표되었다. 본 논문에서는 대용량의 영상 데이터 사이즈를 고려하여 검출에 소요되는 시간과 검출의 정확도의 상쇄관계를 알아보기 위해서 히스토그램의 분포에 의한 알고리즘과 이미지의 평균과 분산을 이용한 알고리즘을 구현하고 그 알고리즘 간의 성능의 차이를 비교하였다.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.129-132
• /
• 2003

Fixed GOP allocation in MPEG-2 cannot cope with scene change and amount of motion, which results in degradation picture quality. By finding suitable N and M and allocating dynamic GOP, the improvement of picture quality can be achieved. In this paper, N and M are determined by scene change detection and estimation of amount of motion using color histogram per each macroblock. The simulation results show that the average PSNR is improved, especially around the shot boundaries.

• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.3
• /
• pp.115-122
• /
• 2001

A scene change detection is an important step for video indexing and retrieval. This paper proposes an algorithm by a phased algorithm for fast and accurate detection of abrupt scene changes in an MPEG compressed domain with minimal decoding requirements and computational effort. The proposed method compares two successive I-frames for locating a scene change occurring within the GOP and uses macroblock-coded type information contained in B-frames to detect the exact frame where the scene change occurred. The algorithm has the advantage of speed, simplicity and accuracy. In addition, it requires less amount of storage. The experiment results demonstrate that the proposed algorithm has better detection performance, such as precision and recall rate, than the existing method using all DC images.

• Journal of Korea Multimedia Society
• /
• v.14 no.7
• /
• pp.858-865
• /
• 2011

In order to allow the user to efficiently browse, select, and retrieve a desired video part without having to deal directly with GBytes of compressed data, classification of shot motion characteristic has to be carried out as a preparation for such user interaction. The organization of video information for video database requires segmentation of a video into its constituent shots and their subsequent characterization in terms of content and camera movement in shot. In order to classify shot motion, it is a conventional way to use element of motion vector. However, there is a limit to estimate global camera motion because the way that uses motion vectors only represents local movement. For shot classification in terms of motion information, we propose a new scheme consisting of partial decoding of INTRA pictures and comparing the x, y displacement vector curve between the decoded I-frame and next P-frame in compressed video data.

• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1157-1163
• /
• 2005

In this paper, an efficient and fast method to segment a video in the MPEG(motion picture expert group) video stream is proposed. For the real time processing of large amount of broadcasting data, we use DC images of I-frames in an MPEG compressed video with minimal decoding. Using the modified histogram comparison which counts on not only luminance but also chrominance information, the scene change detection was performed in the fast and accurate way Also, to discriminate anchorperson frame from non-anchor frame, a neural network method was introduced.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.7-10
• /
• 2000

There are many Problems such as low detection ratio, velocity and increase of false hit ratio on the detection of gradual scene changes with the previous shot transition detection algorithms. In this paper, we Propose an improved dissolve detection method using color information on low-frequency subband and edge elements on high-frequency subband. The Possible dissolve transition are found by analyzing the edge change ratio in the high-frequency subband with edge elements of each direction. Using the double chromatic difference on the lowest frequency subband, we have the improvement of the dissolve detection ratio. The simulation results show that the performance of the proposed algorithm is better than the conventional one for dissolve detection on a diverse set of uncompressed video sequences.