• The Journal of the Acoustical Society of Korea
• /
• v.16 no.4
• /
• pp.64-70
• /
• 1997

This paper is aimed to propose a new wavelet audio signal coding scheme which reduces the complexity of well-known MPEG(Moving Picture Expert Group)-Audio. The filters of MPEG0audio apply subband technique on the 16-bits PCM audio to aquire bitstream of subband sample using dynamic bit allocation. If we use the wavelet coefficients instead of subband samples and 6 bands which is less than 32 bands of MPEG-audio, the complexity can be reduced. A new audio signal compression algorithm in this paper is based on wavelet transform and the proposed algorithm is compared with MPEG-audio. At the bitrate of 256kbps, the proposed algorithm maintains the CD(Compact-disc) quality. We were able to reduce the about 40% of complexity at encoder and about 70% at decoder.

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.883-886
• /
• 2000

Two fast search algorithms are proposed for VQ encoding in subband/VQ coding schemes. These algorithms exploit the property of the transform domain that the large coefficients rarely exist in the decomposed subbands. And the exit condition of PDE algorithm can be satisfied by comparing the large values of the codeword with the corresponding ones of the input vector. The computational complexity can be reduced at the expense of memories without extra coding errors.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.609-612
• /
• 1999

In this paper, we propose wavelet transform image compression method such that an image is decomposed into multiresolutions using biorthogonal wavelet transform with linear phase response property and decomposed subbands are classified by maximum classification gain. The classified data is quantized by allocating bits in accordance with classified class informations within subbands through arbitrary set bit allocation algorithm. And then, quantized data in each subband are entropy coded. The proposed coding method is that the quantized data perform shuffling before entropy coding in order to remove sign bit plane. And the context is assigned by maximum correlation direction for bit plane coding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1361-1369
• /
• 1996

Motion estimation is one of the key components for high quality video coding. In this paper, a new motion estimation scheme for MPEG-like video coder is suggested. The proposed temporally adaptive motion estimation scheme consists of five functional blocks: Temporal subband analysis (TSBA), extraction of temporal information, scene change detection (SCD), picture type replacement (PTR), and temporally adapted block matching algorithm (TABMA). Here all the functional components are based on the temporal subband analysis. In this papre, we applied the analysis part of subband decompostion to the temporal axis of moving picture sequence, newly defined the temporal activity distribution (TAD) and average TAD, and proposed the temporally adapted block matching algorithm, the scene change detection algorithm and picture type replacement algorithm which employed the results of the temporal subband analysis. A new block matching algorithm TABMA is capable of controlling the block matching area. According to the temporal activity distribution of objects, it allocates the search areas nonuniformly. The proposed SCD and PTR can prevent unavailable motion prediction for abrupt scene changes. Computer simulation results show that the proposed motion estimation scheme improve the quality of reconstructed sequence and reduces the number of block matching trials to 40% of the numbers of trials in conventional methods. The TSBA based scene change detection algorithm can detect the abruptly changed scenes in the intentionally combined sequence of this experiment without additional computations.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.783-786
• /
• 2000

본 논문에서는 웨이브렛 변환을 적용한 광대역 음성부호화 알고리즘을 제안하였다. 제안한 음성부호화 알고리즘은 split-band 구조를 가지며, 16 kHz로 sampling된 입력신호를 QMF를 이용해서 동일한 대역폭을 갖는 두 개의 subband 신호로 나누고 이를 8kHz의 sampling율을 갖도록 downsampling 한다. 그리고 저대역 신호는 GSM-EFR 음성부호화 알고리즘을 이용하여 부호화하고, 고대역 신호는 DWT(Discrete Wavelet Transform)을 적용하여 subband로 나누어 부호화하였다. 각 subband에서 양자화 된 파라미터는 IDWT(Inverse DWT)과정을 거쳐서 upsampling되고 합성 QMF를 통과시켜 최종 합성음을 구하였다. 제안한 음성부호화기는 저대역 신호의 GSM-EFR 부호화에 12.2 kbps, 웨이브렛 변환을 이용한 고대역 신호의 부호화에 7.8 kbps로 전체 20 kbps의 전송율을 가지면서 G.722 표준안의 56 kbps에서의 합성음과 비슷한 음질을 나타내었다.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.807-810
• /
• 2000

In this paper, a new hierarchical motion estimation (ME) scheme using the wavelet transformed multi-resolution image layers is proposed. While the coarse-to-fine (CtF) ME, used in previously proposed coding schemes, can provide a better estimate at the coarsest resolution, it is difficult to accurately track motion at finer resolution. On the other hand, in fine-to-coarse (FtC) ME, it can solves this local minima problem by estimating motion track at the finest subband and propagating the motion vector (MV) to coarser subband. But this method causes to higher computational overhead. This paper proposes a new method for reducing the computational overhead of fine-to-coarse rnulti-resolution motion estimation (MRME) at the finest resolution level by searching for the region to consider motion vectors of the coarsest resolution subband.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.1
• /
• pp.97-102
• /
• 2000

Subband coding is to divide the signal frequency band into a set of uncorrelated frequency bands by filtering and then to encode each of these subbands using a bit allocation rationale matched to the signal energy in that subband. The actual coding of the subband signal can be done using waveform encoding techniques such as PCM, DPCM and vector quantizer(VQ) in order to obtain higher data compression. Most researchers have focused on the error in the quantizer, but not on the overall reconstruction error and its dependence on the filter bank. This paper provides a thorough analysis of subband codecs and further development of optimum filter bank design using vector quantizer. We compute the mean squared reconstruction error(MSE) which depends on N the number of entries in each code book, k the length of each code word, and on the filter bank coefficients. We form this MSE measure in terms of the equivalent quantization model and find the optimum FIR filter coefficients for each channel in the M-band structure for a given bit rate, given filter length, and given input signal correlation model. Specific design examples are worked out for 4-tap filter in 2-band paraunitary filter bank structure. These optimum paraunitary filter coefficients are obtained by using Monte Carlo simulation. We expect that the results of this work could be contributed to study on the optimum design of subband codecs using vector quantizer.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.199-202
• /
• 1996

기존의 블록단위 DCT 부호화는 계층에 관계없이 일단 부호화한 후, 신호의 중요도에 따라 지역 성분과 고역 성분으로 계층을 나눈다. 하지만, 웨이브릿과 같은 대역 분할 부호화의 경우는 대역별로 비슷한 통계를 가지므로, 이를 이용하여 계층 부호화를 하면 좀 더 큰 부호화 이득을 가질 수 있다. 따라서, 본 논문에서는 기존의 블록 단위 부화화기 형태를 유지하면서 대역 분할 부호화를 이용한 영상 신호의 계층적 부호화를 제안하였다. 제안된 방법은 먼저 영상을 웨이브릿을 이용하여 대역 분할한 후, 각 대역별로 기존의 JPEG과 같이 블록 단위 DCT-변환 부호화를 수행한다.

• Proceedings of the KIEE Conference
• /
• 1993.11a
• /
• pp.342-345
• /
• 1993

In this paper, we study the structure of the hierarchical coding method of video signal which can contain the multi resolution video signals. To preserve the compatibility with the conventional coding methods. we accomplished a scalable structure using the subband coding, maintaining enoughly the international coding structure. The proposed scheme showed the low PSNR, a little, when compared with the conventional scheme, but showed a good image quality perceptually and proved to have a advantage in the H/W implementation in a view of processing speed.