• Journal of Broadcast Engineering
• /
• v.14 no.2
• /
• pp.144-153
• /
• 2009

Recently, as the necessity of a light-weighted video encoding technique has been rising for applications such as UCC(User Created Contents) or Multiview Video, Distributed Video Coding(DVC) where a decoder, not an encoder, performs the motion estimation/compensation taking most of computational complexity has been vigorously investigated. Wyner-Ziv coding reconstructs an image by eliminating the noise on side information which is decoder-side prediction of original image using channel code. Generally the side information of Wyner-Ziv coding is generated by using frame interpolation between key frames. The channel code such as Turbo code or LDPC code which shows a performance close to the Shannon's limit is employed. The noise model of Wyner-Ziv coding for channel decoding is called Virtual Channel Noise and is generally modeled by Laplacian or Gaussian distribution. In this paper, we propose a Wyner-Ziv coding method based on the frequency-adaptive channel noise modeling in transform domain. The experimental results with various sequences prove that the proposed method makes the channel noise model more accurate compared to the conventional scheme, resulting in improvement of the rate-distortion performance by up to 0.52dB.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.364-367
• /
• 2010

분산 비디오 부호화(Distributed Video Coding: DVC)는 복호화보다 훨씬 적은 계산량으로 부호화를 가능하게 함으로써 계산 성능 및 전력이 제한된 환경을 위한 비디오 부호화 기법으로 주목 받고 있다. 그러나 DVC의 부호화 성능은 아직 기존의 비디오 압축 표준에 많이 미치지 못하고 있으며 이를 극복하기 위한 많은 연구가 진행되고 있다. 본 논문에서는 DVC의 부호화 성능 개선을 위한 율-왜곡 기반의 영역별 선택적 부호화 기법을 제안한다. 제안 기법은 복호기 측에서 보조정보를 얻는 과정에서 얻어지는 움직임 벡터가 부호기 측으로 피드백된다는 가정하에 이를 이용하여 움직임 보상 예측 신호를 구하고 율-왜곡(Rate-Distortion) 기반의 블록 단위로 선택적 부호화를 수행한다. 모의실험을 통하여 본 논문에서 제안한 움직임 정보 피드백을 이용한 율-왜곡 기반의 선택적 블록 부호화 기법이 기존의 DVC 부호화 기법보다 시퀀스에 따라 최대 약 2.25 dB 개선된 성능을 가짐을 보인다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.284-286
• /
• 2011

LDPC(low density parity check) 부호는 낮은 복잡성과 Shannon의 한계에 근접하는 오류 정정 능력을 보이기 때문에 turbo 부호와 함께 많은 응용분야에 적용되고 있다. 본 논문에서는 분산 동영상 부호화(distributed video coding: DVC) 시스템을 위한 부호율 적응적인(rate adaptive) LDPC 부호를 설계하기 위하여 패리티 점검 노드를 병합하는 방법을 제안한다. ACE(approximation cycles EMD) 알고리즘을 기반으로 효율적인 LDPC 부호를 설계하고 부호율 적응적인 특성을 갖기 위해 일정한 범위를 지정하고 지정된 범위에 따라 패리티 점검 노드를 병합한다. 그리고 ACE 알고리즘의 계수와 degree distribution을 변화시키면서 성능을 해석한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.582-584
• /
• 2011

This paper presents a Channel DiVision (CDV) scheme for transform-domain distributed video coding. In the proposed system, we employ the symmetric motion estimation to generate high quality side information for Wyner-Ziv (WZ) frames. Also, the decoder estimates the distortion of the side information, which is used to classify the transmitting channels for WZ frames. Each channel has a different expected noise. Then, the encoder allocates an appropriate number noise. Then, the encoder allocates an appropriate number present rate-distortion performance results and comparisons with existing state-of-the-art algorithms and H.264.

• Journal of KIISE:Software and Applications
• /
• v.31 no.9
• /
• pp.1150-1160
• /
• 2004

In this paper, we propose a new 3D video coding method for heterogeneous display systems and network infrastructure over enhanced Access Grid (e-AG) using spatio-temporal scalability defined in MPEG-2. The proposed encoder produces several bit-streams for providing temporally and spatially scalable 3D video service. The generated bit-streams can be nelivered with proper spatio-temporal resolution according to network bandwidths and processing speeds, visualization capabilities of client systems. The functionality of proposed spatio-temporal scalability can be exploited for construction of highly scalable 3D video service in heterogeneous distributed environments.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.1036-1046
• /
• 2011

MPEG and VCEG have constituted a collaboration team called JCT-VC(Joint Collaborative Team on Video Coding) and have been developing HEVC(High Efficiency Video Coding) standard. All transform coefficients in a TU(Transform Unit) have been equally quantized according to the quantization and inverse quantization method which is used in HEVC standard. Such an equal quantization is not efficient because the transformed coefficients in the TU are not eqully distributed. Furthermore, the quantized coefficients which is positioned in later scanning order cannot be efficient due to the entropy scanning method. We suggest an algorithm that transform coefficients are quantized at different values according to the position in TU considering a scanning order of entropy encoding to improve the coding efficiency. The principle of this algorithm is that quantization and inverse quantization are carried out according to the scanning order which is in accordance with the statistical characteristic of distribution of quantized transform coefficients. The proposed algorithm shows on the average of 0.34% Y BD-rate compression rate improvement.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.66-74
• /
• 2010

