• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2016.11a
• /
• pp.107-109
• /
• 2016

본 논문에서는 4K UHD 입력 영상을 실시간으로 부호화하기 위해 적용되는 GOP 단위 또는 IDR 주기 단위의 병렬 부호화 구조를 지원하도록 R-${\lambda}$ 모델 기반의 율 제어 방법을 개선하는 비트 분배(bit allocation) 방법을 제안한다. GOP 단위 또는 IDR 주기 단위의 병렬 부호화기 내에서 율 제어기를 작동시키는 경우, 계층적 B 구조에서 같은 계층에 있는 프레임 간에는 상호간에 얼마만큼의 비트를 소모 하였는지에 대한 정보를 공유 할 수 없기 때문에 기존의 비트 분배 방식으로는 비트 예산(bit budget) 관리가 불가능하다. 이를 해결하기 위해 본 논문에서는, 기존의 R-${\lambda}$ 모델 기반 율 제어 방법을 개선하여 부호화 순서에 의한 시간 순서 방향의 비트 예산 갱신 기반 비트 분배하던 방식으로부터, GOP 마다 비트를 할당한 후 계층적 B 구조에서의 계층이 깊어지는 방향으로 비트 예산을 갱신하여 비트를 분배하는 방식으로 율 배분 방식을 개선하였다. 실험 결과를 통해 R-${\lambda}$ 모델 기반 율 제어의 기존 비트 분배 방식보다 제안 방법에 의한 목표 비트 율 달성 오차가 감소함을 확인하였다.

• Journal of Broadcast Engineering
• /
• v.22 no.2
• /
• pp.193-206
• /
• 2017

In this paper, we propose a rate control method based on the $R-{\lambda}$ model that supports a parallel encoding structure in GOP levels or IDR period levels for 4K UHD input video in real-time. For this, a slice-level bit allocation method is proposed for parallel encoding instead of sequential encoding. When a rate control algorithm is applied in the GOP level or IDR period level parallelism, the information of how many bits are consumed cannot be shared among the frames belonging to a same frame level except the lowest frame level of the hierarchical B structure. Therefore, it is impossible to manage the bit budget with the existing bit allocation method. In order to solve this problem, we improve the bit allocation procedure of the conventional ones that allocate target bits sequentially according to the encoding order. That is, the proposed bit allocation strategy is to assign the target bits in GOPs first, then to distribute the assigned target bits from the lowest depth level to the highest depth level of the HEVC hierarchical B structure within each GOP. In addition, we proposed a processing method that is used to improve subjective image qualities by allocating the bits according to the coding complexities of the frames. Experimental results show that the proposed bit allocation method works well for frame-level parallel HEVC software encoders and it is confirmed that the performance of our rate controller can be improved with a more elaborate bit allocation strategy by using the preprocessing results.

• Journal of Digital Contents Society
• /
• v.16 no.5
• /
• pp.775-781
• /
• 2015

EBS started 2HD MMS experimental broadcasting for the first time in Korea on Feb. 11, 2015. It uses the picture compression technique based on MPEG-2 CODEC, and applies the result of the experiment about variable bit rates and changes according to the scanning types, 1080i and 720p. But when changing channels, the delay in displaying picture occurs because of the operation of the variable GOP on MMS broadcasting, which optimizes image quality by application variable bit rates. In this study, verified the relationship between the decoding time of I frames and the GOP set in the encoding step by experimenting and analyzing ON-AIR TS. By using the verification data and adjusts the Encoder GOP parameters, improved the different video display time delays according to the scanning mode 1080i and 720p.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2005.11a
• /
• pp.25-28
• /
• 2005

디지틸 멀티미디어 시대를 맞이하여 영상통신 기술이 급속히 발전함에 따라 보다 사실감과 몰입감을 줄 수 있는 3차원 입체 영상처리에 대한 관심이 커지고 있다. 최근 국내외 연구기관에서 다차원 멀티미디어 서비스 개발을 위한 연구가 활발히 진행되고 있으며, MPEG 표준화 그룹에서도 H.264/AVC 압축 방법을 이용한 다시점 비디오 부호화(multi-view video coding, MVC) 방법들이 제안되었다. 본 논문에서는 격자 피라미드 GOP 구조 기반의 다시점 비디오 부호화 방법에 대해 기술하였다. 이 방법은 현재 MPEG 표준화 그룹에서 권고된 ‘Anchor’ 방법에서 고려치 못한 인접 시점간의 공간적인 상관도를 효과적으로 활용하기 위해 격자 GOP구조를 제안했고, 각 시점에 대한 효율적인 부호화를 위해 계층적 피라미드 GOP 구조를 이용하였다. 또한, 공간적인 예측의 경우에 시점간의 전체 변이 (global disparity)를 고려하여 가변적인 탐색 범위를 이용하였다. 본 논문에서 제안한 방법은 현재 MPEG에서 성능 평가의 기준이 되는 ‘Anchor’ 방법에 비해 동일 비트율에서 0.5${\sim}$0.8 dB 정도의 성능 향상을 보였다.

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

