• Journal of Korea Multimedia Society
• /
• v.3 no.2
• /
• pp.121-132
• /
• 2000

Most of video indexing applications depend on fast and efficient archiving, browsing, retrieval techniques. A number of techniques have been approached about only pixel domain analysis until now. Those approaches brought about the costly overhead of decompressing because the most of multimedia data is typically stored in compressed format. But with a compressed video data, if we can analyze the compressed data directly. then we avoid the costly overhead such as in pixel domain. In this paper, we analyze the information of compressed video stream directly, and then extract the available features for video indexing. We have derived the technique for cut detection using these features, and the stream is divided into shots. Also we propose a new brief key frame selection technique and an efficient video indexing method using the spatial informations(DT coefficients) and also the temporal informations(motion vectors).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8A
• /
• pp.836-845
• /
• 2002

Video summary is one of the tools which can provide the fast and effective browsing for a lengthy video. Video summary consists of many key-frames that could be defined differently depending on the video genre it belongs to. Consequently, the video summary constructed by the uniform manner might lead into inadequate result. Therefore, identifying the video genre is the important first step in generating the meaningful video summary. We propose a new method that can classify the genre of the video data in MPEC compressed bit-stream domain. Since the proposed method operates directly on the compressed bit-stream without decoding the frame, it has merits such as simple calculation and short processing time. In the proposed method, only the visual information is utilized through the spatial-temporal analysis to classify the video genre. Experiments are done for 6 genres of video: Cartoon, commercial, Music Video, News, Sports, and Talk Show. Experimental result shows more than 90% of accuracy in genre classification for the well -structured video data such as Talk Show and Sports.

• ETRI Journal
• /
• v.26 no.3
• /
• pp.269-272
• /
• 2004

We propose an efficient scheme for camera motion characterization in MPEG-compressed video. The proposed scheme detects six types of basic camera motions through threshold-based qualitative interpretation, in which fixed thresholds are applied to motion model parameters estimated from MPEG motion vectors (MVs). The efficiency and robustness of the scheme are validated by the experiment with real compressed video sequences.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.11a
• /
• pp.151-154
• /
• 1997

In this paper, we propose a new watermarking algorithm for copyright protection of video data. The proposed algorithm inserts a watermark directly on the MPEG-2 bitstream. Since more and more video data are stored and transmitted in a compressed form, it is desirable to insert a watermark on the compressed bit stream to avoid the expensive full-decoding and re-encoding process. Embedding a watermark in the compressed domain, we can also avoid the effect of the compression error which may erase the watermark.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11A
• /
• pp.1908-1924
• /
• 2001

Interoperability and inter-working in the various network and media environment with different technology background is very important to enlarge the opportunity of service access and to increase the competitive power of service. The ITU-T and advanced counties are planning ahead for provision of GII enabling user to access advanced global communication services supporting multimedia communication applications, embracing all modes of information. In this paper, we especially forced the heterogeneity of end user applications for multimedia networking. The heterogeneity has several technical aspects, like different medium access methods, heterogeneous coding algorithms for audio-visual data and so on. Among these elements, we have been itemized bit rate shaping algorithm on the compressed moving video. Previous manipulations of video has been done on the uncompressed signal domain. That is, compressed video should be converted to linear PCM signal. To do such a procedures, we should decode, manipulate and then encode the video to compressed signal once again. The traditional approach for processing the video signa1 has several critical weak points, requiring complexity to implement, degradation of image quality and large processing delay. The bit rate shaping algorithm proposed in this paper process the manipulation of moving video on the completely compressed domain to cope with above deficit. With this algorithms. we could realized efficient video bit rate shaping and the result of software simulation shows that this method has significant advantage than that of pixel oriented algorithms.

• Korean Journal of Cognitive Science
• /
• v.11 no.2
• /
• pp.79-87
• /
• 2000

In this paper we present a face recognition and face detection algorithm in MPEG compressed video. The proposed method consists three stage of processing steps. The first step is to produce a spatially reduced DC image form MPEG compressed video for processing. And the second step is face detection on reduced DC image. Finally, the last step is face recognition on partially extracted compressed frames which contain the detected faces. The spatially reduced DC image is produced from two dimensional inverse DCT of the DC coefficient and the first two AC coefficients. The face detection is performed on DC image and face recognition is performed on one extracted frame per GOP by using the K-L transform. In order to evaluate the proposed method, we carried out experiments on video database. The experiment results show the proposed method is very efficient and helpful for target tasks.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1045-1048
• /
• 1999

In this paper, we report on a set of new algorithms to realize a nonlinear compressed-domain video/audio editor that overcomes various realization problems. For efficiency, the underlying algorithm, which uses a central data structure in the form of doubled linked lists, performs soft edits of cut and paste (which, in turn, involves soft implementations of frame type conversion) and addresses problems relating to video/audio synchronization and random access, and decoder buffer control.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.157-160
• /
• 2002

Scene change detection is the fundamental process of automatic video indexing and retrieving. In this paper we propose a method which utilizes both compressed and uncompressed domain methods to detect scene change in a video. Candidate locations for scene change are estimated from DC images and motion vector information in compressed domain. And candidate frames are verified using edge histogram distance and color histogram distance, in uncompressed domain. The experimental results show that scene change can be detected fast and correctly by proposed method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1355-1363
• /
• 2017

Recently, distributed compressed video sensing (DCVS) has been actively studied in order to achieve a low complexity video encoder by integrating both compressed sensing and distributed video coding characteristics. Conventionally, a motion compensated block compressed sensing with smoothed projected Landweber (MC-BCS-SPL) has been considered as an effective scheme of DCVS with all compressed sensing frames pursuing the simplest sampling. In this scheme, video frames are separately classified into key frames and WZ frames. However, when reconstructing WZ frame with conventional MC-BCS-SPL scheme at the decoder side, the visual qualities are poor for temporally active video sequences. In this paper, to overcome the drawbacks of the conventional scheme, an enhanced MC-BCS-SPL algorithm is proposed, which corrects the initial image with reference to the key frame using a high correlation between adjacent key frames. The proposed scheme is analyzed with respect to GOP (Group of Pictures) structuring method. Experimental results show that the proposed method performs better than conventional MC-BCS-SPL in rate-distortion.

• Journal of Communications and Networks
• /
• v.1 no.2
• /
• pp.134-142
• /
• 1999

We have developed fully functional Video Server and Client applications which can transmit, receive, decompress and display compressed video over various networks. Our video trans-port allows dynamic rate control feedback, loss detection, and repair requests from Clients to the Server. Our experiments show how feedvack-before-degradation scheme for rate adaptation maintains good display frame-rate for video playback. We show how the playback degradation(reduction in display frame-rate) oc-curs and what happens if corrective measures are not taken to im-prove the situation. The degradation is attributed to the increased internal kernel buffering which consumes scarce CPU resources. We demontrate with our experimental results that ServerNet, with improved hardware delivery guarantees, can significantly reduce host CPU resource consumption while serving video streams. We present the maximum number of streams which can be served for each of ATM and ServerNet interconnects. The appropriate user-level packet size for the video server are also determined for each case.