WO2023097064A1 - Décalage adaptatif d'échantillon à composants croisés - Google Patents

Décalage adaptatif d'échantillon à composants croisés Download PDF

Info

Publication number
WO2023097064A1
WO2023097064A1 PCT/US2022/051013 US2022051013W WO2023097064A1 WO 2023097064 A1 WO2023097064 A1 WO 2023097064A1 US 2022051013 W US2022051013 W US 2022051013W WO 2023097064 A1 WO2023097064 A1 WO 2023097064A1
Authority
WO
WIPO (PCT)
Prior art keywords
component
chroma
luma
sample
video
Prior art date
Application number
PCT/US2022/051013
Other languages
English (en)
Inventor
Che-Wei Kuo
Xiaoyu XIU
Wei Chen
Xianglin Wang
Yi-Wen Chen
Hong-Jheng Jhu
Ning Yan
Bing Yu
Original Assignee
Beijing Dajia Internet Information Technology Co., Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Dajia Internet Information Technology Co., Ltd. filed Critical Beijing Dajia Internet Information Technology Co., Ltd.
Publication of WO2023097064A1 publication Critical patent/WO2023097064A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/117—Filters, e.g. for pre-processing or post-processing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/119—Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/129—Scanning of coding units, e.g. zig-zag scan of transform coefficients or flexible macroblock ordering [FMO]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/136—Incoming video signal characteristics or properties
    • H04N19/14—Coding unit complexity, e.g. amount of activity or edge presence estimation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/182—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a pixel
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/186—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a colour or a chrominance component
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/80—Details of filtering operations specially adapted for video compression, e.g. for pixel interpolation
    • H04N19/82—Details of filtering operations specially adapted for video compression, e.g. for pixel interpolation involving filtering within a prediction loop
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/85—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression
    • H04N19/86—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression involving reduction of coding artifacts, e.g. of blockiness

