• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.807-808
• /
• 2008

In H.264, sub-pel motion estimation (ME) has strong effect when coding video sequences. 1/4-pel performs better at low bitrate while 1/8-pel gives better results at high bitrate. In this paper, a variable sub-pixel motion vector resolution based on block mode motion estimation method is proposed. Experiment results show that the proposed method can take the advantage of 1/4-pel at low bitrate and 1/8-pel at high bitrate. In addition to that, time is reduced from 14% to 53% compared to KTA1.3 with 1/8-pel motion vector (MV) resolution.

• Journal of Communications and Networks
• /
• 제15권6호
• /
• pp.635-644
• /
• 2013

Adaptive hypertext transfer protocol (HTTP) streaming has become a new trend to support adaptivity in video delivery. An HTTP streaming client needs to estimate exactly resource availability and resource demand. In this paper, we focus on the most important resource which is bandwidth. A new and general formulation for throughput estimation is presented taking into account previous values of instant throughput and round trip time. Besides, we introduce for the first time the use of bitrate estimation in HTTP streaming. The experiments show that our approach can effectively cope with drastic changes in connection throughput and video bitrate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4585-4603
• /
• 2015

Video streaming services make up a large proportion of Internet traffic on both fixed and mobile access throughout the world. Adaptive streaming allows for dynamical adaptation of the bitrate with varying network conditions, to guarantee the best user experience. Adaptive bitrate algorithms face a significant challenge in correctly estimating the throughput as it varies widely over time. In this paper, we first evaluate the throughput estimation techniques and show that the method that we have used offers stable response to throughput fluctuations while maintaining a stable playback buffer. Then, we propose an adaptive bitrate scheme that intelligently selects the video bitrates based on the estimated throughput and buffer occupancy. We show that the proposed scheme improves viewing experience by achieving a high video rate without taking unnecessary risks and by minimizing the frequency of changes in the video quality. Furthermore, we show that it offers a stable response to short-term fluctuations and responds swiftly to large fluctuations. We evaluate our algorithm for both constant bitrate (CBR) and variable bitrate (VBR) video content by taking into account the segment sizes and show that it significantly improves the quality of video streaming.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권8호
• /
• pp.3856-3872
• /
• 2018

HTTP-based adaptive streaming (HAS) has recently been widely deployed on the Internet. In the HAS system, a video content is encoded at multiple bitrates and the encoded video content is segmented into small parts of fixed durations. The HAS client requests a video segment and stores it in the playout buffer. The rate adaptation algorithm employed in HAS clients dynamically determines the video bitrate depending on the time-varying bandwidth. Many studies have shown that an efficient rate adaptation algorithm is critical to ensuring quality-of-experience in HAS systems. However, existing algorithms have problems estimating the network bandwidth because bandwidth estimation is performed on the client-side application stack. Without the help of transport layer protocols, it is difficult to achieve accurate bandwidth estimation due to the inherent segment-based transmission of the HAS. In this paper, we propose an alternative approach that utilizes the playout buffer occupancy rather than using bandwidth estimates obtained from the application layer. We start with a queueing analysis of the playout buffer. Then, we present a buffer-aware rate adaptation algorithm that is solely based on the mean buffer occupancy. Our simulation results show that compared to conventional algorithms, the proposed algorithm achieves very smooth video quality while delivering a similar average video bitrate.

• 방송공학회논문지
• /
• 제22권3호
• /
• pp.321-326
• /
• 2017

HEVC 표준은 정수 화소로 표현된 신호에 DCT-II를 기반으로 하는 보간 필터를 사용하여 부화소 신호를 생성한다. 이러한 방법으로 생성된 신호는 움직임 보상 및 예측의 성능 향상을 가져온다. HEVC 표준은 부화소를 생성하기 위해서 길이가 다른 각각의 DCT 보간 필터를 사용하고 있다. 1/2-화소를 생성할 땐, 필터의 길이가 8인 DCT 기반 보간 필터를 사용하며, 1/4-화소와 3/4-화소의 경우에는 필터의 길이가 7인 DCT 기반 보간 필터를 사용한다. 본 논문에서는 DST-VII을 기반으로 하는 보간 필터를 제안하여, 움직임 보상 및 예측의 성능 향상을 가져온다. 본 논문에서 제안하는 방법은 HEVC 표준보다 BD-rate가 Random Access와 Low Delay B configurations에서 각각 0.45%와 0.5%의 성능 향상을 가져온다.

• 대한전자공학회논문지SP
• /
• 제47권2호
• /
• pp.69-76
• /
• 2010

