• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.161-162
• /
• 2011

Recently, many research works are focusing on DVC (Distributed Video Coding) system for low complexity encoder. However the feedback channel-based parity bit control is a major cause of the high decoding time latency. Spatial and temporal correlation is high in video and, therefore, the statistical property can be applied for the parity bit request of LDPCA frame. By introducing frame adaptive parity bit request estimation method, this paper proposes a new method for reducing the decoding time latency. Through computer simulations, it is shown that the proposed method achieves about 80% of complexity reduction, compared to the conventional no-estimation method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.383-393
• /
• 2010

DVC (Distributed Video Coding) allows us to explore the video statistics at the decoder side, resulting in a less complex encoder and more complex decoder. In this approach, it is important to generate a good prediction to the current Wyner-Ziv frame, called side information, which plays a crucial role in the overall performance of a DVC system. Conventional MCFI (motion compensated frame interpolation) techniques, which explore temporal correlations between neighbor frames of the current frame, preform the block-based or object-based motion estimation, but, they do not include the basis frame for the Wyner-Ziv frame. This paper proposes an efficient way to get better side information, by finding the average frame between neighbor frames and by comparing adaptively the candidate blocks. Through computer simulations, it is shown that the proposed method can improve the performance up to 0.4dB and provide better subjective and objective visual qualities in Wyner-Ziv CODEC.

• The Journal of the Korea Contents Association
• /
• v.12 no.12
• /
• pp.14-24
• /
• 2012

DVC (Distributed Video Coding) techniques need feedback channel for parity bit control to achieve the good RD performances, however, this causes the DVC system to have high decoding latency. In order to implement in real time environments and to accelerate commercializations, many research works have been focusing on the development of fast video decoding algorithm. As one of the real time implementations, this paper deals with a novel DVC scheme suitable for some application areas where source statistics such as motion information can be provided to the encoder side from the decoder side. That is, this paper propose a fast distributed video decoding scheme to improve the decoding speed by using the feedback of motion information derived in SI generation. Through computer simulations, it is shown that the proposed method outperforms the conventional fast DVC decoding schemes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.2
• /
• pp.259-265
• /
• 2012

Recently, many research works are focusing on DVC (Distributed Video Coding) system for low complexity encoder. Most DVC systems need feedback channel for parity bit control to achieve the good RD performances, however, this causes the system to have high decoding latency and is considered as one of the most critical problems for real implementation. In order to overcome this problem, this paper proposes an effective distributed video decoding method using adaptive LDPCA frame-based parity bit request estimation. The proposed method applies for the pixel-domain Wyner-Ziv system and exploits the statistical characteristics between adjacent LDPCA frames to estimate adaptively the parity bit request. Through computer simulations, it is shown that the proposed method achieves about 80% of latency reduction compared to the conventional no-estimation DVC system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.8
• /
• pp.1675-1685
• /
• 2012

DVC (Distributed Video Coding) technique plays an essential role in providing low-complexity video encoder. But, in order to achieve the better rate-distortion performances, most DVC systems need feedback channel for parity bit control. This causes the DVC-based system to have high decoding latency and becomes as one of the most critical problems to overcome for a real implementation. In order to overcome this problem and to accelerate the commercialization of the DVC applications, this paper analyzes an effect of LDPCA frame size for adaptive LDPCA frame-based parity bit request estimations. First, this paper presents the LDPCA segmentation method in pixel-domain and explains the temporal-based bit request estimation method and the spatial-based bit request estimation method using the statistical characteristics between adjacent LDPCA frames. Through computer simulations, it is shown that the better performance and fast decoding is observed specially when the LDPCA frame size is 3168 in QCIF resolution.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.671-675
• /
• 2011

DVC (Distributed Video Coding) and FRUC (Frame Rate Up Conversion) techniques need to have an efficient motion compensated frame interpolation algorithms. Conventional works of these applications have mainly focused on the performance improvement of overall system. But, in some applications, it is necessary to evaluate how well the MCI (Motion Compensated Interpolation) frame matches the original frame. For this aim, this paper deals with the modeling methods for evaluating the block-based matching cost. First, several matching criteria, which have already been dealt with the motion compensated frame interpolation, are introduced and then combined to make estimate models for the size of MSE (Mean Square Error) noise of the MCI frame to original one. Through computer simulations, it is shown that the block-based matching criteria are evaluated and the proposed model can be effectively used for estimating the MSE noise.

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

분산 동영상 부호화 시스템에서는 복호기에서 움직임 보상 보간 기법을 이용하여 부가정보를 생성한다. 생성된 부가정보의 정확성이 Wyner-Ziv 프레임을 복원하기 위한 parity 정보량에 큰 영향을 미치기 때문에 부가정보의 정확한 생성이 분산 동영상 부호화 시스템의 성능에 큰 영향을 미친다. 따라서 본 논문에서는 다양한 부가정보 생성 기법의 성능을 분석하고 효율적인 부가정보 생성 기법을 제안하였다. 또한 생성된 부가정보가 분산 동영상 부호화 시스템의 성능에 미치는 영향을 비교분석 하였다.

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

분산 동영상 부호화 시스템에서는 복호기에서 움직임 보상 보간 기법을 이용하여 부가정보를 생성한다. 생성된 부가정보와 원 Wyner-Ziv 프레임간의 차이를 채널 부호로 오류 정정하게 되는데 이때 부호기에서는 복호기에서의 오류 정정을 위하여 패리티 비트인 Wyner-Ziv 비트를 복호기로 보내게 되고 복호기에서는 이 Wyner-Ziv 비트를 이용하여 Wyner-Ziv 프레임을 복원하는데 더 많은 Wyner-Ziv 비트가 필요할 경우 피드백 채널을 통해 Wyner-Ziv 비트를 요청하게 된다. 이때 부호기에서 조건부 엔트로피를 구할 수 있다면 이를 이용하여 Wyner-Ziv 비트 전송량을 제어함으로써 피드백 채널을 제거 할 수 있다. 이를 위해 부호기에서도 부가정보를 알아야하는데 복호기에서 사용하는 부가정보 생성 기법은 복잡도가 높기 때문에 사용할 수 없다. 본 논문에서는 부호기에서 간단한 부가정보를 생성하는 방법을 제안하고 분산 동영상 부호화 시스템에 적용하여 피드백 채널을 제거하였을 때의 성능을 분석하였다.

• Journal of Broadcast Engineering
• /
• v.18 no.4
• /
• pp.599-608
• /
• 2013

Motion compensated interpolation (MCI) techniques are used for increasing the frame rate and generating the side information in the distributed video coding (DVC) system. In this paper, an efficient MCI technique using the image resizing in the DCT or LiftLT domain is proposed, and the performance of the MCI technique using various sub-pixel generation techniques is analyzed. Extensive computer simulations show that the proposed method produces the superior results compared to the conventional methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.927-929
• /
• 2011

Since DVC (Distributed Video Coding) and FRUC (Frame Rate Up Conversion) techniques need to have an efficient motion compensated frame interpolation algorithms. Conventional works of these applications have mainly focused on the performance improvement of overall system. But, in some applications, it is necessary to evaluate how well the MCI (Motion Compensated Interpolation) frame matches the original frame. For this aim, this paper deals with the modeling methods for evaluating the block-based matching cost. First, several matching criteria, which have already been dealt with the motion compensated frame interpolation, are introduced and then combined to make estimate models for the size of MSE (Mean Square Error) noise of the MCI frame to original one. Through computer simulations, it is shown that the block-based cost evaluation models are tested and can be effectively used for estimating the MSE noise.