• Journal of Broadcast Engineering
• /
• v.16 no.2
• /
• pp.274-292
• /
• 2011

This paper proposes an efficient coding method of the depth-map which is different from the natural images. The depth-map are so smooth in both inner parts of the objects and background, but it has sharp edges on the object-boundaries like a cliff. In addition, when a depth-map block is decomposed into bit planes, the characteristic of perfect matching or inverted matching between bit planes often occurs on the object-boundaries. Therefore, the proposed depth-map coding scheme is designed to have the bit-plane unit coding method using the adaptive XOR method for efficiently coding the depth-map images on the object-boundary areas, as well as the conventional DCT-based coding scheme (for example, H.264/AVC) for efficiently coding the inside area images of the objects or the background depth-map images. The experimental results show that the proposed algorithm improves the average bit-rate savings as 11.8 % ~ 20.8% and the average PSNR (Peak Signal-to-Noise Ratio) gains as 0.9 dB ~ 1.5 dB in comparison with the H.264/AVC coding scheme. And the proposed algorithm improves the average bit-rate savings as 7.7 % ~ 12.2 % and the average PSNR gains as 0.5 dB ~ 0.8 dB in comparison with the adaptive block-based depth-map coding scheme. It can be confirmed that the proposed method improves the subjective quality of synthesized image using the decoded depth-map in comparison with the H.264/AVC coding scheme. And the subjective quality of the proposed method was similar to the subjective quality of the adaptive block-based depth-map coding scheme.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.42 no.1
• /
• pp.41-46
• /
• 2005

A new multiple description selective coding is proposed to overcome noisy channels. Our algorithm adopts an embedded coding scheme, in which subband coefficients are encoded one bit plane at a time using a non-adaptive arithmetic encoder. According to the importance ratio for each region, we code interest regions with more passes than background in order to reconstruct interest regions with higher quality. To overcome channel errors, we adopt multiple description scheme which adds controlled amounts of redundancy to the original data during the compression process. Proposed algorithm achieves better qualify compared with other algorithms especially in the circumstances where very low bit rate coding is required and some regions are more important than other regions.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.10
• /
• pp.1225-1233
• /
• 1988

In this paper, several simple approaches to Laplacian pyramid coding have been presented for obtaining reasonably acceptable image quality even at low bit rates of 0.3-0.5 bits/pel. For this purpose, the feedback construction of each Lapliacian plane, 3-dimensional prediction and three-level center-clipping quantization are introduced into the coding procedures. For greatly reducing the bit rate of the bottom layer, two new schemes of conditional transmission and edge sharpening without transmission are used. In experiments, our latter sheme has yielded the total bit rate of about 0.3 bits/pel while retaining reasonably acceptable image quality.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2267-2270
• /
• 2003

This paper has been studied to implement MQ encoder in JPEG2000 on FPGA. In the JPEG2000 architecture, Each of coding passes collects contextual information about the bit-plane data. An MQ coder uses contextual information and its internal state to decode a compressed bit-stream. This paper draws up JPEG2000 Standard Part 1: FCD 15444-1 It is simulated with Modelsim and tested with JBIG2 data.

• Journal of Digital Contents Society
• /
• v.17 no.6
• /
• pp.593-601
• /
• 2016

This paper is related to the Region-based Spectral Correlation Estimation(RSCE) coding method that makes it possible to achieve the high-compression ratio by estimating color component images from luminance image. The proposed method is composed of three steps. First, Y/C bit-plane summation image is defined using normalized chrominance summation image and luminance image, and then the Y/C bit-plane summation image is segmented for extracting the shape information of the regions. Secondly, the scale factor and the offset factor minimizing the approximation square errors between luminance image and R, B images by the each region are calculated. Finally, the scale factor and the offset factor for the each region are encoded into bit stream. Referring to the results of computer simulation, the proposed method provides more than two or three times higher compression ratio than JPEG/Baseline or JPEG2000/EBCOT algorithm in terms of bpp needed for encoding two color component images with the same PSNR.

• Journal of Broadcast Engineering
• /
• v.14 no.5
• /
• pp.551-560
• /
• 2009