본 논문에서는 새로운 고속 다중 참조 프레임 움직임 추정 알고리즘을 제안한다. 제안된 알고리즘은 참조 프레임간의 거리와 움직임 벡터 간의 선형 관계를 이용하여 검색영역을 줄인다. 새로운 알고리즘은 0번 참조 프레임과 1번 참조 프레임에서는 전영역 움직임 추정을 사용한 후, 2번 참조 프레임, 3번 참조 프레임, 4번 참조 프레임에서는 0번 참조 프레임과 1번 참조프레임에서의 움직임 추정의 결과를 사용하여 검색 영역을 최소화 한다. 제안된 알고리즘은 문턱값을 사용하지 않기 때문에 하드웨어 구현과 프로세싱 스케줄을 지정하는 것이 용이하고 많은 연산량을 줄일 수 었다. 이러한 몇 가지 특징으로 인하여 제안된 알고리즘은 다중 참조 프레임 움직임 추정기의 하드웨어 구현에 용이하다. 시뮬레이션 결과는 제안된 알고리즘의 PSNR 감소와 bitrate의 증가가 기존의 고속 다중 창조 프레임 움직임 추정 알고리즘에 비해서 좋은 성능을 나타내고 있고, 연산량은 기존의 5장의 참조 프레임을 사용하는 전영역 검색 방법에 비해서 52.5%의 감소를 나타낸다.

• ETRI Journal
• /
• 제31권5호
• /
• pp.610-612
• /
• 2009

We present intra-mixture prediction (IMP) mode for intra prediction and an enhanced estimation method for most probable mode (MPM). IMP mode supports more flexibility in intra prediction by mixing $4{\times}4$ blocks and $8{\times}8$ blocks in one macroblock, while the enhanced MPM estimation extends the number of referenced neighboring blocks and efficiently uses their prediction modes depending on their positions. Simulation results show that the combination of both proposed methods provides a bit reduction in the Bj${\phi}$ntegaard delta bitrate by an average of 2.56% compared to H.264/AVC.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.795-796
• /
• 2008

H.264/AVC standard adopts multiple reference frames for motion estimation. This method improves coding efficiency, but it increases complexity of encoder. In this paper, we propose a algorithm that reduces the search range by using the correlation of motion vector. Consequently, motion estimation processing time is 47.5% when compared with standard of five reference frames, and SNR and bitrate are better than that of standard of three multi reference frames.

• IEIE Transactions on Smart Processing and Computing
• /
• 제3권6호
• /
• pp.397-403
• /
• 2014

A new video compression standard called High Efficiency Video Coding (HEVC) has recently been released onto the market. HEVC provides higher coding performance compared to previous standards, but at the cost of a significant increase in encoding complexity, particularly in motion estimation (ME). At the same time, the computing capabilities of Graphics Processing Units (GPUs) have become more powerful. This paper proposes a parallel integer-pel ME (IME) algorithm for HEVC on GPU using the Compute Unified Device Architecture (CUDA). In the proposed IME, concurrent parallel reduction (CPR) is introduced. CPR performs several parallel reduction (PR) operations concurrently to solve two problems in conventional PR; low thread utilization and high thread synchronization latency. The proposed encoder reduces the portion of IME in the encoder to almost zero with a 2.3% increase in bitrate. In terms of IME, the proposed IME is up to 172.6 times faster than the IME in the HEVC reference model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1441-1461
• /
• 2017

Nowadays, Dynamic Adaptive Streaming over HTTP (DASH) has become very popular in streaming multimedia contents. In DASH, a client estimates current network bandwidth and then determines an appropriate video quality with bitrate matching the estimated bandwidth. Thus, estimating accurately the available bandwidth is a significant premise in the quality of video streaming, especially when network traffic fluctuates substantially. To cope with this challenge, researchers have presented various filters to estimate network bandwidth adaptively. However, experiment results show that current schemes either adapt slowly to network changes or adapt fast but are very sensitive to delay jitter and produce sharply changed estimation. This paper presents a novel bandwidth estimation scheme based on Moving Average Convergence Divergence (MACD). We applied an MACD indicator and its two thresholds to classifying network states into stable state and agile state, based on the network state different filters are applied to estimate network bandwidth. In the paper, we studied the performance of various MACD indicators and the threshold values on bandwidth estimation. Then we used a DASH proxy-based environment to compare the performance of the presented scheme with current well-known schemes. The simulation results illustrate that the MACD-based bandwidth estimation scheme performs superior to existing schemes both in the speed of adaptively to network changes and in stability in bandwidth estimation.