• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.79-86
• /
• 2003

A new quantization constraint set based on the theory of Projection onto Convex Set(POCS) is proposed to reduce blocking artifact appearing in block-coded images. POCS-based postprocessing for alleviating the blocking artifact consists of iterative projections onto smoothness constraint set and quantization constraint set, respectively. In general, the conventional quantization constraint set has the maximum size of range where original image data can be included, therefore over-blurring of restored image is unavoidable as iteration proceeds. The projection onto the proposed quantization constraint set can reduce blocking artifact as well as maintain the clearness of the decoded image, since it controls adaptively the size of quantization constraint set according to the DCT coefficients. Simulation results using the proposed quantization constraint set as a substitute for conventional quantization constraint set show that the blocking artifact of the decoded image can be reduced by the small number of iterations, and we know that the postprocessed image maintains the distinction of the decoded image.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.49 no.11
• /
• pp.933-940
• /
• 2021

The space-borne SAR(Synthetic Aperture Radar) system radiates the microwave signal and receives the backscattered signal. The received signal is converted to digital at the Digital Receiver, which is implemented at the end of the SAR sensor receiving chain. The converted signal is formated after signal processing such as filtering and data compression. Two quantization are conducted in the Digital Receiver. One quantization is an analog to digital conversion at ADC(Analog-Digital Converter). Another quantization is the BAQ(Block Adaptive Quantization) for data compression. The quantization process is a conversion from a continuous or higher bit precision to a discrete or lower bit precision. As a result, a quantization noise is inevitably occurred. In this paper, the impact of two quantization processes are analyzed in a view of SNR degradation.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.258-262
• /
• 2009

In this paper, we propose an effective memory reduction algorithm to reduce the amount of reference frame buffer and memory bandwidth in video encoder and decoder. In general video codecs, decoded previous frames should be stored and referred to reduce temporal redundancy. Recently, reference frames are recompressed for memory efficiency and bandwidth reduction between a main processor and external memory. However, these algorithms could hurt coding efficiency. Several algorithms have been proposed to reduce the amount of reference memory with minimum quality degradation. They still suffer from quality degradation with fixed-bit allocation. In this paper, we propose an adaptive block-based min-max quantization that considers local characteristics of image. In the proposed algorithm, basic process unit is $8{\times}8$ for memory alignment and apply an adaptive quantization to each $4{\times}4$ block for minimizing quality degradation. We found that the proposed algorithm could improve approximately 37.5% in coding efficiency, compared with an existing memory reduction algorithm, at the same memory reduction rate.

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

• Journal of Broadcast Engineering
• /
• v.15 no.2
• /
• pp.232-235
• /
• 2010

This paper proposes an efficient depth-map coding method. The adaptive block-based depth-map coding method decides the number of bit planes to be encoded according to the quantization parameters to obtain the desired bit rates. So, the depth-map coding using the block-based decision of the bit-plane to be encoded proposes to free from the constraint of the quantization parameters. Simulation results show that the proposed method, in comparison with the adaptive block-based depth-map coding method, improves the average BD-rate savings by 3.5% and the average BD-PSNR gains by 0.25dB.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.296-306
• /
• 2006

We proposed the algorithm for the quantization noise reduction based on variable filter adaptive to edge signal in MPEG postprocessing system. In our algorithm, edge map and local modulus maxima in the decoded images are obtained by using 2D Mallat wavelet tilter. And then, blocking artifacts in inter-block are reduced by Gaussian LPF that is variable to filtering region according to edge map. Ringing artifacts in intra-block are reduced by 2D SAF according to local modulus maxima. Experimental results show that the proposed algorithm was superior to the conventional algorithms as regards PSNR, which was improved by 0.04-0.20 dB, and the subjective image quality.

• Journal of Broadcast Engineering
• /
• v.14 no.2
• /
• pp.219-227
• /
• 2009

In H.264/AVC, if each block is quantized with a adaptive quantization parameter(QP) regardless of the characteristics of a block, it could be the deterioration of the picture quality. In this paper, an adaptive block-based QP selection method is proposed in order to improve picture quality by utilizing the bit amounts of the zigzag-scanned integer transform coefficients of the neighboring blocks and changing the QP value in the current block. The proposed method works in the same way as the encoder and decoder without transmitting the change of QP value to the decoder side. The experimental results show that the proposed method achieves a gain of about $0.1\sim0.3dB$ compared with H.264/AVC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.10
• /
• pp.1546-1552
• /
• 1993

We proposed an adaptive block truncation coding(BTC) using gradient and a new initial value. We used gradient of sobel operator as a new category classification coefficient to reduce Jagged appearance at edge part. We defined a new initial value to reduce large quantization error in the 4-level quantizer block including edge part. By computer simulations, we showed that the proposed method less computation load, reduced jagged appearance at edge part, also improved PSNR more than the conventional adaptive BTC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.172-181
• /
• 2010

In this paper, we propose an adaptive block quantization method. The propose method perfrect reconstructs side information without high complexity in the encoder side, as transmitting motion vectors from a decoder to an encoder side. Also, at the encoder side, residual signals between reconstructed side information and original frame are adaptively quantized to minimize parity bits to be transmitted to the decoder. The proposed method can effectively allocate bits based on bit error rate of side information. Also, we can achieved bit-saving by transmission of parity bits based on the error correction ability of the LDPC channel decoder, because we can know bit error rate and positions of error bit in encoder side. Experimental results show that the proposed algorithm achieves bit-saving by around 66% and delay of feedback channel, compared with the convntional algorithm.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.130-137
• /
• 1993

In this paper, A progressive coding of mean difference pyramid by Hadamard transform of the difference between two successive pyramid levels has been studied. A block adaptive bit allocation method based on ac energy of each sub-block has been proposed, which efficiently reduces the final distortion in the progressive transmission of image parameters. In our scheme, the dc energy equals the sum of the quantization errors of the Hadamard transform coefficients at previous level. Therefore proposed allocation method includes the estimation of dc energy at each pyramid level. Computer simulation results show some improvements in terms of MSE and picture quality over the conventional fixed allocation scheme.