• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3C
• /
• pp.387-397
• /
• 2004

The wavelet transform providing both of the frequency and spatial information of an image is proved to be very much effective for the compression of images, and recently lot of studies on coding algorithms for images decomposed by the wavelet transform together with the multi-resolution theory are going on. This paper proposes a quadtree decomposition method of image compression applied to the images decomposed by wavelet transform by using the correlations between pixels and '0'data grouping. Since the coefficients obtained by the wavelet transform have high correlations between scales and high concentrations, the quadtree method can reduce the data quantity effectively. the experimental infrared image with 256${\times}$256 size and 8〔bit〕, was used to compare the performances of the existing and the proposed compression methods.

• Journal of Broadcast Engineering
• /
• v.3 no.2
• /
• pp.127-137
• /
• 1998

In this paper, we propose the method of extracting edge information from MPEG video sequences for the detection of scene changes. In a the proposed method, five significant AC coefficients of each MPEG block are utilized to obtain edge images from the MPEG video. AC edge images obtained by the proposed scheme not only produce better object boundary information than conventional methods using only DC coefficients, but also can reduce the boundary effects produced by DC-based. Since the AC edge image contains the content information of each frame, it can be effectively utilized for the detection of scene change as well as the content-based video query. Experimental results show that the proposed method can be effectively utilized for the detection of scene changes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.520-529
• /
• 2007

In this paper, we study the characteristics of parameters which are related to performance of MCTF which is a key technique for wavelet-based scalable video coding, and propose an improved MCTF method. The proposed MCTF method adopts the motion estimation of which motion vector field is distributed more uniformly using variable block sizes. By using the proposed method, the decomposition performance of temporal filter is improved, and the energy in high-frequency frames is reduced. It can help the entropy coder to generate lower bitrate. From simulation results, we verify the decomposed energy on high-frequency frame using the proposed method is reduced by 25.86% at the most in terms of variance of the high-frequency frame.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.197-200
• /
• 2006

A scene changing detection using histogram and header information of H.264 video stream is presented in this paper. The method using histogram is normal to be detect the changing scene. But this technique results in a lot of processing time because video data is compressed and decompressed to video stream and calculated the difference of histogram between scenes on the each frame. The method using H.264 header information is available to detect the scene change at real time without the process of calculation. Histogram and header information is more rapid for scene change detection with being the same performance in precision and recall.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1518-1531
• /
• 1999

The reconstructed images from highly compressed MPEG or H.263 data have noticeable image degradations, such as blocking artifacts near the block boundaries, corner outliers at cross points of blocks, and ringing noise near image edges, because the MPEG or H.263 quantizes the transformed coefficients of 8$\times$8 pixel blocks. A post-processing algorithm has been proposed by authors to reduce quantization effects, such as blocking artifacts, corner outliers, and ringing noise, in MPEG-decompressed images. Our signal-adaptive post-processing algorithm reduces the quantization effects adaptively by using both spatial frequency and temporal information extracted from the compressed data. The blocking artifacts are reduced by one-dimensional (1-D) horizontal and vertical low pass filtering (LPF), and the ringing noise is reduced by two-dimensional (2-D) signal-adaptive filtering (SAF). A comparison study of the subjective quality evaluation using modified single stimulus method (MSSM), the objective quality evaluation (PSNR) and the computation complexity analysis between the signal-adaptive post-processing algorithm and the MPEG-4 VM (Verification Model) post-processing algorithm is performed by computer simulation with several MPEG-4 image sequences. According to the comparison study, the subjective image qualities of both algorithms are similar, whereas the PSNR and the comparison complexity analysis of the signal-adaptive post-processing algorithm shows better performance than the VM post-processing algorithm.

• The KIPS Transactions:PartD
• /
• v.10D no.6
• /
• pp.927-934
• /
• 2003

Database query optimates the selectivety of a query to find the most efficient access plan. Multi-dimensional selectivity estimation technique is required for a query with multiple attributes because the attributes are not independent each other. Histogram is practically used in most commercial database products because it approximates data distributions with small overhead and small error rates. However, histogram is inadequate for a query with multiple attributes because it incurs high storage overhead and high error rates. In this paper, we propose a novel method for multi-dimentional selectivity estimation. Compressed information from a large number of small-sized histogram buckets is maintained using the discrete cosine transform. This enables low error rates and low storage overheads even in high dimensions. Extensive experimental results show adventages of the proposed approach.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.5 s.311
• /
• pp.57-67
• /
• 2006

Intellectual property rights are gathering strength theses days. Because digital contents are easily reproduced and distributed by advanced computers and networks. Digital watermarking is one of the best solutions for this problem. Generally, frequency-domain watermarking algorithms are preferred since they are more robust than spatial-domain algorithms. However, coefficients in the frequency domain are floating-point numbers. Thus, it is not easy to manipulate those floating-point coefficients and frequency-domain watermarking algorithms have some limitations in their applications. In order to overcome this difficulty, we employ an integer transform in this paper. In addition, our proposed algerian can extract the watermark from both the spatial and frequency domains. We embed the watermark into a specific bit-plane of mid-frequency coefficients. This is equivalent to the differential energy watermarking (DEW) in the spatial domain. Our simulation results show that the proposed algorithm is imperceptible, good for the watermark payload, and robustness against various attacks. Moreover, it is more efficient than any other algorithm working in only one domain.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.5
• /
• pp.72-78
• /
• 2008

Although the H.264 video coding scheme is popular, it is not efficient for high-definition (HD) video coding because the size of its macroblock is relatively small for the HD video resolution. In this paper, we propose a new intra coding scheme based on the enlarged macroblock size. For the luminance component, intra $4{\times}4$ prediction and intra $16{\times}16$ prediction in H.264 are scaled into intra $8{\times}8$ prediction and intra $32{\times}32$ prediction, respectively. For the chrominance components, intra $8{\times}8$ prediction is extended to intra $16{\times}16$ prediction. Along with the $8{\times}8$ basic coding block size, an $8{\times}8$ integer discrete cosine transform (DCT) is used. Experimental results show that the proposed algorithm improves coding efficiency of the intra coding for HD video: PSNR gain by 0.23dB and bit-rate reduction by 5.32% on average.