Dan Grois
Research Subjects
Dan Grois has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
Ofer Hadar
Communication Systems Engineering Department, Ben-Gurion University of the Negev, P.O. Box 653, 84105 Beer-Sheva, Israel
15 shared publications- Alex Giladi
Comcast, Denver, USA
6 shared publications Evgeny Kaminsky
Department of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel
6 shared publications- Ashok Kumar Mishra
Multicoreware, Inc, Chennai, India
3 shared publications Alex Giladi
Comcast Corp. (United States)
2 shared publications- Evgeny Kaminsky
Ben-Gurion University of the Negev
2 shared publications
Latest Publications
- Open Access
- 11 February 2024
- Published by Association for Computing Machinery (ACM)
- p. 85-86
AV1-Compatible Film Grain Modeling for HEVC Decoders
- 11 February 2024
- Published by Association for Computing Machinery (ACM)
- p. 85-86
Open AccessAV1-Compatible Film Grain Modeling for HEVC Decoders
- Open Access
- 11 February 2024
- Published by Association for Computing Machinery (ACM)
- p. 116-117
Novel Segment-Based Rate Control Scheme for x265 Open-Source Video Encoder
- 11 February 2024
- Published by Association for Computing Machinery (ACM)
- p. 116-117
Open AccessNovel Segment-Based Rate Control Scheme for x265 Open-Source Video Encoder
- Open Access
- 7 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 146-147
Performance Assessment of AV1, x265 and VVenC Open-Source Encoder Implementations Compared to VVC and HEVC Reference Software Models
- 7 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 146-147
Open AccessPerformance Assessment of AV1, x265 and VVenC Open-Source Encoder Implementations Compared to VVC and HEVC Reference Software Models
- Open Access
- 7 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 122-123
Novel Histogram-Based Scene Change Detection Scheme for x265 Open-Source Video Encoder
There is an increasing need in bandwidth requirements, particularly, due to the increase in the device resolution [1]. As a result, there is a strong demand to decrease the video transmission bitrate without reducing visual quality. In 2010, a Joint Collaborative Team on Video Coding (JCT-VC) was established by ITU-T Video Coding Experts Group (VCEG) and ISO/IEC Moving Pictures Expert Group (MPEG) to work on the video coding standard, which was called the High-Efficiency Video Coding standard, or HEVC in short. The H.265/MPEG-HEVC video coding standard [2] was approved in 2013 (see Figure 1), and it provides approximately 50% coding gain compared to its predecessor H.264/MPEG-AVC [3],[4]. The x265 encoder [5]-[7] is a popular open-source encoder, which generates bitstreams compliant with the HEVC video coding standard. Built on top of x264 [8], the x265 encoder is integrated into several popular open-source frameworks, such as ffmpeg [9], GStreamer [10], and HandBrake [11]. x265 is used by a variety of broadcast and streaming service providers who leverage benefits of HEVC for streaming live and over-the-top (OTT) content. In addition to implementing nearly all the tools defined in HEVC, it implements many algorithmic optimizations that enable trading off encoder performance for quality [5]-[7]. Additionally, performance-critical kernels are implemented with hand-coded assembly kernels that use AVX2 and AVX-512 single instruction, multiple data instructions to improve performance on x86 CPUs. This flexible architecture of x265 makes it a popular choice for HEVC encoding for both on-premises and on the cloud services. In addition, recent x265 development efforts have been focused on a further coding gain increase. Particularly, there is a continuous need to extract key information automatically from videos for the purpose of indexing and scene analysis, and also in order to improve coding efficiency of the video encoders. To support this vision, reliable scene change detection algorithms must be developed. In this work, we present a novel algorithm for the gradual and abrupt scene change detection by using picture histograms, variance and pixel intensity. The extensive experimental results show that the proposed algorithm can be used to detect scene change with a high reliability and with the reduced computational complexity. According to the proposed approach, the novel scenecut algorithm detects scene changes in a video and decides on how aggressively each I-frame has to to be placed within the video. For that, each picture/frame is divided into a number of regions. Histograms and pixel intensities are considered for these regions separately, such that the higher is a number of regions, the higher the reliability of the algorithm is. During this work, it was decided to fix the number of regions to the value of nine to optimize the above-mentioned scenarios. Figure 2 below presents a flow chart of the proposed novel scene change detection algorithm. Note that the intensity contrast characterizes the intensity difference between an object and background. Both variance and intensity contrast are used for thresholding, which is obtained by computing their weighted sum. Further, a sliding window of three adjacent frames is employed to determine whether there is an abrupt scenecut or there is a gradual transition, while a decision of the number of frames within the sliding window is compromised due to the reliability and delay (i.e. if more frames are considered, then the reliability improves, but the delay increases as well). The conducted extensive experimental results show significant bit-rate savings in terms of BD-BR [12] as well as computational complexity reduction in terms of encoded frames per second.
- 7 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 122-123
Open AccessNovel Histogram-Based Scene Change Detection Scheme for x265 Open-Source Video Encoder
There is an increasing need in bandwidth requirements, particularly, due to the increase in the device resolution [1]. As a result, there is a strong demand to decrease the video transmission bitrate without reducing visual quality. In 2010, a Joint Collaborative Team on Video Coding (JCT-VC) was established by ITU-T Video Coding Experts Group (VCEG) and ISO/IEC Moving Pictures Expert Group (MPEG) to work on the video coding standard, which was called the High-Efficiency Video Coding standard, or HEVC in short. The H.265/MPEG-HEVC video coding standard [2] was approved in 2013 (see Figure 1), and it provides approximately 50% coding gain compared to its predecessor H.264/MPEG-AVC [3],[4]. The x265 encoder [5]-[7] is a popular open-source encoder, which generates bitstreams compliant with the HEVC video coding standard. Built on top of x264 [8], the x265 encoder is integrated into several popular open-source frameworks, such as ffmpeg [9], GStreamer [10], and HandBrake [11]. x265 is used by a variety of broadcast and streaming service providers who leverage benefits of HEVC for streaming live and over-the-top (OTT) content. In addition to implementing nearly all the tools defined in HEVC, it implements many algorithmic optimizations that enable trading off encoder performance for quality [5]-[7]. Additionally, performance-critical kernels are implemented with hand-coded assembly kernels that use AVX2 and AVX-512 single instruction, multiple data instructions to improve performance on x86 CPUs. This flexible architecture of x265 makes it a popular choice for HEVC encoding for both on-premises and on the cloud services. In addition, recent x265 development efforts have been focused on a further coding gain increase. Particularly, there is a continuous need to extract key information automatically from videos for the purpose of indexing and scene analysis, and also in order to improve coding efficiency of the video encoders. To support this vision, reliable scene change detection algorithms must be developed. In this work, we present a novel algorithm for the gradual and abrupt scene change detection by using picture histograms, variance and pixel intensity. The extensive experimental results show that the proposed algorithm can be used to detect scene change with a high reliability and with the reduced computational complexity. According to the proposed approach, the novel scenecut algorithm detects scene changes in a video and decides on how aggressively each I-frame has to to be placed within the video. For that, each picture/frame is divided into a number of regions. Histograms and pixel intensities are considered for these regions separately, such that the higher is a number of regions, the higher the reliability of the algorithm is. During this work, it was decided to fix the number of regions to the value of nine to optimize the above-mentioned scenarios. Figure 2 below presents a flow chart of the proposed novel scene change detection algorithm. Note that the intensity contrast characterizes the intensity difference between an object and background. Both variance and intensity contrast are used for thresholding, which is obtained by computing their weighted sum. Further, a sliding window of three adjacent frames is employed to determine whether there is an abrupt scenecut or there is a gradual transition, while a decision of the number of frames within the sliding window is compromised due to the reliability and delay (i.e. if more frames are considered, then the reliability improves, but the delay increases as well). The conducted extensive experimental results show significant bit-rate savings in terms of BD-BR [12] as well as computational complexity reduction in terms of encoded frames per second.
- Open Access
- 7 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 126-127
Novel Motion-Compensated Spatio-Temporal Filtering Scheme for x265 Open-Source Video Encoder
There is a strong demand to decrease the video transmission bitrate without reducing visual quality [1]. The x265 encoder [2]-[4] is a popular open-source encoder, which generates bitstreams compliant with the H.265/MPEG-HEVC video coding standard [5]. Built on top of x264[6], the x265 encoder is integrated into several popular open-source frameworks, such as ffmpeg [7], GStreamer [8], and Handbrake [9]. In addition, the x265 is used by a variety of broadcast and streaming service providers who leverage the benefits of HEVC for streaming live and over-the-top (OTT) content. In addition to implementing nearly all the tools defined in HEVC, it implements many algorithmic optimizations that enable trading off encoder performance for quality [2]-[4]. The performance-critical kernels are implemented with hand-coded assembly kernels that use AVX2 and AVX-512 single instruction, multiple data instructions to improve performance on x86 CPUs. This flexible architecture of x265 makes it a popular choice for HEVC encoding for both on-premises and cloud services. Recent x265 development efforts have been focused on further improving the coding gains. Specifically, the motion compensated spatio-temporal filtering (MCSTF) employed within the coding loop is especially useful for pictures that contain a high level of noise. It utilizes previously generated motion vectors across different video content resolutions to find the best temporal correspondence for low-pass filtering, while the temporal filtering is applied to the I- and P-frames. Figure 1 schematically illustrates the motion estimation process for temporal filtering in a temporal window, which consists of 5 adjacent pictures: two past, two future and one central picture used for producing a single filtered picture. Motion estimation is applied between the central picture and each future or past picture, thereby generating multiple motion-compensated predictions, which are then combined by using adaptive filtering to produce a final noise-reduced picture. Thus, a hierarchical motion estimation scheme is employed (layers L0, L1 and L2, are illustrated in Figure 2). Subsampled pictures are generated for all reference pictures and the original picture as well: i.e., L1, while L2 is derived from L1 by using the same subsampling method. First, the motion estimation is done for each 16x16 block in L2. Then, the selected motion vector is used as an initial value for estimating the motion in L1. After that, the same is performed for estimating the motion in L0. As a final step, the subpixel motion is estimated for each 8x8 block by using an interpolation filter on L0. Particularly, the motion of reference pictures before and after, relative to the original picture, is estimated per the 8x8 picture block. In turn, the motion compensation is applied on the pictures before and after the original picture according to the best matching motion for each block. i.e., such that pixel coordinates of the original picture in each block have the best matching coordinates within the referenced pictures. The filter is then applied to the current pixels, and after that, the filtered picture is encoded. Note that the pixels are processed one by one for the luma and chroma channels. The new sample value, is calculated by using the following equation: [EQUATION] where Io is the original pixel, Ir(i) is the intensity of the corresponding pixel within the motion compensated picture i, and wr(i, a) is the weight of the motion compensated picture where a is the number of available motion compensated pictures. The conducted extensive experimental results show significant bit-rate savings in terms of BD-BR [10].
- 7 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 126-127
Open AccessNovel Motion-Compensated Spatio-Temporal Filtering Scheme for x265 Open-Source Video Encoder
There is a strong demand to decrease the video transmission bitrate without reducing visual quality [1]. The x265 encoder [2]-[4] is a popular open-source encoder, which generates bitstreams compliant with the H.265/MPEG-HEVC video coding standard [5]. Built on top of x264[6], the x265 encoder is integrated into several popular open-source frameworks, such as ffmpeg [7], GStreamer [8], and Handbrake [9]. In addition, the x265 is used by a variety of broadcast and streaming service providers who leverage the benefits of HEVC for streaming live and over-the-top (OTT) content. In addition to implementing nearly all the tools defined in HEVC, it implements many algorithmic optimizations that enable trading off encoder performance for quality [2]-[4]. The performance-critical kernels are implemented with hand-coded assembly kernels that use AVX2 and AVX-512 single instruction, multiple data instructions to improve performance on x86 CPUs. This flexible architecture of x265 makes it a popular choice for HEVC encoding for both on-premises and cloud services. Recent x265 development efforts have been focused on further improving the coding gains. Specifically, the motion compensated spatio-temporal filtering (MCSTF) employed within the coding loop is especially useful for pictures that contain a high level of noise. It utilizes previously generated motion vectors across different video content resolutions to find the best temporal correspondence for low-pass filtering, while the temporal filtering is applied to the I- and P-frames. Figure 1 schematically illustrates the motion estimation process for temporal filtering in a temporal window, which consists of 5 adjacent pictures: two past, two future and one central picture used for producing a single filtered picture. Motion estimation is applied between the central picture and each future or past picture, thereby generating multiple motion-compensated predictions, which are then combined by using adaptive filtering to produce a final noise-reduced picture. Thus, a hierarchical motion estimation scheme is employed (layers L0, L1 and L2, are illustrated in Figure 2). Subsampled pictures are generated for all reference pictures and the original picture as well: i.e., L1, while L2 is derived from L1 by using the same subsampling method. First, the motion estimation is done for each 16x16 block in L2. Then, the selected motion vector is used as an initial value for estimating the motion in L1. After that, the same is performed for estimating the motion in L0. As a final step, the subpixel motion is estimated for each 8x8 block by using an interpolation filter on L0. Particularly, the motion of reference pictures before and after, relative to the original picture, is estimated per the 8x8 picture block. In turn, the motion compensation is applied on the pictures before and after the original picture according to the best matching motion for each block. i.e., such that pixel coordinates of the original picture in each block have the best matching coordinates within the referenced pictures. The filter is then applied to the current pixels, and after that, the filtered picture is encoded. Note that the pixels are processed one by one for the luma and chroma channels. The new sample value, is calculated by using the following equation: [EQUATION] where Io is the original pixel, Ir(i) is the intensity of the corresponding pixel within the motion compensated picture i, and wr(i, a) is the weight of the motion compensated picture where a is the number of available motion compensated pictures. The conducted extensive experimental results show significant bit-rate savings in terms of BD-BR [10].
- Open Access
- 7 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 148
Bitrate and Adaptive Streaming: What are We Measuring and Why?
Currently, a significant increase in bandwidth requirements is expected in the next couple of years, particularly due to an increase in the device resolution [1]: a typical bit-rate for the 4K video is between 15 to 18 Mbps, while it is considered to be more than twice the High-Definition (HD) video bit-rate and a factor of nine the Standard-Definition (SD) video bit-rate. As a result, there is currently a strong demand to decrease video transmission bit-rate, substantially without reducing the visual presentation quality [1]. Bitrate is one of the most well-known and intuitively understood concepts in video transmission. With that said, there are several different definitions of how bitrate is measured, and different methods of measurement are applicable for different situations. Video compression standards, such as H.265/MPEG-HEVC [2], provide a normative definition of bitrate which applies to all Network Abstraction Layer (NAL) units or their subset, and it is followed by video encoders in a corresponding manner. However, we are not transmitting "bare" NAL units, and not necessarily doing so in a significantly constrained pipe. In addition, a ubiquitously used definition of bitrate in the MPEG-2 TS is provided within the measurement technical report for Digital Video Broadcasting (DVB) systems - ETSI 101 290 [3]. Furthermore, the situation is different in the adaptive video streaming: for example, a 1-sec sliding window over a stream is less relevant when the unit of transmission is a segment. MPEG DASH [4] and Apple HLS [5] have their own definitions of bitrate, based on maxima of segment bitrates, and extended signaling for content-adaptive encoding. The concept of a constant-rate "pipe" is also often irrelevant - video traffic is de-facto multiplexed with all other traffic within: e.g., an LTE cell or a service group in a DOCSIS broadband network and CDN storage, and egress become the limiting per-stream factor. With that said, segment-level measurement is important for streaming clients reasoning the sustainability of a given variant. Lastly, ISPs and CDNs often use the so-called 95/5 burstable model, where 95th percentile of a 5-min average is used in lieu of second or segment-based calculation. In this work, we first review various bitrate measurement models and illustrate the difference between them by using different measurement methods, which are applied to a set of constant-rate and content-adaptive streams, being generated by a variety of commercial encoders. Then, we show benefits from using the segment rate, rather than a sliding window, as the target rate. The latter approach showed statistically significant improvements in compression efficiency by using the open source x265 encoder [6],[7], which is a popular open-source encoder that generates bitstreams compliant with the HEVC video coding standard [2].
- 7 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 148
Open AccessBitrate and Adaptive Streaming: What are We Measuring and Why?
Currently, a significant increase in bandwidth requirements is expected in the next couple of years, particularly due to an increase in the device resolution [1]: a typical bit-rate for the 4K video is between 15 to 18 Mbps, while it is considered to be more than twice the High-Definition (HD) video bit-rate and a factor of nine the Standard-Definition (SD) video bit-rate. As a result, there is currently a strong demand to decrease video transmission bit-rate, substantially without reducing the visual presentation quality [1]. Bitrate is one of the most well-known and intuitively understood concepts in video transmission. With that said, there are several different definitions of how bitrate is measured, and different methods of measurement are applicable for different situations. Video compression standards, such as H.265/MPEG-HEVC [2], provide a normative definition of bitrate which applies to all Network Abstraction Layer (NAL) units or their subset, and it is followed by video encoders in a corresponding manner. However, we are not transmitting "bare" NAL units, and not necessarily doing so in a significantly constrained pipe. In addition, a ubiquitously used definition of bitrate in the MPEG-2 TS is provided within the measurement technical report for Digital Video Broadcasting (DVB) systems - ETSI 101 290 [3]. Furthermore, the situation is different in the adaptive video streaming: for example, a 1-sec sliding window over a stream is less relevant when the unit of transmission is a segment. MPEG DASH [4] and Apple HLS [5] have their own definitions of bitrate, based on maxima of segment bitrates, and extended signaling for content-adaptive encoding. The concept of a constant-rate "pipe" is also often irrelevant - video traffic is de-facto multiplexed with all other traffic within: e.g., an LTE cell or a service group in a DOCSIS broadband network and CDN storage, and egress become the limiting per-stream factor. With that said, segment-level measurement is important for streaming clients reasoning the sustainability of a given variant. Lastly, ISPs and CDNs often use the so-called 95/5 burstable model, where 95th percentile of a 5-min average is used in lieu of second or segment-based calculation. In this work, we first review various bitrate measurement models and illustrate the difference between them by using different measurement methods, which are applied to a set of constant-rate and content-adaptive streams, being generated by a variety of commercial encoders. Then, we show benefits from using the segment rate, rather than a sliding window, as the target rate. The latter approach showed statistically significant improvements in compression efficiency by using the open source x265 encoder [6],[7], which is a popular open-source encoder that generates bitstreams compliant with the HEVC video coding standard [2].
- 3 October 2022
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12226, 1222602
Joint backward and forward temporal masking for perceptually optimized x265-based video coding
There is a strong and ever-growing demand for higher-resolution video content, such as UltraHD, which requires significantly higher bitrates. Providing such content at scale is a challenge due to limitations of the available last-mile bandwidth and content delivery network (CDN) storage and egress capacity. Lower bitrates are often considered an answer. This way, the high-resolution video content is often compressed with visually perceptible coding artifacts, thereby leading to an inferior user experience. Improved compression efficiency is thus the obvious solution for improving the user experience. However, in order to realize the gain from such efficiency improvements in a large-scale deployment, such improvements need to be applicable to an already deployed ecosystem such as set-top boxes or mobile devices, and SmartTVs, and to have a reasonably low computational complexity. This work proposes a low-complexity joint backward and forward temporal masking for reducing bitrate without perceptibly affecting visual quality. This is achieved by introducing a novel low-complexity scenecut-aware adaptive frame-level quantization framework, which considers temporal distances between frames and the closest scenecuts. The proposed framework has been implemented in the popular x265 open-source HEVC encoder. With that said, the framework is codec-independent and can be applied to other encoders and video coding standards. Different backward and forward masking time periods and quantizer behaviors are investigated to determine exact time periods for which temporal masking does not substantially impact video quality, as perceived by the human visual system (HVS). Extensive subjective quality assessments have been carried out for evaluating the benefits and advantages of the proposed scenecut-aware adaptive quantization framework. The subjective results showed significant bitrate savings of up to about 26%, while maintaining substantially the same perceived visual quality.
- 3 October 2022
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12226, 1222602
Joint backward and forward temporal masking for perceptually optimized x265-based video coding
There is a strong and ever-growing demand for higher-resolution video content, such as UltraHD, which requires significantly higher bitrates. Providing such content at scale is a challenge due to limitations of the available last-mile bandwidth and content delivery network (CDN) storage and egress capacity. Lower bitrates are often considered an answer. This way, the high-resolution video content is often compressed with visually perceptible coding artifacts, thereby leading to an inferior user experience. Improved compression efficiency is thus the obvious solution for improving the user experience. However, in order to realize the gain from such efficiency improvements in a large-scale deployment, such improvements need to be applicable to an already deployed ecosystem such as set-top boxes or mobile devices, and SmartTVs, and to have a reasonably low computational complexity. This work proposes a low-complexity joint backward and forward temporal masking for reducing bitrate without perceptibly affecting visual quality. This is achieved by introducing a novel low-complexity scenecut-aware adaptive frame-level quantization framework, which considers temporal distances between frames and the closest scenecuts. The proposed framework has been implemented in the popular x265 open-source HEVC encoder. With that said, the framework is codec-independent and can be applied to other encoders and video coding standards. Different backward and forward masking time periods and quantizer behaviors are investigated to determine exact time periods for which temporal masking does not substantially impact video quality, as perceived by the human visual system (HVS). Extensive subjective quality assessments have been carried out for evaluating the benefits and advantages of the proposed scenecut-aware adaptive quantization framework. The subjective results showed significant bitrate savings of up to about 26%, while maintaining substantially the same perceived visual quality.
- 1 May 2021
- Published by Society of Motion Picture and Television Engineers (SMPTE) in SMPTE Motion Imaging Journal
- Vol. 130 (4) , 1-12
Performance Comparison of Emerging EVC and VVC Video Coding Standards with HEVC and AV1
The recent dramatic increase in video content consumption requires efficient video coding standards, which is specifically true for ultrahigh-definition (UltraHD) resolutions, such as 4K and 8K (i.e., 3840×2160 or 7680×4320 resolutions in terms of luma samples, respectively). The well-known high-efficiency video coding (HEVC) [H.265/Moving Pictures Expert Group (MPEG)-H] standard was approved in 2013. Although HEVC provides approximately 50% coding gain compared to its predecessor advanced video coding (AVC) (H.264/MPEG-4), its adoption is still relatively slow. In addition, larger bitrate savings than those provided by HEVC are currently in demand. At the same time, work on the versatile video coding (VVC) and essential video coding (EVC) standards started in 2018. After intensive development efforts that continued for two and a half years, these two video coding standards have been recently finalized. VVC (H.266/MPEG-I) was developed jointly by the MPEG and the International Telecommunication Union-Telecommunication (ITU-T) Video Coding Experts Group (VCEG). On the other hand, EVC (MPEG-5) is an MPEG-only effort. In this paper, we compare the performance of EVC and VVC, in terms of both coding gains and computational complexity, to their predecessor—the HEVC video coding standard. In addition, given the growing popularity of the AV1 video codec, which was recently developed by the Alliance for Open Media (AOM), we also include AV1 as an alternative baseline and provide corresponding comparison results. According to the experimental results, which have been carried out in a constant bitrate (CBR) mode, EVC provides about 30% bitrate savings compared to HEVC for encoding 4K/2160p entertainment content (such as VoD) in terms of Bjøntegaard-delta bitrate (BD-BR) peak-signal-to-noise ratio (PSNR)YUV, while introducing an encoding computational complexity increase of approximately five times. VVC provides larger bitrate savings of about 40% at a price of a significant encoding computational complexity increase of more than nine times. When the performance of HEVC CBR encoding (i.e., with the rate control disabled) was compared to that of AV1 VBR encoding (i.e., with the rate control enabled), it was found that AV1 provides bitrate savings of about 20% compared to HEVC for encoding 4K/2160p video sequences, as a tradeoff of an encoding computational complexity increase by a factor of approximately four. The authors find both EVC and VVC to be very promising successors to HEVC in terms of coding gains and computational complexity, but the jury is still out on the speed of their adoption .
- 1 May 2021
- Published by Society of Motion Picture and Television Engineers (SMPTE) in SMPTE Motion Imaging Journal
- Vol. 130 (4) , 1-12
Performance Comparison of Emerging EVC and VVC Video Coding Standards with HEVC and AV1
The recent dramatic increase in video content consumption requires efficient video coding standards, which is specifically true for ultrahigh-definition (UltraHD) resolutions, such as 4K and 8K (i.e., 3840×2160 or 7680×4320 resolutions in terms of luma samples, respectively). The well-known high-efficiency video coding (HEVC) [H.265/Moving Pictures Expert Group (MPEG)-H] standard was approved in 2013. Although HEVC provides approximately 50% coding gain compared to its predecessor advanced video coding (AVC) (H.264/MPEG-4), its adoption is still relatively slow. In addition, larger bitrate savings than those provided by HEVC are currently in demand. At the same time, work on the versatile video coding (VVC) and essential video coding (EVC) standards started in 2018. After intensive development efforts that continued for two and a half years, these two video coding standards have been recently finalized. VVC (H.266/MPEG-I) was developed jointly by the MPEG and the International Telecommunication Union-Telecommunication (ITU-T) Video Coding Experts Group (VCEG). On the other hand, EVC (MPEG-5) is an MPEG-only effort. In this paper, we compare the performance of EVC and VVC, in terms of both coding gains and computational complexity, to their predecessor—the HEVC video coding standard. In addition, given the growing popularity of the AV1 video codec, which was recently developed by the Alliance for Open Media (AOM), we also include AV1 as an alternative baseline and provide corresponding comparison results. According to the experimental results, which have been carried out in a constant bitrate (CBR) mode, EVC provides about 30% bitrate savings compared to HEVC for encoding 4K/2160p entertainment content (such as VoD) in terms of Bjøntegaard-delta bitrate (BD-BR) peak-signal-to-noise ratio (PSNR)YUV, while introducing an encoding computational complexity increase of approximately five times. VVC provides larger bitrate savings of about 40% at a price of a significant encoding computational complexity increase of more than nine times. When the performance of HEVC CBR encoding (i.e., with the rate control disabled) was compared to that of AV1 VBR encoding (i.e., with the rate control enabled), it was found that AV1 provides bitrate savings of about 20% compared to HEVC for encoding 4K/2160p video sequences, as a tradeoff of an encoding computational complexity increase by a factor of approximately four. The authors find both EVC and VVC to be very promising successors to HEVC in terms of coding gains and computational complexity, but the jury is still out on the speed of their adoption .
- Open Access
- 4 November 2013
- Published by Wiley in Advances in Multimedia
- Vol. 2013, 1-17
Efficient Region-of-Interest Scalable Video Coding with Adaptive Bit-Rate Control
This work relates to the regions-of-interest (ROI) coding that is a desirable feature in future applications based on the scalable video coding, which is an extension of the H.264/MPEG-4 AVC standard. Due to the dramatic technological progress, there is a plurality of heterogeneous devices, which can be used for viewing a variety of video content. Devices such as smartphones and tablets are mostly resource-limited devices, which make it difficult to display high-quality content. Usually, the displayed video content contains one or more ROI(s), which should be adaptively selected from the preencoded scalable video bitstream. Thus, an efficient scalable ROI video coding scheme is proposed in this work, thereby enabling the extraction of the desired regions-of-interest and the adaptive setting of the desirable ROI location, size, and resolution. In addition, an adaptive bit-rate control is provided for the region-of-interest scalable video coding. The performance of the presented techniques is demonstrated and compared with the joint scalable video model reference software (JSVM 9.19), thereby showing significant bit-rate savings as a tradeoff for the relatively low PSNR degradation.
- 4 November 2013
- Published by Wiley in Advances in Multimedia
- Vol. 2013, 1-17
Open AccessEfficient Region-of-Interest Scalable Video Coding with Adaptive Bit-Rate Control
This work relates to the regions-of-interest (ROI) coding that is a desirable feature in future applications based on the scalable video coding, which is an extension of the H.264/MPEG-4 AVC standard. Due to the dramatic technological progress, there is a plurality of heterogeneous devices, which can be used for viewing a variety of video content. Devices such as smartphones and tablets are mostly resource-limited devices, which make it difficult to display high-quality content. Usually, the displayed video content contains one or more ROI(s), which should be adaptively selected from the preencoded scalable video bitstream. Thus, an efficient scalable ROI video coding scheme is proposed in this work, thereby enabling the extraction of the desired regions-of-interest and the adaptive setting of the desirable ROI location, size, and resolution. In addition, an adaptive bit-rate control is provided for the region-of-interest scalable video coding. The performance of the presented techniques is demonstrated and compared with the joint scalable video model reference software (JSVM 9.19), thereby showing significant bit-rate savings as a tradeoff for the relatively low PSNR degradation.
- Open Access
- 1 July 2013
- Published by SPIE-Intl Soc Optical Eng in Optical Engineering
- Vol. 52 (7) , 071501
Special Section Guest Editorial: Video Compression Technology
Nowadays, we cannot imagine our life without video content and without devices that enable us to acquire and display such content. According to recent research, in 2012, the video content transfer over the Internet was around 60% of the overall Internet data transfer, and the overall video transfer (including the Internet) could reach 90% during the next four years. The TV sets supporting only full high-definition (HD) resolution (i.e., 1080p) are already considered to be outdated due to a dramatic demand for the ultra-HD resolution that often refers to 3840×2160 (4K) or 7680×4320 (8K) resolutions. So, what are the key factors for such tremendous progress? If you are reading this special section on video compression technology, we are sure that you know the answer…
- 1 July 2013
- Published by SPIE-Intl Soc Optical Eng in Optical Engineering
- Vol. 52 (7) , 071501
Open AccessSpecial Section Guest Editorial: Video Compression Technology
Nowadays, we cannot imagine our life without video content and without devices that enable us to acquire and display such content. According to recent research, in 2012, the video content transfer over the Internet was around 60% of the overall Internet data transfer, and the overall video transfer (including the Internet) could reach 90% during the next four years. The TV sets supporting only full high-definition (HD) resolution (i.e., 1080p) are already considered to be outdated due to a dramatic demand for the ultra-HD resolution that often refers to 3840×2160 (4K) or 7680×4320 (8K) resolutions. So, what are the key factors for such tremendous progress? If you are reading this special section on video compression technology, we are sure that you know the answer…