• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10C
• /
• pp.991-999
• /
• 2006

This paper shows that the support growth of an optimum (minimum mean square-error) scalar quantizer for a Laplacian density is logarithmic with the number of quantization points. Specifically, it is shown that, for a unit-variance Laplacian density, the ratio of the support-determining threshold of an optimum quantizer to $\frac 3{\sqrt{2}}1n\frac N 2$ converges to 1, as the number of quantization points grows. Also derived is a limiting upper bound that says that the optimum support cannot exceed the logarithmic growth by more than a constant. These results confirm the logarithmic growth of the optimum support that has previously been derived heuristically.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.1
• /
• pp.45-51
• /
• 2003

JPEG200, a new international standard for still image compression based on wavelet and bit-plane coding techniques, is developed. In this paper, we design the DWT(Discrete Wavelet Transform) and quantizer for JPEG2000 CODEC. DWT handles both lossy and lossless compression using the same transform-based framework: The Daubechies 9/7 and 5/3 transforms, and quantizer is implemented as SQ(Scalar Quantization). The architecture of the proposed DWT and SQ are synthesized and verified using Xilinx FPGA technology. It operates up to 30MHz, and executes algorithms of wavelet transform and quantization for VGA 10 frame per second.

• Journal of Korea Multimedia Society
• /
• v.13 no.8
• /
• pp.1154-1162
• /
• 2010

Because it is easy to implement the scalar quantizer, it is used in various video coding systems. Although the scalar quantizer with a large quantization stepsize can reduce the amount of data, it has disadvantage that the reconstructed picture quality is poor. In this paper, we propose an efficient method which improves the coding performance by maintaining original quantization stepsize and increasing the number of quantization reconstruction levels. Simultaneously, for the purpose of solving the problem of transmitting the added symbol informations which is used to indicate the region of quantizer reconstruction level as the number of quantizer reconstruction level is increased, we also suggest the method to reduce the added informations. Therefore, for the intra-coded picture of H.264 video coding system, we generate the huffman codes for the symbol informations of quantization reconstruction regions by 4${\times}$4(horizontal 4 pixels, vertical pixels) block unit. Furthermore, for the inter-coded picture, we also generate the huffman codes for the symbol informations of quantization reconstruction regions by 8${\times}$8 blocks and 4${\times}$4 blocks within a macroblock. Adopting this method of reducing the added information by increasing the number of quantization reconstruction region, It is shown that the coding performance can be improved at the same bitrate.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.832-835
• /
• 2004

In this paper, we proposed a blind watermarking algorithm to use characteristics of a scalar quantizer which is similar with the recommended in the JPEG2000 and JPEG. This algorithm shifts a quantization index according to the value of each watermark bit to prevent losing the watermark information during the compression by quantization. Therefore, the watermark is embedded during the process of quantization, not an additional process for watermarking, and adaptively applied as an assigned quantizer according to application area. In the embedding process, a LFSR(Linear feedback shift register) is used to hide the watermarking positions. Therefore the embedded watermark can be extracted by only the owner who knows the initial value of LFSR without the original image. The experimental results showed that the proposed algorithm satisfies the robustness and imperceptibility corresponding to the major requirement of watermarking.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.2E
• /
• pp.24-32
• /
• 1996

A rigorous theory for modeling, analysis, optimum nonseparable filter bank in multidimensional M-band quantized subband codec are developed in this paper. Each pdf-optimized quantizer is modeled by a nonlinear gain-plus-additive uncorrelated noise and embedded into the subband structure. We then decompose the analysis/synthesis filter banks into their polyphase components and shift the down-and up-samplers to the right and left of the analysis/synthesis polyphase matrices respectively. Focusing on the slow clock rate signal between the samplers, we derive the exact expression for the output mean square quantization error by using spatial-invariant analysis. We show that this error can be represented by two uncorrelated components : a distortion component due to the quantizer gain, and a random noise component due to fictitious uncorrelated noise at the uantizer. This mean square error is then minimized subject to perfect reconstruction (PR) constraints and the total bit allocation for the entire filter bank. The algorithm gives filter coefficients and subband bit allocations. Numerical design example for the optimum nonseparable orthonormal filter bank is given with a quincunx subsampling lattice.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.269-273
• /
• 2000

