• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.458-471
• /
• 2006

Digital watermarking of multimedia data is a very active research area that has enjoyed a considerable amount of attention in recent years. In this paper, we propose an algorithm for embedding/detecting a fragile watermark in MPEG-4 compressed video domain (Simple and Advance Simple Profiles). The watermark bits are put directly into Huffman VLC-codespace of quantized DCT domain. The advantage of watermark embedding into the compressed domain is the significant savings for a real-time implementation as it does not require a full decoding operation. The watermark embedding does not change the video file size. The algorithm demonstrates high watermarking capacity, thereby providing reliable foolproof authentication. The results of experimental testing demonstrate that watermark embedding preserves the video quality. Watermark detection is performed without using the original video.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.6
• /
• pp.503-511
• /
• 2014

In this paper, a novel, real-time video stitching algorithm in an H.264/AVC compressed domain is proposed. This enables viewers to watch multiple video contents using a single device. The basic concept of this paper is that the server is asked to combine multiple streams into one bit-stream based in a compressed domain. In other words, this paper presents a new compressed domain combiner that works in boundary macroblocks of input videos with re-calculating intra prediction mode, intra prediction MVD, a re-allocation of the coefficient table, and border extension methods. The rest of the macroblocks of the input video data are achieved simply by copying them. Simulation experiments have demonstrated the possibility and effectiveness of the proposed algorithm by showing that it is able to generate more than 103 frames per second, stitching four 480p-sized images into each frame.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.3
• /
• pp.10-17
• /
• 2009

This paper proposes a compressed domain signature extraction method which can be used for CBCD (Content Based Copy Detection). Since existing signature extraction methods for the CBCD are executed in spatial domain, they need additional computations to decode the compressed video before the signature extraction. To avoid this overhead, we generate a thumbnail image directly from the compressed video without full decoding. Then we can extract the video signature from the thumbnail image. Experimental results of extracting brightness ordering information as the signature for CBCD show that our proposed method is 2.8 times faster than the spatial domain method while maintaining 80.98% accuracy.

• 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.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.145-147
• /
• 2006

Image resizing is to change an image size by upsampling or downsampling of a digital image. Most still images and video frames are given in a compressed domain on digital media. Image resizing of a compressed image can be performed in a spatial domain via decompression or recompression. In general, resizing of a compressed image in a compressed domain is much faster than that in a spatial domain. In this paper, we propose an approach to resize images in the integer discrete cosine transform (DCT) domain, which exploits the multiplication-convolution property of DCT.

• 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 KIEE Conference
• /
• 2005.10b
• /
• pp.539-541
• /
• 2005

We propose efficient video retrieval scheme which use fast key frame extraction in DCT domain. Our scheme extract key frame using the edge histogram difference which is extracted in compressed domain for I-frames. And the video retrieval is implemented using Hausdorff distance function about edge histogram of key frame. This approach enables fast content-based video retrieval of the compressed video content without decompression process. Experimental results show our scheme is very fast and efficient.

• 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).

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.21-23
• /
• 2006

Due to development of Internet network environments and data compression techniques, the size and amount of multimedia data has greatly increased. They are compressed before transmission or storage. Dealing with these compressed data such as video retrieval or indexing requires the decoding procedure most of the time. In video retrieval and indexing a color histogram is one of the most frequently used tools. We propose a novel scheme for extracting color histograms from images transformed into the compressed domain using $8{times}8$ DCT(Discrete Cosine Transform). In this scheme an averaged version of original image is obtained by filtering DCT coefficients with a filter we destined.

• Journal of Korea Multimedia Society
• /
• v.20 no.5
• /
• pp.731-739
• /
• 2017

Distributed compressed video sensing (DCVS) is a framework that integrates both compressed sensing and distributed video coding characteristics to achieve a low complexity video sampling. In DCVS schemes, motion estimation & motion compensation is employed at the decoder side, similarly to distributed video coding (DVC), for a low-complex encoder. However, since a simple BCS-SPL algorithm is applied to a residual arising from motion estimation and compensation in conventional MC-BCS-SPL (motion compensated block compressed sensing with smoothed projected Landweber) scheme, the reconstructed visual qualities are severly degraded in Wyner-Ziv (WZ) frames. Furthermore, the scheme takes lots of iteration to reconstruct WZ frames. In this paper, the conventional MC-BCS-SPL algorithm is improved to be operated in more effective way in WZ frames. That is, first, the proposed algorithm calculates a correlation coefficient between two reference key frames and, then, by selecting adaptively the reference frame, the residual reconstruction in pixel domain is performed to the conventional BCS-SPL scheme. Experimental results show that the proposed algorithm achieves significantly better visual qualities than conventional MC-BCS-SPL algorithm, while resulting in the significant reduction of the decoding time.