• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.291-294
• /
• 2000

본 논문에서는 웨이브릿 변환영역에서 개선된 모폴로지와 적응양자화를 이용한 영상부호화 방법을 제안한다 제안한 방법은 제로트리를 기반으로 한 기존의 방법들과 유사한 코딩성능을 가지면서 EZW, SFQ 등에서 나타나는 복잡성을 모폴로지를 사용하여 유효정보를 클러스터링 함으로써 복잡성을 줄일 수 있다. 그러나 클러스터의 개수가 많아지면 클러스터를 나타내는 부가정보의 양도 많아진다. 이러한 부가정보의 비율이 실제데이터에서 많은 비중을 차지하기 때문에 개선된 모폴로지를 적용하여 효율적으로 부호화 함으로써 영상의 화질을 개선하였다. 또한 고주파 대역에서의 유효계수를 효율적으로 코딩하기 위해 적응양자화를 적용하여 양자화 시 오차범위를 줄일 수 있다. 따라서 제안한 방법은 양자화 시 발생하는 많은 비교연산을 줄일 수 있으며, 기존의 방법에 비해 화질을 개선하였다.

• 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 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 Korea Institute of Information and Communication Engineering
• /
• v.9 no.6
• /
• pp.1234-1240
• /
• 2005

In this paper, I propose the wavelet image coding method using band adaptive quantization and the significant cluster extraction. The proposed method can reduce to unnecessary additional seed data which create on conventional MRWD coding, because it eliminate cluster which smaller than structuring element by using morphology. And it make fast coding possible, because it is reduced to computational complexity by using band adaptive quantization. Consequently, the proposed method reduces computational complexity with $20\%{\~}33.3\%$ according to bit rate in quantization process.

• Journal of Broadcast Engineering
• /
• v.15 no.5
• /
• pp.672-680
• /
• 2010

This paper presents an adaptive quantization matrix selection scheme for H.264 video encoding. Conventional H.264 coding standard applies the same quantization matrix to the entire video sequence without considering local characteristics in each frame. In this paper, we propose block adaptive selection of quantization matrix according to edge directivity of each block. Firstly, edge directivity of each block is determined using intra prediction modes of its spatially adjacent blocks. If the block is decided as a directional block, new weighted quantization matrix is applied to the block. Otherwise, conventional quantization matrix is used for quantization of the non-directional block. Since the proposed weighted quantization is designed based on statistical distribution of transform coefficients in accordance with intra prediction modes, we can achieve high coding efficiency. Experimental results show that the proposed scheme can improve coding efficiency by about 2% in terms of BD bit-rate.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.18-27
• /
• 2012

Optimal quantizers in conducting the entropy-constrained quantization for high bit rates have the lattice structure. The quantization process is simple due to the regular structure and various quantization algorithms are proposed depending on the lattice. In this paper, such a lattice vector quantization is implemented by using the sample-adaptive product quantizer (SAPQ). It is shown that several important lattices can be implemented by SAPQ and the lattice vector quantization can be performed by using a simple integer-transform function of scalar values within SAPQ. The performance of the proposed lattice SAPQ is compared to the entropy-constrained scalar quantizer and the entropy-constrained SAPQ (ECSAPQ) at a similar encoding complexity. Even though ECSAPQ shows a good performance at low bit-rates, lattice SAPQ shows better performance than the ECSAPQ case for a wide range of bit rates.

• The Journal of the Acoustical Society of Korea
• /
• v.42 no.5
• /
• pp.422-428
• /
• 2023

Ultrafast ultrasound imaging has been applied to various imaging approaches, including shear wave elastography, ultrafast Doppler, and super-resolution imaging. However, these methods are still challenging in real-time implementation for three Dimension (3D) or portable applications because of their massive data rate required. In this paper, we proposed an adaptive quantization method that effectively reduces the data rate of large Radio Frequency (RF) data. In soft tissue, ultrasound backscatter signals require a high dynamic range, and thus typical quantization used in the current systems uses the quantization level of 10 bits to 14 bits. To alleviate the quantization level to expand the application of ultrafast ultrasound imaging, this study proposed a depth-sectional quantization approach that reduces the quantization errors. For quantitative evaluation, Field II simulations, phantom experiments, and in vivo imaging were conducted and CNR, spatial resolution, and SSIM values were compared with the proposed method and fixed quantization method. We demonstrated that our proposed method is capable of effectively reducing the quantization level down to 3-bit while minimizing the image quality degradation.

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

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.2
• /
• pp.85-90
• /
• 2004

This paper proposes the wavelet image coding using the significant cluster extraction by morphology and the adaptive quantization. In the conventional MRWD method, the additional seed data takes large potion of the total data bits. The proposed method extracts the significant cluster using morphology to improve the coding efficiency. In addition, the adaptive quantization is proposed to reduce the number of redundant comparative operations which are indispensably occurred in the MRWD quantization. The experimental result shows that the proposed algorithm has the improved coding efficiency and computational cost while preserving superior PSNR

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.67-75
• /
• 2012

Optimal quantizers in conducting the entropy-constrained quantization for high bit rates have the lattice structure. The quantization process is simple due to the regular structure, and various quantization algorithms are proposed depending on the lattice. Such a lattice vector quantizer (VQ) can be implemented by using the sample-adaptive product quantizer (SAPQ) and its output can also be easily entropy encoded. In this paper, the entropy encoding scheme for the lattice VQ is proposed based on SAPQ, and the performance of the proposed lattice VQ, which is based on SAPQ with the entropy coder, is asymptotically compared as the rate increases. It is shown by experiment that the gain for the memoryless Gaussian source also approaches the theoretic gain for the uniform density case.