HEVC

The amount of video data stored on local devices or transmitted over the networks is permanently increased. The emerging of a more efficient next generation video coding standard is of a high demand at the moment. There seem to be two main contenders for the position of the next state-of-the-art video compression standard: JCT-VC H.265/HEVC and Google VP9. The announced aim of HEVC is to achieve twice more efficient compression compared to H.264/AVC, and VP9 was developed to get half the bit-rate of VP8 with royalty-free video M.P. Sharabayko, O.G. Ponomarev and R.I. Chernyak codec. Intra compression is one of the main features that determines the compression efficiency of the whole codec.

In this paper, we propose a modern method of tracking in which it detects multiple moving objects in videos compressed per H.265/HEVC standard. Our proposed paper work largely depends on motion vectors (MV) and block types obtained by partially decoding the video bit stream and occasionally uses pixel domain information to distinguish between two objects. In this work an approach to detect the moving object in compressed domain HEVC is discussed which is used in video surveillance system. Because High Efficiency Video Coding (HEVC) has a large potential to identify events by reusing coding structures in HEVC, which saves vast extent of computational resources. Here the feature Motion Intensity Count (MIC) makes use of motion vector, coding unit and prediction unit of HEVC. Our extensive experimental results demonstrate that the approach provides the remarkable performance and can classify moving person and vehicles accurately and robustly.

HEVC (High Efficiency Video Coding) is the next-generation video coding standard being jointly developed by the ITU-T VCEG and ISO/IEC MPEG JCT-VC team. In addition to the high coding efficiency, which is expected to provide 50% more bit-rate reduction when compared to H.264/AVC, HEVC has built-in parallel processing tools to address bit-rate, pixel-rate and motion estimation (ME) throughput requirements. This paper describes how CABAC, which is also used in H.264/AVC, has been redesigned for improved throughput, and how parallel merge/skip and tiles, which are new tools introduced for HEVC, enable high-throughput processing. CABAC has data dependencies which make it difficult to parallelize and thus limit its throughput. The prediction error/residual, represented as quantized transform coefficients, accounts for the majority of the CABAC workload. Various improvements have been made to the context selection and scans in transform coefficient coding that enable CABAC in HEVC to potentially achieve higher throughput and increased coding gains relative to H.264/AVC. The merge/skip mode is a coding efficiency enhancement tool in HEVC; the parallel merge/skip breaks dependency between the regular and merge/skip ME, which provides flexibility for high throughput and high efficiency HEVC encoder designs. For ultra high definition (UHD) video, such as 4kx2k and 8kx4k resolutions, low-latency and real-time processing may be beyond the capability of a single core codec. Tiles are an effective tool which enables pixel-rate balancing among the cores to achieve parallel processing with a throughput scalable implementation of multi-core UHD video codec. With the evenly divided tiles, a multi-core video codec can be realized by simply replicating single core codec and adding a tile boundary processing core on top of that. These tools illustrate that accounting for implementation cost when designing video coding algorithms can enable higher processing speed and reduce implementation cost, while still delivering high coding efficiency in the next generation video coding standard.

The emerging video coding standard, High Efficiency Video Coding (HEVC), aims at doubling coding efficiency of H.264/AVC. In the intra encoding, Rate-Distortion Optimization (RDO) processes are employed to determine the best prediction mode. RDO based mode decision accounts for 35-39% coding time, because the large scale two-dimensional(2D) DCT/IDCT introduces a plethora of computation-and hardware-consuming multiplications. In this paper, the simplified Rate-Distortion (RD) cost estimation algorithms, which are based on the Hadamard transform and the distortion evaluation without the signal reconstruction, are proposed. When embedded to HEVC test Model(HM-5.2), our methods averagely achieve 16.1% time saving at the price of 0.055dB BD-PSNR loss, or equivalently 1.27% BD-BR increasing in intra coding. The corresponding VLSI design of the proposed algorithms is implemented with TSMC 90nm 1P9M technology. The maximum clock speed is 418 MHz under the worst work conditions (125 • C,0.9V). As compared with the primitive design, 64.9% hardware cost can be saved by our schemes. One proposed engine fulfills the throughput for 4K-UHDTV@28fps real-time encoding.

In this paper, we present area-and power-efficient architectures for the implementation of integer discrete cosine transform (DCT) of different lengths to be used in High Efficiency Video Coding (HEVC). We show that an efficient constant matrixmultiplication scheme can be used to derive parallel architectures for 1-D integer DCT of different lengths. We also show that the proposed structure could be reusable for DCT of lengths 4, 8, 16, and 32 with a throughput of 32 DCT coefficients per cycle irrespective of the transform size. Moreover, the proposed architecture could be pruned to reduce the complexity of implementation substantially with only a marginal affect on the coding performance. We propose power-efficient structures for folded and full-parallel implementations of 2-D DCT. From the synthesis result, it is found that the proposed architecture involves nearly 14% less area-delay product (ADP) and 19% less energy per sample (EPS) compared to the direct implementation of the reference algorithm, in average, for integer DCT of lengths 4, and 32. Also, an additional 19% saving in ADP and 20% saving in EPS can be achieved by the proposed pruning algorithm with nearly the same throughput rate. The proposed architecture is found to support Ultra-High-Definition (UHD) 7680×4320 @ 60 fps video which is one of the applications of HEVC.

