• The Journal of the Korea Contents Association
• /
• v.7 no.12
• /
• pp.303-310
• /
• 2007

Compressed video bitstreams are intended for real-time transmission over communication networks. Because video compression algorithms eliminate the temporal, spatial, and statistical redundancies, the coded video bitstreams are very sensitive to transmission errors. We propose an error resilient video coding technique to limit the effect of error propagation in low bit-rate video coding. The success of error resilient coding techniques relies on how accurately the transmission errors can be detected. To detect the transmission error, we propose a very simple error detection technique based on data hiding Next, we conceal the corrupted MB data using intra MB refresh and motion compensation with the estimated motion vector and compare the simulation results. This method will be useful in video communication in error Prone environment such as WCDMA networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8C
• /
• pp.1125-1132
• /
• 2004

In this Paper, we Propose an effective boundary matching based error detection algorithm using causal neighbor blocks to improve video quality degraded from channel error in block-coded video. The proposed algorithm first calculates boundary mismatch powers between a current block and each of its causal neighbor blocks. It then decides that a current block should be normal if all the mismatch powers are less than an adaptive threshold, which is adaptively determined using the statistics of the two adjacent blocks. In some experiments under the environment of 16bi1s burst error at bit error rates (BERs) of 10$^{-3}$ -10$^{-4}$ , it is shown that the proposed algorithm yields the improvements of maximum 20% in error detection rate and of maximum 3.5㏈ in PSNR of concealed kames, compared with Zeng's error detection algorithm.

• Journal of Broadcast Engineering
• /
• v.2 no.2
• /
• pp.206-215
• /
• 1997

We pror.a;e a H.263-based video ceder with two-layer ocalability. The bare layer is ceded by using the default H.263 axling algorithms to achieve high compresred video data and the enhanced layer is axied by enhanced axling such as HVS-based quantization updating. The enhanced layer contains only arled refinement data for the OCT coefficients of the bare layer. Bitstream syntax and semantics for enhancement layer are designed and quantizer design using the HVS is pror.ooed. Data from the two layers are combined after inverse quantization and inverse OCT prcx:esses in the deaxier. We show with e~rirrental results that the pror.a;ed layered arlee achieves comparable picture quality with non-layered arlee at bitrates of 30 kbr;s or less. Overhead information for the bitstream layer can 00 limited to less than 0.5 kbits/frame.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1384-1392
• /
• 1999

A high compression rate is required to transmit video sequences over low bit rate networks such as low bit rate communication channels. When highly compressed videos are transmitted over mobile channels of high error rate, bitstreams corrupted by channel errors are not only difficult to be decoded, but also have fatal effects on the other parts of the bitstreams. In this Paper, we propose an error concealment algorithm for recovering the blocks which can not be decoded due to damaged bitstreams. The proposed error concealment algorithm recovers the damaged blocks using the information of adjacent blocks which are correctly decoded. In the proposed algorithm, the motion vector of the damaged block is estimated using the overlapped block motion compensation(OBMC) and block boundary matching(BBM) techniques. Experiment results show that the proposed algorithm exhibits better performance in PSNR than existing error concealment methods.

• 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.2 no.2
• /
• pp.146-155
• /
• 1997

