• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.2
• /
• pp.366-385
• /
• 2013

In this paper, we propose a compressed sensing (CS) based Wyner-Ziv (WZ) codec using motion-aligned auto regressive model (MAAR) based side information (SI) extrapolation to improve the compression performance of low-delay distributed video coding (DVC). In the CS based WZ codec, the WZ frame is divided into small blocks and CS measurements of each block are acquired at the encoder, and a specific CS reconstruction algorithm is proposed to correct errors in the SI using CS measurements at the decoder. In order to generate high quality SI, a MAAR model is introduced to improve the inaccurate motion field in auto regressive (AR) model, and the Tikhonov regularization on MAAR coefficients and overlapped block based interpolation are performed to reduce block effects and errors from over-fitting. Simulation experiments show that our proposed CS based WZ codec associated with MAAR based SI generation achieves better results compared to other SI extrapolation methods.

• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.252-261
• /
• 2012

This papers proposes a motion vector coding method which selects the optimal predictive motion vector after excluding some candidate predictive motion vectors in the minimum rate-distortion sense, and prunes the candidate predictive motion vectors by a contradiction testing that operates under a predefined criterion at both encoder and decoder for reducing the signaling information. Experimental results show that the proposed method gains in BDBR by up to 1.8% compared to the H.264/AVC.

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

스케일러블 비디오 코딩은 레이어간 예측 기능을 이용하여 시뮬케스트 코딩에 비해 코딩 효율을 높인다. 하지만 스케일러블 비디오 코딩의 레이어간 예측으로는, 인트라 픽셀(inta pixel). 모션 정보(motion vector information), 레지듀얼(residual)등의 예측이 수행되는데, 이는 많은 계산 시간을 소요하게 되며, 시뮬케스트에 비해 코딩 시간이 증가하게 된다. 특히 인코더의 경우, 가장 최적의 모드를 선택하기 위하여, 기존 H.264 AVC에서 사용하는 예측을 수행한 뒤, 부가적으로 스케일러블 비디오 코딩의 레이어간 예측을 수행하기 때문에, 하나의 영상이 많은 레이어를 포함할수록 인코딩에 의한 계산부하가 매우 증가하게 된다. 본 논문에서는 이를 해결하기 위해, 멀티 코어 이용하여 레이어별로 병렬처리가 가능하도록 하는 스케일러블 비디오 인코더의 구조를 제안한다. 이로써 하나의 영상이 포함하는 레이어의 수가 증가함에 따라 발생하는 인코딩 계산 부하를 줄이도록 하였다. 그리하여 본 논문에서 제안하는 구조를 적용하였을 때, 2개의 공간영역으로의 스케일러빌리티를 가지는 영상들에 대해서는 평균 24.8%의 속도가 향상되었고, 1개의 공간영역과 1개의 화질 영역으로의 스케일러빌리티를 가지는 영상들에 대해서는 평균 82%의 속도 향상을 보였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.108-111
• /
• 2008

In this paper, we propose an advanced hardware architecture for the CAVLC entropy encoder engine for real time Full HD video compression. Since there are 384 data coefficients which are sum of 376 AC coefficient and 8 DC coefficient per one macroblock, 384 coefficient have to be processed per one macroblock in worst case for real time processing. We propose an novel architecture which includes parallel architecture and pipeline processing, and reduction "0" in AC/DC coefficient table. To verify the proposed architecture, we develop the reference C for CAVLC and verified the designed circuit with the test vector from reference C code.

• Journal of Broadcast Engineering
• /
• v.20 no.4
• /
• pp.489-496
• /
• 2015

In this paper, a new weighted prediction scheme is proposed to improve the coding efficiency for video scenes containing brightness variations. Conventional weighted prediction is applied by the reference picture and use only one weighted parameter set. Thus, it is only useful for GBV(Glabal Brightness Variation). In order to solve this problem, the proposed algorithm use three kind of schemes depending on situation. Experimental results show that maximum coding efficiency gain of the proposed method is up to 10.2% in luminance. Average computional time complexity is increased about 163% in encoder and about 101% in decoder.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4C
• /
• pp.329-336
• /
• 2010

Distributed source coding (DSC) system moves computational burden from encoder to decoder, so it takes higher decoding complexity. This paper explores the problem of reducing the decoding complexity of practical Slepian-Wolf coding using low-density parity check accumulate (LDPCA) codes. It is shown that the convergence of mean magnitude (CMM) stopping criteria for LDPC codes help reduce the 85% of decoding complexity under the 2% of compression rate loss, and marginal initial rate request reduces complexity below complexity minimum bound. Moreover, inter-rate stopping criterion, modified for rate-adaptable characteristic, is proposed for LDPCA codes, and it makes decoder perform less iterative decoding than normal stopping criterion does when channel characteristic is unknown.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9A
• /
• pp.868-873
• /
• 2010