Recently distributed video coding (DVC) is spotlighted for the environment which has restriction in computing resource at encoder. Wyner-Ziv (WZ) coding is a representative scheme of DVC. The WZ encoder independently encodes key frame and WZ frame respectively by conventional intra coding and channel code. WZ decoder generates side information from reconstructed two key frames (t-1, t+1) based on temporal correlation. The side information is regarded as a noisy version of original WZ frame. Virtual channel noise can be removed by channel decoding process. So the performance of WZ coding greatly depends on the performance of channel code. Among existing channel codes, Turbo code and LDPC code have the most powerful error correction capability. These channel codes use stochastically iterative decoding process. However the iterative decoding process is quite time-consuming, so complexity of WZ decoder is considerably increased. Analysis of the complexity of LPDCA with real video data shows that the portion of complexity of LDPCA decoding is higher than 60% in total WZ decoding complexity. Using the HDA (Hard Decision Aided) method proposed in channel code area, channel decoding complexity can be much reduced. But considerable RD performance loss is possible according to different thresholds and its proper value is different for each sequence. In this paper, we propose an adaptive HDA method which sets up a proper threshold according to sequence. The proposed method shows about 62% and 32% of time saving, respectively in LDPCA and WZ decoding process, while RD performance is not that decreased.

• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.144-154
• /
• 2011

In this paper, we propose a parallel LDPCA encoding method for fast transform-domain Wyner-Ziv video encoding which is suitable in an ultra fast and low power video encoding. The conventional transform-domain Wyner-Ziv video encoding performs LDPCA channel coding of quantized transform coefficients in bitplane-serial fashion, which takes about 60% of total encoding time, and this computational complexity becomes severer as the bitrate increases. The proposed method binds several bitplanes into one packed message and carries out the LDPCA encoding in parallel. The proposed LDPCA encoding method improves the encoding speed by 8 ~ 55 times. In the experiment, the proposed Wyner-Ziv encoder can encode 700 ~ 2,300 QCIF size frames per second with GOP=64. The method can be applied to the pixel-domain Wyner-Ziv encoder using LDPCA, and has a wide scope of application.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.3
• /
• pp.23-31
• /
• 2010

The increasing demands on low-power, and low-complexity video encoder have been motivating extensive research activities on distributed video coding (DVC) in which the encoder compresses frames without utilizing inter-frame statistical correlation. In DVC encoder, contrary to the conventional video encoder, an error control code compresses the video frames by representing the frames in the form of syndrome bits. In the meantime, the DVC decoder generates side information which is modeled as a noisy version of the original video frames, and a decoder of the error-control code corrects the errors in the side information with the syndrome bits. The noisy observation, i.e., the side information can be understood as the output of a virtual channel corresponding to the orignal video frames, and the conditional probability of the virtual channel model is assumed to follow a Laplacian distribution. Thus, performance improvement of DVC systems depends on performances of the error-control code and the optimal reconstruction step in the DVC decoder. In turn, the performances of two constituent blocks are directly related to a better estimation of the parameter of the correlation channel. In this paper, we propose an algorithm to estimate the parameter of the correlation channel and also a low-complexity version of the proposed algorithm. In particular, the proposed algorithm minimizes squared-error of the Laplacian probability distribution and the empirical observations. Finally, we show that the conventional algorithm can be improved by adopting a confidential window. The proposed algorithm results in PSNR gain up to 1.8 dB and 1.1 dB on Mother and Foreman video sequences, respectively.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.58-66
• /
• 2009

Recently the emerging demands of the light-video encoder promotes lots of research efforts on DVC (Distributed Video Coding). As an appropriate video compression method, DVC has been studied, and Wyner-Ziv (WZ) video compression is its one representative structure. The WZ encoder splits the image into two kinds of frames, one is key frame which is compressed by conventional intra coding, and the other is WZ frame which is encoded by WZ coding. The WZ decoder decodes the key frame first, and estimates the WZ frame using temporal correlation between key frames. Estimated WZ frame (Side Information) cannot be the same as the original WZ frame due to the absence of the WZ frame information at decoder. As a result, the difference between the estimated and original WZ frames are regarded as virtual channel noise. The WZ frame is reconstructed by removing noise in side information. Therefore precise noise estimation produces good performance gain in WZ video compression by improving error correcting capability by channel code. But noise cannot be estimated precisely at WZ decoder unless there is good WZ frame information, and generally it is estimated from the difference of corresponding key frames. Also the estimated noise is limited by comparing with frame level noise to reduce the uncertainty of the estimation method. However these methods cannot provide good noise estimation for every frame or each bit plane. In this paper, we propose a noise nodel selection method which chooses a better noise model for each bit plane after generating candidate noise models. Experimental result shows PSNR gain up to 0.8 dB.