• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.824-833
• /
• 2004

Due to the bandwidth and storage limitations, medical images are needed to be compressed before transmission and storage. DICOM (Digital Imaging and Communications in Medicine) specification, which is the medical images standard, provides a mechanism for supporting the use of JPEG still image compression standard. In this paper, we explain a method for compressing medical images by JPEG standard and propose two methods for JPEG compression. First, because medical images differ from natural images in optical feature, we propose a method to design adaptively the quantization table using spectrum analysis. Second, because medical images have higher pixel depth than natural images do, we propose a method to design Huffman table which considers the probability distribution feature of symbols. Therefore, we propose methods to design a quantization table and Huffman table suitable for medical images. Simulation results show the improved performance compared to the quantization table and the adjusted Huffman table of JPEG standard. Proposed methods which are satisfied JPEG Standard, can be applied to PACS (Picture Archiving and Communications System).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.822-832
• /
• 1994

DSC-HDTV image compression algorithm removes spatial, temporal, and amplitude redundancies of an image by using transform coding, motion-compensated predictive coding, and adaptive quantization, respectively. In this paper, leak processing method which is used to recover image quality quickly from scene change and transmission error and adaptive quantization using perceptual weighting factor obtained by HVS are proposed. Perceptual weighting factor is calculated by contrast sensitivity, spatio-temporal masking and frequency sensitivity. Adaptive quantization uses the perceptual weighting factor and global distortion level from buffer history state. Redundant bits according to adaptation of HVS are used for the next image coding. In the case of scene change, DFD using motion compensated predictive coding has high value, large bit rate and unstabilized buffer states since reconstructed image has large quantization noise. Thus, leak factor is set to 0 for scene change frame and leak factor to 15/16 for next frame, and global distortion level is calculated by using standard deviation. Experimental results show that image quality of the proposed method is recovered after several frames and then buffer status is stabilized.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.585-588
• /
• 2011

본 논문은 HEVC 표준화 회의 중 빈 단위 병렬화 위해 제안된 V2V 기술을 바탕으로 슬라이스 내에서 적응적으로 발생 확률 예측을 통하여 압축 효율을 높이는 기술을 제안한다. 기존의 V2V 기술은 슬라이스 단위로 확률 양자화 간격과 대표 확률 결정하여 다수개의 빈 코더에 매핑하여 병렬 엔트로피 부호화를 수행하였다. 제안하는 방법은 V2V 기술에서 슬라이스 보다 작은 단위의 확률적 특성을 고려하여 슬라이스 내에서 대표확률의 선택을 적응적으로 결정한다. 대표 확률의 적응적인 선택은 이전의 부호화된 빈의 실제 심볼의 확률을 이용하며, 이로 인해 슬라이스 보다 작은 단위의 국부적 특성을 확률 양자화기에 반영할 수 있다. 실험 결과, 제안하는 방법을 위해 실험된 현재 부호화 빈의 발생확률은 이용하여 최적의 확률을 얻는 실험은 기존의 V2V 기술 대비 0.1%의 부호화 효율을 얻었다.

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

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1998.10a
• /
• pp.644-647
• /
• 1998

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

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.415-418
• /
• 2003

칼라 히스토그램 인터섹션 방법은 칼라 분포간의 유사도를 측정하는데 널리 사용된다 하지만 이 방법은 칼라 공간을 고정된 칼라수로 양자화시킨 경우에만 유효하므로 칼라 공간에 대한 분할 문제와 양자화 레벨의 결정 문제를 내포하고 있다. 이에, 본 논문에서는 고정 양자화된 칼라 분포뿐만 아니라 적응적 양자화되어 상이한 칼라분포를 갖는 영상간의 정합에 적용 가능한 확장 칼라 히스토그램 인터섹션 방법을 제안한다. 제안된 방법은 생산자가 생산된 상품을 소비자에게 공급하는 동안 생산효율을 계산하여 경제적 이익을 최대화 시키기 위한 생산자-소비자 모델로 간주되어질 수 있다 실험을 통해 우리는 제안된 방법이 두 칼라 분포간의 유사도를 효과적으로 측정할 수 있음을 확인하였다

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.1
• /
• pp.19-30
• /
• 2012