This paper proposes a method for efficient lossless depth map coding for MPEG 3D-Video coding. In general, the conventional video coding method such as H.264 has been used for depth map coding. However, the conventional video coding methods do not consider the image characteristics of the depth map. Therefore, as a lossless depth map coding method, this paper proposes a bit-plane based lossless depth mar coding method by using the MPEG-4 Part 2 shape coding scheme. Simulation results show that the proposed method achieves the compression ratios of 28.91:1. In intra-only coding, proposed method reduces the bitrate by 24.84% in comparison with the JPEG-LS scheme, by 39.35% in comparison with the JPEG-2000 scheme, by 30.30% in comparison with the H.264(CAVLC mode) scheme, and by 16.65% in comparison with the H.264(CABAC mode) scheme. In addition, in intra and inter coding the proposed method reduces the bitrate by 36.22% in comparison with the H.264(CAVLC mode) scheme, and by 23.71% in comparison with the 0.264(CABAC mode) scheme.

• Journal of Broadcast Engineering
• /
• v.18 no.4
• /
• pp.647-650
• /
• 2013

HEVC RExt(High Efficiency Video Coding Range Extension) set a goal to support RGB/YUV 4:2:2 4:4:4 color sampling and over 10 bit-depth images. Unlike the previous 4:2:0 color sampling images, RGB images have the high correlation in inter-color planes. Using this characteristic, some methods which are contributed in JCT-VC standardization meetings estimate the pixel values of inter-color plane. But when we use the estimation of inter-color plane in RGB images, high frequency components of RGB images are caused to reduce the coding efficiency because they usually have the low inter-color plane correlation. Therefore, in this paper, we propose an adaptive low pass filtering method in the inter-color plane estimation. Using this method, we can improve the estimation efficiency of inter-color plane in RGB images. The experimental results with HEVC RExt RGB test sequences show that the proposed method has 0.6% BD(Bjontegaard Distortion)-rate gain and some increased complexity compared to the previous inter-color plane estimation method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.151-154
• /
• 2001

본 연구는 웹 카메라에 적용하기 위한 JPEG2000의 주요 블록인 EBCOT(Embedded Block Coding with Optimized Truncation)의 설계 및 구현에 관한 연구이다. EHCOT 블록은 웨이블렛(wavelet)변환에 의해 분할된 각 sub-band에 존재하는 주위 화소 값들과 상위 bit-plane의 값들에 대한 상호 연관성을 조사하여 context을 추출하고 그 context를 이용하여 엔트로피 부호화(entropy coding)를 수행하는 T1(Tier 1) 블록과 bit-stream을 구성하는 T2(Tier 2) 블록으로 구성된다. 본 논문에서는 JPEG2000에서 전체 압축성능을 좌우하는 EBCOT의 T1 블록을 Synopsys tool을 이용하여 설계하고 구현하였다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.160-172
• /
• 2014

Although Wyner-Ziv (WZ) video coding proves useful for applications employing encoders having restricted computing resources, the WZ decoder has a problem of excessive decoding complexity. It is mainly due to its iterative LDPC channel decoding process which repeatedly requests incremental parity data after iterative channel decoding of parity data received at each request. In order to solve the complexity problem, we divide bit planes into two groups and estimate the minimum required number of parity requests separately for the two groups of bit planes using bit plane correlation. The WZ decoder executes the iterative decoding process only after receiving parity data corresponding to the estimated minimum number of parity requests. The proposed method saves about 71% of the computing time in the LDPC decoding process.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2363-2366
• /
• 2003

With the increasing use of multimedia technologies, image compression requires higher performance as well as new features such as embedded Tossy to lossless coding, various progressive order, error resilience and region-of-interest coding. In the specific area of still image encoding, a new standard, the JPEG2000, has been currently developed. This paper presents a new compression scheme based on JPEG2000. In the proposed scheme, gray coding is applied to the wavelet coefficient. Since gray coding produces an image whose bit plane is will clustered. The proposed method improves compression efficiency of the JPEG2000.