다시점 영상 비디오를 부호화하기 위해 다시점 영상 부호화기(MVC)가 제안되었다. MVC가 다시점 영상 비디오를 효율적으로 압축함에도 불구하고 여전히 제한된 대역폭의 채널을 통해 다시점 영상을 전송하기에는 한계가 있다. 따라서 제한된 대역폭을 효과적으로 활용할 수 있도록 효율적인 비트율 제어 알고리즘이 요구된다. 2D 영상 부호화를 위한 비트율 제어 알고리즘은 활발한 연구가 이루어졌지만 다시점 영상 부호화를 위한 비트율 제어 알고리즘은 아직 충분히 연구되어지지 않았다. 본 논문에서는 시점 간 화질 분산과 계층적 B 픽처 구조를 고려한, 다시점 영상 부호화를 위한 비트율 제어 알고리즘을 제안한다. 제안된 알고리즘은 부호화 전 단계, 시점 레벨 비트율 제어, GOP 레벨 비트율 제어, 픽처 레벨 비트율 제어의 네 단계로 이루어진다. 부호화 전 단계에서 시점 간 비트율의 비중과 계층 레벨 간의 비중을 계산한다. 그리고 시점의 목표 비트율, GOP의 목표 비트율, 픽처의 목표 비트율이 각각 시점 레벨 비트율 제어단계, GOP 레벨 비트율 제어단계, 픽처 레벨 비트율 제어 단계에서 계산된다. 실험 결과는 제안된 방식이 시점 간 화질(PSNR)의 분산을 줄이면서 비트율을 제어하는데 효과적이라는 것을 보여준다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.5
• /
• pp.837-842
• /
• 2008

Any errors that are generated in the channels and networks distort the video quality and are propagated in both the spatial and temporal domains. In particular, header errors ran result in serious visual degradation of the output video encoding/decoding schemes that can make an error resilient compressed bit-stream in error prone environments, such as mobile networks. In this paper, we proposes an header error resilience method that consider the activity of macroblock in video bitstream syntex. The extract of header error repaetedly embeds the header parameters into the least significant bits(LSB) of the quantized DCT coefficients prior to VLC. Experimental results show that the proposed error resilience method restores good image quality despite the detected error on header parameters.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.1-14
• /
• 2017

This paper proposes adaptive reference structure decision method to improve the performance of HEVC (High Efficiency Video Coding) encoder. When an event occurs in the input sequence, such as scene change, scene rotation, fade in/out, or light on/off, the proposed algorithm changes the reference structure to improve the inter prediction performance. The proposed algorithm divides GOP (Group Of Pictures) into two sub-groups based on the picture that has such event and decides the reference pictures in the divided sub-groups. Also, this paper proposes fast encoding method which changes the picture type of first encoded picture in the GOP that has such event to CRA (Clean Random Access). With the statistical feature that intra prediction is selected by high probability for the first encoded picture in the GOP carrying such event, the proposed fast encoding method does not operate inter prediction. The experimental result shows that the proposed adaptive reference structure decision method improves the BD-rate 0.3% and reduces encoding time 4.9% on average under the CTC (Common Test Condition) for standardization. In addition, the proposed reference structure decision method with the picture type change reduces the average encoding time 12.2% with 0.11% BD-rate loss.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.6
• /
• pp.95-107
• /
• 2008

In this paper, we propose a fast mode decision method for temporal and spatial scalability to reduce computational complexity of mode decision that used to be computationally one of the most intensive processes of the MPEG-4 AVC|H.264 SE(Scalable Extension) encoding. For temporal scalability, we propose an early skip method and MHM(mode history map) method. The early skip method confines macroblock modes of backward and forward frames within selected a few candidates. The MHM method utilizes stored information of frames inside a GOP of lower levels for the decision of MHM at higher level. For the spatial scalability, we propose the method that uses a candidate mode according to the MHM method and adds the BL_mode as candidates. The proposed scheme reduces the number of candidate modes to reduce computational complexity in mode decision. The proposed scheme reduces total encoding time by about 52% for temporal scalability and 47% for spatial scalability without significant loss of RD performance.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.10
• /
• pp.722-733
• /
• 2006

In scalable streaming application, there are two important knobs to tune to effectively exploit the underlying network resource and to maximize the user perceivable quality of service(QoS): layer selection and packet scheduling. In this work, we propose Semantics Aware Packet Scheduling (SAPS) algorithm to address these issues. Using packet dependency graph, SAPS algorithm selects a layer to maximize QoS. We aim at minimizing distortion in selecting layers. In inter-frame coded video streaming, minimizing packet loss does not imply maximizing QoS. In determining the packet transmission schedule, we exploit the fact that significance of each packet loss is different dependent upon its frame type and the position within group of picture(GOP). In SAPS algorithm, each packet is assigned a weight called QoS Impact Factor Transmission schedule is derived based upon weighted smoothing. In simulation experiment, we observed that QOS actually improves when packet loss becomes worse. The simulation results show that the SAPS not only maximizes user perceivable QoS but also minimizes resource requirements.

• Journal of Broadcast Engineering
• /
• v.5 no.2
• /
• pp.227-238
• /
• 2000

This paper, at first, provides analysis on loss pattern of Internet based on real experiments of the current Internet. Then, we propose an effective adaptive QoS management technique, in which measured loss pattern as well as PLR (Packet Loss Ratio) are used to select titrate of temporal scalability. level of FEC and retransmission This selection is also incorporated to the MPEG-4 error resilience tools and error concealment techniques. In order to minimize effect of packet loss, multimedia stream is segmented in the unit of group of Pictures (GOP) and interleaving and FEC are applied to the segment. Proposed algorithms are applied to build a VOD system.