Definitions

  • the present disclosure generally relates to video coding and compression, and more specifically, to methods and apparatus on improving both the luma and the chroma coding efficiency.
  • Digital video is supported by a variety of electronic devices, such as digital televisions, laptop or desktop computers, tablet computers, digital cameras, digital recording devices, digital media players, video gaming consoles, smart phones, video teleconferencing devices, video streaming devices, etc.
  • the electronic devices transmit and receive or otherwise communicate digital video data across a communication network, and/or store the digital video data on a storage device. Due to a limited bandwidth capacity of the communication network and limited memory resources of the storage device, video coding may be used to compress the video data according to one or more video coding standards before it is communicated or stored.
  • video coding standards include Versatile Video Coding (VVC), Joint Exploration test Model (JEM), High-Efficiency Video Coding (HEVC/H.265), Advanced Video Coding (AVC/H.264), Moving Picture Expert Group (MPEG) coding, or the like.
  • AOMedia Video 1 (AVI) was developed as a successor to its preceding standard VP9.
  • Audio Video Coding (AVS), which refers to digital audio and digital video compression standard, is another video compression standard series.
  • Video coding generally utilizes prediction methods (e.g., inter- prediction, intra-prediction, or the like) that take advantage of redundancy inherent in the video data.
  • Video coding aims to compress video data into a form that uses a lower bit rate, while avoiding or minimizing degradations to video quality.
  • the present disclosure describes implementations related to video data encoding and decoding and, more particularly, to methods and apparatus on improving the coding efficiency of both luma and chroma components, including improving the coding efficiency by exploring cross-component relationship between luma component and chroma component.
  • a method of video decoding may include that: a decoder receives a picture frame including one or more components, where the one or more components may include a first component and a second component. Additionally, the method may include that: the decoder determines a classifier for a respective sample of the second component according to a collocated sample of the first component, obtains an indicator that indicates one or more bandNum segments of the one or more components in response to determining that the classifier is a band classifier or a joint classifier encompassing the band classifier, and determines the one or more bandNum segments according to the indicator. Furthermore, the method may include that the decoder determines a band offset according to the one or more bandNum segments and modifies the respective sample of the second component according to a sample offset including the band offset.
  • a method of video encoding may include that: an encoder may determine a classifier for a respective sample of a second component according to a collocated sample of a first component, where a picture frame may include one or more components including the first component and the second component. Additionally, the method may include that the encoder predefines or signals an indicator in a bitstream in response to determining that the classifier is a band classifier or a joint classifier encompassing the band classifier, where the indicator indicates one or more bandNum segments of the one or more components.
  • an apparatus for video decoding may include one or more processors and a memory coupled to the one or more processors and configured to store instructions executable by the one or more processor.
  • the one or more processors upon execution of the instructions, are configured to perform the method according to the first aspect.
  • an apparatus for video encoding may include one or more processors and a memory coupled to the one or more processors and configured to store instructions executable by the one or more processor.
  • the one or more processors upon execution of the instructions, are configured to perform the method according to the second aspect.
  • a non-transitory computer-readable storage medium storing computer-executable instructions that, when executed by one or more computer processors, cause the one or more computer processors to receive a bitstream, and perform the method according to the first aspect based on the bitstream.
  • a non-transitory computer-readable storage medium for storing computer-executable instructions that, when executed by one or more computer processors, cause the one or more computer processors to perform the method according to the second aspect, and transmit the bitstream.
  • FIG. l is a block diagram illustrating an exemplary system for encoding and decoding video blocks in accordance with some implementations of the present disclosure.
  • FIG. 2 is a block diagram illustrating an exemplary video encoder in accordance with some implementations of the present disclosure.
  • FIG. 3 is a block diagram illustrating an exemplary video decoder in accordance with some implementations of the present disclosure.
  • FIGS. 4A through 4E are block diagrams illustrating how a frame is recursively partitioned into multiple video blocks of different sizes and shapes in accordance with some implementations of the present disclosure.
  • FIG. 4F is a block diagram illustrating intra modes as defined in VVC.
  • FIG. 4G is a block diagram illustrating multiple reference lines for intra prediction.
  • FIG. 5A is a block diagram illustrating the four gradient patterns used in Sample
  • FIG. 5B is a block diagram illustrating a decoder for deblocking filter (DBF) combined with proposed SAO filtering SAOV and SAOH in accordance with some implementations of the present disclosure.
  • DPF deblocking filter
  • FIG. 6 is a block diagram illustrating that both the proposed bilateral filter (BIF) and SAO use samples from the deblocking stage as input in accordance with some implementations of the present disclosure.
  • FIG. 7 is a block diagram illustrating naming convention for samples surrounding the center sample in accordance with some implementations of the present disclosure.
  • FIG. 8A a block diagram illustrating a 5x5 diamond shape of ALF filter applied for chroma component in accordance with some implementations of the present disclosure.
  • FIG. 8B a block diagram illustrating a 7x7 diamond shape of ALF filter applied for luma component in accordance with some implementations of the present disclosure.
  • FIGS. 9A-9D illustrate subsampled Laplacian calculation in accordance with some implementations of the present disclosure.
  • FIG. 10A is a block diagram illustrating a system level diagram of the CC-ALF process with respect to the SAO, luma ALF and chroma ALF processes in accordance with some implementations of the present disclosure.
  • FIG. 10B illustrates filtering in CC-ALF is accomplished by applying a linear, diamond shaped filter to the luma channel in accordance with some implementations of the present disclosure.
  • FIG. 11 illustrates modified block classification at virtual boundaries in accordance with some implementations of the present disclosure.
  • FIG. 12 illustrates modified ALF filtering for Luma component at virtual boundaries in accordance with some implementations of the present disclosure.
  • FIG. 13A illustrates the CCSAO applying on chroma samples and using DBF Y as input in accordance with some implementations of the present disclosure.
  • FIG. 13B illustrates the CCSAO applying on luma and chroma samples and using DBF Y/Cb/Cr as input in accordance with some implementations of the present disclosure.
  • FIG. 13C illustrates the CCSAO working independently in accordance with some implementations of the present disclosure.
  • FIG. 13D illustrates recursively applied CCSAO in accordance with some implementations of the present disclosure.
  • FIG. 13E illustrates applying in parallel with SAO and BIF in accordance with some implementations of the present disclosure.
  • FIG. 13F illustrates replacing SAO and applying in parallel with BIF in accordance with some implementations of the present disclosure.
  • FIG. 14 illustrates that the CCSAO is applied in parallel with other coding tools in accordance with some implementations of the present disclosure.
  • FIG. 15A illustrates that the location of CCSAO is after SAO in accordance with some implementations of the present disclosure.
  • FIG. 15B illustrates the CCSAO working independently without CCALF in accordance with some implementations of the present disclosure.
  • FIG. 15C illustrates the CCSAO serving as a post reconstruction filter in accordance with some implementations of the present disclosure.
  • FIG. 16 illustrates the CCSAO applied in parallel with CCALF in accordance with some implementations of the present disclosure.
  • FIG. 17 illustrates using different luma sample position for CO classification as another classifier in accordance with some implementations of the present disclosure.
  • FIGS. 18A-18G illustrate different candidate shapes where a constraint may be applied to different shapes in accordance with some implementations of the present disclosure.
  • FIG. 19 illustrates that other cross-component collocated and neighboring chroma samples may be also fed into CCSAO classification besides luma in accordance with some implementations of the present disclosure.
  • FIGS. 20A-20B illustrate that a collocated luma sample value may be replaced by a phase corrected value by weighting neighboring luma samples in accordance with some implementations of the present disclosure.
  • FIGS. 21 A-21B illustrate that a collocated luma sample value may be replaced by a phase corrected value by weighting neighboring luma samples in accordance with some implementations of the present disclosure.
  • FIGS. 22A-22B illustrate examples of using edge strengths to classify c in accordance with some implementations of the present disclosure.
  • FIGS. 23A-23B illustrate that CCSAO is not applied on a current chroma sample if any of the collocated and neighboring luma samples used for classification is outside a current picture in accordance with some implementations of the present disclosure.
  • FIGS. 24A-24B illustrate that missed samples are used repetitive or mirror padding to create samples for classification if any of the collocated and neighboring luma samples used for classification is outside the current picture in accordance with some implementations of the present disclosure.
  • FIG. 25 illustrates that in AVS, 9 luma candidates CCS AO may increase 2 additional luma line buffers in accordance with some implementations of the present disclosure.
  • FIG. 26A illustrates that in VVC, 9 luma candidates CCSAO may increase 1 additional luma line buffer in accordance with some implementations of the present disclosure.
  • FIG. 26B illustrates that a selected chroma candidate may across VB and need additional chroma line buffer if collocated or neighboring chroma samples are used to classify the current luma samples in accordance with some implementations of the present disclosure.
  • FIGS. 27A-27C illustrate in AVS and VVC, CCSAO is disabled for a chroma sample if any of the chroma sample’s luma candidates is across VB (outside the current chroma sample VB) in accordance with some implementations of the present disclosure.
  • FIGS. 28A-28B illustrate virtual boundary example for CO with 9 luma position candidates in accordance with some implementations of the present disclosure.
  • FIGS. 29A-29C illustrate in AVS and VVC, CCSAO is enabled using repetitive padding for a chroma sample if any of the chroma sample’s luma candidates is across VB (outside the current chroma sample VB) in accordance with some implementations of the present disclosure.
  • FIGS. 30A-30C illustrate in AVS and VVC, CCSAO is enabled using mirror padding for a chroma sample if any of the chroma sample’s luma candidates is across VB (outside the current chroma sample VB) in accordance with some implementations of the present disclosure.
  • FIGS. 31 A-3 IB illustrate in AVS and VVC, CCSAO is enabled using double sided symmetric padding if one side is outside VB in accordance with some implementations of the present disclosure.
  • FIGS. 32A-32B illustrate repetitive or mirror padding can be applied on the luma samples that outside the virtual boundary in accordance with some implementations of the present disclosure.
  • FIGS. 33A-33B illustrate a restriction applied to reduce CCSAO required line buffer and to simplify boundary processing condition check in accordance with some implementations of the present disclosure.
  • FIG. 34 illustrates CCSAO applied region not aligned to CTB boundary in accordance with some implementations of the present disclosure.
  • FIG. 35 illustrates CCSAO applied region frame partition may be fixed in accordance with some implementations of the present disclosure.
  • FIG. 36 illustrates CCSAO applied region partition may be dynamic and switched in picture level in accordance with some implementations of the present disclosure.
  • FIG. 37 illustrates how to apply the classifier set index can be switched in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock levels if plural classifiers are used in one frame in accordance with some implementations of the present disclosure.
  • FIG. 38 illustrates CCSAO applied region may be BT/QT/TT split from frame/slice/CTB level in accordance with some implementations of the present disclosure.
  • FIG. 39 illustrates CCSAO classifiers taking current or cross component coding information into account in accordance with some implementations of the present disclosure.
  • FIG. 40A is a block diagram illustrating that the SAO classification methods disclosed in the present disclosure serve as a post prediction filter in accordance with some implementations of the present disclosure.
  • FIGS. 40B-40D are block diagrams illustrating that for post prediction SAO filter, each component can use the current and neighboring samples for classification in accordance with some implementations of the present disclosure.
  • FIG. 41 is a diagram illustrating a computing environment coupled with a user interface in accordance with some implementations of the present disclosure.
  • FIG. 42 is a flowchart illustrating a method for video decoding according to an example of the present disclosure.
  • FIG. 43 is a flowchart illustrating a method for video encoding according to an example of the present disclosure.
  • first,” “second,” “third,” etc. are all used as nomenclature only for references to relevant elements, e.g., devices, components, compositions, steps, etc., without implying any spatial or chronological orders, unless expressly specified otherwise.
  • a “first device” and a “second device” may refer to two separately formed devices, or two parts, components, or operational states of a same device, and may be named arbitrarily.
  • module may include memory (shared, dedicated, or group) that stores code or instructions that can be executed by one or more processors.
  • a module may include one or more circuits with or without stored code or instructions.
  • the module or circuit may include one or more components that are directly or indirectly connected. These components may or may not be physically attached to, or located adjacent to, one another.
  • a method may comprise steps of i) when or if condition X is present, function or action X’ is performed, and ii) when or if condition Y is present, function or action Y’ is performed.
  • the method may be implemented with both the capability of performing function or action X’, and the capability of performing function or action Y’ .
  • the functions X’ and Y’ may both be performed, at different times, on multiple executions of the method.
  • a unit or module may be implemented purely by software, purely by hardware, or by a combination of hardware and software.
  • the unit or module may include functionally related code blocks or software components, that are directly or indirectly linked together, so as to perform a particular function.
  • the first generation AVS standard includes Chinese national standard “Information Technology, Advanced Audio Video Coding, Part 2: Video” (known as AVS1) and “Information Technology, Advanced Audio Video Coding Part 16: Radio Television Video” (known as AVS+). It can offer around 50% bit-rate saving at the same perceptual quality compared to MPEG-2 standard.
  • the second generation AVS standard includes the series of Chinese national standard “Information Technology, Efficient Multimedia Coding” (knows as AVS2), which is mainly targeted at the transmission of extra HD TV programs. The coding efficiency of the AVS2 is double of that of the AVS+. Meanwhile, the AVS2 standard video part was submitted by Institute of Electrical and Electronics Engineers (IEEE) as one international standard for applications.
  • the AVS3 standard is one new generation video coding standard for UHD video application aiming at surpassing the coding efficiency of the latest international standard HEVC, which provides approximately 30% bit-rate savings over the HEVC standard.
  • HEVC latest international standard
  • the AVS3-P2 baseline was finished, which provides approximately 30% bit-rate savings over the HEVC standard.
  • HPM high performance model
  • the AVS3 standard is built upon the block-based hybrid video coding framework.
  • FIG. 1 is a block diagram illustrating an exemplary system 10 for encoding and decoding video blocks in parallel in accordance with some implementations of the present disclosure.
  • the system 10 includes a source device 12 that generates and encodes video data to be decoded at a later time by a destination device 14.
  • the source device 12 and the destination device 14 may comprise any of a wide variety of electronic devices, including desktop or laptop computers, tablet computers, smart phones, set-top boxes, digital televisions, cameras, display devices, digital media players, video gaming consoles, video streaming device, or the like.
  • the source device 12 and the destination device 14 are equipped with wireless communication capabilities.
  • the destination device 14 may receive the encoded video data to be decoded via a link 16.
  • the link 16 may comprise any type of communication medium or device capable of moving the encoded video data from the source device 12 to the destination device 14.
  • the link 16 may comprise a communication medium to enable the source device 12 to transmit the encoded video data directly to the destination device 14 in real time.
  • the encoded video data may be modulated according to a communication standard, such as a wireless communication protocol, and transmitted to the destination device 14.
  • the communication medium may comprise any wireless or wired communication medium, such as a Radio Frequency (RF) spectrum or one or more physical transmission lines.
  • RF Radio Frequency
  • the communication medium may form part of a packet-based network, such as a local area network, a wide-area network, or a global network such as the Internet.
  • the communication medium may include routers, switches, base stations, or any other equipment that may be useful to facilitate communication from the source device 12 to the destination device 14.
  • the encoded video data may be transmitted from an output interface 22 to a storage device 32. Subsequently, the encoded video data in the storage device 32 may be accessed by the destination device 14 via an input interface 28.
  • the storage device 32 may include any of a variety of distributed or locally accessed data storage media such as a hard drive, Blu-ray discs, Digital Versatile Disks (DVDs), Compact Disc Read-Only Memories (CD-ROMs), flash memory, volatile or non-volatile memory, or any other suitable digital storage media for storing the encoded video data.
  • the storage device 32 may correspond to a file server or another intermediate storage device that may hold the encoded video data generated by the source device 12.
  • the destination device 14 may access the stored video data from the storage device 32 via streaming or downloading.
  • the file server may be any type of computer capable of storing the encoded video data and transmitting the encoded video data to the destination device 14.
  • Exemplary file servers include a web server (e.g., for a website), a File Transfer Protocol (FTP) server, Network Attached Storage (NAS) devices, or a local disk drive.
  • the destination device 14 may access the encoded video data through any standard data connection, including a wireless channel (e.g., a Wireless Fidelity (Wi-Fi) connection), a wired connection (e.g., Digital Subscriber Line (DSL), cable modem, etc.), or a combination of both that is suitable for accessing encoded video data stored on a file server.
  • the transmission of the encoded video data from the storage device 32 may be a streaming transmission, a download transmission, or a combination of both.
  • the source device 12 includes a video source 18, a video encoder 20 and the output interface 22.
  • the video source 18 may include a source such as a video capturing device, e.g., a video camera, a video archive containing previously captured video, a video feeding interface to receive video from a video content provider, and/or a computer graphics system for generating computer graphics data as the source video, or a combination of such sources.
  • a video capturing device e.g., a video camera, a video archive containing previously captured video, a video feeding interface to receive video from a video content provider, and/or a computer graphics system for generating computer graphics data as the source video, or a combination of such sources.
  • the source device 12 and the destination device 14 may form camera phones or video phones.
  • the implementations described in the present application may be applicable to video coding in general, and may be applied to wireless and/or wired applications.
  • the captured, pre-captured, or computer-generated video may be encoded by the video encoder 20.
  • the encoded video data may be transmitted directly to the destination device 14 via the output interface 22 of the source device 12.
  • the encoded video data may also (or alternatively) be stored onto the storage device 32 for later access by the destination device 14 or other devices, for decoding and/or playback.
  • the output interface 22 may further include a modem and/or a transmitter.
  • the destination device 14 includes the input interface 28, a video decoder 30, and a display device 34.
  • the input interface 28 may include a receiver and/or a modem and receive the encoded video data over the link 16.
  • the encoded video data communicated over the link 16, or provided on the storage device 32 may include a variety of syntax elements generated by the video encoder 20 for use by the video decoder 30 in decoding the video data. Such syntax elements may be included within the encoded video data transmitted on a communication medium, stored on a storage medium, or stored on a file server.
  • the destination device 14 may include the display device 34, which can be an integrated display device and an external display device that is configured to communicate with the destination device 14.
  • the display device 34 displays the decoded video data to a user, and may comprise any of a variety of display devices such as a Liquid Crystal Display (LCD), a plasma display, an Organic Light Emitting Diode (OLED) display, or another type of display device.
  • LCD Liquid Crystal Display
  • OLED Organic Light Emitting Diode
  • the video encoder 20 and the video decoder 30 may operate according to proprietary or industry standards, such as VVC, HEVC, MPEG-4, Part 10, AVC, AVS, or extensions of such standards. It should be understood that the present application is not limited to a specific video encoding/decoding standard and may be applicable to other video encoding/decoding standards. It is generally contemplated that the video encoder 20 of the source device 12 may be configured to encode video data according to any of these current or future standards. Similarly, it is also generally contemplated that the video decoder 30 of the destination device 14 may be configured to decode video data according to any of these current or future standards.
  • the video encoder 20 and the video decoder 30 each may be implemented as any of a variety of suitable encoder and/or decoder circuitry, such as one or more microprocessors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs), discrete logic, software, hardware, firmware or any combinations thereof.
  • DSPs Digital Signal Processors
  • ASICs Application Specific Integrated Circuits
  • FPGAs Field Programmable Gate Arrays
  • an electronic device may store instructions for the software in a suitable, non-transitory computer-readable medium and execute the instructions in hardware using one or more processors to perform the video encoding/decoding operations disclosed in the present disclosure.
  • Each of the video encoder 20 and the video decoder 30 may be included in one or more encoders or decoders, either of which may be integrated as part of a combined encoder/decoder (CODEC) in a respective device.
  • CODEC combined encoder/decoder
  • FIG. 2 is a block diagram illustrating an exemplary video encoder 20 in accordance with some implementations described in the present application.
  • the video encoder 20 may perform intra and inter predictive coding of video blocks within video frames.
  • Intra predictive coding relies on spatial prediction to reduce or remove spatial redundancy in video data within a given video frame or picture.
  • Inter predictive coding relies on temporal prediction to reduce or remove temporal redundancy in video data within adjacent video frames or pictures of a video sequence.
  • frame may be used as synonyms for the term “image” or
  • the video encoder 20 includes a video data memory 40, a prediction processing unit 41, a Decoded Picture Buffer (DPB) 64, a summer 50, a transform processing unit 52, a quantization unit 54, and an entropy encoding unit 56.
  • the prediction processing unit 41 further includes a motion estimation unit 42, a motion compensation unit 44, a partition unit 45, an intra prediction processing unit 46, and an intra Block Copy (BC) unit 48.
  • the video encoder 20 also includes an inverse quantization unit 58, an inverse transform processing unit 60, and a summer 62 for video block reconstruction.
  • An in-loop filter 63 such as a deblocking filter, may be positioned between the summer 62 and the DPB 64 to filter block boundaries to remove blockiness artifacts from reconstructed video.
  • Another in-loop filter such as Sample Adaptive Offset (SAO) filter and/or Adaptive in-Loop Filter (ALF), may also be used in addition to the deblocking filter to filter an output of the summer 62.
  • the in-loop filters may be omitted, and the decoded video block may be directly provided by the summer 62 to the DPB 64.
  • the video encoder 20 may take the form of a fixed or programmable hardware unit or may be divided among one or more of the illustrated fixed or programmable hardware units.
  • the video data memory 40 may store video data to be encoded by the components of the video encoder 20.
  • the video data in the video data memory 40 may be obtained, for example, from the video source 18 as shown in FIG. 1.
  • the DPB 64 is a buffer that stores reference video data (for example, reference frames or pictures) for use in encoding video data by the video encoder 20 (e.g., in intra or inter predictive coding modes).
  • the video data memory 40 and the DPB 64 may be formed by any of a variety of memory devices.
  • the video data memory 40 may be on-chip with other components of the video encoder 20, or off-chip relative to those components.
  • the partition unit 45 within the prediction processing unit 41 partitions the video data into video blocks.
  • This partitioning may also include partitioning a video frame into slices, tiles (for example, sets of video blocks), or other larger Coding Units (CUs) according to predefined splitting structures such as a Quad-Tree (QT) structure associated with the video data.
  • the video frame is or may be regarded as a two- dimensional array or matrix of samples with sample values.
  • a sample in the array may also be referred to as a pixel or a pel.
  • a number of samples in horizontal and vertical directions (or axes) of the array or picture define a size and/or a resolution of the video frame.
  • the video frame may be divided into multiple video blocks by, for example, using QT partitioning.
  • the video block again is or may be regarded as a two-dimensional array or matrix of samples with sample values, although of smaller dimension than the video frame.
  • a number of samples in horizontal and vertical directions (or axes) of the video block define a size of the video block.
  • the video block may further be partitioned into one or more block partitions or sub-blocks (which may form again blocks) by, for example, iteratively using QT partitioning, Binary-Tree (BT) partitioning or Triple-Tree (TT) partitioning or any combination thereof.
  • BT Binary-Tree
  • TT Triple-Tree partitioning or any combination thereof.
  • block or “video block” as used herein may be a portion, in particular a rectangular (square or non- square) portion, of a frame or a picture.
  • the block or video block may be or correspond to a Coding Tree Unit (CTU), a CU, a Prediction Unit (PU) or a Transform Unit (TU) and/or may be or correspond to a corresponding block, e.g., a Coding Tree Block (CTB), a Coding Block (CB), a Prediction Block (PB) or a Transform Block (TB) and/or to a sub-block.
  • CTU Coding Tree Block
  • PU Prediction Unit
  • TU Transform Unit
  • a corresponding block e.g., a Coding Tree Block (CTB), a Coding Block (CB), a Prediction Block (PB) or a Transform Block (TB) and/or to a sub-block.
  • CTB Coding Tree Block
  • PB Prediction Block
  • TB Transform Block
  • the prediction processing unit 41 may select one of a plurality of possible predictive coding modes, such as one of a plurality of intra predictive coding modes or one of a plurality of inter predictive coding modes, for the current video block based on error results (e.g., coding rate and the level of distortion).
  • the prediction processing unit 41 may provide the resulting intra or inter prediction coded block to the summer 50 to generate a residual block and to the summer 62 to reconstruct the encoded block for use as part of a reference frame subsequently.
  • the prediction processing unit 41 also provides syntax elements, such as motion vectors, intra-mode indicators, partition information, and other such syntax information, to the entropy encoding unit 56.
  • the intra prediction processing unit 46 within the prediction processing unit 41 may perform intra predictive coding of the current video block relative to one or more neighbor blocks in the same frame as the current block to be coded to provide spatial prediction.
  • the motion estimation unit 42 and the motion compensation unit 44 within the prediction processing unit 41 perform inter predictive coding of the current video block relative to one or more predictive blocks in one or more reference frames to provide temporal prediction.
  • the video encoder 20 may perform multiple coding passes, e.g., to select an appropriate coding mode for each block of video data.
  • the motion estimation unit 42 determines the inter prediction mode for a current video frame by generating a motion vector, which indicates the displacement of a video block within the current video frame relative to a predictive block within a reference video frame, according to a predetermined pattern within a sequence of video frames.
  • Motion estimation performed by the motion estimation unit 42, is the process of generating motion vectors, which estimate motion for video blocks.
  • a motion vector for example, may indicate the displacement of a video block within a current video frame or picture relative to a predictive block within a reference frame relative to the current block being coded within the current frame.
  • the predetermined pattern may designate video frames in the sequence as P frames or B frames.
  • the intra BC unit 48 may determine vectors, e.g., block vectors, for intra BC coding in a manner similar to the determination of motion vectors by the motion estimation unit 42 for inter prediction, or may utilize the motion estimation unit 42 to determine the block vector.
  • a predictive block for the video block may be or may correspond to a block or a reference block of a reference frame that is deemed as closely matching the video block to be coded in terms of pixel difference, which may be determined by Sum of Absolute Difference (SAD), Sum of Square Difference (SSD), or other difference metrics.
  • the video encoder 20 may calculate values for sub-integer pixel positions of reference frames stored in the DPB 64. For example, the video encoder 20 may interpolate values of one-quarter pixel positions, one-eighth pixel positions, or other fractional pixel positions of the reference frame. Therefore, the motion estimation unit 42 may perform a motion search relative to the full pixel positions and fractional pixel positions and output a motion vector with fractional pixel precision.
  • the motion estimation unit 42 calculates a motion vector for a video block in an inter prediction coded frame by comparing the position of the video block to the position of a predictive block of a reference frame selected from a first reference frame list (List 0) or a second reference frame list (List 1), each of which identifies one or more reference frames stored in the DPB 64.
  • the motion estimation unit 42 sends the calculated motion vector to the motion compensation unit 44 and then to the entropy encoding unit 56.
  • Motion compensation performed by the motion compensation unit 44, may involve fetching or generating the predictive block based on the motion vector determined by the motion estimation unit 42.
  • the motion compensation unit 44 may locate a predictive block to which the motion vector points in one of the reference frame lists, retrieve the predictive block from the DPB 64, and forward the predictive block to the summer 50.
  • the summer 50 then forms a residual video block of pixel difference values by subtracting pixel values of the predictive block provided by the motion compensation unit 44 from the pixel values of the current video block being coded.
  • the pixel difference values forming the residual video block may include luma or chroma difference components or both.
  • the motion compensation unit 44 may also generate syntax elements associated with the video blocks of a video frame for use by the video decoder 30 in decoding the video blocks of the video frame.
  • the syntax elements may include, for example, syntax elements defining the motion vector used to identify the predictive block, any flags indicating the prediction mode, or any other syntax information described herein. Note that the motion estimation unit 42 and the motion compensation unit 44 may be highly integrated, but are illustrated separately for conceptual purposes.
  • the intra BC unit 48 may generate vectors and fetch predictive blocks in a manner similar to that described above in connection with the motion estimation unit 42 and the motion compensation unit 44, but with the predictive blocks being in the same frame as the current block being coded and with the vectors being referred to as block vectors as opposed to motion vectors.
  • the intra BC unit 48 may determine an intra-prediction mode to use to encode a current block.
  • the intra BC unit 48 may encode a current block using various intra-prediction modes, e.g., during separate encoding passes, and test their performance through rate-distortion analysis.
  • the intra BC unit 48 may select, among the various tested intra-prediction modes, an appropriate intra-prediction mode to use and generate an intra-mode indicator accordingly. For example, the intra BC unit 48 may calculate rate-distortion values using a rate-distortion analysis for the various tested intra-prediction modes, and select the intra-prediction mode having the best rate-distortion characteristics among the tested modes as the appropriate intra-prediction mode to use. Rate-distortion analysis generally determines an amount of distortion (or error) between an encoded block and an original, unencoded block that was encoded to produce the encoded block, as well as a bitrate (i.e., a number of bits) used to produce the encoded block. Intra BC unit 48 may calculate ratios from the distortions and rates for the various encoded blocks to determine which intra-prediction mode exhibits the best rate-distortion value for the block.
  • Rate-distortion analysis generally determines an amount of distortion (or error) between an encoded block and an original, unencoded block
  • the intra BC unit 48 may use the motion estimation unit 42 and the motion compensation unit 44, in whole or in part, to perform such functions for Intra BC prediction according to the implementations described herein.
  • a predictive block may be a block that is deemed as closely matching the block to be coded, in terms of pixel difference, which may be determined by SAD, SSD, or other difference metrics, and identification of the predictive block may include calculation of values for subinteger pixel positions.
  • the video encoder 20 may form a residual video block by subtracting pixel values of the predictive block from the pixel values of the current video block being coded, forming pixel difference values.
  • the pixel difference values forming the residual video block may include both luma and chroma component differences.
  • the intra prediction processing unit 46 may intra-predict a current video block, as an alternative to the inter-prediction performed by the motion estimation unit 42 and the motion compensation unit 44, or the intra block copy prediction performed by the intra BC unit 48, as described above.
  • the intra prediction processing unit 46 may determine an intra prediction mode to use to encode a current block. To do so, the intra prediction processing unit 46 may encode a current block using various intra prediction modes, e.g., during separate encoding passes, and the intra prediction processing unit 46 (or a mode selection unit, in some examples) may select an appropriate intra prediction mode to use from the tested intra prediction modes.
  • the intra prediction processing unit 46 may provide information indicative of the selected intra-prediction mode for the block to the entropy encoding unit 56.
  • the entropy encoding unit 56 may encode the information indicating the selected intra-prediction mode in the bitstream.
  • the summer 50 forms a residual video block by subtracting the predictive block from the current video block.
  • the residual video data in the residual block may be included in one or more TUs and is provided to the transform processing unit 52.
  • the transform processing unit 52 transforms the residual video data into residual transform coefficients using a transform, such as a Discrete Cosine Transform (DCT) or a conceptually similar transform.
  • DCT Discrete Cosine Transform
  • the transform processing unit 52 may send the resulting transform coefficients to the quantization unit 54.
  • the quantization unit 54 quantizes the transform coefficients to further reduce the bit rate.
  • the quantization process may also reduce the bit depth associated with some or all of the coefficients.
  • the degree of quantization may be modified by adjusting a quantization parameter.
  • the quantization unit 54 may then perform a scan of a matrix including the quantized transform coefficients.
  • the entropy encoding unit 56 may perform the scan.
  • the entropy encoding unit 56 entropy encodes the quantized transform coefficients into a video bitstream using, e.g., Context Adaptive Variable Length Coding (CAVLC), Context Adaptive Binary Arithmetic Coding (CAB AC), Syntax-based context-adaptive Binary Arithmetic Coding (SBAC), Probability Interval Partitioning Entropy (PIPE) coding or another entropy encoding methodology or technique.
  • CAVLC Context Adaptive Variable Length Coding
  • CAB AC Context Adaptive Binary Arithmetic Coding
  • SBAC Syntax-based context-adaptive Binary Arithmetic Coding
  • PIPE Probability Interval Partitioning Entropy
  • the encoded bitstream may then be transmitted to the video decoder 30 as shown in FIG. 1, or archived in the storage device 32 as shown in FIG. 1 for later transmission to or retrieval by the video decoder 30.
  • the entropy encoding unit 56 may also
  • the inverse quantization unit 58 and the inverse transform processing unit 60 apply inverse quantization and inverse transformation, respectively, to reconstruct the residual video block in the pixel domain for generating a reference block for prediction of other video blocks.
  • the motion compensation unit 44 may generate a motion compensated predictive block from one or more reference blocks of the frames stored in the DPB 64.
  • the motion compensation unit 44 may also apply one or more interpolation filters to the predictive block to calculate sub-integer pixel values for use in motion estimation.
  • the summer 62 adds the reconstructed residual block to the motion compensated predictive block produced by the motion compensation unit 44 to produce a reference block for storage in the DPB 64.
  • the reference block may then be used by the intra BC unit 48, the motion estimation unit 42 and the motion compensation unit 44 as a predictive block to inter predict another video block in a subsequent video frame.
  • FIG. 3 is a block diagram illustrating an exemplary video decoder 30 in accordance with some implementations of the present application.
  • the video decoder 30 includes a video data memory 79, an entropy decoding unit 80, a prediction processing unit 81, an inverse quantization unit 86, an inverse transform processing unit 88, a summer 90, and a DPB 92.
  • the prediction processing unit 81 further includes a motion compensation unit 82, an intra prediction unit 84, and an intra BC unit 85.
  • the video decoder 30 may perform a decoding process generally reciprocal to the encoding process described above with respect to the video encoder 20 in connection with FIG. 2.
  • the motion compensation unit 82 may generate prediction data based on motion vectors received from the entropy decoding unit 80, while the intraprediction unit 84 may generate prediction data based on intra-prediction mode indicators received from the entropy decoding unit 80.
  • a unit of the video decoder 30 may be tasked to perform the implementations of the present application. Also, in some examples, the implementations of the present disclosure may be divided among one or more of the units of the video decoder 30.
  • the intra BC unit 85 may perform the implementations of the present application, alone, or in combination with other units of the video decoder 30, such as the motion compensation unit 82, the intra prediction unit 84, and the entropy decoding unit 80.
  • the video decoder 30 may not include the intra BC unit 85 and the functionality of intra BC unit 85 may be performed by other components of the prediction processing unit 81, such as the motion compensation unit 82.
  • the video data memory 79 may store video data, such as an encoded video bitstream, to be decoded by the other components of the video decoder 30.
  • the video data stored in the video data memory 79 may be obtained, for example, from the storage device 32, from a local video source, such as a camera, via wired or wireless network communication of video data, or by accessing physical data storage media (e.g., a flash drive or hard disk).
  • the video data memory 79 may include a Coded Picture Buffer (CPB) that stores encoded video data from an encoded video bitstream.
  • the DPB 92 of the video decoder 30 stores reference video data for use in decoding video data by the video decoder 30 (e.g., in intra or inter predictive coding modes).
  • the video data memory 79 and the DPB 92 may be formed by any of a variety of memory devices, such as dynamic random access memory (DRAM), including Synchronous DRAM (SDRAM), Magneto-resistive RAM (MRAM), Resistive RAM (RRAM), or other types of memory devices.
  • DRAM dynamic random access memory
  • SDRAM Synchronous DRAM
  • MRAM Magneto-resistive RAM
  • RRAM Resistive RAM
  • the video data memory 79 and the DPB 92 are depicted as two distinct components of the video decoder 30 in FIG. 3. But it will be apparent to one skilled in the art that the video data memory 79 and the DPB 92 may be provided by the same memory device or separate memory devices.
  • the video data memory 79 may be on-chip with other components of the video decoder 30, or off-chip relative to those components.
  • the video decoder 30 receives an encoded video bitstream that represents video blocks of an encoded video frame and associated syntax elements.
  • the video decoder 30 may receive the syntax elements at the video frame level and/or the video block level.
  • the entropy decoding unit 80 of the video decoder 30 entropy decodes the bitstream to generate quantized coefficients, motion vectors or intra-prediction mode indicators, and other syntax elements.
  • the entropy decoding unit 80 then forwards the motion vectors or intraprediction mode indicators and other syntax elements to the prediction processing unit 81.
  • the intra prediction unit 84 of the prediction processing unit 81 may generate prediction data for a video block of the current video frame based on a signaled intra prediction mode and reference data from previously decoded blocks of the current frame.
  • the motion compensation unit 82 of the prediction processing unit 81 produces one or more predictive blocks for a video block of the current video frame based on the motion vectors and other syntax elements received from the entropy decoding unit 80.
  • Each of the predictive blocks may be produced from a reference frame within one of the reference frame lists.
  • the video decoder 30 may construct the reference frame lists, List 0 and List 1, using default construction techniques based on reference frames stored in the DPB 92.
  • the intra BC unit 85 of the prediction processing unit 81 produces predictive blocks for the current video block based on block vectors and other syntax elements received from the entropy decoding unit 80.
  • the predictive blocks may be within a reconstructed region of the same picture as the current video block defined by the video encoder 20.
  • the motion compensation unit 82 and/or the intra BC unit 85 determines prediction information for a video block of the current video frame by parsing the motion vectors and other syntax elements, and then uses the prediction information to produce the predictive blocks for the current video block being decoded. For example, the motion compensation unit 82 uses some of the received syntax elements to determine a prediction mode (e.g., intra or inter prediction) used to code video blocks of the video frame, an inter prediction frame type (e.g., B or P), construction information for one or more of the reference frame lists for the frame, motion vectors for each inter predictive encoded video block of the frame, inter prediction status for each inter predictive coded video block of the frame, and other information to decode the video blocks in the current video frame.
  • a prediction mode e.g., intra or inter prediction
  • an inter prediction frame type e.g., B or P
  • the intra BC unit 85 may use some of the received syntax elements, e.g., a flag, to determine that the current video block was predicted using the intra BC mode, construction information of which video blocks of the frame are within the reconstructed region and should be stored in the DPB 92, block vectors for each intra BC predicted video block of the frame, intra BC prediction status for each intra BC predicted video block of the frame, and other information to decode the video blocks in the current video frame.
  • a flag e.g., a flag
  • the motion compensation unit 82 may also perform interpolation using the interpolation filters as used by the video encoder 20 during encoding of the video blocks to calculate interpolated values for sub-integer pixels of reference blocks. In this case, the motion compensation unit 82 may determine the interpolation filters used by the video encoder 20 from the received syntax elements and use the interpolation filters to produce predictive blocks.
  • the inverse quantization unit 86 inverse quantizes the quantized transform coefficients provided in the bitstream and entropy decoded by the entropy decoding unit 80 using the same quantization parameter calculated by the video encoder 20 for each video block in the video frame to determine a degree of quantization.
  • the inverse transform processing unit 88 applies an inverse transform, e.g., an inverse DCT, an inverse integer transform, or a conceptually similar inverse transform process, to the transform coefficients in order to reconstruct the residual blocks in the pixel domain.
  • the summer 90 reconstructs decoded video block for the current video block by summing the residual block from the inverse transform processing unit 88 and a corresponding predictive block generated by the motion compensation unit 82 and the intra BC unit 85.
  • An in-loop filter 91 such as deblocking filter, SAO filter and/or ALF may be positioned between the summer 90 and the DPB 92 to further process the decoded video block.
  • the in-loop filter 91 may be applied on the reconstructed CU before it is put in the reference picture store.
  • the in-loop filter 91 may be omitted, and the decoded video block may be directly provided by the summer 90 to the DPB 92.
  • the decoded video blocks in a given frame are then stored in the DPB 92, which stores reference frames used for subsequent motion compensation of next video blocks.
  • the DPB 92, or a memory device separate from the DPB 92 may also store decoded video for later presentation on a display device, such as the display device 34 of FIG. 1.
  • a video sequence typically includes an ordered set of frames or pictures. Each frame may include three sample arrays, denoted SL, SCb, and SCr.
  • SL is a two-dimensional array of luma samples.
  • SCb is a two-dimensional array of Cb chroma samples.
  • SCr is a two-dimensional array of Cr chroma samples.
  • a frame may be monochrome and therefore includes only one two-dimensional array of luma samples.
  • the AVS3 standard is built upon the block-based hybrid video coding framework.
  • the input video signal is processed block by block (called coding units (CUs)).
  • CUs coding units
  • one coding tree unit (CTU) is split into CUs to adapt to varying local characteristics based on quad/binary/extended-quad-tree.
  • the concept of multiple partition unit type in the HEVC is removed, i.e., the separation of CU, prediction unit (PU) and transform unit (TU) does not exist in the AVS3. Instead, each CU is always used as the basic unit for both prediction and transform without further partitions.
  • one CTU is firstly partitioned based on a quad-tree structure. Then, each quad-tree leaf node can be further partitioned based on a binary and extended-quad-tree structure.
  • the video encoder 20 (or more specifically the partition unit 45) generates an encoded representation of a frame by first partitioning the frame into a set of CTUs.
  • a video frame may include an integer number of CTUs ordered consecutively in a raster scan order from left to right and from top to bottom.
  • Each CTU is a largest logical coding unit and the width and height of the CTU are signaled by the video encoder 20 in a sequence parameter set, such that all the CTUs in a video sequence have the same size being one of 128 ⁇ 128, 64x64, 32x32, and 16x16. But it should be noted that the present application is not necessarily limited to a particular size. As shown in FIG.
  • each CTU may comprise one CTB of luma samples, two corresponding coding tree blocks of chroma samples, and syntax elements used to code the samples of the coding tree blocks.
  • the syntax elements describe properties of different types of units of a coded block of pixels and how the video sequence can be reconstructed at the video decoder 30, including inter or intra prediction, intra prediction mode, motion vectors, and other parameters.
  • a CTU may comprise a single coding tree block and syntax elements used to code the samples of the coding tree block.
  • a coding tree block may be an NxN block of samples.
  • the video encoder 20 may recursively perform tree partitioning such as binary-tree partitioning, ternary-tree partitioning, quad-tree partitioning or a combination thereof on the coding tree blocks of the CTU and divide the CTU into smaller CUs.
  • tree partitioning such as binary-tree partitioning, ternary-tree partitioning, quad-tree partitioning or a combination thereof on the coding tree blocks of the CTU and divide the CTU into smaller CUs.
  • the 64x64 CTU 400 is first divided into four smaller CUs, each having a block size of 32x32.
  • CU 410 and CU 420 are each divided into four CUs of 16x16 by block size.
  • the two 16x16 CUs 430 and 440 are each further divided into four CUs of 8x8 by block size.
  • each leaf node of the quadtree corresponding to one CU of a respective size ranging from 32x32 to 8x8.
  • each CU may comprise a CB of luma samples and two corresponding coding blocks of chroma samples of a frame of the same size, and syntax elements used to code the samples of the coding blocks.
  • a CU may comprise a single coding block and syntax structures used to code the samples of the coding block.
  • each CTU is partitioned by a quad-tree structure and each quad-tree leaf CU can be further partitioned by a binary and ternary tree structure.
  • FIG. 4E there are five possible partitioning types of a coding block having a width W and a height H, i.e., quaternary partitioning, horizontal binary partitioning, vertical binary partitioning, horizontal ternary partitioning, and vertical ternary partitioning.
  • AVS3 there are five possible partitioning types, i.e., quaternary partitioning, horizontal binary partitioning, vertical binary partitioning, horizontal extended quad-tree partitioning, and vertical extended quad-tree partitioning.
  • the video encoder 20 may further partition a coding block of a CU into one or more MxN PBs.
  • a PB is a rectangular (square or non-square) block of samples on which the same prediction, inter or intra, is applied.
  • a PU of a CU may comprise a PB of luma samples, two corresponding PBs of chroma samples, and syntax elements used to predict the PBs. In monochrome pictures or pictures having three separate color planes, a PU may comprise a single PB and syntax structures used to predict the PB.
  • the video encoder 20 may generate predictive luma, Cb, and Cr blocks for luma, Cb, and Cr PBs of each PU of the CU.
  • the video encoder 20 may use intra prediction or inter prediction to generate the predictive blocks for a PU. If the video encoder 20 uses intra prediction to generate the predictive blocks of a PU, the video encoder 20 may generate the predictive blocks of the PU based on decoded samples of the frame associated with the PU. If the video encoder 20 uses inter prediction to generate the predictive blocks of a PU, the video encoder 20 may generate the predictive blocks of the PU based on decoded samples of one or more frames other than the frame associated with the PU.
  • the video encoder 20 may generate a luma residual block for the CU by subtracting the CU’s predictive luma blocks from its original luma coding block such that each sample in the CU’s luma residual block indicates a difference between a luma sample in one of the CU's predictive luma blocks and a corresponding sample in the CU's original luma coding block.
  • the video encoder 20 may generate a Cb residual block and a Cr residual block for the CU, respectively, such that each sample in the CU's Cb residual block indicates a difference between a Cb sample in one of the CU's predictive Cb blocks and a corresponding sample in the CU's original Cb coding block and each sample in the CU's Cr residual block may indicate a difference between a Cr sample in one of the CU's predictive Cr blocks and a corresponding sample in the CU's original Cr coding block.
  • each sample in the CU's Cr residual block may indicate a difference between a Cr sample in one of the CU's predictive Cr blocks and a corresponding sample in the CU's original Cr coding block.
  • the video encoder 20 may use quad-tree partitioning to decompose the luma, Cb, and Cr residual blocks of a CU into one or more luma, Cb, and Cr transform blocks respectively.
  • a transform block is a rectangular (square or nonsquare) block of samples on which the same transform is applied.
  • a TU of a CU may comprise a transform block of luma samples, two corresponding transform blocks of chroma samples, and syntax elements used to transform the transform block samples.
  • each TU of a CU may be associated with a luma transform block, a Cb transform block, and a Cr transform block.
  • the luma transform block associated with the TU may be a sub-block of the CU's luma residual block.
  • the Cb transform block may be a sub-block of the CU's Cb residual block.
  • the Cr transform block may be a sub-block of the CU's Cr residual block.
  • a TU may comprise a single transform block and syntax structures used to transform the samples of the transform block.
  • the video encoder 20 may apply one or more transforms to a luma transform block of a TU to generate a luma coefficient block for the TU.
  • a coefficient block may be a two- dimensional array of transform coefficients.
  • a transform coefficient may be a scalar quantity.
  • the video encoder 20 may apply one or more transforms to a Cb transform block of a TU to generate a Cb coefficient block for the TU.
  • the video encoder 20 may apply one or more transforms to a Cr transform block of a TU to generate a Cr coefficient block for the TU.
  • the video encoder 20 may quantize the coefficient block. Quantization generally refers to a process in which transform coefficients are quantized to possibly reduce the amount of data used to represent the transform coefficients, providing further compression.
  • the video encoder 20 may entropy encode syntax elements indicating the quantized transform coefficients. For example, the video encoder 20 may perform CAB AC on the syntax elements indicating the quantized transform coefficients.
  • the video encoder 20 may output a bitstream that includes a sequence of bits that forms a representation of coded frames and associated data, which is either saved in the storage device 32 or transmitted to the destination device 14.
  • the video decoder 30 may parse the bitstream to obtain syntax elements from the bitstream.
  • the video decoder 30 may reconstruct the frames of the video data based at least in part on the syntax elements obtained from the bitstream.
  • the process of reconstructing the video data is generally reciprocal to the encoding process performed by the video encoder 20.
  • the video decoder 30 may perform inverse transforms on the coefficient blocks associated with TUs of a current CU to reconstruct residual blocks associated with the TUs of the current CU.
  • the video decoder 30 also reconstructs the coding blocks of the current CU by adding the samples of the predictive blocks for PUs of the current CU to corresponding samples of the transform blocks of the TUs of the current CU. After reconstructing the coding blocks for each CU of a frame, video decoder 30 may reconstruct the frame.
  • video coding achieves video compression using primarily two modes, i.e., intra-frame prediction (or intra-prediction) and inter-frame prediction (or inter-prediction). It is noted that IBC could be regarded as either intra-frame prediction or a third mode. Between the two modes, inter-frame prediction contributes more to the coding efficiency than intra-frame prediction because of the use of motion vectors for predicting a current video block from a reference video block.
  • motion information of spatially neighboring CUs and/or temporally co-located CUs as an approximation of the motion information (e.g., motion vector) of a current CU by exploring their spatial and temporal correlation, which is also referred to as “Motion Vector Predictor (MVP)” of the current CU.
  • MVP Motion Vector Predictor
  • a set of rules need to be adopted by both the video encoder 20 and the video decoder 30 for constructing a motion vector candidate list (also known as a “merge list”) for a current CU using those potential candidate motion vectors associated with spatially neighboring CUs and/or temporally co-located CUs of the current CU and then selecting one member from the motion vector candidate list as a motion vector predictor for the current CU.
  • a motion vector candidate list also known as a “merge list”
  • the basic intra prediction scheme applied in VVC is almost kept the same as that of HEVC, except that several prediction tools are further extended, added and/or improved, e.g., extended intra prediction with wide-angle intra modes, Multiple Reference Line (MRL) intra prediction, Position-Dependent intra Prediction Combination (PDPC), Intra Sub-Partition (ISP) prediction, Cross-Component Linear Model (CCLM) prediction, and Matrix weighted Intra Prediction (MIP).
  • MML Multiple Reference Line
  • PDPC Position-Dependent intra Prediction Combination
  • ISP Intra Sub-Partition
  • CCLM Cross-Component Linear Model
  • MIP Matrix weighted Intra Prediction
  • FIG. 4F is a block diagram illustrating intra modes as defined in VVC. As shown in FIG. 4F, among the 93 angular intra modes, modes 2 to 66 are conventional angular intra modes, and modes -1 to -14 and modes 67 to 80 are wide-angle intra modes. In addition to the angular intra modes, the planar mode (mode 0 in FIG. 1) and Direct Current (DC) mode (mode 1 in FIG. 1) of HEVC are also applied in VVC.
  • an index of a wide-angle intra mode of the video block may be adaptively determined by the video decoder 30 according to an index of a conventional angular intra mode received from the video encoder 20 using a mapping relationship as shown in Table 1-0 below.
  • the wide-angle intra modes are signaled by the video encoder 20 using the indexes of the conventional angular intra modes, which are mapped to indexes of the wide-angle intra modes by the video decoder 30 after being parsed, thus ensuring that a total number (i.e., 67) of intra modes (i.e., the planar mode, the DC mode and 65 angular intra modes among the 93 angular intra modes) is unchanged, and the intra-prediction mode coding method is unchanged. As a result, a good efficiency of signaling intra-prediction modes is achieved while providing a consistent design across different block sizes.
  • Table 1-0 shows a mapping relationship between indexes of conventional angular intra modes and indexes of wide-angle intra modes for the intra prediction of different block shapes in VCC, wherein W represents a width of a video block, and H represents a height of the video block.
  • VVC Similar to the intra prediction in HEVC, all the intra modes (i.e., planar, DC and angular intra modes) in VVC utilize a set of reference samples above and left to a current video block for intra prediction. However, differently from HEVC where only the nearest row/column (i.e., a zeroth line 201 in FIG. 4G) of reference samples are used, MRL intra prediction is introduced in VVC where in addition to the nearest row/column of reference samples, two additional rows/columns of reference samples (i.e., a first line 203 and a third line 205 in FIG. 4G) may be used for the intra prediction.
  • MRL intra prediction is introduced in VVC where in addition to the nearest row/column of reference samples, two additional rows/columns of reference samples (i.e., a first line 203 and a third line 205 in FIG. 4G) may be used for the intra prediction.
  • An index of a selected row/column of reference samples is signaled from the video encoder 20 to the video decoder 30.
  • a non-nearest row/column of reference samples i.e., the first line 203 or the third line 205 in FIG. 4G
  • the planar mode is excluded from a set of intra modes that may be used to predict the current video block.
  • the MRL intra prediction is disabled for a first row/column of video blocks inside a current CTU to prevent using extended reference samples outside the current CTU.
  • Sample Adaptive Offset is a process that modifies the decoded samples by conditionally adding an offset value to each sample after the application of the deblocking filter, based on values in look-up tables transmitted by the encoder.
  • SAO filtering is performed on a region basis, based on a filtering type selected per CTB by a syntax element sao-type-idx.
  • a value of 0 for sao-type-idx indicates that the SAO filter is not applied to the CTB, and the values 1 and 2 signal the use of the band offset and edge offset filtering types, respectively.
  • the selected offset value directly depends on the sample amplitude.
  • the full sample amplitude range is uniformly split into 32 segments called bands, and the sample values belonging to four of these bands (which are consecutive within the 32 bands) are modified by adding transmitted values denoted as band offsets, which can be positive or negative.
  • band offsets transmitted values denoted as band offsets, which can be positive or negative.
  • the main reason for using four consecutive bands is that in the smooth areas where banding artifacts can appear, the sample amplitudes in a CTB tend to be concentrated in only few of the bands.
  • the design choice of using four offsets is unified with the edge offset mode of operation which also uses four offset values.
  • FIG. 5A is a block diagram depicting the four gradient patterns used in SAO in accordance with some implementations of the present disclosure.
  • the four gradient patterns 502, 504, 506, and 508 are for the respective sao-eo-class in the edge offset mode.
  • Sample labelled “p” indicates a center sample to be considered.
  • Each sample in the CTB is classified into one of five Edgeldx categories by comparing the sample value p located at some position with the values nO and nl of two samples located at neighboring positions as shown in FIG. 5A. This classification is done for each sample based on decoded sample values, so no additional signaling is required for the Edgeldx classification.
  • SAO types 1 and 2 a total of four amplitude offset values are transmitted to the decoder for each CTB.
  • type 1 the sign is also encoded.
  • the offset values and related syntax elements such as sao-type-idx and sao-eo-class are determined by the encoder - typically using criteria that optimize rate-distortion performance.
  • the SAO parameters can be indicated to be inherited from the left or above CTB using a merge flag to make the signaling efficient.
  • SAO is a nonlinear filtering operation which allows additional refinement of the reconstructed signal, and it can enhance the signal representation in both smooth areas and around edges.
  • Pre-Sample Adaptive Offset is implemented.
  • the coding performance of pre-SAO with low complexity is promising in the future video coding standard development.
  • Pre-SAO is only applied on luma component samples using luma samples for classification.
  • Pre-SAO operates by applying two SAO-like filtering operations called SAOV and SAOH and they are applied jointly with the deblocking filter (DBF) before applying the existing (legacy) SAO.
  • the first SAO-like filter SAOV operates as applying SAO to the input picture Y 2 after the deblocking filter for the vertical edges (DBFV) is applied.
  • T is a predetermined positive constant and d ⁇ and d 2 are offset coefficients associated with two classes based on the sample-wise difference between ⁇ (i) and f 2 (i) given by
  • the first class for d r is given as taking all sample locations i such that /(i) > T while the second class for d 2 is given by /(i) ⁇ — T.
  • the offset coefficients d r and d 2 are calculated at the encoder so that the mean square error between output picture f 3 of SAOV and the original picture X is minimized, in the same way as in the existing SAO process.
  • the second SAO-like filter SAOH operates as applying SAO to f 4 , after SAOV has been applied, with a classification based on the sample-wise difference between f 3 (t) and f 4 (i), the output picture of the deblocking filter for the horizontal edges (DBFH), as shown in FIG. 5B.
  • both SAOV and SAOH operate only on the picture samples affected by the respective deblocking (DBFV or DBFH).
  • DBFV or DBFH deblocking
  • Pre-SAO only a subset of all samples in the given spatial region (picture, or CTU in case of legacy SAO) are being processed by the Pre-SAO, which keeps the resulting increase in decoder-side mean operations per picture sample low (two or three comparisons and two additions per sample in the worst-case scenario according to preliminary estimates).
  • Pre-SAO only needs samples used by the deblocking filter without storing additional samples at the decoder.
  • bilateral filter is implemented for compression efficiency exploration beyond VVC.
  • the BIF is carried out in the sample adaptive offset (SAO) loop-filter stage.
  • Both the bilateral filter (BIF) and SAO are using samples from deblocking as input. Each filter creates an offset per sample, and these are added to the input sample and then clipped, before proceeding to ALF.
  • the output sample I 0UT is obtained as where I c is the input sample from deblocking, &I BIF is the offset from the bilateral filter and is the offset from SAO.
  • the implementation provides the possibility for the encoder to enable or disable filtering at the CTU and slice level.
  • the encoder takes a decision by evaluating the Rate-distortion optimization (RDO) cost.
  • RDO Rate-distortion optimization
  • pps bilateral filter enabled flag 0 specifies that the bilateral loop filter is disabled for slices referring to the PPS.
  • pps bilateral filter flag 1 specifies that the bilateral loop filter is enabled for slices referring to the PPS.
  • bilateral filter strength specifies a bilateral loop filter strength value used in the bilateral transform block filter process.
  • the value of bilateral filter strength shall be in the range of 0 to 2, inclusive.
  • bilateral filter qp offset specifies an offset used in the derivation of the bilateral filter look-up table, LUT(x), for slices referring to the PPS.
  • bilateral filter qp offset shall be in the range of -12 to +12, inclusive.
  • slice bilateral filter all ctb enabled flag 1 specifies that the bilateral filter is enabled and is applied to all CTBs in the current slice.
  • slice bilateral filter all ctb enabled flag is not present, it is inferred to be equal to 0.
  • slice bilateral filter enabled flag 1 specifies that the bilateral filter is enabled and may be applied to CTBs of the current slice. When slice bilateral filter enabled flag is not present, it is inferred to be equal to slice bilateral filter all ctb enabled flag.
  • bilateral filter ctb flag [xCtb » CtbLog2SizeY ][ yCtb » CtbLog2SizeY ] equal to 1 specifies that the bilateral filter is applied to the luma coding tree block of the coding tree unit at luma location ( xCtb, yCtb ).
  • bilateral filter ctb flag [ cldx ][ xCtb » CtbLog2SizeY ][ yCtb » CtbLog2SizeY ] equal to 0 specifies that the bilateral filter is not applied to the luma coding tree block of the coding tree unit at luma location ( xCtb, yCtb ).
  • bilateral filter ctb flag is not present, it is inferred to be equal (slice bilateral filter all ctb enabled flag & slice bilateral filter enabled flag).
  • FIG. 7 is a block diagram depicting naming convention for samples surrounding the center sample, in accordance with some implementations of the present disclosure.
  • n-bit data is to use where bilateral filter strength can be 0 or 1 and is signalled in the pps.
  • VVC Adaptive Loop Filter
  • ALF Adaptive Loop Filter
  • FIGS. 8A-8B Two diamond filter shapes (as shown in FIGS. 8A-8B) are used. The 7x7 diamond shape is applied for luma component and the 5x5 diamond shape is applied for chroma components.
  • each 4 x 4 block is categorized into one out of 25 classes.
  • the classification index C is derived based on its directionality D and a quantized value of activity A, as follows:
  • the activity value A is calculated as:
  • A is further quantized to the range of 0 to 4, inclusively, and the quantized value is denoted as A.
  • K is the size of the filter and are coefficients coordinates, such that location (0,0) is at the upper left corner and location is at the lower right comer.
  • the transformations are applied to the filter coefficients f (k, 1) and to the clipping values c(fc, Z) depending on gradient values calculated for that block.
  • the relationship between the transformation and the four gradients of the four directions are summarized in the following Table 1-6 showing a mapping of the gradient calculated for one block and the transformations.
  • each sample R(i,j) within the CU is filtered, resulting in sample value R'(i> j) as shown below, where f(k, Z) denotes the decoded filter coefficients, K(x, y) is the clipping function and (fc Z) denotes the decoded clipping parameters.
  • the variable k and 1 varies between where L denotes the filter length.
  • the clipping function K (x, y) min (y, max(— y, x)) which corresponds to the function Clip3 (— y, y, x).
  • the clipping operation introduces non-linearity to make ALF more efficient by reducing the impact of neighbor sample values that are too different with the current sample value.
  • CC-ALF uses luma sample values to refine each chroma component by applying an adaptive, linear filter to the luma channel and then using the output of this filtering operation for chroma refinement.
  • FIG. 10A provides a system level diagram of the CC-ALF process with respect to the SAO, luma ALF and chroma ALF processes.
  • Filtering in CC-ALF is accomplished by applying a linear, diamond shaped filter (FIG. 10B) to the luma channel.
  • FOG. 10B linear, diamond shaped filter
  • One filter is used for each chroma channel, and the operation is expressed as where (x, y) is chroma component i location being refined (x y , y r ) is the luma location based on (x,y), Si is filter support area in luma component, c £ (x 0 , y 0 ) represents the filter coefficients.
  • the luma filter support is the region collocated with the current chroma sample after accounting for the spatial scaling factor between the luma and chroma planes.
  • CC-ALF filter coefficients are computed by minimizing the mean square error of each chroma channels with respect to the original chroma content.
  • the VTM algorithm uses a coefficient derivation process similar to the one used for chroma ALF. Specifically, a correlation matrix is derived, and the coefficients are computed using a Cholesky decomposition solver in an attempt to minimize a mean square error metric.
  • a maximum of 8 CC-ALF filters can be designed and transmitted per picture. The resulting filters are then indicated for each of the two chroma channels on a CTU basis.
  • CC-ALF Additional characteristics of CC-ALF include:
  • the design uses a 3x4 diamond shape with 8 taps
  • Each of the transmitted coefficients has a 6-bit dynamic range and is restricted to power-of-2 values
  • the eighth filter coefficient is derived at the decoder such that the sum of the filter coefficients is equal to 0;
  • CC-ALF filter selection is controlled at CTU-level for each chroma component
  • Boundary padding for the horizontal virtual boundaries uses the same memory access pattern as luma ALF.
  • the reference encoder can be configured to enable some basic subjective tuning through the configuration file.
  • the VTM attenuates the application of CC-ALF in regions that are coded with high QP and are either near mid-grey or contain a large amount of luma high frequencies. Algorithmically, this is accomplished by disabling the application of CC-ALF in CTUs where any of the following conditions are true:
  • the slice QP value minus 1 is less than or equal to the base QP value
  • ALF filter parameters are signalled in Adaptation Parameter Set (APS).
  • APS Adaptation Parameter Set
  • filter coefficients of different classification for luma component can be merged.
  • slice header the indices of the APSs used for the current slice are signaled.
  • Clipping value indexes which are decoded from the APS, allow determining clipping values using a table of clipping values for both luma and Chroma components. These clipping values are dependent of the internal bitdepth. More precisely, the clipping values are obtained by the following formula:
  • a with B equal to the internal bitdepth, a is a pre-defined constant value equal to 2.35, and N equal to 4 which is the number of allowed clipping values in VVC.
  • the AlfClip is then rounded to the nearest value with the format of power of 2.
  • APS indices can be signaled to specify the luma filter sets that are used for the current slice.
  • the filtering process can be further controlled at CTB level.
  • a flag is always signalled to indicate whether ALF is applied to a luma CTB.
  • a luma CTB can choose a filter set among 16 fixed filter sets and the filter sets from APSs.
  • a filter set index is signaled for a luma CTB to indicate which filter set is applied.
  • the 16 fixed filter sets are pre-defined and hard-coded in both the encoder and the decoder.
  • an APS index is signaled in slice header to indicate the chroma filter sets being used for the current slice.
  • a filter index is signaled for each chroma CTB if there is more than one chroma filter set in the APS.
  • the filter coefficients are quantized with norm equal to 128.
  • a bitstream conformance is applied so that the coefficient value of the non-central position shall be in the range of -2 7 to 2 7 - 1, inclusive.
  • the central position coefficient is not signalled in the bitstream and is considered as equal to 128.
  • VVC to reduce the line buffer requirement of ALF, modified block classification and filtering are employed for the samples near horizontal CTU boundaries.
  • a virtual boundary is defined as a line by shifting the horizontal CTU boundary with “N” samples as shown in FIG. 11, with N equal to 4 for the Luma component and 2 for the Chroma component.
  • Modified block classification is applied for the Luma component as depicted in FIG. 11.
  • the ID Laplacian gradient calculation of the 4x4 block below the virtual boundary only the samples below the virtual boundary are used.
  • the quantization of activity value A is accordingly scaled by taking into account the reduced number of samples used in ID Laplacian gradient calculation.
  • symmetric padding operation at the virtual boundaries are used for both Luma and Chroma components. As shown in FIG. 12, when the sample being filtered is located below the virtual boundary, the neighboring samples that are located above the virtual boundary are padded. Meanwhile, the corresponding samples at the other sides are also padded, symmetrically.
  • the luma Y, chroma Cb and chroma Cr sample offset values are decided independently. That is, for example, the current chroma sample offset is decided by only the current and neighboring chroma sample values, without taking collocated or neighboring luma samples into consideration.
  • luma samples preserve more original picture detail information than chroma samples, and they can benefit the decision of the current chroma sample offset.
  • the correlation not only includes cross-component sample values but also includes picture/coding information such as prediction/residual coding modes, transformation types, and quantization/deblocking/SAO/ALF parameters from crosscomponents.
  • a luma sample offsets are decided only by the luma samples.
  • a luma sample with the same band offset (BO) classification can be further classified by its collocated and neighboring chroma samples, which may lead to a more effective classification.
  • SAO classification can be taken as a shortcut to compensate the sample difference between the original picture and the reconstructed picture. Therefore, an effective classification is desired.
  • Cross-component Sample Adaptive Offset (CCSAO)
  • the existing SAO design in the HEVC, VVC, AVS2, and AVS3 standards is used as the basic SAO method in the following description, to a person skilled in the art of video coding, the proposed cross-component method described in the disclosure can also be applied to other loop filter designs or other coding tools with similar design spirits.
  • SAO is replaced by a coding tool called Enhanced Sample Adaptive Offset (ESAO)
  • ESAO Enhanced Sample Adaptive Offset
  • the proposed CCSAO can also be applied in parallel with ESAO.
  • Another example that CCSAO can be applied in parallel is Constrained Directional Enhancement Filter (CDEF) in the AVI standard.
  • CDEF Constrained Directional Enhancement Filter
  • FIGS. 13A-13F show the diagram of the proposed method.
  • the luma samples after luma deblocking filter (DBF Y) is used to determine additional offsets for chroma Cb and Cr after SAO Cb and SAO Cr.
  • the current chroma sample (1302) is first classified using collocated (1304) and neighboring (1306) luma samples, and the CCSAO offset of the corresponding class is added to the current chroma sample.
  • CCSAO applies on luma and chroma samples, and uses DBF Y/Cb/Cr as input.
  • CCSAO may work independently.
  • FIG. 13A the luma samples after luma deblocking filter
  • CCSAO can be applied recursively (2 or N times) with same or different offsets in the same codec stage or repeated in the different stages.
  • CCSAO applies in parallel with SAO and BIF.
  • CCSAO replaces SAO and applies in parallel with BIF.
  • FIG. 14 shows that CCSAO may also be applied in parallel with other coding tools.
  • CCSAO may also be applied in parallel with other coding tools.
  • FIG. 15A shows the location of CCSAO can be after SAO, i.e., the location of CCALF in the VVC standard.
  • CCS AO can work independently without CCALF.
  • CCS AO can serve as a post reconstruction filter, i.e., using reconstructed sample as input for classification, compensating luma/chroma samples before entering neighboring intra prediction.
  • FIG. 16 shows CCSAO can also be applied in parallel with CCALF. In FIG. 16, the location of CCALF and CCSAO can be switched. Note in FIG.
  • the SAO Y/Cb/Cr blocks can be replaced by ESAO Y/Cb/Cr (in AVS3) or CDEF (in AVI).
  • Y/Cb/Cr also can be denoted as Y/U/V in video coding area.
  • the proposed CCSAO can also be applied by simply mapping YUV notation to GBR in the below paragraphs.
  • FIGS. 13A-13F and FIG. 19 show the input of CCSAO classification.
  • FIGS. 13A-13F and FIG. 19 also show that all collocated and neighboring luma/chroma samples can be fed into CCSAO classification.
  • the classifiers mentioned in this disclosure not only can serve cross-component classification (for example, using luma to classify chroma or vice versa) but also can serve single component classification (for example, using luma to classify luma or using chroma to classify chroma), as the newly proposed classifier in this disclosure may also benefit the original SAO classification.
  • a classifier example is using the collocated luma or chroma sample value (Y0 in FIG. 13A) (Y4/U4/V4 in FIGS. 13B-13C) for classification.
  • band num be the number of equally divided bands of luma or chroma dynamic range
  • bit depth is the sequence bit depth
  • an example of the class index for the current chroma sample is
  • Class (CO) (Y0 * band num) » bit depth
  • Table 2-2 shows three classification examples when the number of bands is different for each of the classification examples.
  • the classification can take rounding into account.
  • Class (CO) ((YO * band num) + (1 « bit depth)) » bit depth
  • a classifier uses different luma (or chroma) sample position for CO classification. For example, using the neighboring Y7 but not YO for CO classification, as shown in FIG. 17. Different classifiers can be switched in
  • SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels For example, in FIG. 17, using YO for POCO but using Y7 for POC1, as shown in Table 2-2 below.
  • FIGS. 18A-18G show some examples of different shape luma candidates.
  • a constraint can be applied to the shape: total number of candidates must be power of 2, as shown in FIGS. 18B-18D.
  • a constraint can be applied to the shape: number of luma candidates must be horizontal and vertical symmetric with the chroma sample, as shown in FIGS. 18 A, 18C-18E.
  • the power of 2 constraint and the symmetric constraint can also be applied for chroma candidates.
  • U/V part shows an example for symmetric constraint.
  • different color format can have different classifiers “constraints.”
  • 420 uses FIGS. 13B-13C luma/chroma candidates selection (one candidate selected from 3x3 shape), but 444 uses FIG. 18F for luma and chroma candidates selection, 422 uses FIG. 18G for luma (2 chroma samples share 4 luma candidates), and FIG. 18F for chroma candidates.
  • the CO position and CO band num can be combined and switched in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels. Different combinations can be different classifiers as shown in Table 2-3 below.
  • the collocated luma sample value (Y0) can be replaced by a value (Yp) by weighting collocated and neighboring luma samples.
  • FIGS. 20A-20B show 2 examples. Different Yp can be a different classifier. Different Yp can be applied on different chroma format. For example, the Yp of FIG. 20A is used for the 420 case, the Yp of FIG. 20B is used for the 422 case, and Y0 is used for the 444 case.
  • another classifier example (Cl) is the comparison score [-8, 8] of the collocated luma samples (Y0) and neighboring 8 luma samples, which yields 17 classes in total.
  • the Cl example is equal to the following function with threshold th is 0.
  • one or plural thresholds can be predefined (e.g., kept in a LUT) or signaled in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels to help classify (quantize) the difference.
  • a variation is only counting comparison score [0, 8], and this yields 8 classes.
  • (Cl, CL) is a classifier group and a PH/SH level flag can be signaled to switch between Cl and CL .
  • a variation is selectively using neighboring N out of M neighboring samples to count the comparison score.
  • An M-bit bitmask can be signaled at SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels to indicate which neighboring samples are selected to count the comparison score.
  • FIG. 13B as an example for a luma classifier: 8 neighboring luma samples are candidates, and an 8-bit bitmask (01111110) is signaled at PH, indicating YI to Y6 6 samples are selected, so the comparison score is in [-6, 6], which yields 13 offsets.
  • the selective classifier Cis gives encoder more choices to trade-off between offsets signaling overhead and classification granularity.
  • Cis a variation (Cl’s) is only counting comparison score [0, +N], the previous bitmask 01111110 example gives comparison score is in [0, 6], which yields 7 offsets.
  • Different classifiers can be combined to yield a general classifier. For example, for different pictures, for different pictures (different POC values), different classifiers are applied as shown in Table 2-4 below.
  • C2 is using the difference (Yn) of collocated and neighboring luma samples.
  • FIGS. 21A-21B show an example of Yn, of which dynamic range is [-1024, 1023] when bit depth is 10.
  • C2 band num be the be the number of equally divided bands of Yn dynamic range
  • Class (C2) (Yn + (1 « bit depth) * band num) » (bit depth + 1)
  • Another classifier example is using a bitmask for classification as shown in Table 2-6.
  • Table 2-6 shows classifier example using a bitmask for classification (bit mask position is underscored).
  • a 10-bit bitmask is signaled in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels to indicate the classifier.
  • bitmask 11 1100 0000 means for a given 10-bit luma sample value, only MSB 4 bits are used for classification, and this yields 16 classes in total.
  • Another example bitmask 10 0100 0001 means only 3 bits are used for classification, and this yields 8 classes in total.
  • the bitmask length (N) can be fixed or switched in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels.
  • N The bitmask length
  • Another example is 4-bit bitmask 0011 on LSB. bO, bl are used for classification.
  • the bitmask classifier can apply on luma or chroma classification. Whether to use MSB or LSB for bitmask N can be fixed or switched in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels.
  • the luma position and C3 bitmask can be combined and switched in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels. Different combinations can be different classifiers.
  • a “max number of Is” of the bitmask restriction can be applied to restrict the corresponding number of offsets. For example, restricting “max number of Is” of the bitmask to 4 in SPS, and this yields the max offsets in the sequence to be 16.
  • the bitmask in different POC can be different, but the “max number of Is” shall not exceed 4 (total classes shall not exceed 16).
  • the “max number of Is” value can be signaled and switched in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels.
  • the other cross-component chroma samples can be also fed into CCSAO classification.
  • the classifier of cross-component chroma samples can be the same as luma crosscomponent classifier or have its own classifier mentioned in this disclosure.
  • the two classifiers can be combined to form a joint classifier to classify the current chroma sample.
  • a joint classifier combining cross-component luma and chroma samples yields total 16 classes as shown in Table 2-7 below.
  • Table 2-7 shows classifier example using a joint classifier combining cross-component luma and chroma samples (bit mask position is underscored).
  • Table 2-8 below. Table 2-8 shows that different classifiers are combined.
  • C4 is using the difference of CCSAO input and to-be-compensated sample value for classification.
  • CCSAO is applied in the ALF stage
  • the difference of the current component pre-ALF and post-ALF sample values are used for classification.
  • One or plural thresholds can be predefined (e.g., kept in a LUT) or signaled in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels to help classify (quantize) the difference.
  • the C4 classifier can be combined with CO Y/U/V bandNum to form a joint classifier (for example, POC1 example as shown in Table 2-9).
  • Table 2-9 shows a classifier example uses the difference of CCSAO input values and to-be-compensated sample values for classification.
  • a classifier example uses “coding information” to help subblock classification since different coding mode may introduce different distortion statistics in the reconstruction image.
  • a CCSAO sample is classified by its sample previous coding information and the combination of the coding information can form a classifier, for example, as shown in Table 2-10 below.
  • FIG. 39 shows another example of different stages of the coding information for C5.
  • Table 2-10 shows a CCSAO sample is classified by its sample previous coding information and the combination of the coding information can form a classifier.
  • a classifier example uses the YUV color transformed value for classification. For example, to classify the current Y component, 1/1/1 collocated or neighboring Y/U/V samples are selected to be color transformed to RGB, and using C3 bandNum to quantize the R value to be the current Y component classifier.
  • a classifier example may be taken as a generalized version of C0/C3 and C6.
  • C0/C3 bandNum classification all 3 color component collocated/current and neighbouring samples are used.
  • current and neighbouring U samples are used as in FIG.
  • S is the intermediate sample ready to be used for C0/C3 bandNum classification
  • Ry is the i-th component’s j -th collocated/neighbouring/current samples, wherein the i-th component may be Y/U/V component
  • cy is the weighting coefficient which may be predefined or signaled in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels.
  • one special subset case of C7 may only use 1/1/1 collocated or neighboring Y/U/V samples to derive the intermediate sample S, which may be also taken as a special case of C6 (color transform by using 3 components).
  • the S may be further fed into C0/C3 bandNum classifier.
  • the C7 may also be combined with other classifier to form a joint classifier.
  • C7 may not the same as the later example which jointly uses collocated and neighbouring Y/U/V samples for classification (3 component joint bandNum classification for each Y/U/V component).
  • force cOO (1 - sum of other cy).
  • Which cy (cOO in this example) is forced may be predefined or signaled in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels.
  • another classifier example uses cross-component/current component spatial activity information as a classifier. Similar to the above block activity classifier, one sample located at (k,l) may get sample activity by
  • A may be then further mapped to the range of [0, 4]:
  • B, Qn may be predefined or signaled in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels.
  • another classifier example may use spatial gradient information of the cross-component/current component as a classifier. Similar to the above block gradient classifier, one sample located at (k,l) may get a sample gradient class by
  • C8 and C9 may be combined to form a joint classifier.
  • CIO another classifier example
  • SAO SAO
  • CIO may extract the cross/current component edge information more effectively by:
  • FIGS. 22A-22B illustrate an example of using edge information of the cross/current component for the current component classification in accordance with some implementations of the present disclosure.
  • the current sample is represented by c
  • the two neighboring samples of the current/cross component are represented by a and b.
  • One diagonal direction is selected from 4 direction candidates.
  • the differences (c-a) and (c-b) are 2 edge strengths ranging from -1023-1023 (for example, for 10b sequence);
  • the direction patterns may be 0, 45, 90, 135 degrees (45 degrees between directions), or extending to 22.5 degrees between directions, or a predefined direction set, or signaled in SPS/APS/PPS/PH/SH/Region(Set)/CTU/CU/Subblock/Sample levels.
  • the edge strength may also be defined as (b-a), which simplifies the calculation but sacrifices precision.
  • the M-l thresholds may be predefined or signaled in SPS/APS/PPS/PH/SH/Region(Set)/CTU/CU/Subblock/S ample levels.
  • the M-l thresholds may be different sets for edge strength calculation, for example, different sets for (c-a), (c-b). If different sets are used, the total classes may be different. For example, when [-T, 0, T] is used for calculating (c-a) but [-T, T] for (c-b), the total classes are 4 * 3.
  • the M-l thresholds may use “symmetric” property to reduce the signaling overhead.
  • a predefined pattern [-T, 0, T] may be used but not [TO, Tl, T2] which requires to signal 3 threshold values.
  • Another example is [-T, T],
  • the threshold values may only contain power of 2 values, which not only effectively grabs the edge strength distribution but reduces the comparison complexity (only MSB N bits need be compared).
  • the position of a, and b may be indicated by signaling 2 syntaxes: (1) edgeDir indicating the selected direction, and (2) edgeStep indicating the sample distance used to calculate the edge strength, as in FIGS. 22A-22B.
  • the edgeDir/edgeStep may be predefined or signaled in SPS/APS/PPS/PH/SH/Region(Set)/CTU/CU/Subblock/S ample levels.
  • the edgeDir/edgeStep may be coded with fixed length code (FLC) or other methods, such as truncated unary (TU) code, exponential-golomb code with order k (EGk), signed EGO (SVLC), or unsigned EGO (UVLC).
  • FLC fixed length code
  • TU truncated unary
  • EGk exponential-golomb code with order k
  • SVLC signed EGO
  • UVLC unsigned EGO
  • CIO may be combined with bandNumY/U/V or other classifiers to form a joint classifier. For example, combining 16 edge strengths with max 4 bandNumY bands yields 64 classes.
  • classifier examples which use only current component information for current component classification, can be used as cross-component classification.
  • luma sample information and eo-class are used to derive an Edgeldx, and classify the current chroma sample.
  • Other “non-cross- componenf ’ classifiers which can also be used as cross-component classifiers include edge direction, pixel intensity, pixel variation, pixel variance, pixel sum-of-Laplacian, sobel operator, compass operator, high-pass filtered value, low-pass filtered value, etc.
  • plural classifiers are used in the same POC.
  • the current frame is divided by several regions, and each region uses the same classifier.
  • 3 different classifiers are used in POCO, and which classifier (0, 1, or 2) is used is signaled in CTU level as shown in Table 2-11 below which shows different general classifiers are applied to different regions in the same picture.
  • the maximum number of plural classifiers can be fixed or signaled in
  • the fixed (predefined) maximum number of plural classifiers is 4. In that case, 4 different classifiers are used in POCO, and which classifier (0, 1, or 2) is used is signaled in the CTU level.
  • Truncated-unary (TU) code can be used to indicate the classifier used for each luma or chroma CTB.
  • TU code when TU code is 0: CCSAO is not applied; when TU code is 10: set 0 is applied; when TU code is 110, set 1 is applied; when TU code is 1110: set 2 is applied; when TU code is 1111 : set 3 is applied.
  • Fixed-length code, golomb-rice code, and exponential- golomb code can also be used to indicate the classifier (offset set index) for CTB. 3 different classifiers are used in POC1.
  • Cb and Cr CTB offset set indices is given for 1280x720 sequence POCO (number of CTUs in a frame is 10x6 if the CTU size is 128x128).
  • POCO Cb uses 4 offset sets and Cr uses 1 offset set.
  • Type means the position of the chosen collocated luma sample (Yi). Different offset sets can have different types, band num and corresponding offsets.
  • Table 2-13 shows an example of Cb and Cr CTB offset set indices is given for 1280x720 sequence POCO (number of CTUs in a frame is 10x6 if the CTU size is 128x128).
  • an example of jointly using collocated/current and neighboring Y/U/V samples for classification is listed (3 component joint bandNum classification for each Y/U/V component) in Table 2-14 below.
  • Table 2-14 shows an example of jointly using collocated/current and neighboring Y/U/V samples for classification.
  • ⁇ 2,4,1 ⁇ offset sets are used for ⁇ Y, U, V ⁇ , respectively.
  • Each offset set can be adaptively switched in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels. Different offset sets can have different classifiers. For example, as candidate position (candPos) indicating in FIGS.
  • the classIdx derivation of a joint classifier can be represented as the “or-shift” form to simplify the derivation process.
  • an example of jointly using collocated and neighboring Y/U/V samples for the current Y/U/V sample classification is listed (3 components joint edgeNum (C1s) and bandNum classification for each Y/U/V component), for example, as shown in Table 2-15 below.
  • Edge CandPos is the centered position used for C1s classifier, edge bitMask is the C1s neighboring samples activation indicator, and edgeNum is corresponding number of C1s classes.
  • C1s is only applied on Y classifier (so edgeNum equals to edgeNumY) with edge candPos is always Y4 (current/collocated sample position).
  • C1s can be applied on Y/U/V classifiers with edge candPos as the neighboring sample position.
  • bandY (candY * bandNumY) » BitDepth
  • bandU (candU * bandNumU) » BitDepth
  • bandV (candV * bandNumV) » BitDepth
  • classldx bandldx * edgeNum + edgeldx
  • plural CO classifiers may be combined (different positions or weight combination, bandNum) to form a joint classifier.
  • This joint classifier may be combined with other components to form another joint classifier, for example, using 2 Y samples (candY/candX and bandNumY/bandNumX), 1 U sample (candU and bandNumU), and 1 V sample (candV and bandNum V) to classify one U sample (Y/V can have the same concept).
  • bandY (candY * bandNum Y) » BitDepth
  • bandX (candX * bandNumX) » BitDepth
  • bandU (candU * bandNumU) » BitDepth
  • bandV (candV * bandNum V) » BitDepth
  • classldx bandY * bandNumX * bandNumU * bandNumV
  • some decoder normative or encoder conformance constraints may be applied if using plural CO for one single component.
  • the max number of classes or offsets (combinations of jointly using multiple classifiers, for example, Cis edgeNum * Cl bandNumY * bandNumU * bandNumV) for each set (or all set added) can be fixed or signaled in
  • a restriction can be applied on the CO classification, for example, restricting band_num (bandNumY, bandNumU, or bandNumV) to be only power of 2 values.
  • band_num bandNumY, bandNumU, or bandNumV
  • a syntax band num shift is signaled. Decoder can use shift operation to avoid multiplication. Different band num shift can be used for different component.
  • Class (CO) (Y0 » band num shift) » bit depth
  • Class (CO) ((Y0 + (1 « (band num shift - 1))) » band num shift) » bit depth
  • band num max (Y, U, or V) is 16
  • the classifiers applied to Cb and Cr are different.
  • the Cb and Cr offsets for all classes can be signaled separately.
  • different signaled offsets are applied to different chroma components as shown in Table 2-18 below.
  • the max offset value is fixed or signaled in Sequence Parameter Set (SPS)/ Adaptation parameter set (APS)/ Picture parameter set (PPS)/ Picture header (PH)/ Slice header (SH) /Region / CTU / CU / Subblock / Sample levels.
  • SPS Sequence Parameter Set
  • PPS Picture parameter set
  • PH Picture header
  • SH Slice header
  • the max offset is between [-15, 15]
  • Different component can have different max offset value.
  • the offset signaling can use Differential pulse-code modulation (DPCM).
  • DPCM Differential pulse-code modulation
  • offsets ⁇ 3, 3, 2, 1, -1 ⁇ can be signaled as ⁇ 3, 0, -1, -1, -2 ⁇ .
  • the offsets can be stored in APS or a memory buffer for the next picture/slice reuse.
  • An index can be signaled to indicate which stored previous frame offsets are used for the current picture.
  • the classifiers of Cb and Cr are the same.
  • the Cb and Cr offsets for all classes can be signaled jointly, for example, as shown in Table 2-19 below.
  • the classifier of Cb and Cr can be the same.
  • the Cb and Cr offsets for all classes can be signaled jointly, with a sign flag difference, for example, as shown in Table 16 below. According to Table 2-20, when Cb offsets are (3, 3, 2, -1), the derived Cr offsets are (- 3, -3, -2, 1).
  • the sign flag can be signaled for each class, for example, as shown in Table 2-21 below. According to Table 2-21, when Cb offsets are (3, 3, 2, -1), the derived Cr offsets are (-3, 3, 2, 1) according to the respective signed flag.
  • the classifiers of Cb and Cr can be the same.
  • the Cb and Cr offsets for all classes can be signaled jointly, with a weight difference, for example, as shown in Table 2-22 below showing Cb and Cr offsets for all classes can be signaled jointly with a weight difference.
  • the weight (w) can be selected in a limited table, for example, +-1/4, +-1/2, 0, +-1, +- 2, +-4. . . etc., where
  • the weight can be signaled for each class, for example, as shown in Table 2-23 below showing Cb and Cr offsets for all classes can be signaled jointly with a weight signaled for each class. According to Table 2-22, when Cb offsets are (3, 3, 2, -1), the derived Cr offsets are (-6, 12, 0, -1) according to the respective signed flag.
  • the previously decoded offsets can be stored for use of future frames.
  • An index can be signaled to indicate which previously decoded offsets set is used for the current frame, to reduce offsets signaling overhead.
  • the reuse offsets set idx for Cb and Cr can be different, for example, as shown in Table 2-24 below showing an index can be signaled to indicate which previously decoded offsets set is used for the current frame, and the index can be different for Cb and Cr components.
  • collocated and neighbouring YUV samples can be jointly used for classification, and all abovementioned offsets signaling method for Cb/Cr can be extended to Y/Cb/Cr.
  • different component offset set can be stored and used separately (each component has its own stored sets) or jointly (each component shares/rates the same stored).
  • Table 2-26 shows an example showing that different component offset set can be stored and used separately (each component has its own stored sets) or jointly (each component shares/rates the same stored).
  • the offset can be quantized before signaling.
  • the decoded offset is dequantized before applying it as shown in Table 2-27 below. For example, for a 12-bit sequence, the decoded offsets are left shifted (dequantized) by 2.
  • the offset quantization can be encoder selective (programmable). Whether to enable the offset quantization (on/off control) and the indicated quantization step size can be predefined or signaled at SPS/APS/PPS/PH/SH/Region(Set)/CTU/CU/Subblock/Sample levels. For example, predefine the quantization step size according to the bitdepth or resolution and switch in PH. The on/off control flag and the quantization step size may be stored in APS for future frames reuse. The range of supported step sizes in this sequence can be predefined or signaled at SPS/APS/PPS/PH/SH/Region(Set)/CTU/CU/Subblock/Sample levels.
  • the offset quantization mechanism enables encoder to trade-off between bit costs and picture quality improvement because of offset precision.
  • the offset binarization method may depend on the quantization step size.
  • the offset binarization method can be predefined or signaled at SPS/APS/PPS/PH/SH/Region(Set)/CTU/CU/Subblock/S ample levels.
  • Different components can have different or share the same ⁇ on/off control, quantization step sizes, offset binarization methods ⁇ . For example, U/V use the same ones, Y use different ones.
  • Different sequence bit depth can have different predefined quantization step sizes/offset binarization methods. For example, use different EGk order for different quantization step sizes.
  • step size ⁇ 0, 0, 2, 4, 6 ⁇ for ⁇ 8b, 10b, 12b, 14b, 16b ⁇ sequences, and switch step size/binarization methods at different levels.
  • switch step size/binarization methods at different levels.
  • Each Region(Set) in one picture can reuse the quantization step sizes (q)/according EGk orders in the stored APS.
  • the filter strength concept is further introduced herein.
  • the classifier offsets can be further weighted before being applied to samples.
  • the weight (w) can be selected in a table of power-of-2 values. For example, +-1/4, +-1/2, 0, +-1, +- 2, +-4. . . etc., where
  • the weight index can be signaled at SPS/APS/PPS/PH/SH/Region (Set)/CTU/CU/Subblock/Sample levels.
  • the quantized offset signaling can be taken as a subset of this weight application. If recursive CCSAO is applied as shown in FIG. 13D, a similar weight index mechanism can be applied between the 1st and 2nd stages.
  • weighting for different classifiers plural classifiers’ offsets can be applied to the same sample with a weight combination.
  • a similar weight index mechanism can be signaled as mentioned above. For example, o o
  • the previously used param eters/offsets can be stored in Adaptation Parameter Set (APS) or a memory buffer for the next pictures/ slices reuse.
  • An index can be signaled in PH/SH to indicate which stored previous frame offsets are used for the current picture/slice.
  • a new APS ID can be created to maintain the CCSAO history offsets.
  • candPos, bandNum, offsets signaling method can be fixed length code (FLC) or other methods, such as truncated unary (TU) code, exponential-golomb code with order k (EGk), signed EGO (SVLC), or unsigned EGO (UVLC).
  • FLC fixed length code
  • TU truncated unary
  • EGk exponential-golomb code with order k
  • SVLC signed EGO
  • UVLC unsigned EGO
  • aps adaptationjoarameter set id provides an identifier for the APS for reference by other syntax elements.
  • aps_params_type is equal to CCSAO APS
  • the value of aps adaptation parameter set id shall be in the range of 0 to 7, inclusive (for example).
  • ph_sao_cc_y_aps_id specifies the aps adaptation param eter set id of the CCSAO APS that the Y color component of the slices in the current picture refers to.
  • ph_sao_cc_y_aps_id the value of sao cc y set signal flag of the APS NAL unit having aps params type equal to CCSAO APS and aps adaptation parameter set id equal to ph_sao_cc_y_aps_id shall be equal to 1 ;
  • the Temporalld of the APS network abstraction layer (NAL) unit having aps params type equal to CCSAO APS and aps adaptation parameter set id equal to ph_sao_cc_y_aps_id shall be less than or equal to the Temporalld of the current picture.
  • APS update mechanism is described herein.
  • a maximum number of APS offset sets can be predefined or signaled in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels. Different component can have different maximum number limitation. If the APS offset sets are full, the newly added offset set can replace one existing stored offset with first in, first out (FIFO), last in, first out (LIFO), or least-recently-used (LRU) mechanism, or an index value is received which indicates which APS offset set should be replaced. In some examples, if the chosen classifier consists of candPos/edge info/coding info. .
  • all classifier information can be taken as part of the APS offset set and can be also stored in the APS offset set with its offset values.
  • the update mechanisms mentioned above may be predefined or signaled in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels.
  • a constraint can be applied which is referred to as “pruning.” For example, the newly received classifier info and offsets cannot be the same as any of the stored APS offset set (of the same component, or across different components).
  • the 2 criteria may be applied at the same time or individually. Whether to apply each criterion is predefined or switched in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels.
  • N/thr can be predefined or switched in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels.
  • the FIFO update can be (1) update from previously left set idx circularly (if all updated, started from set 0 again) as in the above example, (2) every time update from set 0.
  • the update can be in PH (as in example), or SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels, when receiving a new offset set.
  • the decoder maintains a count table which counts the “total offset set used count”, which can be refreshed in SPS/APS/per Group of Pictures (GOP) structure/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels. The newly received offset set replaces the least-recently-used offset set in the APS. If 2 stored offset sets have the same count,
  • FIFO/LIFO can be used. For example, see component Y in Table 2-30 below.
  • different components can have different update mechanisms.
  • different components can share the same classifier (same candPos/edge info/coding info/offsets, can additionaly have a weight with a modifier).
  • a “patch” implementation may be used in the offset replacement mechanism.
  • the “patch” implementation is differential pulse-code modulation (DPCM).
  • DPCM differential pulse-code modulation
  • the offset values may be on top of an existed APS stored offset set (OffsetOld).
  • FIFO update LRU, LIFO, or signaling an index indicating which set to be updated
  • YUV components may have the same or use different updating mechanisms.
  • the DPCM delta offset values may be signaled in FLC/TU/EGk
  • CcSaoOffsetVal CcSaoOffsetVal + ( 1 - 2 * ccsao offset sign flag ) * ( ccsao offset abs « 1 )
  • one constraint may be applied to reduce the direct offset signaling overhead, for example, the updated offset values must have the same sign as the old offset values. By using such an inferred offset sign, the new updated offset does not need to transmit the sign flag again (ccsao offset sign flag is inferred to be the same as the old offset).
  • each luma or chroma sample value R(x, y) is classified using the indicated classifier of the current picture and/or current offset set idx.
  • the corresponding offset of the derived class index is added to each luma or chroma sample value R(x, y).
  • a clip function Clip 3 is applied to the (R(x, y) + offset) to make the output luma or chroma sample value R’(x, y) within the bit depth dynamic range, for example, range 0 to (1 « bit depth) - 1.
  • FIG. 6 is a block diagram illustrating that both the proposed bilateral filter (BIF) and SAO use samples from the deblocking stage as input in accordance with some implementations of the present disclosure.
  • the clip operation when CCSAO is operated with other loop filters, the clip operation can be
  • Clipping before adding operated with BIF.
  • the clip order can be switched.
  • FIG. 6 shows SAO/BIF offsets clipping. More specifically, for example, FIG. 6 shows the current BIF design when it interacts with SAO. Offsets from SAO and BIF are added to the input sample, followed by performing one bitdepth clipping.
  • two possible clipping designs can be selected: (1) adding one additional bitdepth clipping for CCSAO, and (2) one harmonized design that performs a joint clipping after adding SAO/BIF/CCSAO offsets to the input sample.
  • the abovementioned clipping designs only differ in luma samples since BIF only applies on them.
  • FIGS. 23A-23B are block diagrams illustrating CCSAO is not applied on the current chroma (luma) sample if any of the collocated and neighboring luma (chroma) samples used for classification is outside the current picture in accordance with some implementations of the present disclosure.
  • CCSAO is not applied on the left 1 column chroma components of the current picture.
  • Cl is used, CCSAO is not applied on the left 1 column and the top 1 row chroma components of the current picture, as shown in FIG. 23B.
  • FIGS. 24A-24B are block diagrams illustrating CCSAO is applied on the current luma or chroma sample if any of the collocated and neighboring luma or chroma samples used for classification is outside the current picture in accordance with some implementations of the present disclosure.
  • a variation is, if any of the collocated and neighboring luma or chroma samples used for classification is outside the current picture, the missed samples are used repetitively as shown in FIG. 24A, or the missed samples are mirror padded to create samples for classification as shown in FIG. 24B, and CCSAO can be applied on the current luma or chroma samples.
  • disabled/repetitive/mirror picture boundary processing method disclosed herein can also be applied on the subpicture/slice/tile/ CTU/360 virtual boundary if any of the collocated and neighboring luma (chroma) samples used for classification is outside the current subpicture/slice/tile/patch/CTU/360 virtual boundary.
  • a picture is divided into one or more tile rows and one or more tile columns.
  • a tile is a sequence of CTUs that covers a rectangular region of a picture.
  • a slice consists of an integer number of complete tiles or an integer number of consecutive complete CTU rows within a tile of a picture.
  • a subpicture contains one or more slices that collectively cover a rectangular region of a picture.
  • a 360-degree video is captured on a sphere and inherently has no “boundary,” the reference samples that are out of the boundaries of a reference picture in the projected domain can always be obtained from neighboring samples in the spherical domain.
  • the reference samples that are out of the boundaries of a reference picture in the projected domain can always be obtained from neighboring samples in the spherical domain.
  • the use of 360 virtual boundary is more flexible as it does not require the face size to be a multiple of the CTU size.
  • the maximum number of vertical 360 virtual boundaries is 3 and the maximum number of horizontal 360 virtual boundaries is also 3.
  • the distance between two virtual boundaries is greater than or equal to the CTU size and the virtual boundary granularity is 8 luma samples, for example, an 8x8 sample grid.
  • FIGS. 28A-28B are block diagrams illustrating CCSAO is not applied on the current chroma sample if a corresponding selected collocated or neighboring luma sample used for classification is outside a virtual space defined by a virtual boundary in accordance with some implementations of the present disclosure.
  • a virtual boundary is a virtual line that separates the space within a picture frame.
  • CCSAO is not applied on the chroma samples that have selected corresponding luma position outside a virtual space defined by the virtual boundary.
  • FIGS. 28A-28B show an example with a virtual boundary for CO classifier with 9 luma position candidates.
  • CCSAO is not applied on the chroma samples for which the corresponding selected luma position is outside a virtual space surrounded by the virtual boundary.
  • CCSAO is not applied to the chroma sample 2802 when the selected Y7 luma sample position is on the other side of the horizontal virtual boundary 2806 which is located 4 pixel lines from the bottom side of the frame.
  • CCSAO is not applied to the chroma sample 2804 when the selected Y5 luma sample position is located on the other side of the vertical virtual boundary 2808 which is located y pixel lines from the right side of the frame.
  • FIGS. 32A-32B shows repetitive or mirror padding can be applied on the luma samples that are outside the virtual boundary in accordance with some implementations of the present disclosure.
  • FIG. 32A shows an example of repetitive padding. If the original Y7 is chosen to be the classifier which is located on the bottom side of the VB 3202, the Y4 luma sample value is used for classification (copied to the Y7 position), instead of the original Y7 luma sample value.
  • FIG. 32B shows an example of mirror padding.
  • Y7 is chosen to be the classifier which is located on the bottom side of the VB 3204, the Y1 luma sample value which is symmetric to the Y7 value relative to the Y0 luma sample is used for classification, instead of the original Y7 luma sample value.
  • the padding methods give more chroma samples possibility to apply CCS AO so more coding gain can be achieved.
  • FIG. 26A shows additional 1 luma line buffer, i.e., the whole line luma samples of line -5 above the current VB 1602, may be required if all 9 collocated neighboring luma samples are used for classification in accordance with some implementations of the present disclosure.
  • FIGS. 18A-18G show an example using only 6 luma candidates for classification, which reduces the line buffer and does not need any additional boundary check in FIGS. 23A-23B and FIGS. 24A-24B.
  • using luma samples for CCSAO classification may increase the luma line buffer and hence increase the decoder hardware implementation cost.
  • FIG. 25 shows an illustration in AVS that 9 luma candidates CCSAO crossing VB 1702 may increase 2 additional luma line buffers in accordance with some implementations of the present disclosure.
  • DBF/SAO/ALF are processed at the current CTU row.
  • DBF/SAO/ALF are processed at the next CTU row.
  • luma line -4 to -1 pre DBF samples, line -5 pre SAO samples, and chroma line -3 to -1 pre DBF samples, line -4 pre SAO samples are stored as line buffers for next CTU row DBF/SAO/ALF processing.
  • luma and chroma samples not in the line buffer are not available.
  • CCSAO requires pre SAO luma sample lines -7, -6, and -5 for classification.
  • Pre SAO luma sample lines -7, -6 are not in the line buffer so they are not available.
  • luma VB (line -4) and chroma VB (line -3) can be different (not aligned).
  • FIG. 26A shows an illustration in VVC that 9 luma candidates CCSAO crossing VB 1802 may increase 1 additional luma line buffer in accordance with some implementations of the present disclosure.
  • VB can be different in different standard.
  • luma VB is line -4 and chroma VB is line -2, so 9 candidate CCSAO may increase 1 luma line buffer.
  • CCSAO is disabled for a chroma sample if any of the chroma sample’s luma candidates is across VB (outside the current chroma sample VB).
  • FIGS. 27A-27C show in AVS and VVC, CCSAO is disabled for a chroma sample if any of the chroma sample’s luma candidates is across VB 2702 (outside the current chroma sample VB) in accordance with some implementations of the present disclosure.
  • FIGS. 28A-28B also show some examples of this implementation.
  • repetitive padding is used for CCSAO from a luma line close to and on the other side of the VB, for example, the luma line -4, for “cross VB” luma candidates.
  • repetitive padding from luma nearest neighbor below VB is implemented for “cross VB” chroma candidates.
  • FIGS. 29A-29C show in AVS and VVC, CCSAO is enabled using repetitive padding for a chroma sample if any of the chroma sample’s luma candidates is across VB 2902 (outside the current chroma sample VB) in accordance with some implementations of the present disclosure.
  • FIG. 28A also shows some examples of this implementation.
  • FIGS. 30A-30C show in AVS and VVC, CCSAO is enabled using mirror padding for a chroma sample if any of the chroma sample’s luma candidates is across VB 3002 (outside the current chroma sample VB) in accordance with some implementations of the present disclosure.
  • FIG. 28B and 24B also show some examples of this implementation.
  • “double sided symmetric padding” is used for applying CCSAO.
  • FIG. 31 A-3 IB show that CCSAO is enabled using double sided symmetric padding for some examples of different CCSAO shapes (for example, 9 luma candidates (FIG. 31 A) and 8 luma candidates (FIG. 3 IB)) in accordance with some implementations of the present disclosure.
  • CCSAO is enabled using double sided symmetric padding for some examples of different CCSAO shapes (for example, 9 luma candidates (FIG. 31 A) and 8 luma candidates (FIG. 3 IB)) in accordance with some implementations of the present disclosure.
  • doublesided symmetric padding is applied for both sides of the luma sample set. For example, in FIG.
  • luma samples Y0, Yl, and Y2 are outside of the VB 3102, so both Y0, Yl, Y2 and Y6, Y7, Y8 are padded using Y3, Y4, Y5.
  • Y0, Yl, Y2 and Y6, Y7, Y8 are padded using Y3, Y4, Y5.
  • luma sample Y0 is outside of the VB 3102, so Y0 is padded using Y2, and Y7 is padded using Y5.
  • FIG. 26B shows an illustration when the collocated or neighboring chroma samples are used to classify the current luma samples, the selected chroma candidate may be across VB and need additional chroma line buffer in accordance with some implementations of the present disclosure. Similar solutions 1 to 4 as described above can be applied to handle the issue.
  • Solution 1 is to disable CCSAO for a luma sample when any of its chroma candidates may across VB.
  • Solution 2 is to use repetitive padding from chroma nearest neighbor below VB for “cross VB” chroma candidates.
  • Solution 3 is to use mirror padding from below chroma VB for “cross VB” chroma candidates.
  • Solution 4 is to use “double sided symmetric padding.” For a candidate set centered at CCSAO collocated chroma sample, if one side of the candidate set is outside VB, double-sided symmetric padding is applied for both sides.
  • the padding methods give more luma or chroma samples possibility to apply CCSAO so more coding gain can be achieved.
  • the samples below VB are processed at the current CTU row, so the above special handling (Solution 1, 2, 3, 4) is not applied at the bottom picture (or slice, tile, brick) boundary CTU row.
  • Solution 1, 2, 3, 4 Solution 1, 2, 3, 4
  • a frame of 1920x1080 is divided by CTUs of 128x128.
  • a frame contains 15x9 CTUs (round up).
  • the bottom CTU row is the 15th CTU row.
  • the decoding process is CTU row by CTU row, and CTU by CTU for each CTU row.
  • Deblocking needs to be applied along horizontal CTU boundaries between the current and next CTU row.
  • CTB VB is applied for each CTU row since inside one CTU, at the bottom 4/2 luma/chroma line, DBF samples (VVC case) are processed at the next CTU row and are not available for CCSAO at the current CTU row.
  • the bottom 4/2 luma/chroma line DBF samples are available at the current CTU row since there is no next CTU row left and they are DBF processed at the current CTU row.
  • the VB displayed in FIGS. 13 to 22 can be replaced by a boundary of subpicture/slice/tile/patch/CTU/360 virtual boundary.
  • the positions of the chroma and luma samples in FIGs. 13 to 22 can be switched.
  • the positions of the chroma and luma samples in FIGS. 6, 23A-32B can be replaced by positions of a first chroma sample and a second chroma sample.
  • an ALF VB inside CTU may be commonly horizontal.
  • a boundary of subpicture/slice/tile/patch/CTU/360 virtual boundary may be horizontal or vertical.
  • a restriction can be applied to reduce the CCSAO required line buffer, and to simplify boundary processing condition check.
  • FIGS. 26 A shows additional 1 luma line buffer (the whole line luma samples of line: -5) may be required if all 9 collocated neighboring luma samples are used for classification.
  • FIGS. 33A-33B shows the restrictions of using a limited number of luma candidates for classification in accordance with some implementations of the present disclosure.
  • FIG. 33 A shows the restriction of using only 6 luma candidates for classification.
  • FIG. 33B shows the restriction of using only 4 luma candidates for classification.
  • applied region is implemented.
  • the CCSAO applied region unit can be CTB based. That is, the on/off control, CCSAO parameters (offsets, luma candidate positions, band num, bitmask. . .etc. used for classification, offset set index) are the same in one CTB.
  • the applied region can be not aligned to the CTB boundary.
  • the applied region is not aligned to chroma CTB boundary but shifted.
  • the syntaxes on/off control, CCSAO parameters
  • FIG. 34 shows the CCSAO applied region is not aligned to the CTB/CTU boundary 3406 in accordance with some implementations of the present disclosure.
  • the applied region is not aligned to chroma CTB/CTU boundary 3406 but top-left shifted (4, 4) samples to VB 3408.
  • This not-aligned CTB boundary design benefits the deblocking process since the same deblocking parameters are used for each 8x8 deblocking process region.
  • the CCSAO applied region unit can be variant (larger or smaller than CTB size) as shown in Table 2-32.
  • the mask size can be different for different components.
  • the mask size can be switched in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels. For example, in PH, a series of mask on/off flags and offset set indices are signaled to indicate each CCSAO region information.
  • the CCSAO applied region frame partition can be fixed. For example, partition the frame into N regions.
  • FIG. 35 shows that the CCSAO applied region frame partition can be fixed with CCSAO parameters in accordance with some implementations of the present disclosure.
  • each region can have its own region on/off control flag and CCSAO parameters. Also, if the region size is larger than CTB size, it can have both CTB on/off control flags and region on/off control flag.
  • FIG. 35 (a) and (b) show some examples of partitioning the frame into N regions.
  • FIG. 35 (a) shows vertical partitioning of 4 regions.
  • 35 (b) shows square partitioning of 4 regions. In some embodiments, similar to picture level
  • CTB all on control flag (ph cc sao cb ctb control flag / ph cc sao cr ctb control flag), if the region on/off control flag is off, CTB on/off flags can be further signaled. Otherwise CCSAO is applied for all CTBs in this region without further signaling CTB flags.
  • different CCSAO applied region can share the same region on/off control and CCSAO parameters.
  • region 0 ⁇ 2 shares the same parameters and region 3—15 shares the same parameters.
  • FIG. 35 (c) also shows the region on/off control flag and CCSAO parameters can be signaled in a Hilbert scan order.
  • the CCSAO applied region unit can be quad-tree/binary- tree/ternary-tree split from picture/ slice/CTB level. Similar to the CTB split, a series of split flags are signaled to indicate the CCSAO applied region partition.
  • FIG. 36 shows that the CCSAO applied region can be Binary -tree (BT)/ Quad-tree (QT)/Temary-tree (TT) split from frame/slice/CTB level in accordance with some implementations of the present disclosure.
  • FIG. 37 is a block diagram illustrating a plurality of classifiers used and switched at different levels within a picture frame in accordance with some implementations of the present disclosure.
  • the method of how to apply the classifier set index can be switched in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock/Sample levels.
  • four sets of classifiers are used in a frame, switched in PH as shown in Table 2-33 below.
  • FIG. 37 (a) and (c) show default fixed region classifier.
  • FIG. 37 (b) shows classifier set index is signaled in mask/CTB level, where 0 means CCSAO off for this CTB, and 1 ⁇ 4 means set index.
  • a region level flag can be signaled if CTBs in this region do not use the default set index (for example, the region level flag is 0), but use other classifier set in this frame. For instance, if the default set index is used, the region level flag is 1. For example, in a square partition 4 regions, the following classifier sets are used as shown in Table 2-34 below which shows a region level flag can be signaled to show if CTBs in this region do not use the default set index.
  • FIG. 38 is a block diagram illustrating that the CCSAO applied region partition can be dynamic and switched in picture level, in accordance with some implementations of the present disclosure.
  • Each region can have its own region all on flag to save per CTB on/off control bits. The number of regions is dependent on signaled picture set num.
  • whether to introduce coding information applied region restriction can be predefined or singling one control flag in SPS/APS/PPS/PH/SH/Region(per alternative set)/CTU/CU/Subblock/Sample levels to indicate if a specified coding information is included/excluded in CCSAO application. Decoder skips CCSAO processing for those area according to the predefined condition or the control flags. For example, YUV use different predefined/flag controlled conditions that switched in region (set) level. The CCSAO application judgement can be in CU/TU/PU or sample levels. Table 2-35 shows that YUV use different predefined/flag controlled conditions that switched in region (set) level Table 2-35
  • excluding some specific area may benefit CCSAO statistics collection.
  • FIG. 39 is a diagram illustrating the CCSAO classifiers can take current or cross component coding information into account, in accordance with some implementations of the present disclosure. For example, different coding modes/parameters/sample positions can form different classifiers. Different coding information can be combined to form a joint classifier. Different areas can use different classifiers.
  • FIG. 29 also shows another example of applied region.
  • the predefined or flag control “coding information excluding area” mechanism can be used in DBF/Pre-SAO/SAO/BIF/CCSAO/ALF/CCALF/ NN loop filter (NNLF), or other loop filters.
  • CCSAO syntax implemented is shown in Table 2-36 below.
  • the binarization of each syntax element can be changed.
  • patch is similar with slice
  • patch header is similar with the slice header.
  • FLC stands for fixed length code.
  • TU stands for truncated unary code.
  • EGk stands for exponential-golomb code with order k, where k can be fixed.
  • SVLC stands for signed EGO.
  • UVLC stands for unsigned EGO.
  • a higher-level flag is off, the lower level flags can be inferred from the off state of the flag and do not need to be signaled. For example, if ph cc sao cb flag is false in this picture, ph_cc_sao_cb_band_num_minus 1 , ph cc sao cb luma type, cc sao cb offset sign flag, cc sao cb offset abs, ctb cc sao cb flag, cc sao cb merge left flag, and cc sao cb merge up flag are not present and inferred to be false.
  • the SPS ccsao enabled flag is conditioned on the SPS SAO enabled flag as shown in Table 2-37 below.
  • ph cc sao cb ctb control flag, ph cc sao cr ctb control flag indicate whether to enable Cb/Cr CTB on/off control granularity. If ph cc sao cb ctb control flag, and ph cc sao cr ctb control flag are enabled, ctb cc sao cb flag and ctb cc sao cr flag can be further signaled.
  • CCSAO whether CCSAO is applied in the current picture depends on ph cc sao cb flag, ph cc sao cr flag, without further signaling ctb cc sao cb flag and ctb cc sao cr flag at CTB level.
  • a flag can be further signaled to distinguish if the center collocated luma position is used (Y0 position in FIGS. 18A-18G) for classification for a chroma sample, to reduce bit overhead.
  • a flag can be further signaled with the same mechanism.
  • cc sao cb typeO flag is further signaled to distinguish if the center collocated luma position is used as shown in Table 2-38 below. If the center collocated luma position is not used, cc sao cb type idc is used to indicate which of the remaining 8 neighboring luma positions is used.
  • the syntax example can include region on/off control flag (picture_ccsao_lcu_control_flag[compldx] [setldx]) as shown in Table 2-40 below.
  • pps ccsao info in ph flag and gci no sao constraint flag can be added.
  • pps_ccsao_info_in_ph_flag 1 specifies that the CCSAO filter information could be present in the PH syntax structure and not present in the slice headers referring to the PPS that do not contain a PH syntax structure
  • pps ccsao info in ph flag 0 specifies that the CCSAO filter information is not present in the PH syntax structure and could be present in the slice headers referring to the PPS.
  • the value of pps_ccsao_info_in_ph_flag is inferred to be equal to 0.
  • gci no ccsao constraint flag 1 specifies that sps ccsao enabled flag for all pictures in OlsInScope shall be equal to 0.
  • gci no ccsao constraint flag 0 does not impose such a constraint.
  • a bitstream of the video comprises one or more output layer sets (OLSs) according to a rule.
  • OLSs output layer sets
  • OlsInScope refers to one or more OLSs that are in scope.
  • a profile_tier_level( ) syntax structure provides level information and, optionally, profile, tier, sub-profile, and general constraints information to which the OlsInScope conforms.
  • OlsInScope is one or more OLSs specified by the VPS.
  • the OlsInScope is the OLS that includes only the layer that is the lowest layer among the layers that refer to the SPS, and this lowest layer is an independent layer.
  • the separate signaling of band_num_y minus 1, band num u minusl, band num v minusl may introduce syntax redundancy.
  • Ul/Vl are the same as Y1 since no segment is applied on U/V (redundant).
  • a classifier is a band classifier or a joint classifier encompassing the band classifier
  • an indicator may be predefined or signaled by the encoder.
  • a band classifier may be determined by: utilizing a sample value based on one or more samples from the collocated and/or neighboring samples of a Y component, and the current and neighboring samples of a U/V component relative to the respective sample of the U/V component; dividing a range of the sample value into several bands; and, selecting a band from the several bands.
  • the indicator may be a bandNum indicator (bandldc, bandNum mapping table) that is predefined or signaled in SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock levels, to indicate the bandNum segments of one or more components.
  • bandNum indicator bandldc, bandNum mapping table
  • Different components can share the same bandNum indicators.
  • U/V share the same bandNum mapping table.
  • bandNum indicators may be predefined for different components, where the bandldc of U/V contains bandNum segments of more than one components.
  • Table 2-42 shows an example of the bandNum mapping table. As shown in Table 2-42 below, if the current sample is of a U component, the bandNum indicator signaled as 2 may indicate to use the segment of Y3, i.e., a bandNum segment of Y component. In another examples, if the current sample is of a V component, the bandNum indicator signaled as 6 may indicate to use U2 segment and V2 segment while the bandNum indicator signaled as 7 may indicate to use Y2 segment, U2 segment and V2 segment.
  • C current chroma
  • CT chroma transpose, use the other chroma component
  • the bandNum mapping table may be predefined or adjusted/changed by the encoder at SPS/APS/PPS/PH/SH/Region/CTU/CU/Subblock levels according to different granularity requirement.
  • FIG. 40A is a block diagram illustrating that the SAO classification methods disclosed in the present disclosure serve as a post prediction filter in accordance with some implementations of the present disclosure.
  • each component for each Y, U, and V component, a corresponding classifier is chosen. And for each component prediction sample, it is first classified, and a corresponding offset is added. For example, each component can use the current and neighboring samples for classification. Y uses the current Y and neighboring Y samples, and U/V uses the current U/V samples for classification as shown in Table 2-44 below.
  • FIGS. 40B-40D are a block diagram illustrating that for post prediction SAO filter, each component can use the current and neighboring samples for classification in accordance with some implementations of the present disclosure.
  • the refined prediction samples (Ypred’, Upred’, Vpred’) are updated by adding the corresponding class offset and are used for intra, inter, or other prediction thereafter.
  • Ypred’ clip3(0, (1 « bit_depth)-l, Ypred + h_Y[i])
  • Upred clip3(0, (1 « bit_depth)-l, Upred + h_U[i])
  • Vpred’ clip3(0, (1 « bit_depth)-l, Vpred + h_V[i])
  • the cross-component (Y) can be used for further offset classification.
  • the additional cross-component offset (h’_U, h’_V) can be added on the current component offset (h_U, h_V), for example, as shown in Table 2-45 below.
  • the refined prediction samples are updated by adding the corresponding class offset and are used for intra, inter, or other prediction thereafter.
  • Upred clip3(0, (1 « bit_depth)-l, Upred’ + h’_U[i])
  • Vpred clip3(0, (1 « bit_depth)-l, Vpred’ + h’_V[i])
  • the intra and inter prediction can use different SAO filter offsets.
  • FIG. 15C is a block diagram illustrating that the SAO classification methods disclosed in the present disclosure serve as a post reconstruction filter in accordance with some implementations of the present disclosure.
  • the SAO/CCSAO classification methods disclosed herein can serve as a filter applied on reconstructed samples of a tree unit (TU).
  • CCS AO can serve as a post reconstruction filter, i.e., using reconstructed sample (after prediction/residual sample addition, before deblocking) as input for classification, compensating luma/chroma samples before entering neighboring intra/inter prediction.
  • the CCSAO post reconstruction filter may reduce distortion of the current TU samples, and may give a better prediction for neighboring intra/inter blocks. A better compression efficiency may be expected by a more precise prediction.
  • one hierarchical rate-distortion (RD) optimization algorithm is designed, including 1) a progressive scheme for searching the best single classifier; 2) a training process for refining the offset values for one classifier; 3) a robust algorithm to effectively allocate suitable classifiers for different local regions.
  • RD rate-distortion
  • a typical CCSAO classifier is: where are the three collocated samples that are used to classify the current sample; are the numbers of bands that are applied to Y, U and V components, respectively; BD is the coding bit-depth; C rec and C( ec are the reconstructed samples before and after the CCSAO is applied; OCCSAO [*] is the value of the CCSAO offset that is applied to the z-th category; CZipl(-) is the clipping function that clips the input to the range of the bit-depth, i.e., [0, 2 BD - 1]; » represents the right-shift operation.
  • the collocated luma sample can be chosen from 9 candidate positions while the collocated chroma sample is fixed.
  • a multi-stage early termination method is applied for searching the best classifier which consists of N categories.
  • the classifiers with more categories are skipped.
  • Multiple breakpoints are set for N categories early termination based on different configurations. For example, Al: every 4 categories RA/LB: every 16 categories
  • ⁇ are the sample positions, original samples, and samples before CCSAO, ⁇ is the sum of differences between ⁇ ( ⁇ ) and ⁇ ( ⁇ ) , ⁇ is the sample count, ⁇ is the estimated delta distortion by applying offset h, ⁇ is RD cost, ⁇ is the lagrange multiplier, ⁇ is the bit cost.
  • the original samples can be true original samples (raw image samples without pre-processing) or Motion Compensated Temporal Filter (MCTF, one classical encoding algorithm pre-processes the original samples before encoding) original samples.
  • ⁇ can be the same as that of SAO/ALF, or weighted by a factor (according to configuration/resolution).
  • the encoder optimized CCSAO by trade-off total RD cost for all categories.
  • the statistic data ⁇ and ⁇ for each category are stored for each CTB for further determination of plural region classifiers.
  • the CTBs with CCSAO enabled are sorted in ascending order according to the distortion (or according to RD cost, including bit cost).
  • the half (or a predefined/dependent ratio, e.g., (setNum- l)/setNum-l) CTBs with smaller distortion are kept the same classifier, while the other half CTBs are trained with a new second classifier.
  • each CTB may select its best classifier, therefore a good classifier may propagate to more CTBs.
  • the strategy gives both randomness and robustness for parameter decision. If the current number of classifiers does not further improve the RD cost, more plural classifiers are skipped.
  • FIG. 41 shows a computing environment 4110 coupled with a user interface 4150.
  • the computing environment 4110 can be part of a data processing server.
  • the computing environment 4110 includes a processor 4120, a memory 4130, and an Input/Output (I/O) interface 4140.
  • I/O Input/Output
  • the processor 4120 typically controls overall operations of the computing environment 4110, such as the operations associated with display, data acquisition, data communications, and image processing.
  • the processor 4120 may include one or more processors to execute instructions to perform all or some of the steps in the above-described methods.
  • the processor 4120 may include one or more modules that facilitate the interaction between the processor 4120 and other components.
  • the processor may be a Central Processing Unit (CPU), a microprocessor, a single chip machine, a Graphical Processing Unit (GPU), or the like.
  • the memory 4130 is configured to store various types of data to support the operation of the computing environment 4110.
  • the memory 4130 may include predetermined software 4132. Examples of such data includes instructions for any applications or methods operated on the computing environment 4110, video datasets, image data, etc.
  • the memory 4130 may be implemented by using any type of volatile or non-volatile memory devices, or a combination thereof, such as a Static Random Access Memory (SRAM), an Electrically Erasable Programmable Read-Only Memory (EEPROM), an Erasable Programmable Read-Only Memory (EPROM), a Programmable Read-Only Memory (PROM), a Read-Only Memory (ROM), a magnetic memory, a flash memory, a magnetic or optical disk.
  • SRAM Static Random Access Memory
  • EEPROM Electrically Erasable Programmable Read-Only Memory
  • EPROM Erasable Programmable Read-Only Memory
  • PROM Programmable Read-Only Memory
  • ROM Read-Only Memory
  • magnetic memory a magnetic memory
  • the I/O interface 4140 provides an interface between the processor 4120 and peripheral interface modules, such as a keyboard, a click wheel, buttons, and the like.
  • the buttons may include but are not limited to, a home button, a start scan button, and a stop scan button.
  • the VO interface 4140 can be coupled with an encoder and decoder.
  • FIG. 42 is a flowchart illustrating a method for video decoding according to an example of the present disclosure.
  • the processor 4120 may receive a picture frame including one or more components, where the one or more components may include a first component and a second component.
  • the first component may include one of following components: a luma component, a first chroma component, or a second chroma component
  • the second component may include one of following components: the luma component, the first chroma component, or the second chroma component.
  • the luma component may be Y component
  • the first chroma component may be U component
  • the second chroma component may be V component.
  • the first and second chroma components are interchangeable.
  • the processor 4120 may determine a classifier for a respective sample of the second component according to a collocated sample of the first component.
  • the collocated sample of the first component may obtained by linearly weighting samples from at least one of following samples: a plurality of collocated and neighboring luma samples, or a plurality of linearly weighted samples for three components comprising a luma component, a first chroma component, and a second chroma component.
  • the collocated sample of the first component may obtained by linearly weighting samples from the plurality of collocated and neighboring luma samples as shown in FIGS. 20A-20B and 21 A-21B.
  • the collocated luma sample value (Y0) can be replaced by a value (Yp) by weighting collocated and neighboring luma samples as shown in FIGS. 20A-20B.
  • the collocated sample of the first component may obtained by linearly weighting samples from a plurality of linearly weighted samples for three components including the luma component, the first chroma component, and the second chroma component.
  • the classifier C7 all 3 color component collocated/current and neighboring samples are used to derive the current component C0/C3 bandNum classification.
  • current and neighboring U samples are used as in FIG. 13B.
  • the processor 4120 may obtain an indicator that indicates one or more bandNum segments of the one or more components in response to determining that the classifier is a band classifier or a joint classifier encompassing the band classifier.
  • the indicator may be predefined or signaled by an encoder at at least one level.
  • the at least one level may include at least one of following levels: a Sequence Parameter Set (SPS) level, an Adaption Parameter Set (APS) level, a Picture Parameter Set (PPS) level, a Picture Header (PH) level, a Sequence Header (SH) level, a Region level, a Coding Tree Unit (CTU) level, a Subblock level, or a Sample level.
  • SPS Sequence Parameter Set
  • APS Adaption Parameter Set
  • PPS Picture Parameter Set
  • PH Picture Header
  • SH Sequence Header
  • Region level a Coding Tree Unit
  • CTU Coding Tree Unit
  • Subblock level or a Sample level.
  • the luma component, the first chroma component, and the second chroma component may use different indicators to indicate respective bandNum segments, as shown in Table 2-42.
  • At least two of the luma component, the first chroma component, or the second chroma component use a same indicator to indicate respective bandNum segments.
  • a chroma transpose component may be used in the bandNum mapping table, where the chroma transpose component is a transpose of the first chroma component or the second chroma component.
  • C represents a current chroma component which may be the first chroma component or the second chroma component
  • CT represents the chroma transpose component which is the transpose of C, i.e., the other chroma component.
  • C represents the U component
  • CT represents the V component
  • C represents the V component
  • the indicator may indicate the one or more bandNum segments of the one or more components including at least one of following components: the luma component, the first chroma component, the second chroma component, or the chroma transpose component associated with the first chroma component or the second chroma component, as shown in Table 2-42.
  • the processor 4120 may determine the one or more bandNum segments according to the indicator and may then determine a band offset according to the one or more bandNum segments.
  • the one or more bandNum segments may be determined according to the indicator that is determined from a mapping table.
  • the mapping table may be predefined or adjusted/changed by an encoder.
  • the mapping table may be the bandNum mapping table as shown in Table 2-42 and Table 2-43.
  • mapping table when the mapping table is predefined, the mapping table may be designed offline and cannot be designed or changed by the encoder, both the encoder and the decoder may have the mapping table and there is no need to signal the mapping table in the bitstream to be transmitted to the decoder. In such situation, both the encoder and the decoder don’t need to change the mapping table, such that the encoder/decoder don’t need to support various variants and lower complexity may be obtained.
  • a mapping table may be predefined offline as shown in Table 2-42 or Table 2-43. Both encoder and decoder know the mapping table without any signaling. Predefining does not need any design or signaling at the encoder.
  • mapping table when the mapping table can be changed or adjusted, the encoder can change the mapping table at different levels.
  • the processor 4120 may modify the respective sample of the second component based on a sample offset including the band offset.
  • the sample offset may include the band offset and an edge offset, as described above.
  • FIG. 43 is a flowchart illustrating a method for video encoding according to an example of the present disclosure
  • the processor 4120 may determine a classifier for a respective sample of a second component according to a collocated sample of a first component, where a picture frame may include one or more components including a first component and a second component.
  • the first component may include one of following components: a luma component, a first chroma component, or a second chroma component
  • the second component may include one of following components: the luma component, the first chroma component, or the second chroma component.
  • the luma component may be Y component
  • the first chroma component may be U component
  • the second chroma component may be V component.
  • the first and second chroma components are interchangeable.
  • the collocated sample of the first component may obtained by linearly weighting samples from at least one of following samples: a plurality of collocated and neighboring luma samples, or a plurality of linearly weighted samples for three components comprising a luma component, a first chroma component, and a second chroma component.
  • the collocated sample of the first component may obtained by linearly weighting samples from the plurality of collocated and neighboring luma samples as shown in FIGS. 20A-20B and 21 A-21B.
  • the collocated luma sample value (Y0) can be replaced by a value (Yp) by weighting collocated and neighboring luma samples as shown in
  • FIGS. 20A-20B are identical to FIGS. 20A-20B.
  • the collocated sample of the first component may obtained by linearly weighting samples from a plurality of linearly weighted samples for three components including the luma component, the first chroma component, and the second chroma component.
  • the classifier C7 all 3 color component collocated/current and neighboring samples are used to derive the current component C0/C3 bandNum classification.
  • current and neighboring U samples are used as in FIG. 13B.
  • the processor 4120 may predefine or signal an indicator in a bitstream, where the indicator indicates one or more bandNum segments of the one or more components in response to determining that the classifier is a band classifier or a joint classifier encompassing the band classifier.
  • the indicator may be predefined or signaled by an encoder at at least one level.
  • the at least one level may include at least one of following levels: a Sequence Parameter Set (SPS) level, an Adaption Parameter Set (APS) level, a Picture Parameter Set (PPS) level, a Picture Header (PH) level, a Sequence Header (SH) level, a Region level, a Coding Tree Unit (CTU) level, a Subblock level, or a Sample level.
  • SPS Sequence Parameter Set
  • APS Adaption Parameter Set
  • PPS Picture Parameter Set
  • PH Picture Header
  • SH Sequence Header
  • CTU Coding Tree Unit
  • Subblock level or a Sample level.
  • the one or more bandNum segments may be determined according to the indicator that is determined from a mapping table.
  • the processor 4120 may predefine or adjust/change the mapping table.
  • the mapping table may be the bandNum mapping table as shown in Table 2-42 and Table 2-43.
  • both the encoder and the decoder may have the mapping table and there is no need to signal the mapping table in the bitstream to be transmitted to the decoder. In such situation, both the encoder and the decoder don’t need to change the mapping table.
  • the encoder can change the mapping table at different levels.
  • the luma component, the first chroma component, and the second chroma component use different indicators to indicate respective bandNum segments, as shown in Table 2-42.
  • At least two of the luma component, the first chroma component, or the second chroma component use a same indicator to indicate respective bandNum segments.
  • a chroma transpose component may be used in the mapping table, where the chroma transpose component is a transpose of the first chroma component or the second chroma component.
  • C represents a current chroma component which may be the first chroma component or the second chroma component
  • CT represents the chroma transpose component which is the transpose of C, i.e., the other chroma component.
  • C represents the U component
  • CT represents the V component
  • C represents the V component
  • the indicator may indicate the one or more bandNum segments of the one or more components including at least one of following components: the luma component, the first chroma component, the second chroma component, or the chroma transpose component associated with the first chroma component or the second chroma component, as shown in Table 2-42.
  • the video decoder after receiving the bitstream encoded by the encoder, may determine the one or more bandNum segments according to the indicator and may then determine a band offset according to the one or more bandNum segments.
  • the one or more bandNum segments may be determined according to the indicator that is determined from a mapping table.
  • the mapping table may be predefined or adjusted/changed by an encoder.
  • the mapping table may be the bandNum mapping table as shown in Table 2-42 and Table 2-43.
  • the decoder may modify the respective sample of the second component based on a sample offset including the band offset.
  • a non-transitory computer-readable storage medium comprising a plurality of programs, for example, in the memory 4130, executable by the processor 4120 in the computing environment 4110, for performing the above-described methods.
  • the plurality of programs may be executed by the processor 4120 in the computing environment 4110 to receive (for example, from the video encoder 20 in FIG. 2) a bitstream or data stream including encoded video information (for example, video blocks representing encoded video frames, and/or associated one or more syntax elements, etc.), and may also be executed by the processor 4120 in the computing environment 4110 to perform the decoding method described above according to the received bitstream or data stream.
  • the plurality of programs may be executed by the processor 4120 in the computing environment 4110 to perform the encoding method described above to encode video information (for example, video blocks representing video frames, and/or associated one or more syntax elements, etc.) into a bitstream or data stream, and may also be executed by the processor 4120 in the computing environment 4110 to transmit the bitstream or data stream (for example, to the video decoder 30 in FIG. 3).
  • the non-transitory computer-readable storage medium may have stored therein a bitstream or a data stream comprising encoded video information (for example, video information comprising one or more syntax elements) generated by an encoder (for example, the video encoder 20 in FIG.
  • the non-transitory computer-readable storage medium may be, for example, a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disc, an optical data storage device or the like.
  • the is also provided a computing device comprising one or more processors (for example, the processor 4120); and the non-transitory computer-readable storage medium or the memory 4130 having stored therein a plurality of programs executable by the one or more processors, wherein the one or more processors, upon execution of the plurality of programs, are configured to perform the above-described methods.
  • processors for example, the processor 4120
  • non-transitory computer-readable storage medium or the memory 4130 having stored therein a plurality of programs executable by the one or more processors, wherein the one or more processors, upon execution of the plurality of programs, are configured to perform the above-described methods.
  • a computer program product comprising a plurality of programs, for example, in the memory 4130, executable by the processor 4120 in the computing environment 4110, for performing the above-described methods.
  • the computer program product may include the non-transitory computer-readable storage medium.
  • the computing environment 4110 may be implemented with one or more ASICs, DSPs, Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), FPGAs, GPUs, controllers, micro-controllers, microprocessors, or other electronic components, for performing the above methods.
  • ASICs application-specific integrated circuits
  • DSPs Digital Signal Processing Devices
  • PLDs Programmable Logic Devices
  • FPGAs field-programmable Logic Devices
  • GPUs GPUs
  • controllers micro-controllers
  • microprocessors microprocessors, or other electronic components, for performing the above methods.
  • Computer-readable media may include computer-readable storage media, which corresponds to a tangible medium such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol.
  • computer-readable media generally may correspond to (1) tangible computer- readable storage media which is non-transitory or (2) a communication medium such as a signal or carrier wave.
  • Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the implementations described in the present application.
  • a computer program product may include a computer-readable medium.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

La présente invention concerne des procédés et des dispositifs de codage vidéo. Dans le procédé, un décodeur peut recevoir une trame d'image comprenant un ou plusieurs composants, le ou les composants comprenant un premier composant et un second composant. Le décodeur détermine un classificateur pour un échantillon respectif du second composant selon un échantillon co-localisé du premier composant; obtient un indicateur qui indique un ou plusieurs segments de bande passante du ou des composants en réponse à la détermination du fait que le classificateur est un classificateur de bande ou un classificateur d'assemblage englobant le classificateur de bande; détermine, selon l'indicateur et à partir d'une table de mappage, le ou les segments de bande passante et détermine un décalage de bande selon le ou les segments de bande passante; et modifie l'échantillon respectif du second composant en fonction d'un décalage d'échantillon comprenant le décalage de bande.
PCT/US2022/051013 2021-11-25 2022-11-25 Décalage adaptatif d'échantillon à composants croisés WO2023097064A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US202163283266P 2021-11-25 2021-11-25
US63/283,266 2021-11-25

Publications (1)

Publication Number Publication Date
WO2023097064A1 true WO2023097064A1 (fr) 2023-06-01

Family

ID=86540329

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2022/051013 WO2023097064A1 (fr) 2021-11-25 2022-11-25 Décalage adaptatif d'échantillon à composants croisés

Country Status (1)

Country Link
WO (1) WO2023097064A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180220138A1 (en) * 2015-07-08 2018-08-02 Vid Scale, Inc. Enhanced chroma coding using cross plane filtering
US20210152841A1 (en) * 2019-11-15 2021-05-20 Qualcomm Incorporated Cross-component adaptive loop filter in video coding
WO2021127534A1 (fr) * 2019-12-18 2021-06-24 Beijing Dajia Internet Information Technology Co., Ltd. Filtre en boucle adaptatif à composantes croisées pour le codage vidéo
CN113099221A (zh) * 2021-02-22 2021-07-09 浙江大华技术股份有限公司 跨分量样点自适应补偿方法、编码方法及相关装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180220138A1 (en) * 2015-07-08 2018-08-02 Vid Scale, Inc. Enhanced chroma coding using cross plane filtering
US20210152841A1 (en) * 2019-11-15 2021-05-20 Qualcomm Incorporated Cross-component adaptive loop filter in video coding
WO2021127534A1 (fr) * 2019-12-18 2021-06-24 Beijing Dajia Internet Information Technology Co., Ltd. Filtre en boucle adaptatif à composantes croisées pour le codage vidéo
CN113099221A (zh) * 2021-02-22 2021-07-09 浙江大华技术股份有限公司 跨分量样点自适应补偿方法、编码方法及相关装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
C.-W. KUO (KWAI), X. XIU (KWAI), Y.-W. CHEN (KWAI), H.-J. JHU (KWAI), W. CHEN (KWAI), X. WANG (KWAI): "EE2-5.1: Cross-component Sample Adaptive Offset", 23. JVET MEETING; 20210707 - 20210716; TELECONFERENCE; (THE JOINT VIDEO EXPLORATION TEAM OF ISO/IEC JTC1/SC29/WG11 AND ITU-T SG.16 ), 1 July 2021 (2021-07-01), XP030295926 *

Similar Documents

Publication Publication Date Title
EP3984222A1 (fr) Amélioration du codage par chrominance dans un décalage adaptatif d'échantillon inter-composant
WO2022115698A1 (fr) Amélioration du codage par chrominance dans un décalage adaptatif d'échantillon inter-composantes
US20230396781A1 (en) Coding enhancement in cross-component sample adaptive offset
WO2022066783A1 (fr) Amélioration du codage par chrominance dans un décalage adaptatif d'échantillon inter-composant à limite virtuelle
US20240007652A1 (en) Coding enhancement in cross-component sample adaptive offset
WO2022046903A1 (fr) Amélioration du codage par chrominance dans un décalage adaptatif d'échantillon inter-composant
US20230336785A1 (en) Coding enhancement in cross-component sample adaptive offset
EP4201063A1 (fr) Amélioration du codage de chrominance dans un décalage adaptatif d'échantillon de composant croisé
US20230319315A1 (en) Coding enhancement in cross-component sample adaptive offset
EP4285591A1 (fr) Amélioration du codage par chrominance dans un décalage adaptatif d'échantillon à composantes croisées
WO2023097064A1 (fr) Décalage adaptatif d'échantillon à composants croisés
WO2023091729A1 (fr) Décalage adaptatif d'échantillon à composante transversale
WO2023038964A1 (fr) Amélioration du codage dans un décalage adaptatif d'échantillon de composante croisée
US20240137546A1 (en) Coding enhancement in cross-component sample adaptive offset
WO2023009608A1 (fr) Amélioration du codage dans un décalage adaptatif d'échantillons à composants transversaux
WO2023023174A1 (fr) Amélioration du codage dans un décalage adaptatif d'échantillon inter-composants
CN117917074A (zh) 跨分量样点自适应偏移中的编解码增强
WO2022093992A1 (fr) Amélioration du codage par chrominance dans un décalage adaptatif d'échantillon inter-composant à limite virtuelle
CN117413516A (zh) 跨分量样本自适应偏移中的编解码增强
CN117296315A (zh) 跨分量样点自适应偏移中的编解码增强

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 22899427

Country of ref document: EP

Kind code of ref document: A1