• The Journal of the Acoustical Society of Korea
• /
• v.10 no.4
• /
• pp.27-37
• /
• 1991

This paper proposes the ESFVQ(energy subspace fuzzy vector quantization) that employs energy subspaces to reduce the quantizing distortion which is less than that of a fuzzy vector quatization. The ESFVQ is applied to a speaker adaptation method by which Korean words spoken by unknown speakers are recognized. By generating mapped codebooks with fuzzy histogram according to each energy subspace in the training procedure and by decoding a spoken word through the ESFVQ in the recognition proecedure, we attempt to improve the recognition rate. The performance of the ESFVQ is evaluated by measuring the quantizing distortion and the speaker adaptive recognition rate for DDD telephone area names uttered by 2 males and 1 female. The quatizing distortion of the ESFVQ is reduced by 22% than that of a vector quantization and by 5% than that of a fuzzy vector quantization, and the speaker adaptive recognition rate of the ESFVQ is increased by 26% than that without a speaker adaptation and by 11% than that of a vector quantization.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.4
• /
• pp.50-56
• /
• 1997

In this paper, efficient quantization methods of line spectrum pairs (LSP) which has good performances and low complexity and memory are proosed for vocoder of mobile communication system. The adaptive quantization method utilizing the ordering property of LSP parameters is used in a scalar quantizer and a vector-scalar hybrid quantizer. The proposed scalar quantization algorithm needs 31 bits/frame to maintain the transparent quality of speech. The improved vector-scalar quantizer achieves an average spectral distortion of 1dB using 26 bits/frame. The proposed methods are evaluated in the channel errors and changed the predictor structure to maintain the robustness to channel errors.

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

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.4
• /
• pp.276-280
• /
• 2017

This paper presents computationally efficient image compression for wireless transmission of high-definition video, to adaptively utilize available channel bandwidth and improve image quality. The method indirectly predicts an unknown available channel bandwidth by monitoring encoder buffer status, and adaptively controls a quantization parameter to fully utilize the bandwidth. Experimental results show that the proposed method is robust to variations in channel bandwidth.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.249-254
• /
• 2002

We consider a buffer-constrained adaptive quantization algorithm for image compression. Buffer control algorithm was considered with source coding scheme by some researchers and recently a formal description of the algorithm in terms of rate-distortion has been developed. We propose a buffer control algorithm that incorporates the buffer occupancy into the Lagrange multiplier form in a rate-distortion cost measure. Although the proposed algorithm provides the suboptimal performance as opposed to the optimal Vieterbi algorithm, it can be implemented with very low computaional complexity. In addition stability of this buffer control algorithm has been mentioned briefly using Liapnov stability theory.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2254-2263
• /
• 2000

This paper proposes an efficient predictive image-compression technique based on vector quantization of blocks of pels. In the proposed method edge contents of blocks control the selection of predictors and block shapes as well. The maximum number of bits assigned to quantizers has been in creased to 3bits/pel from 1/5bits/pel, the setting employed by forerunners in predictive vector quantization of images. This increase prevents the saturation in SNR observed in their results in high bit rates. The variable block shape is instrumental in eh reconstruction of edges. The adaptive procedure is controlled by means of he standard deviation ofp rediction errors generated by a default predictor; the standard deviation address a decision table which can be set up beforehand. eh proposed method is characterized by overall improvements in image quality over A-VQ-PE and A-DCT VQ, both of which are known for their efficient use of vector quantizers.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1240-1243
• /
• 2002

In this paper, we propose an adaptive digital image watermarking algorithm using successive subband quantization (SSQ) and perceptual model based on wavelet domain. The watermark is embedded into the perceptually significant coefficients (PSCs) of image. The PSCs in the baseband are selected according to the amplitude of the coefficients and the high frequency subbands are selected by SSQ. To embed the watermark, we use perceptual model. The perceptual model is based on the computation of the noise visibility function (NVF) and embed at the texture and edge region stronger embedded watermarks.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.9
• /
• pp.124-132
• /
• 1994

An image data compression method for a digital VCR must satisfy special requirements such as high speed playback. various edting capabilities and error concealment to provide immunity to tape dropouts. Taking these requirements requirements into consideration, this paper proposes a new interframe subband coding algorithm for a digital VCR. In the proposed method, continuous input images are fist partitioned into four frequency bands. The lowest frequency subband is coded with 3-D block adaptive quantization that removes the level redundancy within each level. The other higher frequency subbands are coded by an intraframe coding method using the property of the human visual system. To keep reasonable image quality in high speed palyback, a segment forming method in the frequency domaing is also proposed Computer simulation results demonstrate that the proposed algorithm has the potential of achieving virtually lossless compression in normal play and produces an image with less mosaic errors in high speed play.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.121-124
• /
• 2002

This paper presents an adaptive digital image watermarking scheme that uses successive subband quantization (SSQ) and perceptual modeling. Our approach performs a multiwavelet transform to determine the local image properties optimal and the watermark embedding location. The multiwavelet used in this paper is the DGHM multiwavelet with approximation order 2 to reduce artifacts in the reconstructed image. A watermark is embedded into the perceptually significant coefficients (PSC) of the image in each subband. The PSCs in high frequency subbands are selected by setting the thresholds to one half of the largest coefficient in each subband. After the PSCs in each subband are selected, a perceptual model is combined with a stochastic approach based on the noise visibility function to produce the final watermark.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.138-145
• /
• 1997

This paper proposes an adaptive algorithm for the quantization step size control of MPEG-2, using the information obtained from the previously encoded picture. Before quantizing the DCT coefficients, the properties of reconstruction error of each macro block (MB) is predicted from the previous frame. For the prediction of the error of current MB, a block with the size of MB in the previous frame are chosen by use of the motion vector. Since the original and reconstructed images of the previous frame are available in the encoder, we can calculate the reconstruction error of this block. This error is considered as the expected error of the current MB if it is quantized with the same step size and bit rate. Comparing the error of the MB with the average of overall MBs, if it is larger than the average, small step size is given for this MB, and vice versa. As a result, the error distribution of the MB is more concentrated to the average, giving low variance and improved image quality. Especially for the low bit application, the proposed algorithm gives much smaller error variance and higher PSNR compared to TM5 (test model 5).