Ashok Kumar Mishra
Research Subjects
Research Interests
Ashok Kumar Mishra has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Alex Giladi
Comcast, Denver, USA
3 shared publications - Dan Grois
Comcast, Beer-Sheva, Israel
3 shared publications - Santhoshini Sekar
Multicoreware, Inc, Chennai, India
2 shared publications - Kirithika Kalirathnam
Multicoreware, Inc, Chennai, India
1 shared publication
Latest Publications
- 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. 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].