• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.536-538
• /
• 2005

As multimedia data and huge-Quantity video data having been increasingly and commonly used, the key frame algorithm, as one of the methods for manipulating these kinds of data, became an important matter and has been studied for many years. But the formerly proposed key frame extraction methods take much processing time or need complex calculations due to decoding processes. In order to solve these problems which the former methods have and to enhance the key frame extraction efficiency, a novel key frame extraction method in compressed domain is proposed in this paper. In this method we get an edge histogram for each I-frame in DCT domain and then extract the key frames by means of histogram difference metric. Experimental results show that our algorithm achieves fast processing speed and high accuracy.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.3
• /
• pp.137-143
• /
• 2003

Key frame extraction has been recognized as one of tile important research issues in video information retrieval. Although progress has been made in key frame extraction, the existing approaches do not evaluate the importance of extracted frame Quantitatively, and Dey are computationally expensive or ineffective. In this Paper, we introduce a new 미해rithm for key frame extraction using shot coverage and distortion. The algorithm finds significant key frames from candidate key frames. When selecting the candidate frames, the coverage rate to the total frames from each frame is computed by using the difference between the adjacent frames in tile shot. The frames within 10$\%$ from the top are selected as the candidates. Then, by comfuting the distortion rate of the candidates against all frames, pick the frames which arc most representative are selected. The performance of the proposed algorithm has been verified by a statistical test. Experiments show that more than 13-50$\%$ improvement has been obtained by the proposed algorithm compared to the existing methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.10A
• /
• pp.1021-1028
• /
• 2002

This paper proposes a method to extract the content curve that reflects changes in video content from the MPEG video in the compressed domain, and also describes a video summary generation technique which can read video effectively and rapidly from the content curve. Existing video summary techniques have a disadvantage of taking significant amount of time to generate the video summary due to complex calculations in the decoding process. Moreover, the existing techniques, which use video content curve, require to perform many calculations to process the high dimensional content curve. However, the proposed technique generates video summary fast via the linear approximation of the proposed curve, after extraction the two dimensional content curve directly. In addition, the proposed technique has a merit that the user can set any number of key-frames and amount of calculation that form the video summary.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.4 s.42
• /
• pp.147-154
• /
• 2006

Effective and efficient representation of color features of multiple video frames is an important vet challenging task for visual information management systems. This paper Proposes a Video Browsing Service(VBS) that provides both the video content retrieval and the video browsing by the real-time user interface on Web. For the scene segmentation and key frame extraction of video sequence, we proposes an efficient scene change detection method that combine the RGB color histogram with the X2 (Chi Square) histogram. Resulting key frames are linked by both physical and logical indexing. This system involves the video editing and retrieval function of a VCR's. Three elements that are the date, the need and the subject are used for video browsing. A Video Browsing Service is implemented with MySQL, PHP and JMF under Apache Web Server.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.3 s.309
• /
• pp.17-24
• /
• 2006

In this paper, an algorithm for anchor frame detection in news video is proposed, which consists of four steps. In the first step, the cumulative histogram method is used to detect shot boundaries in order to segment a news video into video shots. In the second step, skin color information is used to detect face regions in each shot boundary. In the third step, color information of upper body regions is used to extract anchor object, which produces candidate anchor frames. Then, from the candidate anchor frames, a graph-theoretic cluster analysis algorithm is utilized to classify the news video into anchor-person frames and non-anchor frames. Experiment results have shown the effectiveness of the proposed algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.5
• /
• pp.136-144
• /
• 2010

Two types of informations are used for content-based video copy detection: spatial information and temporal information. The spatial information means content-based image fingerprint. This image fingerprint must have following characteristic. First, Extraction is simple. Second, pairwise independence for random selected two images. At last, Robust for modifications. This paper proposed image fingerprint method for contents based video copy detection. Proposed method's extraction speed is fast because this method's using block average, first order differentiation and second order differentiation that can be calculated add and minus operation. And it has pairwise independence and robust against modifications. Also, proposed method feature makes binary by comparisons and using coarse to fine structure, so it's matching speed is fast. Proposed method is verified by modified image that modified by VCE7's experimental conditions in MPEG7.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.3
• /
• pp.87-99
• /
• 2006

In this paper, we propose a method of conditional access control for encrypted SVC(scalable video coding) bitstream. The main purpose of the proposition is to provide a SVC suitable encryption algorithm and a efficient method for conditional access control using encrypted SVC bitstream. We analyzed requirements for conditional access control of a SVC bitstream. And based on the analysis, we proposed encryption algorithm suitable for SVC bitstream and a method of conditional access control of the encryped bitstream. The proposed conditional access control for encrypted SVC bitstream is performed by bitsream extraction and selective decryption. We verified the usefulness of the proposed method through experiments.

• 전자공학회논문지 IE
• /
• v.43 no.4
• /
• pp.37-42
• /
• 2006

This paper proposes a adaptive video watermarking algorithm according to bitrate and motion vector size in MPEG2 system. The watermark strength in the I-frames is adapted for quantization step size and the strength in the P-B-frames is adapted for quantization step size and motion vector of macroblock to make the watermark more robust against the accompanying degradation due to aggressively compression. A realtime watermark extraction is done directly in the DCT domain during MPEG decoding without full decoding of MPEG video. The experimental simulations show that the video quality results almost invisible difference between the watermarked frames and the original frames and the watermark is resistant to frame dropping, MPEG compression, GoP conversion and low pass filter attacks.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.2
• /
• pp.45-53
• /
• 2009

The fast progress on multimedia data acquisition technologies has enabled collecting vast amount of videos in real time. Although the amount of information gathered from these videos could be high in terms of quantity and quality, the use of the collected data is very limited typically by human-centric monitoring systems. In this paper, we propose a framework for analyzing long traffic video using series of content-based analyses tools. Our framework suggests a method to integrate theses analyses tools to extract highly informative features specific to a traffic video analysis. Our analytical framework provides (1) re-sampling tools for efficient and precise analysis, (2) foreground extraction methods for unbiased traffic flow analysis, (3) frame property analyses tools using variety of frame characteristics including brightness, entropy, Harris corners, and variance of traffic flow, and (4) a visualization tool that summarizes the entire video sequence and automatically highlight a collection of frames based on some metrics defined by semi-automated or fully automated techniques. Based on the proposed framework, we developed an automated traffic flow analysis system, and in our experiments, we show results from two example traffic videos taken from different monitoring angles.

• The Journal of the Korea Contents Association
• /
• v.9 no.2
• /
• pp.43-50
• /
• 2009

We proposed similarity detection method of the video frame data that extracts the feature data of own video frame and creates the 1-D signal in this paper. We get the similar frame boundary and make the representative frames within the frame boundary to extract the similarity extraction between video. Representative frames make blurring frames and extract the feature data using DOG values. Finally, we convert the feature data into the 1-D signal and compare the contents similarity. The experimental results show that the proposed algorithm get over 0.9 similarity value against noise addition, rotation change, size change, frame delete, frame cutting.