The new video coding standard Iv1PEG-4 is enabling content-based functionalities. It requires a prior decomposition of sequences into video object planes (VOP's) so that each VOP represents moving objets. This paper addresses an image segmentation method for separating moving objects from still background (non-moving area) in video sequences using a statistical hypothesis test. In the proposed method. three consecutive image frames are exploited and a hypothesis testing is performed by comparing two means from two consecutive difference images. which results in a T-test. This hypothesis test yields a change detection mask that indicates moving areas (foreground) and non-moving areas (background), Moreover. an effective method for extracting

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.285-287
• /
• 1998

본 논문에서는 다양한 멀티미디어 스트림(multimedia stream)을 재생할 수 있는DirectShow SDK를 이용하여, 비디오의 특수효과를 구현하기 위한 변환 필터(Transform filter) 제작 방법에 대해 소개한다. DirectShow는 여러 가지 포맷(MPEG, AVI, MOV, WAV)으로 부호화된 digital movie나 sound를 재생할 수 있는 run-time(.ock)과 dynamic-link library (DLLs)를 제공하여 필터의 제작을 용이하게 한다. 본 논문에서는 디지털 영상 특수효과 중에서 Clip이라는 특수효과를 예로하여 변환 필터를 제작하는 방법을 소개한다. 또한 DirectShow Documentation에서 제공된 변환방법을 수정하여 변환필터의 입력 pin에서 출력 pin으로의 불필요한 복사를 줄임으로써 수행 속도를 개선하는 특수효과 구현 방법을 제시한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.06a
• /
• pp.101-104
• /
• 2022

MPEG Immersive Video (MIV) 표준화 기술은 다시점 영상 부호화 시 비디오 코덱의 부담을 최소화하기 위해 각 시점 영상의 차분 정보만을 표현하는 처리 기술을 바탕으로 하고 있다. 본 논문에서는 시점 간 중복성 제거를 진행하는 과정인 프루닝(pruning) 과정에서 복잡도 절감을 위해 병렬처리에 용이하도록 구성되는 프루닝 클러스터 그래프에 대해 서술하고, 각 클러스터 그래프 별 구성 전략에 따른 성능 분석을 진행한다. 클러스터 그래프 내에서 중복성 제거를 진행하지 않고 완전한 정보를 보존하는 바탕 시점(basic view)의 개수가 적게 포함될수록 처리할 전체 픽셀 화소율(pixel rate)은 감소하지만, 복원 화질 역시 감소하며 프루닝 복잡도는 증가하는 경향을 보인다. 실험 결과를 통해 프루닝 클러스터 그래프 구성에 따른 트레이드오프를 탐색하고, 최적화된 그래프 구성 전략에 따라 몰입형 비디오의 효율적인 전송이 가능함을 보인다.

• Journal of Broadcast Engineering
• /
• v.11 no.1 s.30
• /
• pp.116-129
• /
• 2006

The progress of data transmission technology through the Internet has spread a variety of realistic contents. One of such contents is multi-view video that is acquired from multiple camera sensors. In general, the multi-view video processing requires encoders and decoders as many as the number of cameras, and thus the processing complexity results in difficulties of practical implementation. To solve for this problem, this paper considers a simple multi-view system utilizing a single encoder and a single decoder. In the encoder side, input multi-view YUV sequences are combined on GOP units by a video mixer. Then, the mixed sequence is compressed by a single H.264/AVC encoder. The decoding is composed of a single decoder and a scheduler controling the decoding process. The goal of the scheduler is to assign approximately identical number of decoded frames to each view sequence by estimating the decoder utilization of a Gap and subsequently applying frame skip algorithms. Furthermore, in the frame skip, efficient frame selection algorithms are studied for H.264/AVC baseline and main profiles based upon a cost function that is related to perceived video quality. Our proposed method has been performed on various multi-view test sequences adopted by MPEG 3DAV. Experimental results show that approximately identical decoder utilization is achieved for each view sequence so that each view sequence is fairly displayed. As well, the performance of the proposed method is examined in terms of bit-rate and PSNR using a rate-distortion curve.

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

In this paper, we propose an adaptive in-loop filter to improve the coding efficiency. Recently, there are post-filter hint SEI and block-based adaptive filter control (BAFC) methods based on the Wiener filter which can minimize the mean square error between the input image and the decoded image in video coding standards. However, since the post-filter hint SEI is applied only to the output image, it cannot reduce the prediction errors of the subsequent frames. Because BAFC is also conducted with a deblocking filter, independently, it has a problem of high computational complexity on the encoder and decoder sides. In this paper, we propose the low-complexity adaptive in-loop filter (LCALF) which has lower computational complexity by using H.264/AVC deblocking filter, adaptively, as well as shows better performance than the conventional method. In the experimental results, the computational complexity of the proposed method is reduced about 22% than the conventional method. Furthermore, the coding efficiency of the proposed method is about 1% better than the BAFC.