• Journal of Biomedical Engineering Research
• /
• v.20 no.3
• /
• pp.265-274
• /
• 1999

In this paper, we propose a novel interframe coding algorithm especially appropriate for 3-D medical images. The proposed algorithm is based on a video coding algorithm using motion estimation/ compensation and transform coding. In the algorithm, warping is adopted lor motion compensation (MC). Then, by using adaptive mode selection, a motion compensated residual image and original image are mixed up in the wavelet transform domain for improvement in coding performance. The mixed image is then compressed by the zerotree coding method. We prove that the adaptive mode selection technique in the wavelet transform domain is very useful lor 3-D medical image coding. Simulation results show that the proposed scheme provides good performance regardless of inter-slice distance and is prospective for 3-D medical image compression.

• Journal of Biomedical Engineering Research
• /
• v.18 no.3
• /
• pp.223-231
• /
• 1997

In this paper, an interframe coding method for volumetric medical images is proposed. By treating interslice variations as the motion of bones or tissues, we use the motion compensation (MC) technique to predict the current frame from the previous frame. Instead of a block matching algorithm (BMA), which is the most common motion estimation (ME) algorithm in video coding, image warping with biolinear transformation has been suggested to predict complex interslice object variation in medical images. When an object disappears between slices, however, warping prediction has poor performance. In order to overcome this drawback, an overlapped block motion compensation (OBMC) technique is combined with carping prediction. Motion compensated residual images are then encoded by using an embedded zerotree wavelet (EZW) coder with small modification for consistent quality of reconstructed images. The experimental results show that the interframe coding suing warping prediction provides better performance compared with interframe coding, and the OBMC scheme gives some additional improvement over the warping-only MC method.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.4
• /
• pp.29-34
• /
• 2001

In this paper, we designed an LSF coefficient quantizer of the wideband speech codec that can produce high quality speech service. For the efficient LSF coefficient quantizer, the interframe correlation was used. Also we separately quantized the LSF coefficients with high and low interframe correlation. Predictive pyramid vector quantizer (PVQ) was used for quantizing the LSF coefficients with high interframe correlation, and PVQ was used for quantizing the LSF coefficients with low interframe correlation. Experiments show that the proposed UF quantizer can quantize LSF information in 40 bits/frame, with an average spectral distortion (SD) of 1 dB and less than 3.87% frames having SD greater than 2 dB.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.3 s.303
• /
• pp.53-62
• /
• 2005

In the decoding process of interframe Wavelet coding, the Wavelet transform requires huge computational complexity. Since the decoder may need to be used in various devices such as PDAs, notebooks, or PC, the decoder's complexity should be adapted to the processor's computational power. So, it is natural that the low complexity codec is also required for scalable video coding. In this paper, we develop a method of controlling and lowering the complexity of the spatial Wavelet transform while sustaining the same coding efficiency as the conventional spatial Wavelet transform. In addition, the proposed method may alleviate the ringing effect for slowly changing image sequences.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1707-1714
• /
• 1997

This paper proposes a novel algorithm for fractal coding of image sequence, based on the CPM (Circular Prediction Mapping) and the NCIM (Non Contractive Interframe Mapping). In the CPM and the NCIM, each range block is approximated by a domain block in the adjacent frame, which is of the same size as the range block. Also, in this paepr, we propose a coding scheme of color components and an algorithm for controlling the bit rate, resepectively, for practical implementation of the fractal coder. The computer simulation results on real image sequences demonstrate that the proposed algorithm provides very promising performance at low bit-rate, below 256 Kbps.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.211-220
• /
• 2002

In this paper, we propose an efficient algorithm to compress simple computer cell animation at very low bit rate. The structure of proposed algorithm consists of intra frame coding and inter frame coding. In inter frame coding, animation is encoded by color quantization using a palette, rearrangement of index, ADPCM used in JPEG-LS, mapping, classification, and entropy coding. In interframe coding, classifying the characteristics of motion, animation is encoded by block based motion replenishment. Experimental results show that the proposed methods turns out to outperform conventional methods including Flash, FLC, Motion-JPEG, MPEG-1, and MPEG-4.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.236-239
• /
• 1988

Prediction errors generated by motion compensated coding are coded with transform coding techniques as DCT. The performance of transform coding techniques are lowered mainly due to the source characteristics with a great deal of zero populations and plus-minus sign changes, i.e., low correlation. In this paper a transform coding scheme which adopts a decomposition of prediciton errors into two sources is proposed and compared its performance with conventional scheme.

• The KIPS Transactions:PartB
• /
• v.13B no.3 s.106
• /
• pp.245-254
• /
• 2006

In this work, a new rate control algorithm for transmission of H.264/AVC video bit stream through CBR(constant bit rate) channel is proposed. The proposed algorithm predicts target bit rate and MAD(mean of absolute difference) for current frame considering image complexity variance between neighboring backward and current images. In details, respective linear regression analysis for MAD and encoded bit rate against image complexity variance produce correlation parameters. Additionally, it uses frame skip technique to maintain bit stream within a manageable range and protect buffer from overflow or underflow. Implementation and experimental results show that the proposed algorithm can provide accurate bit allocation, and can effectively visual degradation after scene changes. Also our proposed algorithm encodes the video sequences with less frame skipping compared to the existing rate control for H.264/AVC.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.11
• /
• pp.7582-7588
• /
• 2015

Noncoherent receivers are favored for block-code-modulated ultrawideband impulse radio (UWB-IR) systems because of their low implementation complexity compared with coherent rake receivers. However, existing noncoherent schemes, such as transmitted reference (TR) systems and averaged differential receivers (ADR), suffer from performance degradation and energy efficiency loss. Codeword matching and signal aggregation (CMSA) is a low complexity noncoherent receiver for UWB-IR. As the frame/symbol duration is shortened to boost data rate, interframe interference (IFI) or intersymbol interference (ISI) occurs and degrades the detection performance of CMSA. In this paper, block coded correlator which consists of the delay components and the reference signal is proposed to improve the performance of the receiver. Simulation results show that the proposed system leads to the better performance compared to the conventional CMSA receiver.