The paper deals with video coding based on the use of dependent sources, which is caused by the need to accelerate the coding process. The coding time is directly dependent on the computing power, which with the advent of new standards is not enough. Therefore, the article suggests the results of the study, which are designed to improve existing methods, as well as to continue the progress of scientific research in this area. The results consist of using an approach to compression based on coding methods of dependent sources, which can significantly reduce the complexity of processing on the side of the encoder. The results of the study were obtained using two coding algorithms for fixed and dynamic plots. For comparison, JPEG and, respectively, MPEG encoding standards were defined, as well as an improved algorithm that was considered by the authors in previous papers. It solves the problem of efficiently recovering intermediate frames on the decoder side. When evaluating the movement, search styles have a significant impact on the performance of the algorithm, both the search speed and the quality of the search. The search style should be designed considering the characteristics of the distribution of the motion vector probability (MVP) of the sequences of the real plot. The purpose of this study is to improve the coding efficiency of video sequences using the Diamond Search (DS) algorithm. The results show that DS is efficient and reliable, it can always give a higher search speed in different sequences than other algorithms.

H.264/AVC has been widely applied to various applications. However, a new video compression standard, High Efficient Video Coding (HEVC), had been finalized in 2013. In this work, a fast transcoder from H.264/AVC to HEVC is proposed. The proposed algorithm includes the fast prediction unit (PU) decision and the fast motion estimation. With the strong relation between H.264/AVC and HEVC, the modes, residuals, and variance of motion vectors (MVs) extracted from H.264/AVC can be reused to predict the current encoding PU of HEVC. Furthermore, the MVs from H.264/AVC are used to decide the search range of PU during motion estimation. Simulation results show that the proposed algorithm can save up to 53% of the encoding time and maintains the rate-distortion (R-D) performance for HEVC.

bstract In the High Efficiency Video Coding (HEVC) standard, multiple decoding modules have been designed to take advantage of parallel processing. In particular, the HEVC in-loop filters (i.e., the deblocking filter and sample adaptive offset) were conceived to be exploited by parallel architectures. However, the type of the offered parallelism mostly suits the capabilities of multi-core CPUs, thus making a real challenge to efficiently exploit massively parallel architectures such as Graphic Processing Units (GPUs), mainly due to the existing data dependencies between the HEVC decoding procedures. In accordance, this paper presents a novel strategy to increase the amount of parallelism and the resulting performance of the HEVC inloop filters on GPU devices. For this purpose, the proposed algorithm performs the HEVC filtering at frame-level and employs intrinsic GPU vector instructions. When compared to the state-of-the-art HEVC in-loop filter implementations, the proposed approach also reduces the amount of required memory transfers, thus further boosting the performance. Experimental results show that the proposed GPU in-loop filters deliver a significant improvement in decoding performance. For example, average frame rates of 76 frames per second (FPS) and 125 FPS for Ultra HD 4K are achieved on an embedded NVIDIA GPU for All Intra and Random Access configurations, respectively.

Video Compression is very essential to meet the technological demands such as low power, less memory and fast transfer rate for different range of devices and for various multimedia applications. Video compression is primarily achieved by Motion Estimation (ME) process in any video encoder which contributes to significant compression gain.Sum of Absolute Difference (SAD) is used as distortion metric in ME process.In this paper, efficient Absolute Difference(AD)circuit is proposed which uses Brent Kung Adder(BKA) and a comparator based on modified 1's complement principle and conditional sum adder scheme. Results shows that proposed architecture reduces delay by 15% and number of slice LUTs by 42 % as compared to conventional architecture. Simulation and synthesis are done on Xilinx ISE 14.2 using Virtex 7 FPGA. KEYWORDS HEVC, motion estimation, sum of absolute difference, parallel prefix adders, Brent Kung Adder.

This paper presents a novel scheme for light field compression
based on a randomize hierarchical multi-view extension
of high efficiency video coding (dubbed as RH-MVHEVC).
Specifically, a light field data are arranged as a multiple pseudotemporal
video sequences which are efficiently compressed
withMV-HEVC encoder, following an integrated random coding
technique and hierarchical prediction scheme. The critical
advantage of proposed RH-MVHEVC scheme is that it
utilizes not just a temporal and inter-view prediction, but efficiently
exploits the strong intrinsic similarities within each
sub-aperture image and among neighboring sub-aperture images
in both horizontal and vertical directions. Experimental
results consistently outperform the state-of-the-art compression
methods on benchmark ICME 2016 and ICIP 2017 grand
challenge data sets. It achieves an average up to 33.803% BDrate
reduction and 1.7978 dB BD-PSNR improvement compared
with an advanced JEM video encoder, and an average
20.4156% BD-rate reduction and 2.0644 dB BD-PSNR improvement
compared with a latest image-based JEM-anchor
coding scheme.