For digital data compression, the quantization is the main part of the lossy source coding. In order to improve the performance of quantization, the vector quantizer(VQ) can be employed. The encoding complexity, however, exponentially increases as the vector dimension or bit rate gets large. Much research has been conducted to alleviate such problems of VQ. Especially for high bit rates, a constrained VQ, which is called the sample-adaptive product quantizer(SAPQ), has been proposed for reducing the hugh encoding complexity of regular VQs. SAPQ has very similar structure as to the product VQ(PQ). However, the quantizer performance can be better than the PQ case. Further, the encoding complexity and the memory requirement for the codebooks are lower than the regular full-search VQ case. Among SAPQs, 1-SAPQ has a simple quantizer structure, where each product codebook is symmetric with respect to the diagonal line in the underlying vector space. It is known that 1-SAPQ shows a good performance for i.i.d. sources. In this paper, a study on designing 1-SAPQ for the first-order Markov process. For an efficient design of 1-SAPQ, an algorithm for the initial codebook is proposed, and through the numerical analysis it is shown that 1-SAPQ shows better quantizer distortion than the VQ case, of which encoding complexity is similar to that of 1-SAPQ, and shows distortions, which are close to that of the DPCM(differential pulse coded modulation) scheme with the Lloyd-Max quantizer.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.3 s.303
• /
• pp.81-90
• /
• 2005

When we transmit signals, which are quantized by the vector quantizer (VQ), through noisy channels, the overall performance of the coding system is very dependent on the employed quantization scheme and the channel error effect. In order to design an optimal coding system, the source and channel coding scheme should be jointly optimized as in the channel-optimized VQ. As a suboptimal approach, we may consider the robust VQ (RVQ). In RVQ, we consider developing an index assignment function for mapping the output of quantizers to channel symbols so that the effect of the channel errors is minimized. Recently, a VQ, which can reduce the encoding complexity and is called the sample-adaptive product quantizer (SAPQ), has been proposed. SAPQ has very similar quantizer structure as to the product quantizer (PQ). However, the quantization performance can be better than PQ. Further, the encoding complexity and the memory requirement for the codebooks are lower than the regular full-search VQ case. In this paper, SAPQ is employed in order to design an RVQ to channel errors by reducing the vector dimension. Discussions on the codebook structure of SAPQ and experiments are introduced in an aspect of robustness to noisy channels.

• The Journal of the Acoustical Society of Korea
• /
• v.9 no.6
• /
• pp.5-13
• /
• 1990

본 논문에서는 16Kbps 및 32 Kbps 전송속도에서 ADM의 음질을 개선하기 위하여 두 가지 방 식을 적용한다. 첫째로, 고차 예측기 또는 적응 예측기를 ADM에 활용한다. ADM의 경우에 2차 또는 3 차 예측기를 사용하면 16Kbps 전송속도에서는 별로 개선이 없지만 32Kbps 전송속도에서는 SQNR\sub SEG\척도로 약 3-4dB의 상당한 이득이 얻어진다. 또한 ADM에 적응 예측기를 활용하면 최대 성능은 SZNR\sub SEG\ dir 2dB 정도 개선되지만 양자화 잡음의 축적 때문에 동작 범위가 매우 좁아진다. 둘 째로, 지연 결정 방식을 ADM에 이용한다. 지연 결정 방식을 2차 예측기를 갖고 있는 ADM에 적용하면 약 2dB 정도 개선되지만 양자화 잡음의 축적 때문에 동작 범위가 매우 좁아진다. 둘째로 지연 결정 방 식을 ADM 에 이용한다. 지연 결정 방식을 2차 예측기를 갖고 있는 ADM에 적용하면 1차 예측기를 갖 고 있는 ADMDP 적용했을 때 보다 16또는 32Kbps일 때 SQNR\sub SEG\척도로 재래의 ADM 보다 약 5dB 정도의 성능 개선이 얻어진다.