H.264/AVC video compression standard has been adopted for DMB, digital TV and various next generation broadcasting, communication and consumer electronics applications, and modern DVR system is also based on H.264/AVC standard. Although PC-based DVRs use PCI bus for main interface typically, H.264/AVC codec for SOCs use AHB bus for host interface. In this paper, we present an implementation of PCI to AHB interface module for H.264/AVC codec to efficiently communicate with a PC and experimental results.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.12
• /
• pp.1792-1798
• /
• 2017

Event Data Recorder(Car Black-Box) with WiFi dongle have been released, and the platform of the majority is the Linux platform. This is because the platform development is possible in little investment cost by reducing the source licensing costs by taking advantage of the open source. But utilizing Linux platform has the limitations of boot-up time and consuming processing power due to the limitation of battery capacity, to be cost-competitive to minimize the use of memory. In this paper, the real-time operating system(RTOS) is utilized to optimize these portions. MP4 encoder and Muxer are developed to be about ten seconds boot up and minimized memory. It has the advantages of operating at lower power consumption than the Linux utilizing WiFi dongle. Utilizing a WiFi dongle is to provide a progressive download feature on smart phones to lower product prices. But RTOS has the weakness in WiFi. Porting TCP /IP, Web and DHCP server and combination with the USB OTG Host interface by implementing the protocol stack are developed for WiFi. And also SPI NOR flash memory is utilized for faster boot time and cost reductions, low processing power to be consume. As the results, the developed proved the 10 seconds booting time, 24 frame rate/sec. and 10% lower power consumption.

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

최근 들어 세계적으로 크게 관심을 받는 메타버스 및 몰입형(가상현실, 확장현실, 및 라이트필드) 콘텐츠 서비스의 응용 범위를 확대하기 위해서는 3D 객체의 실시간 전송을 위한 압축 기술이 필요하다. ISO/IEC 23090 MPEG-I Part 5 로 2021 년 표준화 완료된 V-PCC (Video-based Point Cloud Compression)는 이러한 산업계의 관심 및 필요에 의해서 국제 표준화된 동적 3D 포인트 클라우드 객체 부호화 기술이다. V-PCC 기술의 압축 성능은 기존 산업계 기술에 비해 매우 우수하나, 부호화기의 연산 복잡도가 매우 높다는 단점을 가지고 있다. 본 논문에서는 V-PCC 부호화기에서 가장 높은 연산 복잡도를 갖는 법선 추정 알고리즘의 결합 고속화 기법을 제안한다. 법선 추정은 2 개의 알고리즘으로 구성되어 있다. 첫번째는 "방향을 무시하는 법선 추정 알고리즘(normal estimation)"이고, 두번째는 첫번째 알고리즘에서 추정된 법선들을 대상으로 하는 "법선 방향 추정 알고리즘(normal orientation)"이다. 본 논문에서 제안하는 고속화 기법은 2 개 알고리즘을 결합하여 첫번째 법선 추정 알고리즘에서 획득한 부가 정보를 두번째 법선 방향 추정 알고리즘에서 활용함으로써 연산량을 대폭 줄이고, 또한 법선 방향 추정 알고리즘 내의 우선순위 큐 자료구조를 변경하여 추가적인 고속화를 달성한다. 7 개 테스트 영상에 대한 실험 결과, 압축 효율 저하 없이 법선 방향 추정 알고리즘의 속도를 평균 89.2% 향상시킬 수 있다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.11
• /
• pp.41-47
• /
• 2016

High efficiency video coding (HEVC) employs a coding tree unit (CTU) to improve the coding efficiency. A CTU consists of coding units (CU), prediction units (PU), and transform units (TU). All possible block partitions should be performed on each depth level to obtain the best combination of CUs, PUs, and TUs. To reduce the complexity of block partitioning process, this paper proposes the PU mode skip algorithm with region of interest (RoI) selection using motion vector. In addition, this paper presents the CU depth level skip algorithm using the co-located block information in the previously encoded frames. First, the RoI selection algorithm distinguishes between dynamic CTUs and static CTUs and then, asymmetric motion partitioning (AMP) blocks are skipped in the static CTUs. Second, the depth level skip algorithm predicts the most probable target depth level from average depth in one CTU. The experimental results show that the proposed fast CU decision algorithm can reduce the total encoding time up to 44.8% compared to the HEVC test model (HM) 14.0 reference software encoder. Moreover, the proposed algorithm shows only 2.5% Bjontegaard delta bit rate (BDBR) loss.