Tone Mapping Operators (TMOs) compress High Dynamic Range (HDR) content to address Low Dynamic Range (LDR) displays. However, before reaching the end-user, this tone mapped content is usually compressed for broadcasting or storage purposes. Any TMO includes a quantization step to convert floating point values to integer ones. In this work, we propose to adapt this quantization, in the loop of an encoder, to reduce the entropy of the tone mapped video content. Our technique provides an appropriate quantization for each mode of both the Intra and Inter-prediction that is performed in the loop of a block-based encoder. The mode that minimizes a rate-distortion criterion uses its associated quantization to provide integer values for the rest of the encoding process. The method has been implemented in HEVC and was tested over two different scenarios: the compression of tone mapped LDR video content (using the HM10.0) and the compression of perceptually encoded HDR content (HM14.0). Results show an average bit-rate reduction under the same PSNR for all the sequences and TMO considered of 20.3% and 27.3% for tone mapped content and 2.4% and 2.7% for HDR content.

The paper deals with video coding based on the use of dependent sources, which is caused by the need to accelerate the coding process. The coding time is directly dependent on the computing power, which with the advent of new standards is not enough. Therefore, the article suggests the results of the study, which are designed to improve existing methods, as well as to continue the progress of scientific research in this area. The results consist of using an approach to compression based on coding methods of dependent sources, which can significantly reduce the complexity of processing on the side of the encoder. The results of the study were obtained using two coding algorithms for fixed and dynamic plots. For comparison, JPEG and, respectively, MPEG encoding standards were defined, as well as an improved algorithm that was considered by the authors in previous papers. It solves the problem of efficiently recovering intermediate frames on the decoder side. When evaluating the movement, search styles have a significant impact on the performance of the algorithm, both the search speed and the quality of the search. The search style should be designed considering the characteristics of the distribution of the motion vector probability (MVP) of the sequences of the real plot. The purpose of this study is to improve the coding efficiency of video sequences using the Diamond Search (DS) algorithm. The results show that DS is efficient and reliable, it can always give a higher search speed in different sequences than other algorithms.

The paper deals with video coding based on the use of dependent sources, which is caused by the need to accelerate the coding process. The coding time is directly dependent on the computing power, which with the advent of new standards is not enough. Therefore, the article suggests the results of the study, which are designed to improve existing methods, as well as to continue the progress of scientific research in this area. The results consist of using an approach to compression based on coding methods of dependent sources, which can significantly reduce the complexity of processing on the side of the encoder. The results of the study were obtained using two coding algorithms for fixed and dynamic plots. For comparison, JPEG and, respectively, MPEG encoding standards were defined, as well as an improved algorithm that was considered by the authors in previous papers. It solves the problem of efficiently recovering intermediate frames on the decoder side. When evaluating the movement, search styles have a significant impact on the performance of the algorithm, both the search speed and the quality of the search. The search style should be designed considering the characteristics of the distribution of the motion vector probability (MVP) of the sequences of the real plot. The purpose of this study is to improve the coding efficiency of video sequences using the Diamond Search (DS) algorithm. The results show that DS is efficient and reliable, it can always give a higher search speed in different sequences than other algorithms.

High Efficiency Video Coding (HEVC) has achieved significant coding efficiency improvement beyond existing video coding standard by employing several new coding tools. Deblocking Filter, Sample Adaptive Offset (SAO) and Adaptive Loop Filter (ALF) for in-loop filtering are currently introduced for the HEVC standard. However, these filters are implemented in spatial domain despite the fact of temporal correlation within video sequences. To reduce the artifacts and better align object boundaries in video, a proposed algorithm in in-loop filtering is proposed. The proposed algorithm is implemented in HM-11.0 software. This proposed algorithm allows an average bitrate reduction of about 0.7% and improves the PSNR of the decoded frame by 0.05%, 0.30% and 0.35% in luminance and chroma.

High Efficiency Video Coding (HEVC) has achieved significant coding efficiency improvement beyond existing video coding standard by employing several new coding tools. Deblocking Filter, Sample Adaptive Offset (SAO) and Adaptive Loop Filter (ALF) for in-loop filtering are currently introduced for the HEVC standard. However, these filters are implemented in spatial domain despite the fact of temporal correlation within video sequences. To reduce the artifacts and better align object boundaries in video, a proposed algorithm in in-loop filtering is proposed. The proposed algorithm is implemented in HM-11.0 software. This proposed algorithm allows an average bitrate reduction of about 0.7% and improves the PSNR of the decoded frame by 0.05%, 0.30% and 0.35% in luminance and chroma.

The paper deals with video coding based on the use of dependent sources, which is caused by the need to accelerate the coding process. The coding time is directly dependent on the computing power, which with the advent of new standards is not enough. Therefore, the article suggests the results of the study, which are designed to improve existing methods, as well as to continue the progress of scientific research in this area. The results consist of using an approach to compression based on coding methods of dependent sources, which can significantly reduce the complexity of processing on the side of the encoder. The results of the study were obtained using two coding algorithms for fixed and dynamic plots. For comparison, JPEG and, respectively, MPEG encoding standards were defined, as well as an improved algorithm that was considered by the authors in previous papers. It solves the problem of efficiently recovering intermediate frames on the decoder side. When evaluating the moveme...