• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5C
• /
• pp.461-467
• /
• 2003

We propose an efficient method for separable symmetric linear filtering in the DCT domain. First, separable 2-D linear filtering is decomposed into the cascade of 1-D filtering in the DCT domain. We investigate special characteristics of DCT domain filtering matrices when the filter coefficients are symmetric. Then we present the DCT domain 2-D filtering method using these characteristics. The proposed method requires smaller number of multiplications including typical sparseness of DCT coefficients compared to previous DCT domain linear filtering methods. Also, the proposed method is composed of simple and regular operations, which would be appropriate for efficient VLSI implementation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.158-166
• /
• 2005

Even though post-processing methods based on projections onto convex sets (POCS) have shown good performance for blocking artifact reduction, it is infeasible to implement POCS for real-time practical applications. This paper proposes DCT domain post-processing method based on POCS. The proposed method shows very similar performance compared to the conventional POCS method, while it reduces tremendously the computational complexity. DCT domain POCS performs the lowpass filtering in the DCT domain, and it removes the inverse DCT and forward DCT modules. Through the investigation of lowpass filtering in the iterative POCS method, we define kth order lowpass filtering which is equivalent to the lowpass filtering in the kth iteration, and the corresponding kth order DCT domain POCS. Simulation results show that the kth order DCT domain POCS without iteration gives very similar performance compared to the conventional POCS with k iterations, while it requires much less computations. Hence the proposed DCT domain POCS method can be used efficiently in the practical post-processing applications with real-time constraints.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.51-58
• /
• 2007

The purpose of this paper is to find an efficient encryption scheme for digital holograms (fringe patterns) with low encryption cost. Therefore, we introduced several encryption attempts in both hologram-domain and frequency-domain (both DCT-domain and DWT-domain) on the bases of the results from analyzing the properties of the coefficients in each domain. To effectively hide the image information, 25%, 1.5625%, and 0.0244% of the original fringe pattern need to be encrypted for hologram-domain scheme, DWT-domain scheme, and DCT-domain scheme, respectively. Consequently the DCT-domain scheme was the most efficient and it is caused by the fact that the ability for DCT to concentrate the energy of a given 2-dimensional image into a small area is the best. The encryption schemes and the analyses in this paper are expected to be used effectively on the researches on encryption and others for digital holograms.

• Journal of Broadcast Engineering
• /
• v.8 no.1
• /
• pp.30-36
• /
• 2003

According to an evolution of image and video compression technologies, most digital images are in the compressed form. Resizing of these compressed images have various applications such as transmission of resized image according to varying bandwidth, content adaptation for display purpose and etc. Discrete Cosine Transform (DCT) is the most popular transformation for image compression. Recently, several researches have been performed to obtain the reconstructed image of original size in the DCT domain after downsampling and upsampling in the DCT domain. Main focus of these researches is to improve quality of the reconstructed image after downsampling and upsampling in the DCT domain In this paper, we present an modified IDCT method to downsize DCT-encoded image. Furthermore, we propose an efficient scheme for image downsampling and upsampling in the DCT domain With these modified IDCT method. The proposed scheme Provides higher PSNR values than the existing schemes In terms of the reconstructed image after halving and doubling in the DCT domain.

• Journal of Korea Multimedia Society
• /
• v.16 no.10
• /
• pp.1163-1170
• /
• 2013

Digital watermarking techniques have been used as one of the means for copyright protection and authentication of multimedia data. Conventional Chinese Remainder Theorem(CRT)-based spatial domain watermarking techniques do not perform well under JPEG compression. However, it is seen that the CRT-based watermarking technique in Discrete Cosine Transform(DCT) domain performs well for JPEG compression. In this paper, an improved CRT-based image watermarking method in the DCT domain is proposed. The proposed method provides better robustness which decreases changes of absolute difference of residues against rounding errors due to DCT conversion and various attacks. Experimental results show that the proposed method has a good robustness against various attacks compared with the conventional CRT-based watermarking in DCT domain.

• Journal of Broadcast Engineering
• /
• v.6 no.2
• /
• pp.121-130
• /
• 2001

We propose an efficient DCT-domain video transcoding algorithm for flexible for bit-rate video communications. Video transcoding provides communication fiexibility by adaptively changing the bit-rate of compressed bit stream. During the transcoding process, adrift error is unavoidable because of the difference between reference images in the series of encoding and decoding. For solving the drift error problem, cascade pixel-domain transcoder (CPDT) has been proposed. CPDT, however, requires highly complex hardware and heavy computational overhead. In this paper we propose a DCT-domain transcoding technique, which enables efficient transcoding without any drift error. The proposed cascade DCT-domain transcoder (CDDT) is realized by new motion compensation and down-sampling methods in the DCT-domain.

• Journal of Korea Multimedia Society
• /
• v.1 no.2
• /
• pp.194-203
• /
• 1998

In this paper, a new DCT-VQ method is proposed which can solve the problems of VQ such as the degradation of edge and enormous calculations. VQ is carried in DCT domain but spatial domain in order to protect the degradation of edge. DCT makes high correlated image data decorrelated and the energy concentrated on a few coefficients. In DCT domain, the DC coefficient is quantized with 8 bits uniform scalar quantizer and the AC coefficients are divided to three regions and coded with vector qiantizer for considering edge components. For the decrease of the calculation and memory, the vectors for three region have small dimension of $1{\times}7$ and use the same codebook. Thus, the proposed method can fully express the edge components by considering AC coefficients in DCT domain and decrease the calculation and memory be reducing the dimension of vectors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1214-1221
• /
• 2005

In this paper, we propose a digital watermarking method for still images, in which the human visual system (HVS) is used in the discrete cosine transform (DCT) domain. The modulation transfer function (MTF) of the HVS model is employed to increase the invisibility of the inserted watermark in images. The proposed watermarking method is shown to be robust to several common image processing techniques, including lowpass filtering and cropping. Also, using the energy relationship of the DCT, we derive the equation that directly computes the watermark weighting factor in the DCT domain for the specified peak signal to noise ratio (PSNR) of the still image and the length of watermark to be inserted. The difference between desired PSNR and PSNR in spatial domain is within 0.07dB for the 7 test images.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.2
• /
• pp.35-40
• /
• 2004

In this paper, we propose a method for calculation of the length of watermarks to be inserted in the discrete cosine transform (DCT) domain for the specified peak signal to noise ratio (PSNR) of still image. Using the energy relationship of the DCT we derive the equation that directly computes the length of watermarks to be inserted in the DCT domain. Experimental results with several test images show the effectiveness of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2C
• /
• pp.113-123
• /
• 2007

In Ubiquitous communication environment, various conversions of images are essential, and most digital images are compressed by standard methods such as the Joint Photographic Expert Group (JPEG) and Motion Picture Expert Group (MPEG) which are based on the discrete cosine transform (DCT). In this paper, various image resizing algorithms in the DCT domain are analyzed, and a new image resizing algorithm, which shows superior performance compared with the conventional methods, is proposed. For arbitrary-ratio image resizing in the DCT domain, several blocks of $8{\times}8$ DCT coefficients are converted into one block using the conversion formula in the proposed algorithm, and the size of the inverse discrete cosine transform (IDCT) is decided optimally. The performance is analyzed by comparing the peak signal to noise ratio (PSNR) between original images and converted images. The performance of the proposed algorithm is better than that of the conventional algorithm, since the correlation of pixels in images is utilized more efficiently.