No abstract

The MPEG has recently Querydeveloped a new standard, MPEG media transport (MMT), for the nextgeneration hybrid media delivery service over IP networks considering the emerging convergence of digital broadcast and broadband services. On account of the heterogeneous characteristics of broadcast and broadband networks, MMT provides an efficient delivery timing model to enable internetwork synchronization, measure various kinds of transmission delays and jitters caused by the transmission delay, and re-adjust the timing relationship between the MMT packets to ensure synchronized playback. By exploiting the delivery timing model, it is possible to accurately estimate the round-trip time (RTT) experienced during MMT packet transmission. Based on the measured RTT, we propose an efficient delay-constrained automatic repeat request (ARQ) scheme, which is applicable to MMT packet-based realtime video streaming service over IP networks. In the proposed ARQ scheme, the receiver buffer fullness at the time of packet loss detection is used to compute the arrival deadline, which is the maximum allowed time for completing the requesting and retransmitting of the lost MMT packet. Simulation results demonstrate that the proposed delay-constrained ARQ scheme can not only provide reliable error recovery, but it also achieves significant bandwidth savings by reducing the number of wastefully retransmitted packets that arrive at the receiver side and exceed the allowed arrival deadline.

No abstract

No abstract

Recently, as demand for high-quality video and realistic media has increased, High Efficiency Video Coding has been standardized. However, High Efficiency Video Coding requires heavy cost in terms of computational complexity to achieve high coding efficiency, which causes problems in fast coding processing and real-time processing. In particular, High Efficiency Video Coding inter-coding has heavy computational complexity, and the High Efficiency Video Coding inter prediction uses reference pictures to improve coding efficiency. The reference pictures are typically signaled in two independent lists according to the display order, to be used for forward and backward prediction. If an event occurs in the input video, such as a scene change, the inter prediction performs unnecessary computations. Therefore, the reference picture list should be reconfigured to improve the inter prediction performance and reduce computational complexity. To address this problem, this article proposes a method to reduce computational complexity for fast High Efficiency Video Coding encoding using information such as scene changes obtained from the input video through preprocessing. Furthermore, reference picture lists are reconstructed by sorting the reference pictures by similarity to the current coded picture using Angular Second Moment, Contrast, Entropy, and Correlation, which are image texture parameters from the input video. Simulations are used to show that both the encoding time and coding efficiency could be improved simultaneously by applying the proposed algorithms.