본 논문에서는 연속되는 동영상 시퀸스의 9개의 프레임에서 이웃하는 프레임간의 차분 프레임으로 이루어진 8개의 차분 데이터를 3D-DCT 처리 후 특성에 맞는 프레임 차분 체적 양자화기(FDVQ)를 설계하고, 이것으로 처리된 영상데이터를 부호화하여 복원영상 데이터의 압축 효과를 분석하였다. 여러가지 동영상 시퀀스를 시험 대상으로 사용한 결과, 제안한 FDVQ를 적용한 3D-DCT 방법은 유사한 해상도에서 차분 영상 데이터에 대한 압축률은 2D-DCT 방법에 비하여 평균 20.3% 향상된 압축 효율을 얻었다. 체적 양자화(VQ:Volume Quantizer)를 이용한 3D-DCT 방법과 비교했을 때는 유사한 압축률을 보였다. 특히, 움직임 성분이 많은 영상에 대해서는 제안한 FDVQ를 이용한 방법이 압축률을 높일수록 2D-DCT방법과 VQ를 이용한 방법보다 압축률 0.05bpp이하에서 약 1.0dB 개선된 결과를 나타내었다.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.106-113
• /
• 1998

Quantizer with bit rate control performs lossy compressionin moving image coding. Efficient quantizer can improve subjective quality of reconstructed image at the same bit rate because most of errors are occured at this stage. Although quantization matix of current compression stantards reflects human visual system, the performance of their quantization matrixes is not always optimal because they are not considering each image characteristics. We proposed a new adaptive optimal quantization matrix obtained by considering complexity of each image subblocks. It resulted in improvments of image quality about 0.05-0.82 dB and good subject quality at edge regions when we simulated the quantization method in various coding statndards.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.3
• /
• pp.69-79
• /
• 1994

DCT image coding has been well known for its compression efficiency. Its nature makes it also suitable for efficient progressive transmission and reconstruction since low frequency transform coefficients contain most of the energy of image signals. In this paper, we propose a progressive transmission technique of DCT image by non-sequential bit ordering using Lloyd-Max quantizer. And then, we will show that the Lloyd-Max quantizer can be embedded quantization. In simulation results, the proposed method show better subjective picture and MSE of the reconstructed image than the conventional zig-zag scanning transmission of transform coefficients.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.06a
• /
• pp.1-2
• /
• 2013

KLT-AECQ 는 지각적인 성능 향상을 위하여 formant weighting 필터를 사용한다.Code Excited Linear Prediction(CELP) 코더는 사람의 음성신호를 압축하는 대표적인 방식이다. CELP 의 Rate-Distortion 성능을 향상 시키기 위해서 Karhunen-Loeve-Transform (KLT) 기반의 Classified Vector Quantization (KLT-CVQ) 방식이 제안되었으며, 이는 KLT 기반의 Adaptive Entropy-Constrained Quantization (KLT-AECQ) 방식으로 확장되었다. 기존의 KLT-AECQ 에서는 지각적인 성능 향상을 위하여 formant weighting 필터를 사용한다. 본 논문에서는 이 필터 대신에 Spectral Amplitude Warping (SAW) 필터를 적용함으로써, KLT-AECQ 코더의 지각적인 성능을 향상하였다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.10
• /
• pp.1561-1570
• /
• 1989

In this paper, we propose an image coding scheme which combines the Laplacian pyramid structure and a hierarchical finite state classified vector quantizer in the DCT domain, namely FSDCT-CTQ. First, an optimal bit allocation problem for fixed rates DCT-CVQ on the Laplacian pyramid structure is described. In an asymptotic case, with an optimal bit allocation, a coding gain over scalar quantization of each Laplacian plane is derived. Second, it is experimentallhy shown that the Laplacian pyramid structure provides a considerable codng gain in the sense of total MMSE (minimum mean squared error). Finally, we propose an FS-DCT-CVQ which exploits the hierarchicla correlation between the Laplacian planes. Simulation results on real images show that the proposed coding scheme can reconstruct an image with 30.33 dB at 0.192 bpp, 32.45 dB at 0.385 bpp, respectively.