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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.306-309
• /
• 2008

A system realization for video surveillance with interframe probability distribution analysis is presented in this paper. The system design is based on a high performance DSP processor, video surveillance is implemented by analyzing interframe probability distribution for scanning objects in a restricted area and the video analysis algorithm is decided for forming a different image from the probability distribution of several frames compressed by the standardized JPEG. The algorithm processing time of D1($720{\times}480$) image per frame is 85ms.

• ETRI Journal
• /
• v.24 no.4
• /
• pp.280-289
• /
• 2002

In this work, we present a novel approach to the bit allocation problem that aims to minimize overall distortion subject to a bit rate constraint. The optimal solution can be found by the Lagrangian method with dynamic programming. However, the optimal bit allocation for block-based interframe coding is practically unattainable because of the interframe dependency of macroblocks caused by motion compensation. To reduce the computational burden while maintaining a result close to the optimum, i.e., near optimum, we propose an alternative method. First, we present a partitioned form of the bit allocation problem: a "frame-level problem" and "one-frame macroblock-level problems." We show that the solution to this new form is also the solution to the conventional bit allocation problem. Further, we propose a bit allocation algorithm using a "two-phase optimization technique" with an interframe dependency model and a rate-distortion model.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.157-160
• /
• 2007

System realization and video watermarking using spatial and interframe information is presented in this paper. The system is constructed with DSP processor to process compression and watermark algorithm with real time. Video watermark algorithm is used the watermark insertion using the spatial and interframe. As a results, the processing time of D1 image per frame is 32.1msec in DSP.

• 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 Korean Institute of Intelligent Systems
• /
• v.8 no.6
• /
• pp.122-128
• /
• 1998

This paper presents compression of image sequences based on the classification of interframe difference image blocks. classification process consists of image activity classification and energy distribution classification. In the activity classification, interframe difference image blocks are classified into activity blocks and non-activity blocks using the edge detection. In the distribution classification, activity blocks are further classified into vertical blocks, horizontal blocks, and small activity blocks using the AC energy distribution features. The RBFN, trained with numerical classification results, successfully classifies difference image blocks according to image details. Image sequence compressing based on the classification of interframe difference image blocks using the RBFN shows better compression results and less training time than the classical sorting method and the MLP network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.6
• /
• pp.1064-1069
• /
• 2008

A system design and realization for video surveillance with interframe probability distribution analyzation is presented in this paper. The system design is based on a high performance DSP professor, video surveillance is implemented by analyzing interframe probability distribution using trivariate normal distribution(weight, mean, variance) for scanning objects in a restricted area and the video analysis algorithm is decided for forming a different image from the probability distribution of several frame compressed by the standardized JPEG. The system processing time of D1$(720{\times}480)$ image per frame is 85ms and enables to process the system at 12 frames per second. An object surveillance about the restricted area by rules is extracted to 100% unless object is moved faster.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1454-1456
• /
• 1987

Space domain image coding with VQ [9, 10, 11] has been very effective at low rates. To achieve quality at lower rates, it is necessary to exploit spaial redundancy over a larger region of pixels than is possible with general VQ. This paper presents a interframe coding algorithm which is capable of obtaining better performance and lower bi t rate than those of the general interframe coding. The performance is evaluated on the basis of SNR (Signal to Noise Ratio), memory requirements and bit rate.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.1
• /
• pp.72-80
• /
• 1988

In this paper, new adaptive interframe filtering methods have been proposed to separate the luminance and chrominance components in NTSC composite signals. In thess methods, the composite signals are adaptivelty processed in three dimensions according to the local change or movement of the picture. For interframe processing, two algorithms have been proposed which adapt three filters in the horizontal, vertical and temporal directions to the magnitude f detection signal dependent upon both the movement and local change of the picture. The three kind of filters have been used at the sampling rate of four times the subcarrier frequency. The various quantitative measures have been introduced to compare the objective performance of the conventional methods and that of proposed ones by computer simulation.

• ETRI Journal
• /
• v.28 no.2
• /
• pp.145-154
• /
• 2006

In the decoding process associated with interframe wavelet coding, the inverse wavelet transform requires high computational complexity. However, as video technology starts to pervade all aspects of our lives, decoders are becoming required in various devices such as PDAs, notebooks, PCs, and set-top boxes. Therefore, a decoder's complexity needs to be adapted to the processor's computational power, and consequently a low-complexity codec is also required for scalable video coding. In this paper, we propose a method of controlling and lowering the complexity of the spatial wavelet transform while sustaining the same coding efficiency as that currently afforded. In addition, the proposed method may alleviate the ringing effect for slowly changing image sequences.