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

In this paper, we propose a new post-processing method which can solve a problem of MSDS(Mean Squared Difference of Slope) method. Using that method the blocking artifacts can significantly be reduced without any restriction, which is a major drawback of block-based DCT compression method. In this approach, the OSLD(Overlapped Sub-Laplacian Distribution) of dequantized block boundary pixel difference values is defined and used to categorize each block of an image into one of four types. Those types are also classified into one of two classes: an edge and a non-edge classes. A slope across the block boundary is used to quantify discontinuity of the image. If an absolute estimated quantization error value of a DCT coefficient is greater than the corresponding quantization step size, it is saturated to the step size in the edge class. The proposed post-processing method can improve not only the PSNR value up to 0.1~O.3 dB but visual quality without any constraints determined by ad-hoc manner.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.99-108
• /
• 1994

In this paper an image compression technique based on fractal theory using iterated contractive transformation is analysed and an improved image coder is suggested. Existing methods used the classifier proposed by Ramamurthi and Gersho which utilize the properties of neighboring pixels in the spatial domain. In this paper DCT-based classification is applied to 512$\times$512 images and PSNR improvement of 0.4~2.7 dB is obtained at lower bit rate over conventional algorithms. In addition the effect of varying the domain block size and quantization step size of the luminance shift parameter on the compression ratio and the image quality is compared and analysed.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.4
• /
• pp.98-106
• /
• 2011

Since prediction processes such as motion estimation motion compensation are not at the WZ video encoder but at its decoder, WZ video compression cannot have better performance than that of conventional video encoder. In order to implement the prediction process with low complexity at the encoder, WZ residual coding was proposed. Instead of original WZ frames, WZ residual coding encodes the residual signal between key frames and WZ frames. Although the proposed WZ residual coding has good performance in pixel domain, it does not have any improvements in transform domain compared to transform domain WZ coding. The WZ residual coding in transform domain is difficult to have better performance, because pre-defined quantization matrices in WZ coding are not compatible with WZ residual coding. In this paper, we propose a new quantization method modifying quantization matrix and quantization step size adaptively for transform domain WZ residual coding. Experimental result shows 22% gain in BDBR and 1.2dB gain in BDPSNR.

• The Journal of the Acoustical Society of Korea
• /
• v.32 no.1
• /
• pp.71-78
• /
• 2013

This paper describes a multiple audio watermarking using Quantization Index Modulation (QIM) on frequency phase and magnitude response. Proposed embedding procedure is composed of two stage. At the first stage, the watermark is embedded on the frequency phase response using QIM. In the second stage, the watermark is embedded using adaptive QIM with the step-size that is adaptively determined using the maximum value of the frequency magnitude response of every frame. The watermark is extracted by calculating the Euclidean distance as the blind detection. The proposed method is robust against most of attacks of audio watermark benchmarking. For the Fourier attacks, the proposed method shows over 95% recovery rate.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.6
• /
• pp.21-27
• /
• 2019

The video compression standard required a processing technique for a high resoluion image and increased the coding size to increase the resolution of the image. Accurate motion estimation and increased coding size provide high accuracy and compression rate, but there is a problem of increased computational complexity. In this paper, we use DCT - based motion estimation in the frequency domain to reduce complexity. However, we found that the DCT and quantization process used in a general video encoder are applied to the frequency domain encoder, resulting in problems caused by the scaling process. Therfore, in this paper, we extract the scaling matrix that can be applied in the DCT step and resolve the, and improve the performance of motion estimation using increased coding size.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1217-1233
• /
• 2015

The paper studies characteristics of the minimum mean-square error symmetric scalar quantizers for the generalized gamma, Bucklew-Gallagher and Hui-Neuhoff probability density functions. Toward this goal, asymptotic formulas for the inner- and outermost thresholds, and distortion are derived herein for nonuniform quantizers for the Bucklew-Gallagher and Hui-Neuhoff densities, parallelling the previous studies for the generalized gamma density, and optimal uniform and nonuniform quantizers are designed numerically and their characteristics tabulated for integer rates up to 20 and 16 bits, respectively, except for the Hui-Neuhoff density. The assessed asymptotic formulas are found consistently more accurate as the rate increases, essentially making their asymptotic convergence to true values numerically acceptable at the studied bit range, except for the Hui-Neuhoff density, in which case they are still consistent and suggestive of convergence. Also investigated is the uniqueness problem of the differentiation method for finding optimal step sizes of uniform quantizers: it is observed that, for the commonly studied densities, the distortion has a unique local minimizer, hence showing that the differentiation method yields the optimal step size, but also observed that it leads to multiple solutions to numerous generalized gamma densities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1096-1108
• /
• 1996

In this paper, we propose a temporal adaptive tranform 3D SBC coder with motion compensation, exploiting redundancy in the temporal domain. We propose a temporal adaptivity measure, by which the R-D optimal temporal transform can be chaosen. The base temporal subband frame is coded using H.261-like MC-DCT coder, while the higher temporal subband frames are coded using the 2D adaptive wavelet packet bases, considering the various energy distribution which results from the temporal variation. In encoding the subbands, we employ adaptive scanning methods, uniform step-size quantization with VLC, and coded/not-coded flag reduction technique using the quadtree structure. From the simulation results, the proposed adaptive 3D subband coder shows about 0.29~3.14 dB gain over the H.261 and the fixed 3D subband coder techniques.

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

Transcoding is the key technique to further reduce the bit-rate of a previously compressed video. The performance of the transcoding is evaluated by the two factors, the accuracy on the target bit-rate and the complexity of the implementation. In this paper, were propose a new rate control algorithm which has very accurate bit-rate control performance and much smaller computational complexity. For the accuracy problem, we empirically observe the relationship between the quantization step size and generated bits in requantization process and then find that the relationship can be characterized as the new piece-wise linear model. For the complexity problem, we reduce the role of feedback rate control. The simulation results show that the proposed method gives the better performance in the accuracy with the same picture quality than conventional rat control algorithm.

• Journal of the Optical Society of Korea
• /
• v.13 no.1
• /
• pp.92-97
• /
• 2009

In this paper, a conventional simulated annealing (SA) method for optimization of a kinoform computer generated hologram (CGH) is analyzed and the SA method is modified to reduce a reconstruction error rate (ER) of the CGH. The dependences of the quantization level of the hologram pattern and the size of the data on the ER are analyzed. To overcome saturation of the ER, the conventional SA method is modified as it magnifies a Fourier-transformed pattern in the intermediate step. The proposed method can achieve a small ER less than 1%, which is impossible in the conventional SA method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.5
• /
• pp.11-20
• /
• 2002

Based on regularization principles, we propose a new dequantization scheme on DCT-based transform coding for reducing of blocking artifacts and minimizing the quantization error. The conventional image dequantization is simply to multiply the received quantized DCT coefficients by the quantization matrix. Therefore, for each DCT coefficients, we premise that the quantization noise is as large as half quantizer step size (in DCT domain). Our approach is based on basic constraint that quantization error is bounded to ${\pm}$(quantizer spacing/2) and at least there are not high frequency components corresponding to discontinuities across block boundaries of the images. Through regularization, our proposed dequantization scheme, sharply reduces blocking artifacts in decoded images. Our proposed algorithm guarantees that the dequantization process will map the quantized DCT coefficients will be evaluated against the standard JPEG, MPEG-1 and H.263 (with Annex J deblocking filter) decoding process. The experimental results will show visual improvements as well as numerical improvements in terms of the peak-signal-to-noise ratio (PSNR) and the blockiness measure (BM) to be defined.