• The Journal of the Acoustical Society of Korea
• /
• v.17 no.1
• /
• pp.98-106
• /
• 1998

본 논문은 두 부류의 오디오 원에 대해 각각 다른 구조를 가지는 필터뱅크를 설계 하고 스위칭 기준을 제안한다. 균일한 필터뱅크로는 MDCT 필터뱅크를 사용하고 필터 뱅크 로는 웨이브렛 패킷 필터뱅크를 사용하였으며 오디오 신호의 시변 특성에 기초하여 두 필터 뱅크를 스위칭한다. MDCT 필터뱅크는 정상신호 표현에 적절하지만 급격한 변화를 포함하 는 오디오 신호를 표현하는데는 적절하지 못한다. 따라서, 본 연구에서 사용한 웨이브렛 패 킷 필터뱅크는 인간의 청각 특성을 고려한 임계대역(critical band)과 유사하게 설계하였으며 스위칭 기준엣는 에너지-엔트로피(energy-entropy), 영교차(zero-crossing)법 그리고 차분 (difference)기준을 사용하였다. 입력되는 오디오 신호의 통계적 특성에 기안하여 두 필터뱅 크를 스위칭하는 방식의 오디오 부호화기에 대해서 새로운 스위칭 기준을 제안하였다. 여러 가지 오디오 신호에 대한 주관적 평가(MOS)를 수행한 결과, 기존의 부호화기보다 좋은 성 능을 보였다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.17 no.2
• /
• pp.23-28
• /
• 1980

The foundation of information theory mainly established by C. E. Shannon , opened the way to profuse studies on the linguistics of various languages. The statistics of Korean letters composed of elements and space are analyzed. The Korean alphabetic elements including the space have their probabilities . And information techniques can be applied to them. This paper extended the previous statistics of Korean letters to include the space. We have also calculated the entropies and redundancy for the case. The result can be used to modify the evaluation of Korean letter information processing devices and used as the basis for letter coding method for eventual future information processors.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1106-1111
• /
• 1999

Discrete cosine Transform (DCT) is most popular block transform coding in lossy mode. DCT is close to statistically optimal transform - the Karhunen Loeve transform. In this paper, a module for still image encoder is implemented with TMS320C80 based on JPEG, which are international standards for image compression. Th still image encoder consists of three parts- a transformer, a vector quantizer and an entropy encoder.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.5 no.4
• /
• pp.237-242
• /
• 2005

H.264/AVC adopts new features compared with previous multimedia algorithms. It is inefficient to implement some of the new blocks using existing DSP instructions. Hence, new instructions are required to implement H.264/AVC. This paper proposes novel instructions for intra-prediction, in-loop deblocking filter, entropy coding and integer transform. Performance comparisons show that the required computation cycles for the in-loop deblocking filter can be reduced about $20{\sim}25%$. This paper also proposes new instructions for the integer transform. The proposed instructions can execute one dimension forward/inverse integer transform. The integer transform can be implemented using much smaller hardware size than existing DSPs.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.458-461
• /
• 2000

Variable length codes are often used in entropy coding, but are very vulnerable in noisy environments. Reversible variable length codes, however, muse possible to decode instantaneously in both forward and backward directions, so that more usable data can be retrieved when bit errors occur via transmission. Furthermore, partial decodability is desirable to introduce in the reversible variable length code because ROI (Region Of Interest) decoding function is sometimes required in recent image information systems such as the medical imaging, the digital museum and so on. In this paper, we propose a partially decodable and reversible variable length code by modifying Golomb-Rice code.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1613-1623
• /
• 1996

In this paper, an image coding scheme using removal of isolated coefficients and quadtree structure in wavelet transformed domain, is suggested. The number of significant coefficients can be reduced by quantizing in different stages according to the weights of the each band. The quadtree structure preseves the location information while significantly reducing the number of bits required to represent the locality of an image. To increase the efficienty of the wavelet transformed images using quadtree, the energy of the isolated coefficients is analyzed and those with low energy are eliminated. Furthermore, to control the bit rate the entropy of each block is sorted according to its energy concentration and the number of bits required for encoding, and the blocks with low energy are removed to achieve the desired compression rate.

• Journal of Information Processing Systems
• /
• v.6 no.4
• /
• pp.435-452
• /
• 2010

This paper proposes a novel reversible data hiding scheme based on a Vector Quantization (VQ) codebook. The proposed scheme uses the principle component analysis (PCA) algorithm to sort the codebook and to find two similar codewords of an image block. According to the secret to be embedded and the difference between those two similar codewords, the original image block is transformed into a difference number table. Finally, this table is compressed by entropy coding and sent to the receiver. The experimental results demonstrate that the proposed scheme can achieve greater hiding capacity, about five bits per index, with an acceptable bit rate. At the receiver end, after the compressed code has been decoded, the image can be recovered to a VQ compressed image.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.08a
• /
• pp.253-256
• /
• 2000

In this paper, we propose the lossless image compression algorithm using the integer wavelet transform. Recently, the S＋P transform is widely used and computed with only integer addition and bit-shift operations, but not proper to remove the correlation of smooth images. then we compare the Harr wavelet of the S＋P transform with various integer coefficient filter banks and apply 9/7 ICFB to the wavelet transform. In addition, we propose a entropy-coding method that exploits the multiresolution structure and the feedback of the prediction error, and can efficiently compress the transformed image for progressive transmission. Simulation results are compared to the compression ratio using the S+P transform with different types of images.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.115-118
• /
• 2008

H.264/AVC는 동영상 데이터를 효율적으로 전송하기 위한 압축 기술로써 7가지 가변 블록에 대한 움직임 예측(Motion Estimation) 및 움직임 보상(Motion Compensation), DCT(Discrete Cosine Transform), 엔트로피 부호화(Entropy Coding), 디블록킹 필터 등 여러 가지 방법이 있다. 이러한 방법들로 인해 압축 효율은 높아졌으나 많은 계산량으로 인해 부호화 시간이 증가하게 되었다. 따라서 화질 손실을 최소한으로 줄이면서 소모되는 시간을 단축시키는 H.264 부호화 방법들이 개발되어야 한다. 그래서 본 논문에서는 H.264 부호화 과정 중 시간이 많이 소모되는 움직임 예측에서 움직임 벡터를 찾기 위한 방법을 제안한다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.8
• /
• pp.41-52
• /
• 2009

In Motion JPEG2000 encoding, huge bandwidth requirement of data memory access is the bottleneck in required system performance. For the alleviation of this bandwidth requirement, a new embedded compression(EC) algorithm with a little bit of image quality drop is devised. For both random accessibility and low latency, very simple and efficient entropy coding algorithm is proposed. We achieved significant memory bandwidth reductions (about 53${\sim}$81%) and reduced code-block memory to about half size through proposed multi-mode algorithms, without requiring any modification in JPEG2000 standard algorithm.