• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.97-105
• /
• 1998

Subband/DCT coding has been introduced in order to transmit images of various resultions using one given image-codec, for nowadays there are various grades of quality in visual communication services. However, subband/DCT results in the increawse of multiplication number and memory size. In order to resolve this problem, we propose block-based subband/DCT coding in this paper. In block-based subband/DCT, the number of multiplications is not only reduced because we combine subband decomposistion with DCT, but the size of memory is also reduced because images can be parallel-processed block by block. We show that the number of multiplications is reduced, by analyzing the property ofblock-based subband/DCT matrix mathematically, and examine the performance of proposed coder, which adopts JPEG as backhand-coder after block-based subband/DCT.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.655-658
• /
• 1998

This paper proposes a moving image compression algorithm using subband coding that divides and processes the differential image of each moving image frame into subband frequency. This method decomposes the original image with each subband and performs DCT. The moving blocks are detected from each of wubband using threshold value which is select from the variance of difference between frames. then they are performed SBDCT and huffman coding in order to reduce the data. As the result of simulation, we confirmed that this method improved the blocking effect of reconstructed image in low bit rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1096-1108
• /
• 1996

In this paper, we propose a temporal adaptive tranform 3D SBC coder with motion compensation, exploiting redundancy in the temporal domain. We propose a temporal adaptivity measure, by which the R-D optimal temporal transform can be chaosen. The base temporal subband frame is coded using H.261-like MC-DCT coder, while the higher temporal subband frames are coded using the 2D adaptive wavelet packet bases, considering the various energy distribution which results from the temporal variation. In encoding the subbands, we employ adaptive scanning methods, uniform step-size quantization with VLC, and coded/not-coded flag reduction technique using the quadtree structure. From the simulation results, the proposed adaptive 3D subband coder shows about 0.29~3.14 dB gain over the H.261 and the fixed 3D subband coder techniques.

• ETRI Journal
• /
• v.23 no.4
• /
• pp.190-198
• /
• 2001

The performance of Motion Compensated Discrete Cosine Transform (MC-DCT) video coding is improved by using the region adaptive subband image coding [18]. On the assumption that the video is acquired from the camera on a moving platform and the distance between the camera and the scene is large enough, both the motion of camera and the motion of moving objects in a frame are compensated. For the compensation of camera motion, a feature matching algorithm is employed. Several feature points extracted using a Sobel operator are used to compensate the camera motion of translation, rotation, and zoom. The illumination change between frames is also compensated. Motion compensated frame differences are divided into three regions called stationary background, moving objects, and newly emerging areas each of which is arbitrarily shaped. Different quantizers are used for different regions. Compared to the conventional MC-DCT video coding using block matching algorithm, our video coding scheme shows about 1.0-dB improvements on average for the experimental video samples.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.06a
• /
• pp.25-29
• /
• 1997

The present block-based DCT encoder transforms images regardless of layers and then simply partitions the transformed data into a few layers, for example low and high frequency bands in JPEG. Yet, it fails to utilize the similarity of coefficients in each band. Therefore, we combine the subband coder and the block-based DCt coder in this paper. The new coding scheme enables the data to automatically be classified into several layers and increases the efficiency of transform. Various possible coding structures are investigated and the simulation results are also provided.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.10
• /
• pp.99-111
• /
• 1994

A motion picture compression scheme using subband coding with motion compensation is presneted in this paper. A hierarchical subband decomposition is used to split the image signal into 10 subbands with a 3-layer pyramid structure and motion compensation is used in each band. However, in this case, motion vector information is drastically increased; therefore, initial motion vectors are estimated in the highest pyramid and motion vectors are refined using the reconsructed subband signal in each layer. Simulation results show that the proposed method compares favorably in terms of prediction error energy and side informatio with methods requiring additional information. Images recostructed from the proposed method show good quality compared to those reconstructed using blockwise DCT.

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

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

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.695-704
• /
• 2003

A wavelet-based video stream is more susceptible to the network transmission errors than DCT-based video. This is because bit-errors in a subband of a video frame affect not only the other subbands within the current frame but also the subsequent frames. In this paper, we propose a video source coding scheme called IPC(Intra Prediction Coding) scheme in order to reduce the error propagation to the subsequent frames. In the proposed scheme, a subband except LL subband in the current frame refers to the lower-level subband within the same frame. This reduces the error propagation to subsequent frames. We evaluated the performance of our proposed scheme in the simulated wireless network environment. As a result of tests, it was shown that the proposed algorithm shows better performance than MRME in a heavy motion image sequence while IPC outperforms MRME at a high bit-rate in small motion image sequence.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1329-1336
• /
• 1996

In many image compression applications, the discrete cosine transform (DCY) is well known for is highly efficient coding performance. However, it produces undesirable block artifacts in low-bit rate coding. In addition, in many practical applications, faster computation and easier VLST implementation of DCT coefficients are also important issues. The removal of the block artifacts and faster DCT computation are therefor of practical interest. In this paper, a modified DCTcomputation scheme was investigated, which provides a simple efficient solution to the reduction of the block artifacts while achieving faster computation. We have applied the new ap-proach to the low-bit rate coding and decoding of images. Simulation results on real images have verified the improved performance of the proposed method over the standar d method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2C
• /
• pp.113-123
• /
• 2007

In Ubiquitous communication environment, various conversions of images are essential, and most digital images are compressed by standard methods such as the Joint Photographic Expert Group (JPEG) and Motion Picture Expert Group (MPEG) which are based on the discrete cosine transform (DCT). In this paper, various image resizing algorithms in the DCT domain are analyzed, and a new image resizing algorithm, which shows superior performance compared with the conventional methods, is proposed. For arbitrary-ratio image resizing in the DCT domain, several blocks of $8{\times}8$ DCT coefficients are converted into one block using the conversion formula in the proposed algorithm, and the size of the inverse discrete cosine transform (IDCT) is decided optimally. The performance is analyzed by comparing the peak signal to noise ratio (PSNR) between original images and converted images. The performance of the proposed algorithm is better than that of the conventional algorithm, since the correlation of pixels in images is utilized more efficiently.