BLOCK-WISE CONTENT-ADAPTIVE ONLINE TRAINING IN NEURAL IMAGE COMPRESSION WITH POST FILTERING

Abstract

Aspects of the disclosure provide a method, an apparatus, and a non-transitory computer-readable storage medium for video decoding. The apparatus can include processing circuitry. The processing circuitry is configured to reconstruct blocks of an image from a coded video bitstream. The processing circuitry can perform post-processing on one of a plurality of regions of first two neighboring reconstructed blocks of the reconstructed blocks with at least one post-processing neural network (NN). The first two neighboring reconstructed blocks have a first shared boundary and include a boundary region having samples on both sides of the first shared boundary. The plurality of regions of the first two neighboring reconstructed blocks includes the boundary region and non-boundary regions that are outside the boundary region. The one of the plurality of regions is replaced with the post-processed one of the plurality of regions of the first two neighboring reconstructed blocks.

Description

TECHNICAL FIELD

The present disclosure describes embodiments generally related to video coding.

BACKGROUND

The background description provided herein is for the purpose of generally presenting the context of the disclosure. Work of the presently named inventors, to the extent the work is described in this background section, as well as aspects of the description that may not otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admitted as prior art against the present disclosure.

Image and/or video coding and decoding can be performed using inter-picture prediction with motion compensation. Uncompressed digital image and/or video can include a series of pictures, each picture having a spatial dimension of, for example, 1920×1080 luminance samples and associated chrominance samples. The series of pictures can have a fixed or variable picture rate (informally also known as frame rate), of, for example 60 pictures per second or 60 Hz. Uncompressed image and/or video has specific bitrate requirements. For example, 1080p60 4:2:0 video at 8 bit per sample (1920×1080 luminance sample resolution at 60 Hz frame rate) requires close to 1.5 Gbit/s bandwidth. An hour of such video requires more than 600 GBytes of storage space.

One purpose of image/video encoding and decoding can be the reduction of redundancy in the input image and/or video signal, through compression. Compression can help reduce the aforementioned bandwidth and/or storage space requirements, in some cases by two orders of magnitude or more. Although the descriptions herein use video encoding/decoding as illustrative examples, the same techniques can be applied to image encoding/decoding in similar fashion without departing from the spirit of the present disclosure. Both lossless compression and lossy compression, as well as a combination thereof can be employed. Lossless compression refers to techniques where an exact copy of the original signal can be reconstructed from the compressed original signal. When using lossy compression, the reconstructed signal may not be identical to the original signal, but the distortion between original and reconstructed signals is small enough to make the reconstructed signal useful for the intended application. In the case of video, lossy compression is widely employed. The amount of distortion tolerated depends on the application; for example, users of certain consumer streaming applications may tolerate higher distortion than users of television distribution applications. The compression ratio achievable can reflect that: higher allowable/tolerable distortion can yield higher compression ratios.

A video encoder and decoder can utilize techniques from several broad categories, including, for example, motion compensation, transform, quantization, and entropy coding.

Video codec technologies can include techniques known as intra coding. In intra coding, sample values are represented without reference to samples or other data from previously reconstructed reference pictures. In some video codecs, the picture is spatially subdivided into blocks of samples. When all blocks of samples are coded in intra mode, that picture can be an intra picture. Intra pictures and their derivations such as independent decoder refresh pictures, can be used to reset the decoder state and can, therefore, be used as the first picture in a coded video bitstream and a video session, or as a still image. The samples of an intra block can be exposed to a transform, and the transform coefficients can be quantized before entropy coding. Intra prediction can be a technique that minimizes sample values in the pre-transform domain. In some cases, the smaller the DC value after a transform is, and the smaller the AC coefficients are, the fewer the bits that are required at a given quantization step size to represent the block after entropy coding.

Traditional intra coding such as known from, for example MPEG-2 generation coding technologies, does not use intra prediction. However, some newer video compression technologies include techniques that attempt, from, for example, surrounding sample data and/or metadata obtained during the encoding and/or decoding of spatially neighboring, and preceding in decoding order, blocks of data. Such techniques are henceforth called “intra prediction” techniques. Note that in at least some cases, intra prediction is using reference data only from the current picture under reconstruction and not from reference pictures.

There can be many different forms of intra prediction. When more than one of such techniques can be used in a given video coding technology, the technique in use can be coded in an intra prediction mode. In certain cases, modes can have submodes and/or parameters, and those can be coded individually or included in the mode codeword. Which codeword to use for a given mode, submode, and/or parameter combination can have an impact in the coding efficiency gain through intra prediction, and so can the entropy coding technology used to translate the codewords into a bitstream.

A certain mode of intra prediction was introduced with H.264, refined in H.265, and further refined in newer coding technologies such as joint exploration model (JEM), versatile video coding (VVC), and benchmark set (BMS). A predictor block can be formed using neighboring sample values belonging to already available samples. Sample values of neighboring samples are copied into the predictor block according to a direction. A reference to the direction in use can be coded in the bitstream or may itself be predicted.

Referring to FIG. 1A, depicted in the lower right is a subset of nine predictor directions known from H.265's 33 possible predictor directions (corresponding to the 33 angular modes of the 35 intra modes). The point where the arrows converge (101) represents the sample being predicted. The arrows represent the direction from which the sample is being predicted. For example, arrow (102) indicates that sample (101) is predicted from a sample or samples to the upper right, at a 45 degree angle from the horizontal. Similarly, arrow (103) indicates that sample (101) is predicted from a sample or samples to the lower left of sample (101), in a 22.5 degree angle from the horizontal.

Still referring to FIG. 1A, on the top left there is depicted a square block (104) of 4×4 samples (indicated by a dashed, boldface line). The square block (104) includes 16 samples, each labelled with an “S”, its position in the Y dimension (e.g., row index) and its position in the X dimension (e.g., column index). For example, sample S21 is the second sample in the Y dimension (from the top) and the first (from the left) sample in the X dimension. Similarly, sample S44 is the fourth sample in block (104) in both the Y and X dimensions. As the block is 4×4 samples in size, S44 is at the bottom right. Further shown are reference samples that follow a similar numbering scheme. A reference sample is labelled with an R, its Y position (e.g., row index) and X position (column index) relative to block (104). In both H.264 and H.265, prediction samples neighbor the block under reconstruction; therefore no negative values need to be used.

Intra picture prediction can work by copying reference sample values from the neighboring samples as appropriated by the signaled prediction direction. For example, assume the coded video bitstream includes signaling that, for this block, indicates a prediction direction consistent with arrow (102)—that is, samples are predicted from a prediction sample or samples to the upper right, at a 45 degree angle from the horizontal. In that case, samples S41, S32, S23, and S14 are predicted from the same reference sample R05. Sample S44 is then predicted from reference sample R08.

In certain cases, the values of multiple reference samples may be combined, for example through interpolation, in order to calculate a reference sample; especially when the directions are not evenly divisible by 45 degrees.

The number of possible directions has increased as video coding technology has developed. In H.264 (year 2003), nine different direction could be represented. That increased to 33 in H.265 (year 2013), and JEM/VVC/BMS, at the time of disclosure, can support up to 65 directions. Experiments have been conducted to identify the most likely directions, and certain techniques in the entropy coding are used to represent those likely directions in a small number of bits, accepting a certain penalty for less likely directions. Further, the directions themselves can sometimes be predicted from neighboring directions used in neighboring, already decoded, blocks.

FIG. 1B shows a schematic (110) that depicts 65 intra prediction directions according to JEM to illustrate the increasing number of prediction directions over time.

The mapping of intra prediction directions bits in the coded video bitstream that represent the direction can be different from video coding technology to video coding technology; and can range, for example, from simple direct mappings of prediction direction to intra prediction mode, to codewords, to complex adaptive schemes involving most probable modes, and similar techniques. In all cases, however, there can be certain directions that are statistically less likely to occur in video content than certain other directions. As the goal of video compression is the reduction of redundancy, those less likely directions will, in a well working video coding technology, be represented by a larger number of bits than more likely directions.

Motion compensation can be a lossy compression technique and can relate to techniques where a block of sample data from a previously reconstructed picture or part thereof (reference picture), after being spatially shifted in a direction indicated by a motion vector (MV henceforth), is used for the prediction of a newly reconstructed picture or picture part. In some cases, the reference picture can be the same as the picture currently under reconstruction. MVs can have two dimensions X and Y, or three dimensions, the third being an indication of the reference picture in use (the latter, indirectly, can be a time dimension).

In some video compression techniques, an MV applicable to a certain area of sample data can be predicted from other MVs, for example from those related to another area of sample data spatially adjacent to the area under reconstruction, and preceding that MV in decoding order. Doing so can substantially reduce the amount of data required for coding the MV, thereby removing redundancy and increasing compression. MV prediction can work effectively, for example, because when coding an input video signal derived from a camera (known as natural video) there is a statistical likelihood that areas larger than the area to which a single MV is applicable move in a similar direction and, therefore, can in some cases be predicted using a similar motion vector derived from MVs of neighboring area. That results in the MV found for a given area to be similar or the same as the MV predicted from the surrounding MVs, and that in turn can be represented, after entropy coding, in a smaller number of bits than what would be used if coding the MV directly. In some cases, MV prediction can be an example of lossless compression of a signal (namely: the MVs) derived from the original signal (namely: the sample stream). In other cases, MV prediction itself can be lossy, for example because of rounding errors when calculating a predictor from several surrounding MVs.

Various MV prediction mechanisms are described in H.265/HEVC (ITU-T Rec. H.265, “High Efficiency Video Coding”, December 2016). Out of the many MV prediction mechanisms that H.265 offers, described here is a technique henceforth referred to as “spatial merge”.

Referring to FIG. 2, a current block (201) comprises samples that have been found by the encoder during the motion search process to be predictable from a previous block of the same size that has been spatially shifted. Instead of coding that MV directly, the MV can be derived from metadata associated with one or more reference pictures, for example from the most recent (in decoding order) reference picture, using the MV associated with either one of five surrounding samples, denoted A0, A0, and B0, B0, B2 (202 through 206, respectively). In H.265, the MV prediction can use predictors from the same reference picture that the neighboring block is using.

SUMMARY

Aspects of the disclosure provide methods and apparatuses for video encoding and decoding. In some examples, an apparatus for video decoding includes processing circuitry. The processing circuitry is configured to reconstruct blocks of an image from a coded video bitstream. The processing circuitry is configured to perform post-processing on one of a plurality of regions of first two neighboring reconstructed blocks of the reconstructed blocks with at least one post-processing neural network (NN). The first two neighboring reconstructed blocks can have a first shared boundary and include a boundary region having samples on both sides of the first shared boundary. The plurality of regions of the first two neighboring reconstructed blocks includes the boundary region and non-boundary regions that are outside the boundary region. The processing circuitry can replace the one of the plurality of regions with the post-processed one of the plurality of regions of the first two neighboring reconstructed blocks.

In an embodiment, the one of the plurality regions is the boundary region, and the at least one post-processing NN includes at least one deblocking NN. The processing circuitry is configured to perform deblocking on the boundary region with the at least one deblocking NN, and replace the boundary region with the deblocked boundary region.

In an embodiment, the boundary region further includes samples on both sides of a second shared boundary between second two neighboring reconstructed blocks of the reconstructed blocks, and the first two neighboring reconstructed blocks are different from the second two neighboring reconstructed blocks.

In an embodiment, the at least one deblocking NN are based on multiple deblocking models, respectively. The processing circuitry is configured to determine which of the multiple deblocking models to apply to the boundary region, and perform deblocking on the boundary region with the determined deblocking model.

In an embodiment, the determining which of the multiple deblocking models to apply is performed by a classification NN.

In an embodiment, the at least one post-processing NN includes at least one enhancement NN. The processing circuitry is configured to enhance one of the non-boundary regions with the at least one enhancement NN, and replace the one of the non-boundary regions with the enhanced one of the non-boundary regions.

In an embodiment, the at least one enhancement NN are based on multiple enhancement models, respectively. The processing circuitry is configured to determine which of the multiple enhancement models to apply to the one of the non-boundary regions, and enhance the one of the non-boundary regions with the determined enhancement model.

In an embodiment, the processing circuitry is configured to perform deblocking on the boundary region, and enhance the non-boundary regions. The processing circuitry can replace the boundary region with the deblocked boundary region, and replace the non-boundary regions with the enhanced non-boundary regions, respectively.

In an embodiment, a shared sample is located in the boundary region and one of the non-boundary regions, and the at least one post-processing NN further includes at least one enhancement NN. The processing circuitry is configured to enhance the one of the non-boundary regions with the at least one enhancement NN. The processing circuitry can replace the one of the non-boundary regions with the enhanced one of the non-boundary regions. A value of the shared sample can be replaced with a weighted average of a value of the shared sample in the deblocked boundary region and a value of the shared sample in the enhanced one of the non-boundary regions.

In an embodiment, the processing circuitry is configured to decode neural network update information in the coded video bitstream where the neural network update information corresponds to one of the blocks and indicates a replacement parameter corresponding to a pretrained parameter in a neural network in the video decoder. The processing circuitry can reconstruct the one of the blocks based on the neural network updated with the replacement parameter.

Aspects of the disclosure also provide a non-transitory computer-readable storage medium storing a program executable by at least one processor to perform the methods for video decoding.

BRIEF DESCRIPTION OF THE DRAWINGS

Further features, the nature, and various advantages of the disclosed subject matter will be more apparent from the following detailed description and the accompanying drawings in which:

FIG. 1A is a schematic illustration of an exemplary subset of intra prediction modes.

FIG. 1B is an illustration of exemplary intra prediction directions.

FIG. 2 shows a current block (201) and surrounding samples in accordance with an embodiment.

FIG. 3 is a schematic illustration of a simplified block diagram of a communication system (300) in accordance with an embodiment.

FIG. 4 is a schematic illustration of a simplified block diagram of a communication system (400) in accordance with an embodiment.

FIG. 5 is a schematic illustration of a simplified block diagram of a decoder in accordance with an embodiment.

FIG. 6 is a schematic illustration of a simplified block diagram of an encoder in accordance with an embodiment.

FIG. 7 shows a block diagram of an encoder in accordance with another embodiment.

FIG. 8 shows a block diagram of a decoder in accordance with another embodiment.

FIG. 9A shows an example of a block-wise image coding according to an embodiment of the disclosure.

FIG. 9B shows an exemplary NIC framework according to an embodiment of the disclosure.

FIG. 10 shows an exemplary convolution neural network (CNN) of a main encoder network according to an embodiment of the disclosure.

FIG. 11 shows an exemplary CNN of a main decoder network according to an embodiment of the disclosure.

FIG. 12 shows an exemplary CNN of a hyper encoder according to an embodiment of the disclosure.

FIG. 13 shows an exemplary CNN of a hyper decoder according to an embodiment of the disclosure.

FIG. 14 shows an exemplary CNN of a context model network according to an embodiment of the disclosure.

FIG. 15 shows an exemplary CNN of an entropy parameter network according to an embodiment of the disclosure.

FIG. 16A shows an exemplary video encoder according to an embodiment of the disclosure.

FIG. 16B shows an exemplary video decoder according to an embodiment of the disclosure.

FIG. 17 shows an exemplary video encoder according to an embodiment of the disclosure.

FIG. 18 shows an exemplary video decoder according to an embodiment of the disclosure.

FIG. 19 shows a flow chart of an exemplary process for determining a boundary strength value according to an embodiment of the disclosure.

FIG. 20 shows exemplary sample positions for determining a boundary strength value according to an embodiment of the disclosure.

FIGS. 21A-21C show an exemplary deblocking process according to an embodiment of the disclosure.

FIG. 22 shows an example of boundary regions including samples of more than two blocks according to embodiments of the disclosure.

FIG. 23 shows an exemplary deblocking process based on multiple deblocking models according to an embodiment of the disclosure.

FIG. 24 shows an example enhancement process according to an embodiment of the disclosure.

FIG. 25 shows an exemplary enhancement process according to an embodiment of the disclosure.

FIG. 26 shows an exemplary image-level enhancement process according to an embodiment of the disclosure.

FIG. 27 shows an example of shared samples according to an embodiment of the disclosure.

FIG. 28 shows a flow chart outlining a process according to an embodiment of the disclosure.

FIG. 29 is a schematic illustration of a computer system in accordance with an embodiment.

DETAILED DESCRIPTION OF EMBODIMENTS

FIG. 3 illustrates a simplified block diagram of a communication system (300) according to an embodiment of the present disclosure. The communication system (300) includes a plurality of terminal devices that can communicate with each other, via, for example, a network (350). For example, the communication system (300) includes a first pair of terminal devices (310) and (320) interconnected via the network (350). In the FIG. 3 example, the first pair of terminal devices (310) and (320) performs unidirectional transmission of data. For example, the terminal device (310) may code video data (e.g., a stream of video pictures that are captured by the terminal device (310)) for transmission to the other terminal device (320) via the network (350). The encoded video data can be transmitted in the form of one or more coded video bitstreams. The terminal device (320) may receive the coded video data from the network (350), decode the coded video data to recover the video pictures and display video pictures according to the recovered video data. Unidirectional data transmission may be common in media serving applications and the like.

In another example, the communication system (300) includes a second pair of terminal devices (330) and (340) that performs bidirectional transmission of coded video data that may occur, for example, during videoconferencing. For bidirectional transmission of data, in an example, each terminal device of the terminal devices (330) and (340) may code video data (e.g., a stream of video pictures that are captured by the terminal device) for transmission to the other terminal device of the terminal devices (330) and (340) via the network (350). Each terminal device of the terminal devices (330) and (340) also may receive the coded video data transmitted by the other terminal device of the terminal devices (330) and (340), and may decode the coded video data to recover the video pictures and may display video pictures at an accessible display device according to the recovered video data.

In the FIG. 3 example, the terminal devices (310), (320), (330) and (340) may be illustrated as servers, personal computers and smart phones but the principles of the present disclosure may be not so limited. Embodiments of the present disclosure find application with laptop computers, tablet computers, media players and/or dedicated video conferencing equipment. The network (350) represents any number of networks that convey coded video data among the terminal devices (310), (320), (330) and (340), including for example wireline (wired) and/or wireless communication networks. The communication network (350) may exchange data in circuit-switched and/or packet-switched channels. Representative networks include telecommunications networks, local area networks, wide area networks and/or the Internet. For the purposes of the present discussion, the architecture and topology of the network (350) may be immaterial to the operation of the present disclosure unless explained herein below.

FIG. 4 illustrates, as an example for an application for the disclosed subject matter, the placement of a video encoder and a video decoder in a streaming environment. The disclosed subject matter can be equally applicable to other video enabled applications, including, for example, video conferencing, digital TV, storing of compressed video on digital media including CD, DVD, memory stick and the like, and so on.

A streaming system may include a capture subsystem (413), that can include a video source (401), for example a digital camera, creating for example a stream of video pictures (402) that are uncompressed. In an example, the stream of video pictures (402) includes samples that are taken by the digital camera. The stream of video pictures (402), depicted as a bold line to emphasize a high data volume when compared to encoded video data (404) (or coded video bitstreams), can be processed by an electronic device (420) that includes a video encoder (403) coupled to the video source (401). The video encoder (403) can include hardware, software, or a combination thereof to enable or implement aspects of the disclosed subject matter as described in more detail below. The encoded video data (404) (or encoded video bitstream (404)), depicted as a thin line to emphasize the lower data volume when compared to the stream of video pictures (402), can be stored on a streaming server (405) for future use. One or more streaming client subsystems, such as client subsystems (406) and (408) in FIG. 4 can access the streaming server (405) to retrieve copies (407) and (409) of the encoded video data (404). A client subsystem (406) can include a video decoder (410), for example, in an electronic device (430). The video decoder (410) decodes the incoming copy (407) of the encoded video data and creates an outgoing stream of video pictures (411) that can be rendered on a display (412) (e.g., display screen) or other rendering device (not depicted). In some streaming systems, the encoded video data (404), (407), and (409) (e.g., video bitstreams) can be encoded according to certain video coding/compression standards. Examples of those standards include ITU-T Recommendation H.265. In an example, a video coding standard under development is informally known as Versatile Video Coding (VVC). The disclosed subject matter may be used in the context of VVC.

It is noted that the electronic devices (420) and (430) can include other components (not shown). For example, the electronic device (420) can include a video decoder (not shown) and the electronic device (430) can include a video encoder (not shown) as well.

FIG. 5 shows a block diagram of a video decoder (510) according to an embodiment of the present disclosure. The video decoder (510) can be included in an electronic device (530). The electronic device (530) can include a receiver (531) (e.g., receiving circuitry). The video decoder (510) can be used in the place of the video decoder (410) in the FIG. 4 example.

The receiver (531) may receive one or more coded video sequences to be decoded by the video decoder (510); in the same or another embodiment, one coded video sequence at a time, where the decoding of each coded video sequence is independent from other coded video sequences. The coded video sequence may be received from a channel (501), which may be a hardware/software link to a storage device which stores the encoded video data. The receiver (531) may receive the encoded video data with other data, for example, coded audio data and/or ancillary data streams, that may be forwarded to their respective using entities (not depicted). The receiver (531) may separate the coded video sequence from the other data. To combat network jitter, a buffer memory (515) may be coupled in between the receiver (531) and an entropy decoder/parser (520) (“parser (520)” henceforth). In certain applications, the buffer memory (515) is part of the video decoder (510). In others, it can be outside of the video decoder (510) (not depicted). In still others, there can be a buffer memory (not depicted) outside of the video decoder (510), for example to combat network jitter, and in addition another buffer memory (515) inside the video decoder (510), for example to handle playout timing. When the receiver (531) is receiving data from a store/forward device of sufficient bandwidth and controllability, or from an isosynchronous network, the buffer memory (515) may not be needed, or can be small. For use on best effort packet networks such as the Internet, the buffer memory (515) may be required, can be comparatively large and can be advantageously of adaptive size, and may at least partially be implemented in an operating system or similar elements (not depicted) outside of the video decoder (510).

The video decoder (510) may include the parser (520) to reconstruct symbols (521) from the coded video sequence. Categories of those symbols include information used to manage operation of the video decoder (510), and potentially information to control a rendering device such as a render device (512) (e.g., a display screen) that is not an integral part of the electronic device (530) but can be coupled to the electronic device (530), as was shown in FIG. 5. The control information for the rendering device(s) may be in the form of Supplemental Enhancement Information (SEI messages) or Video Usability Information (VUI) parameter set fragments (not depicted). The parser (520) may parse/entropy-decode the coded video sequence that is received. The coding of the coded video sequence can be in accordance with a video coding technology or standard, and can follow various principles, including variable length coding, Huffman coding, arithmetic coding with or without context sensitivity, and so forth. The parser (520) may extract from the coded video sequence, a set of subgroup parameters for at least one of the subgroups of pixels in the video decoder, based upon at least one parameter corresponding to the group. Subgroups can include Groups of Pictures (GOPs), pictures, tiles, slices, macroblocks, Coding Units (CUs), blocks, Transform Units (TUs), Prediction Units (PUs) and so forth. The parser (520) may also extract from the coded video sequence information such as transform coefficients, quantizer parameter values, motion vectors, and so forth.

The parser (520) may perform an entropy decoding/parsing operation on the video sequence received from the buffer memory (515), so as to create symbols (521).

Reconstruction of the symbols (521) can involve multiple different units depending on the type of the coded video picture or parts thereof (such as: inter and intra picture, inter and intra block), and other factors. Which units are involved, and how, can be controlled by the subgroup control information that was parsed from the coded video sequence by the parser (520). The flow of such subgroup control information between the parser (520) and the multiple units below is not depicted for clarity.

Beyond the functional blocks already mentioned, the video decoder (510) can be conceptually subdivided into a number of functional units as described below. In a practical implementation operating under commercial constraints, many of these units interact closely with each other and can, at least partly, be integrated into each other. However, for the purpose of describing the disclosed subject matter, the conceptual subdivision into the functional units below is appropriate.

A first unit is the scaler/inverse transform unit (551). The scaler/inverse transform unit (551) receives a quantized transform coefficient as well as control information, including which transform to use, block size, quantization factor, quantization scaling matrices, etc. as symbol(s) (521) from the parser (520). The scaler/inverse transform unit (551) can output blocks comprising sample values, that can be input into aggregator (555).

In some cases, the output samples of the scaler/inverse transform (551) can pertain to an intra coded block; that is: a block that is not using predictive information from previously reconstructed pictures, but can use predictive information from previously reconstructed parts of the current picture. Such predictive information can be provided by an intra picture prediction unit (552). In some cases, the intra picture prediction unit (552) generates a block of the same size and shape of the block under reconstruction, using surrounding already reconstructed information fetched from the current picture buffer (558). The current picture buffer (558) buffers, for example, partly reconstructed current picture and/or fully reconstructed current picture. The aggregator (555), in some cases, adds, on a per sample basis, the prediction information the intra prediction unit (552) has generated to the output sample information as provided by the scaler/inverse transform unit (551).

In other cases, the output samples of the scaler/inverse transform unit (551) can pertain to an inter coded, and potentially motion compensated block. In such a case, a motion compensation prediction unit (553) can access reference picture memory (557) to fetch samples used for prediction. After motion compensating the fetched samples in accordance with the symbols (521) pertaining to the block, these samples can be added by the aggregator (555) to the output of the scaler/inverse transform unit (551) (in this case called the residual samples or residual signal) so as to generate output sample information. The addresses within the reference picture memory (557) from where the motion compensation prediction unit (553) fetches prediction samples can be controlled by motion vectors, available to the motion compensation prediction unit (553) in the form of symbols (521) that can have, for example X, Y, and reference picture components. Motion compensation also can include interpolation of sample values as fetched from the reference picture memory (557) when sub-sample exact motion vectors are in use, motion vector prediction mechanisms, and so forth.

The output samples of the aggregator (555) can be subject to various loop filtering techniques in the loop filter unit (556). Video compression technologies can include in-loop filter technologies that are controlled by parameters included in the coded video sequence (also referred to as coded video bitstream) and made available to the loop filter unit (556) as symbols (521) from the parser (520), but can also be responsive to meta-information obtained during the decoding of previous (in decoding order) parts of the coded picture or coded video sequence, as well as responsive to previously reconstructed and loop-filtered sample values.

The output of the loop filter unit (556) can be a sample stream that can be output to the render device (512) as well as stored in the reference picture memory (557) for use in future inter-picture prediction.

Certain coded pictures, once fully reconstructed, can be used as reference pictures for future prediction. For example, once a coded picture corresponding to a current picture is fully reconstructed and the coded picture has been identified as a reference picture (by, for example, the parser (520)), the current picture buffer (558) can become a part of the reference picture memory (557), and a fresh current picture buffer can be reallocated before commencing the reconstruction of the following coded picture.

The video decoder (510) may perform decoding operations according to a predetermined video compression technology in a standard, such as ITU-T Rec. H.265. The coded video sequence may conform to a syntax specified by the video compression technology or standard being used, in the sense that the coded video sequence adheres to both the syntax of the video compression technology or standard and the profiles as documented in the video compression technology or standard. Specifically, a profile can select certain tools as the only tools available for use under that profile from all the tools available in the video compression technology or standard. Also necessary for compliance can be that the complexity of the coded video sequence is within bounds as defined by the level of the video compression technology or standard. In some cases, levels restrict the maximum picture size, maximum frame rate, maximum reconstruction sample rate (measured in, for example megasamples per second), maximum reference picture size, and so on. Limits set by levels can, in some cases, be further restricted through Hypothetical Reference Decoder (HRD) specifications and metadata for HRD buffer management signaled in the coded video sequence.

In an embodiment, the receiver (531) may receive additional (redundant) data with the encoded video. The additional data may be included as part of the coded video sequence(s). The additional data may be used by the video decoder (510) to properly decode the data and/or to more accurately reconstruct the original video data. Additional data can be in the form of, for example, temporal, spatial, or signal noise ratio (SNR) enhancement layers, redundant slices, redundant pictures, forward error correction codes, and so on.

FIG. 6 shows a block diagram of a video encoder (603) according to an embodiment of the present disclosure. The video encoder (603) is included in an electronic device (620). The electronic device (620) includes a transmitter (640) (e.g., transmitting circuitry). The video encoder (603) can be used in the place of the video encoder (403) in the FIG. 4 example.

The video encoder (603) may receive video samples from a video source (601) (that is not part of the electronic device (620) in the FIG. 6 example) that may capture video image(s) to be coded by the video encoder (603). In another example, the video source (601) is a part of the electronic device (620).

The video source (601) may provide the source video sequence to be coded by the video encoder (603) in the form of a digital video sample stream that can be of any suitable bit depth (for example: 8 bit, 10 bit, 12 bit, . . . ), any colorspace (for example, BT.601 Y CrCB, RGB, . . . ), and any suitable sampling structure (for example Y CrCb 4:2:0, Y CrCb 4:4:4). In a media serving system, the video source (601) may be a storage device storing previously prepared video. In a videoconferencing system, the video source (601) may be a camera that captures local image information as a video sequence. Video data may be provided as a plurality of individual pictures that impart motion when viewed in sequence. The pictures themselves may be organized as a spatial array of pixels, wherein each pixel can comprise one or more samples depending on the sampling structure, color space, etc. in use. A person skilled in the art can readily understand the relationship between pixels and samples. The description below focuses on samples.

According to an embodiment, the video encoder (603) may code and compress the pictures of the source video sequence into a coded video sequence (643) in real time or under any other time constraints as required by the application. Enforcing appropriate coding speed is one function of a controller (650). In some embodiments, the controller (650) controls other functional units as described below and is functionally coupled to the other functional units. The coupling is not depicted for clarity. Parameters set by the controller (650) can include rate control related parameters (picture skip, quantizer, lambda value of rate-distortion optimization techniques, . . . ), picture size, group of pictures (GOP) layout, maximum motion vector search range, and so forth. The controller (650) can be configured to have other suitable functions that pertain to the video encoder (603) optimized for a certain system design.

In some embodiments, the video encoder (603) is configured to operate in a coding loop. As an oversimplified description, in an example, the coding loop can include a source coder (630) (e.g., responsible for creating symbols, such as a symbol stream, based on an input picture to be coded, and a reference picture(s)), and a (local) decoder (633) embedded in the video encoder (603). The decoder (633) reconstructs the symbols to create the sample data in a similar manner as a (remote) decoder also would create (as any compression between symbols and coded video bitstream is lossless in the video compression technologies considered in the disclosed subject matter). The reconstructed sample stream (sample data) is input to the reference picture memory (634). As the decoding of a symbol stream leads to bit-exact results independent of decoder location (local or remote), the content in the reference picture memory (634) is also bit exact between the local encoder and remote encoder. In other words, the prediction part of an encoder “sees” as reference picture samples exactly the same sample values as a decoder would “see” when using prediction during decoding. This fundamental principle of reference picture synchronicity (and resulting drift, if synchronicity cannot be maintained, for example because of channel errors) is used in some related arts as well.

The operation of the “local” decoder (633) can be the same as of a “remote” decoder, such as the video decoder (510), which has already been described in detail above in conjunction with FIG. 5. Briefly referring also to FIG. 5, however, as symbols are available and encoding/decoding of symbols to a coded video sequence by an entropy coder (645) and the parser (520) can be lossless, the entropy decoding parts of the video decoder (510), including the buffer memory (515), and parser (520) may not be fully implemented in the local decoder (633).

In an embodiment, a decoder technology except the parsing/entropy decoding that is present in a decoder is present, in an identical or a substantially identical functional form, in a corresponding encoder. Accordingly, the disclosed subject matter focuses on decoder operation. The description of encoder technologies can be abbreviated as they are the inverse of the comprehensively described decoder technologies. In certain areas a more detail description is provided below.

During operation, in some examples, the source coder (630) may perform motion compensated predictive coding, which codes an input picture predictively with reference to one or more previously coded picture from the video sequence that were designated as “reference pictures.” In this manner, the coding engine (632) codes differences between pixel blocks of an input picture and pixel blocks of reference picture(s) that may be selected as prediction reference(s) to the input picture.

The local video decoder (633) may decode coded video data of pictures that may be designated as reference pictures, based on symbols created by the source coder (630). Operations of the coding engine (632) may advantageously be lossy processes. When the coded video data may be decoded at a video decoder (not shown in FIG. 6), the reconstructed video sequence typically may be a replica of the source video sequence with some errors. The local video decoder (633) replicates decoding processes that may be performed by the video decoder on reference pictures and may cause reconstructed reference pictures to be stored in the reference picture cache (634). In this manner, the video encoder (603) may store copies of reconstructed reference pictures locally that have common content as the reconstructed reference pictures that will be obtained by a far-end video decoder (absent transmission errors).

The predictor (635) may perform prediction searches for the coding engine (632). That is, for a new picture to be coded, the predictor (635) may search the reference picture memory (634) for sample data (as candidate reference pixel blocks) or certain metadata such as reference picture motion vectors, block shapes, and so on, that may serve as an appropriate prediction reference for the new pictures. The predictor (635) may operate on a sample block-by-pixel block basis to find appropriate prediction references. In some cases, as determined by search results obtained by the predictor (635), an input picture may have prediction references drawn from multiple reference pictures stored in the reference picture memory (634).

The controller (650) may manage coding operations of the source coder (630), including, for example, setting of parameters and subgroup parameters used for encoding the video data.

Output of all aforementioned functional units may be subjected to entropy coding in the entropy coder (645). The entropy coder (645) translates the symbols as generated by the various functional units into a coded video sequence, by lossless compressing the symbols according to technologies such as Huffman coding, variable length coding, arithmetic coding, and so forth.

The transmitter (640) may buffer the coded video sequence(s) as created by the entropy coder (645) to prepare for transmission via a communication channel (660), which may be a hardware/software link to a storage device which would store the encoded video data. The transmitter (640) may merge coded video data from the video coder (603) with other data to be transmitted, for example, coded audio data and/or ancillary data streams (sources not shown).

The controller (650) may manage operation of the video encoder (603). During coding, the controller (650) may assign to each coded picture a certain coded picture type, which may affect the coding techniques that may be applied to the respective picture. For example, pictures often may be assigned as one of the following picture types:

An Intra Picture (I picture) may be one that may be coded and decoded without using any other picture in the sequence as a source of prediction. Some video codecs allow for different types of intra pictures, including, for example Independent Decoder Refresh (“IDR”) Pictures. A person skilled in the art is aware of those variants of I pictures and their respective applications and features.

A predictive picture (P picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most one motion vector and reference index to predict the sample values of each block.

A bi-directionally predictive picture (B Picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most two motion vectors and reference indices to predict the sample values of each block. Similarly, multiple-predictive pictures can use more than two reference pictures and associated metadata for the reconstruction of a single block.

Source pictures commonly may be subdivided spatially into a plurality of sample blocks (for example, blocks of 4×4, 8×8, 4×8, or 16×16 samples each) and coded on a block-by-block basis. Blocks may be coded predictively with reference to other (already coded) blocks as determined by the coding assignment applied to the blocks' respective pictures. For example, blocks of I pictures may be coded non-predictively or they may be coded predictively with reference to already coded blocks of the same picture (spatial prediction or intra prediction). Pixel blocks of P pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one previously coded reference picture. Blocks of B pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one or two previously coded reference pictures.

The video encoder (603) may perform coding operations according to a predetermined video coding technology or standard, such as ITU-T Rec. H.265. In its operation, the video encoder (603) may perform various compression operations, including predictive coding operations that exploit temporal and spatial redundancies in the input video sequence. The coded video data, therefore, may conform to a syntax specified by the video coding technology or standard being used.

In an embodiment, the transmitter (640) may transmit additional data with the encoded video. The source coder (630) may include such data as part of the coded video sequence. Additional data may comprise temporal/spatial/SNR enhancement layers, other forms of redundant data such as redundant pictures and slices, SEI messages, VUI parameter set fragments, and so on.

A video may be captured as a plurality of source pictures (video pictures) in a temporal sequence. Intra-picture prediction (often abbreviated to intra prediction) makes use of spatial correlation in a given picture, and inter-picture prediction makes uses of the (temporal or other) correlation between the pictures. In an example, a specific picture under encoding/decoding, which is referred to as a current picture, is partitioned into blocks. When a block in the current picture is similar to a reference block in a previously coded and still buffered reference picture in the video, the block in the current picture can be coded by a vector that is referred to as a motion vector. The motion vector points to the reference block in the reference picture, and can have a third dimension identifying the reference picture, in case multiple reference pictures are in use.

In some embodiments, a bi-prediction technique can be used in the inter-picture prediction. According to the bi-prediction technique, two reference pictures, such as a first reference picture and a second reference picture that are both prior in decoding order to the current picture in the video (but may be in the past and future, respectively, in display order) are used. A block in the current picture can be coded by a first motion vector that points to a first reference block in the first reference picture, and a second motion vector that points to a second reference block in the second reference picture. The block can be predicted by a combination of the first reference block and the second reference block.

Further, a merge mode technique can be used in the inter-picture prediction to improve coding efficiency.

According to some embodiments of the disclosure, predictions, such as inter-picture predictions and intra-picture predictions are performed in the unit of blocks. For example, according to the HEVC standard, a picture in a sequence of video pictures is partitioned into coding tree units (CTU) for compression, the CTUs in a picture have the same size, such as 64×64 pixels, 32×32 pixels, or 16×16 pixels. In general, a CTU includes three coding tree blocks (CTBs), which are one luma CTB and two chroma CTBs. Each CTU can be recursively quadtree split into one or multiple coding units (CUs). For example, a CTU of 64×64 pixels can be split into one CU of 64×64 pixels, or 4 CUs of 32×32 pixels, or 16 CUs of 16×16 pixels. In an example, each CU is analyzed to determine a prediction type for the CU, such as an inter prediction type or an intra prediction type. The CU is split into one or more prediction units (PUs) depending on the temporal and/or spatial predictability. Generally, each PU includes a luma prediction block (PB), and two chroma PBs. In an embodiment, a prediction operation in coding (encoding/decoding) is performed in the unit of a prediction block. Using a luma prediction block as an example of a prediction block, the prediction block includes a matrix of values (e.g., luma values) for pixels, such as 8×8 pixels, 16×16 pixels, 8×16 pixels, 16×8 pixels, and the like.

FIG. 7 shows a diagram of a video encoder (703) according to another embodiment of the disclosure. The video encoder (703) is configured to receive a processing block (e.g., a prediction block) of sample values within a current video picture in a sequence of video pictures, and encode the processing block into a coded picture that is part of a coded video sequence. In an example, the video encoder (703) is used in the place of the video encoder (403) in the FIG. 4 example.

In an HEVC example, the video encoder (703) receives a matrix of sample values for a processing block, such as a prediction block of 8×8 samples, and the like. The video encoder (703) determines whether the processing block is best coded using intra mode, inter mode, or bi-prediction mode using, for example, rate-distortion optimization. When the processing block is to be coded in intra mode, the video encoder (703) may use an intra prediction technique to encode the processing block into the coded picture; and when the processing block is to be coded in inter mode or bi-prediction mode, the video encoder (703) may use an inter prediction or bi-prediction technique, respectively, to encode the processing block into the coded picture. In certain video coding technologies, merge mode can be an inter picture prediction submode where the motion vector is derived from one or more motion vector predictors without the benefit of a coded motion vector component outside the predictors. In certain other video coding technologies, a motion vector component applicable to the subject block may be present. In an example, the video encoder (703) includes other components, such as a mode decision module (not shown) to determine the mode of the processing blocks.

In the FIG. 7 example, the video encoder (703) includes the inter encoder (730), an intra encoder (722), a residue calculator (723), a switch (726), a residue encoder (724), a general controller (721), and an entropy encoder (725) coupled together as shown in FIG. 7.

The inter encoder (730) is configured to receive the samples of the current block (e.g., a processing block), compare the block to one or more reference blocks in reference pictures (e.g., blocks in previous pictures and later pictures), generate inter prediction information (e.g., description of redundant information according to inter encoding technique, motion vectors, merge mode information), and calculate inter prediction results (e.g., predicted block) based on the inter prediction information using any suitable technique. In some examples, the reference pictures are decoded reference pictures that are decoded based on the encoded video information.

The intra encoder (722) is configured to receive the samples of the current block (e.g., a processing block), in some cases compare the block to blocks already coded in the same picture, generate quantized coefficients after transform, and in some cases also intra prediction information (e.g., an intra prediction direction information according to one or more intra encoding techniques). In an example, the intra encoder (722) also calculates intra prediction results (e.g., predicted block) based on the intra prediction information and reference blocks in the same picture.

The general controller (721) is configured to determine general control data and control other components of the video encoder (703) based on the general control data. In an example, the general controller (721) determines the mode of the block, and provides a control signal to the switch (726) based on the mode. For example, when the mode is the intra mode, the general controller (721) controls the switch (726) to select the intra mode result for use by the residue calculator (723), and controls the entropy encoder (725) to select the intra prediction information and include the intra prediction information in the bitstream; and when the mode is the inter mode, the general controller (721) controls the switch (726) to select the inter prediction result for use by the residue calculator (723), and controls the entropy encoder (725) to select the inter prediction information and include the inter prediction information in the bitstream.

The residue calculator (723) is configured to calculate a difference (residue data) between the received block and prediction results selected from the intra encoder (722) or the inter encoder (730). The residue encoder (724) is configured to operate based on the residue data to encode the residue data to generate the transform coefficients. In an example, the residue encoder (724) is configured to convert the residue data from a spatial domain to a frequency domain, and generate the transform coefficients. The transform coefficients are then subject to quantization processing to obtain quantized transform coefficients. In various embodiments, the video encoder (703) also includes a residue decoder (728). The residue decoder (728) is configured to perform inverse-transform, and generate the decoded residue data. The decoded residue data can be suitably used by the intra encoder (722) and the inter encoder (730). For example, the inter encoder (730) can generate decoded blocks based on the decoded residue data and inter prediction information, and the intra encoder (722) can generate decoded blocks based on the decoded residue data and the intra prediction information. The decoded blocks are suitably processed to generate decoded pictures and the decoded pictures can be buffered in a memory circuit (not shown) and used as reference pictures in some examples.

The entropy encoder (725) is configured to format the bitstream to include the encoded block. The entropy encoder (725) is configured to include various information according to a suitable standard, such as the HEVC standard. In an example, the entropy encoder (725) is configured to include the general control data, the selected prediction information (e.g., intra prediction information or inter prediction information), the residue information, and other suitable information in the bitstream. Note that, according to the disclosed subject matter, when coding a block in the merge submode of either inter mode or bi-prediction mode, there is no residue information.

FIG. 8 shows a diagram of a video decoder (810) according to another embodiment of the disclosure. The video decoder (810) is configured to receive coded pictures that are part of a coded video sequence, and decode the coded pictures to generate reconstructed pictures. In an example, the video decoder (810) is used in the place of the video decoder (410) in the FIG. 4 example.

In the FIG. 8 example, the video decoder (810) includes an entropy decoder (871), an inter decoder (880), a residue decoder (873), a reconstruction module (874), and an intra decoder (872) coupled together as shown in FIG. 8.

The entropy decoder (871) can be configured to reconstruct, from the coded picture, certain symbols that represent the syntax elements of which the coded picture is made up. Such symbols can include, for example, the mode in which a block is coded (such as, for example, intra mode, inter mode, bi-predicted mode, the latter two in merge submode or another submode), prediction information (such as, for example, intra prediction information or inter prediction information) that can identify certain sample or metadata that is used for prediction by the intra decoder (872) or the inter decoder (880), respectively, residual information in the form of, for example, quantized transform coefficients, and the like. In an example, when the prediction mode is inter or bi-predicted mode, the inter prediction information is provided to the inter decoder (880); and when the prediction type is the intra prediction type, the intra prediction information is provided to the intra decoder (872). The residual information can be subject to inverse quantization and is provided to the residue decoder (873).

The inter decoder (880) is configured to receive the inter prediction information, and generate inter prediction results based on the inter prediction information.

The intra decoder (872) is configured to receive the intra prediction information, and generate prediction results based on the intra prediction information.

The residue decoder (873) is configured to perform inverse quantization to extract de-quantized transform coefficients, and process the de-quantized transform coefficients to convert the residual from the frequency domain to the spatial domain. The residue decoder (873) may also require certain control information (to include the Quantizer Parameter (QP)), and that information may be provided by the entropy decoder (871) (data path not depicted as this may be low volume control information only).

The reconstruction module (874) is configured to combine, in the spatial domain, the residual as output by the residue decoder (873) and the prediction results (as output by the inter or intra prediction modules as the case may be) to form a reconstructed block, that may be part of the reconstructed picture, which in turn may be part of the reconstructed video. It is noted that other suitable operations, such as a deblocking operation and the like, can be performed to improve the visual quality.

It is noted that the video encoders (403), (603), and (703), and the video decoders (410), (510), and (810) can be implemented using any suitable technique. In an embodiment, the video encoders (403), (603), and (703), and the video decoders (410), (510), and (810) can be implemented using one or more integrated circuits. In another embodiment, the video encoders (403), (603), and (603), and the video decoders (410), (510), and (810) can be implemented using one or more processors that execute software instructions.

This disclosure describes video coding technologies related to neural image compression technologies and/or neural video compression technologies, such as artificial intelligence (AI) based neural image compression (NIC). Aspects of the disclosure include content-adaptive online training in NIC, such as block-wise content-adaptive online training NIC methods with post filtering for an end-to-end (E2E) optimized image coding framework based on neural networks. A neural network (NN) can include an artificial neural network (ANN), such as a deep neural network (DNN), a convolution neural network (CNN), or the like.

In an embodiment, a related hybrid video codec is difficult to be optimized as a whole. For example, an improvement of a single module (e.g., an encoder) in the hybrid video codec may not result in a coding gain in the overall performance. In a NN-based video coding framework, different modules can be jointly optimized from an input to an output to improve a final objective (e.g., rate-distortion performance, such as a rate-distortion loss L described in the disclosure) by performing a learning process or a training process (e.g., a machine learning process), and thus resulting in an E2E optimized NIC.

An exemplary NIC framework or system can be described as follows. The NIC framework can use an input block x as an input to a neural network encoder (e.g., an encoder based on neural networks such as DNNs) to compute a compressed representation (e.g., a compact representation) {circumflex over (x)} that can be compact, for example, for storage and transmission purposes. A neural network decoder (e.g., a decoder based on neural networks such as DNNs) can use the compressed representation {circumflex over (x)} as an input to reconstruct an output block (also referred to as a reconstructed block) x. In various embodiments, the input block x and reconstructed block x are in a spatial domain and the compressed representation {circumflex over (x)} is in a domain different from the spatial domain. In some examples, the compressed representation {circumflex over (x)} is quantized and entropy coded.

In some examples, a NIC framework can use a variational autoencoder (VAE) structure. In the VAE structure, the neural network encoder can directly use the entire input block x as the input to the neural network encoder. The entire input block x can pass through a set of neural network layers that work as a black box to compute the compressed representation {circumflex over (x)}. The compressed representation {circumflex over (x)} is an output of the neural network encoder. The neural network decoder can take the entire compressed representation x as an input. The compressed representation x can pass through another set of neural network layers that work as another black box to compute the reconstructed block x. A rate-distortion (R-D) loss L (x, x, {circumflex over (x)}) can be optimized to achieve a trade-off between a distortion loss D (x, x) of the reconstructed block x and bit consumption R of the compact representation {circumflex over (x)} with a trade-off hyperparameter λ.

L(x, x, {circumflex over (x)})=λD(x, x)+R({circumflex over (x)}) Eq. 1

A neural network (e.g., an ANN) can learn to perform tasks from examples, without task-specific programming. An ANN can be configured with connected nodes or artificial neurons. A connection between nodes can transmit a signal from a first node to a second node (e.g., a receiving node), and the signal can be modified by a weight which can be indicated by a weight coefficient for the connection. The receiving node can process signal(s) (i.e., input signal(s) for the receiving node) from node(s) that transmit the signal(s) to the receiving node and then generate an output signal by applying a function to the input signals. The function can be a linear function. In an example, the output signal is a weighted summation of the input signal(s). In an example, the output signal is further modified by a bias which can be indicated by a bias term, and thus the output signal is a sum of the bias and the weighted summation of the input signal(s). The function can include a nonlinear operation, for example, on the weighted sum or the sum of the bias and the weighted summation of the input signal(s). The output signal can be sent to node(s) (downstream node(s)) connected to the receiving node). The ANN can be represented or configured by parameters (e.g., weights of the connections and/or biases). The weights and/or the biases can be obtained by training the ANN with examples where the weights and/or the biases can be iteratively adjusted. The trained ANN configured with the determined weights and/or the determined biases can be used to perform tasks.

Nodes in an ANN can be organized in any suitable architecture. In various embodiments, nodes in an ANN are organized in layers including an input layer that receives input signal(s) to the ANN and an output layer that outputs output signal(s) from the ANN. In an embodiment, the ANN further includes layer(s) such as hidden layer(s) between the input layer and the output layer. Different layers may perform different kinds of transformations on respective inputs of the different layers. Signals can travel from the input layer to the output layer.

An ANN with multiple layers between an input layer and an output layer can be referred to as a DNN. In an embodiment, a DNN is a feedforward network where data flows from the input layer to the output layer without looping back. In an example, a DNN is a fully connected network where each node in one layer is connected to all nodes in the next layer. In an embodiment, a DNN is a recurrent neural network (RNN) where data can flow in any direction. In an embodiment, a DNN is a CNN.

A CNN can include an input layer, an output layer, and hidden layer(s) between the input layer and the output layer. The hidden layer(s) can include convolutional layer(s) (e.g., used in an encoder) that perform convolutions, such as a two-dimensional (2D) convolution. In an embodiment, a 2D convolution performed in a convolution layer is between a convolution kernel (also referred to as a filter or a channel, such as a 5×5 matrix) and an input signal (e.g., a 2D matrix such as a 2D block, a 256×256 matrix) to the convolution layer. In various examples, a dimension of the convolution kernel (e.g., 5×5) is smaller than a dimension of the input signal (e.g., 256×256). Thus, a portion (e.g., a 5×5 area) in the input signal (e.g., a 256×256 matrix) that is covered by the convolution kernel is smaller than an area (e.g., a 256×256 area) of the input signal, and thus can be referred to as a receptive field in the respective node in the next layer.

During the convolution, a dot product of the convolution kernel and the corresponding receptive field in the input signal is calculated. Thus, each element of the convolution kernel is a weight that is applied to a corresponding sample in the receptive field, and thus the convolution kernel includes weights. For example, a convolution kernel represented by a 5×5 matrix has 25 weights. In some examples, a bias is applied to the output signal of the convolution layer, and the output signal is based on a sum of the dot product and the bias.

The convolution kernel can shift along the input signal (e.g., a 2D matrix) by a size referred to as a stride, and thus the convolution operation generates a feature map or an activation map (e.g., another 2D matrix), which in turn contributes to an input of the next layer in the CNN. For example, the input signal is a 2D block having 256×256 samples, a stride is 2 samples (e.g., a stride of 2). For the stride of 2, the convolution kernel shifts along an X direction (e.g., a horizontal direction) and/or a Y direction (e.g., a vertical direction) by 2 samples.

Multiple convolution kernels can be applied in the same convolution layer to the input signal to generate multiple feature maps, respectively, where each feature map can represent a specific feature of the input signal. In general, a convolution layer with N channels (i.e., N convolution kernels), each convolution kernel having M×M samples, and a stride S can be specified as Conv: M×M cN sS. For example, a convolution layer with 192 channels, each convolution kernel having 5×5 samples, and a stride of 2 is specified as Cony: 5×5 c192 s2. The hidden layer(s) can include deconvolutional layer(s) (e.g., used in a decoder) that perform deconvolutions, such as a 2D deconvolution. A deconvolution is an inverse of a convolution. A deconvolution layer with 192 channels, each deconvolution kernel having 5×5 samples, and a stride of 2 is specified as DeConv: 5×5 c192 s2.

In various embodiments, a CNN has the following benefits. A number of learnable parameters (i.e., parameters to be trained) in a CNN can be significantly smaller than a number of learnable parameters in a DNN, such as a feedforward DNN. In the CNN, a relatively large number of nodes can share a same filter (e.g., same weights) and a same bias (if the bias is used), and thus the memory footprint can be reduced because a single bias and a single vector of weights can be used across all receptive fields that share the same filter. For example, for an input signal having 100×100 samples, a convolution layer with a convolution kernel having 5×5 samples has 25 learnable parameters (e.g., weights). If a bias is used, then one channel uses 26 learnable parameters (e.g., 25 weights and one bias). If the convolution layer has N channels, the total learnable parameters is 26× N. On the other hand, for a fully connected a layer in a DNN, 100×100 (i.e., 10000) weights are used for each node in the next layer. If the next layer has L nodes, then the total learnable parameters is 10000× L.

A CNN can further include one or more other layer(s), such as pooling layer(s), fully connected layer(s) that can connect every node in one layer to every node in another layer, normalization layer(s), and/or the like. Layers in a CNN can be arranged in any suitable order and in any suitable architecture (e.g., a feed-forward architecture, a recurrent architecture). In an example, a convolutional layer is followed by other layer(s), such as pooling layer(s), fully connected layer(s), normalization layer(s), and/or the like.

A pooling layer can be used to reduce dimensions of data by combining outputs from a plurality of nodes at one layer into a single node in the next layer. A pooling operation for a pooling layer having a feature map as an input is described below. The description can be suitably adapted to other input signals. The feature map can be divided into sub-regions (e.g., rectangular sub-regions), and features in the respective sub-regions can be independently down-sampled (or pooled) to a single value, for example, by taking an average value in an average pooling or a maximum value in a max pooling.

The pooling layer can perform a pooling, such as a local pooling, a global pooling, a max pooling, an average pooling, and/or the like. A pooling is a form of nonlinear down-sampling. A local pooling combines a small number of nodes (e.g., a local cluster of nodes, such as 2×2 nodes) in the feature map. A global pooling can combine all nodes, for example, of the feature map.

The pooling layer can reduce a size of the representation, and thus reduce a number of parameters, a memory footprint, and an amount of computation in a CNN. In an example, a pooling layer is inserted between successive convolutional layers in a CNN. In an example, a pooling layer is followed by an activation function, such as a rectified linear unit (ReLU) layer. In an example, a pooling layer is omitted between successive convolutional layers in a CNN.

A normalization layer can be an ReLU, a leaky ReLU, a generalized divisive normalization (GDN), an inverse GDN (IGDN), or the like. An ReLU can apply a non-saturating activation function to remove negative values from an input signal, such as a feature map, by setting the negative values to zero. A leaky ReLU can have a small slope (e.g., 0.01) for negative values instead of a flat slope (e.g., 0). Accordingly, if a value x is larger than 0, then an output from the leaky ReLU is x. Otherwise, the output from the leaky ReLU is the value x multiplied by the small slope (e.g., 0.01). In an example, the slope is determined before training, and thus is not learnt during training.

In NN-based image compression methods, such as DNN-based or CNN-based image compression methods, instead of directly encoding an entire image, the block-based or block-wise coding mechanism can be effective for compressing images in a DNN-based video coding standards such as FVC. An entire image can be partitioned into blocks of the same (or various) sizes, and the blocks can be compressed individually. In an embodiment, an image may be split into blocks with an equal size or non-equal sizes. The spilt blocks instead of the image can be compressed. FIG. 9A shows an example of a block-wise image coding according to an embodiment of the disclosure. An image (980) can be partitioned into blocks, e.g., blocks (981)-(996). The blocks (981)-(996) can be compressed, for example, according to a scanning order. IN an example shown in FIG. 9A, the blocks (981)-(989) are already compressed, and the blocks (990)-(996) are to be compressed.

An image can be treated as a block. In an embodiment, the image is compressed without being split into blocks. The entire image can be the input of an E2E NIC framework.

FIG. 9B shows an exemplary NIC framework (900) (e.g., a NIC system) according to an embodiment of the disclosure. The NIC framework (900) can be based on neural networks, such as DNNs and/or CNNs. The NIC framework (900) can be used to compress (e.g., encode) blocks and decompress (e.g., decode or reconstruct) compressed blocks (e.g., encoded blocks). The NIC framework (900) can include two sub-neural networks, a first sub-NN (951) and a second sub-NN (952) that are implemented using neural networks.

The first sub-NN (951) can resemble an autoencoder and can be trained to generate a compressed block 2 of an input block x and decompress the compressed block 2 to obtain a reconstructed block 2. The first sub-NN (951) can include a plurality of components (or modules), such as a main encoder neural network (or a main encoder network) (911), a quantizer (912), an entropy encoder (913), an entropy decoder (914), and a main decoder neural network (or a main encoder network) (915). Referring to FIG. 9, the main encoder network (911) can generate a latent or a latent representation y from the input block x (e.g., an block to be compressed or encoded). In an example, the main encoder network (911) is implemented using a CNN. A relationship between the latent representation y and the input block x can be described using Eq. 2.

y=f ₁(x; θ₁)   Eq.

where a parameter θ₁ represents parameters, such as weights used in convolution kernels in the main encoder network (911) and biases (if biases are used in the main encoder network (911)). The latent representation y can be quantized using the quantizer (912) to generate a quantized latent ŷ. The quantized latent ŷ can be compressed, for example, using lossless compression by the entropy encoder (913) to generate the compressed block (e.g., an encoded block) {circumflex over (x)} (931) that is a compressed representation {circumflex over (x)} of the input block x. The entropy encoder (913) can use entropy coding techniques such as Huffman coding, arithmetic coding, or the like. In an example, the entropy encoder (913) uses arithmetic encoding and is an arithmetic encoder. In an example, the encoded block (931) is transmitted in a coded bitstream.

The encoded block (931) can be decompressed (e.g., entropy decoded) by the entropy decoder (914) to generate an output. The entropy decoder (914) can use entropy coding techniques such as Huffman coding, arithmetic coding, or the like that correspond to the entropy encoding techniques used in the entropy encoder (913). In an example, the entropy decoder (914) uses arithmetic decoding and is an arithmetic decoder. In an example, lossless compression is used in the entropy encoder (913), lossless decompression is used in the entropy decoder (914), and noises, such as due to the transmission of the encoded block (931) are omissible, the output from the entropy decoder (914) is the quantized latent ŷ.

The main decoder network (915) can decode the quantized latent ŷ to generate the reconstructed block x. In an example, the main decoder network (915) is implemented using a CNN. A relationship between the reconstructed block x (i.e., the output of the main decoder network (915)) and the quantized latent ŷ (i.e., the input of the main decoder network (915)) can be described using Eq. 3.

x=f ₂(ŷ; θ₂)   Eq. 2

where a parameter θ₂ represents parameters, such as weights used in convolution kernels in the main decoder network (915) and biases (if biases are used in the main decoder network (915)). Thus, the first sub-NN (951) can compress (e.g., encode) the input block x to obtain the encoded block (931) and decompress (e.g., decode) the encoded block (931) to obtain the reconstructed block {tilde over (x)}. The reconstructed block {tilde over (x)} can be different from the input block x due to quantization loss introduced by the quantizer (912).

The second sub-NN (952) can learn the entropy model (e.g., a prior probabilistic model) over the quantized latent ŷ used for entropy coding. Thus, the entropy model can be a conditioned entropy model, e.g., a Gaussian mixture model (GMM), a Gaussian scale model (GSM) that is dependent on the input block x. The second sub-NN (952) can include a context model NN (916), an entropy parameter NN (917), a hyper encoder (921), a quantizer (922), an entropy encoder (923), an entropy decoder (924), and a hyper decoder (925). The entropy model used in the context model NN (916) can be an autoregressive model over latent (e.g., the quantized latent ŷ). In an example, the hyper encoder (921), the quantizer (922), the entropy encoder (923), the entropy decoder (924), and the hyper decoder (925) form a hyper neural network (e.g., a hyperprior NN). The hyper neural network can represent information useful for correcting context-based predictions. Data from the context model NN (916) and the hyper neural network can be combined by the entropy parameter NN (917). The entropy parameter NN (917) can generate parameters, such as mean and scale parameters for the entropy model such as a conditional Gaussian entropy model (e.g., the GMM).

Referring to FIG. 9B, at an encoder side, the quantized latent ŷ from the quantizer (912) is fed into the context model NN (916). At a decoder side, the quantized latent ŷ from the entropy decoder (914) is fed into the context model NN (916). The context model NN (916) can be implemented using a neural network, such as a CNN. The context model NN (916) can generate an output o_cm,i based on a context ŷ_<i that is the quantized latent ŷ available to the context model NN (916). The context ŷ_<i can include previously quantized latent at the encoder side or previously entropy decoded quantized latent at the decoder side. A relationship between the output o_cmi, and the input (e.g., ŷ_<i) of the context model NN (916) can be described using Eq. 4.

o _cm,i =f ₃(ŷ_<i; θ₃)   Eq. 4

where a parameter θ₃ represents parameters, such as weights used in convolution kernels in the context model NN (916) and biases (if biases are used in the context model NN (916)).

The output o_cm,i from the context model NN (916) and an output o_hc from the hyper decoder (925) are fed into the entropy parameter NN (917) to generate an output o_ep. The entropy parameter NN (917) can be implemented using a neural network, such as a CNN. A relationship between the output o_ep and the inputs (e.g., o_cm,i and o_hc) of the entropy parameter NN (917) can be described using Eq. 5.

o _ep =f ₄(o_cm,i, o_hc; θ₄)   Eq. 5

where a parameter θ₄ represents parameters, such as weights used in convolution kernels in the entropy parameter NN (917) and biases (if biases are used in the entropy parameter NN (917)). The output o_ep of the entropy parameter NN (917) can be used in determining (e.g., conditioning) the entropy model, and thus the conditioned entropy model can be dependent on the input block x, for example, via the output o_hc from the hyper decoder (925). In an example, the output o_ep includes parameters, such as the mean and scale parameters, used to condition the entropy model (e.g., GMM). Referring to FIG. 9B, the entropy model (e.g., the conditioned entropy model) can be employed by the entropy encoder (913) and the entropy decoder (914) in entropy coding and entropy decoding, respectively.

The second sub-NN (952) can be described below. The latent y can be fed into the hyper encoder (921) to generate a hyper latent z. In an example, the hyper encoder (921) is implemented using a neural network, such as a CNN. A relationship between the hyper latent z and the latent y can be described using Eq. 6.

z=f ₅(y; θ₅)   Eq. 6

where a parameter θ₅ represents parameters, such as weights used in convolution kernels in the hyper encoder (921) and biases (if biases are used in the hyper encoder (921)).

The hyper latent z is quantized by the quantizer (922) to generate a quantized latent {circumflex over (z)}. The quantized latent {circumflex over (z)} can be compressed, for example, using lossless compression by the entropy encoder (923) to generate side information, such as encoded bits (932) from the hyper neural network. The entropy encoder (923) can use entropy coding techniques such as Huffman coding, arithmetic coding, or the like. In an example, the entropy encoder (923) uses arithmetic encoding and is an arithmetic encoder. In an example, the side information, such as the encoded bits (932), can be transmitted in the coded bitstream, for example, together with the encoded block (931).

The side information, such as the encoded bits (932), can be decompressed (e.g., entropy decoded) by the entropy decoder (924) to generate an output. The entropy decoder (924) can use entropy coding techniques such as Huffman coding, arithmetic coding, or the like. In an example, the entropy decoder (924) uses arithmetic decoding and is an arithmetic decoder. In an example, lossless compression is used in the entropy encoder (923), lossless decompression is used in the entropy decoder (924), and noises, such as due to the transmission of the side information are omissible, the output from the entropy decoder (924) can be the quantized latent {circumflex over (z)}. The hyper decoder (925) can decode the quantized latent {circumflex over (z)} to generate the output o_hc. A relationship between the output o_hc and the quantized latent {circumflex over (z)} can be described using Eq. 7.

o _hc =f ₆({circumflex over (z)}; θ₆)   Eq. 7

where a parameter θ₆ represents parameters, such as weights used in convolution kernels in the hyper decoder (925) and biases (if biases are used in the hyper decoder (925)).

As described above, the compressed or encoded bits (932) can be added to the coded bitstream as the side information, which enables the entropy decoder (914) to use the conditional entropy model. Thus, the entropy model can be block-dependent and spatially adaptive, and thus can be more accurate than a fixed entropy model.

The NIC framework (900) can be suitably adapted, for example, to omit one or more components shown in FIG. 9, to modify one or more components shown in FIG. 9, and/or to include one or more components not shown in FIG. 9. In an example, a NIC framework using a fixed entropy model includes the first sub-NN (951), and does not include the second sub-NN (952). In an example, a NIC framework includes the components in the NIC framework (900) except the entropy encoder (923) and the entropy decoder (924).

In an embodiment, one or more components in the NIC framework (900) shown in FIG. 9 are implemented using neural network(s), such as CNN(s). Each NN-based component (e.g., the main encoder network (911), the main decoder network (915), the context model NN (916), the entropy parameter NN (917), the hyper encoder (921), or the hyper decoder (925)) in a NIC framework (e.g., the NIC framework (900)) can include any suitable architecture (e.g., have any suitable combinations of layers), include any suitable types of parameters (e.g., weights, biases, a combination of weights and biases, and/or the like), and include any suitable number of parameters.

In an embodiment, the main encoder network (911), the main decoder network (915), the context model NN (916), the entropy parameter NN (917), the hyper encoder (921), and the hyper decoder (925) are implemented using respective CNNs.

FIG. 10 shows an exemplary CNN of the main encoder network (911) according to an embodiment of the disclosure. For example, the main encoder network (911) includes four sets of layers where each set of layers includes a convolution layer 5×5 c192 s2 followed by a GDN layer. One or more layers shown in FIG. 10 can be modified and/or omitted. Additional layer(s) can be added to the main encoder network (911).

FIG. 11 shows an exemplary CNN of the main decoder network (915) according to an embodiment of the disclosure. For example, the main decoder network (915) includes three sets of layers where each set of layers includes a deconvolution layer 5×5 c192 s2 followed by an IGDN layer. In addition, the three sets of layers are followed by a deconvolution layer 5×5 c3 s2 followed by an IGDN layer. One or more layers shown in FIG. 11 can be modified and/or omitted. Additional layer(s) can be added to the main decoder network (915).

FIG. 12 shows an exemplary CNN of the hyper encoder (921) according to an embodiment of the disclosure. For example, the hyper encoder (921) includes a convolution layer 3×3 c192 s1 followed by a leaky ReLU, a convolution layer 5×5 c192 s2 followed by a leaky ReLU, and a convolution layer 5×5 c192 s2. One or more layers shown in FIG. 12 can be modified and /or omitted. Additional layer(s) can be added to the hyper encoder (921).

FIG. 13 shows an exemplary CNN of the hyper decoder (925) according to an embodiment of the disclosure. For example, the hyper decoder (925) includes a deconvolution layer 5×5 c192 s2 followed by a leaky ReLU, a deconvolution layer 5×5 c288 s2 followed by a leaky ReLU, and a deconvolution layer 3×3 c384 s1. One or more layers shown in FIG. 13 can be modified and/or omitted. Additional layer(s) can be added to the hyper encoder (925).

FIG. 14 shows an exemplary CNN of the context model NN (916) according to an embodiment of the disclosure. For example, the context model NN (916) includes a masked convolution 5×5 c384 s1 for context prediction, and thus the context ŷ_<i in Eq. 4 includes a limited context (e.g., a 5×5 convolution kernel). The convolution layer in FIG. 14 can be modified. Additional layer(s) can be added to the context model NN (916).

FIG. 15 shows an exemplary CNN of the entropy parameter NN (917) according to an embodiment of the disclosure. For example, the entropy parameter NN (917) includes a convolution layer 1×1 c640 s1 followed by a leaky ReLU, a convolution layer 1×1 c512 s1 followed by leaky ReLU, and a convolution layer 1×1 c384 s1. One or more layers shown in FIG. 15 can be modified and/or omitted. Additional layer(s) can be added to the entropy parameter NN (917).

The NIC framework (900) can be implemented using CNNs, as described with reference to FIGS. 10-15. The NIC framework (900) can be suitably adapted such that one or more components (e.g., (911), (915), (916), (917), (921), and/or (925)) in the NIC framework (900) are implemented using any suitable types of neural networks (e.g., CNNs or non-CNN based neural networks). One or more other components the NIC framework (900) can be implemented using neural network(s).

The NIC framework (900) that includes neural networks (e.g., CNNs) can be trained to learn the parameters used in the neural networks. For example, when CNNs are used, the parameters represented by θ₁-θ₆, such as the weights used in the convolution kernels in the main encoder network (911) and biases (if biases are used in the main encoder network (911)), the weights used in the convolution kernels in the main decoder network (915) and biases (if biases are used in the main decoder network (915)), the weights used in the convolution kernels in the hyper encoder (921) and biases (if biases are used in the hyper encoder (921)), the weights used in the convolution kernels in the hyper decoder (925) and biases (if biases are used in the hyper decoder (925)), the weights used in the convolution kernel(s) in the context model NN (916) and biases (if biases are used in the context model NN (916)), and the weights used in the convolution kernels in the entropy parameter NN (917) and biases (if biases are used in the entropy parameter NN (917)), respectively, can be learned in the training process.

In an example, referring to FIG. 10, the main encoder network (911) includes four convolution layers where each convolution layer has a convolution kernel of 5×5 and 192 channels. Thus, a number of the weights used in the convolution kernels in the main encoder network (911) is 19200 (i.e., 4×5×5×192). The parameters used in the main encoder network (911) include the 19200 weights and optional biases. Additional parameter(s) can be included when biases and/or additional NN(s) are used in the main encoder network (911).

Referring to FIG. 9B, the NIC framework (900) includes at least one component or module built on neural network(s). The at least one component can include one or more of the main encoder network (911), the main decoder network (915), the hyper encoder (921), the hyper decoder (925), the context model NN (916), and the entropy parameter NN (917). The at least one component can be trained individually. In an example, the training process is used to learn the parameters for each component separately. The at least one component can be trained jointly as a group. In an example, the training process is used to learn the parameters for a subset of the at least one component jointly. In an example, the training process is used to learn the parameters for all of the at least one component, and thus is referred to as an E2E optimization.

In the training process for one or more components in the NIC framework (900), the weights (or the weight coefficients) of the one or more components can be initialized. In an example, the weights are initialized based on pre-trained corresponding neural network model(s) (e.g., DNN models, CNN models). In an example, the weights are initialized by setting the weights to random numbers.

A set of training blocks can be employed to train the one or more components, for example, after the weights are initialized. The set of training blocks can include any suitable blocks having any suitable size(s). In some examples, the set of training blocks includes blocks from raw images, natural images, computer-generated images, and/or the like that are in the spatial domain. In some examples, the set of training blocks includes blocks from residue blocks or residue images having residue data in the spatial domain. The residue data can be calculated by a residue calculator (e.g., the residue calculator (723)). In some examples, raw images and/or residue images including residue data can be used directly to train neural networks in a NIC framework. Thus, raw images, residue images, blocks from raw images, and/or blocks from residue images can be used to train neural networks in a NIC framework.

For purposes of brevity, the training process below is described using a training block as an example. The description can be suitably adapted to a training image. A training block t of the set of training blocks can be passed through the encoding process in FIG. 9B to generate a compressed representation (e.g., encoded information, for example, to a bitstream). The encoded information can be passed through the decoding process described in FIG. 9B to compute and reconstruct a reconstructed block t.

For the NIC framework (900), two competing targets, e.g., a reconstruction quality and a bit consumption are balanced. A quality loss function (e.g., a distortion or distortion loss) D (t, t) can be used to indicate the reconstruction quality, such as a difference between the reconstruction (e.g., the reconstructed block t) and an original block (e.g., the training block t). A rate (or a rate loss) R can be used to indicate the bit consumption of the compressed representation. In an example, the rate loss R further includes the side information, for example, used in determining a context model.

For neural image compression, differentiable approximations of quantization can be used in E2E optimization. In various examples, in the training process of neural network-based image compression, noise injection is used to simulate quantization, and thus quantization is simulated by the noise injection instead of being performed by a quantizer (e.g., the quantizer (912)). Thus, training with noise injection can approximate the quantization error variationally. A bits per pixel (BPP) estimator can be used to simulate an entropy coder, and thus entropy coding is simulated by the BPP estimator instead of being performed by an entropy encoder (e.g., (913)) and an entropy decoder (e.g., (914)). Therefore, the rate loss R in the loss function L shown in Eq. 1 during the training process can be estimated, for example, based on the noise injection and the BPP estimator. In general, a higher rate R can allow for a lower distortion D, and a lower rate R can lead to a higher distortion D. Thus, a trade-off hyperparameter λ in Eq. 1 can be used to optimize a joint R-D loss L where L as a summation of λD and R can be optimized. The training process can be used to adjust the parameters of the one or more components (e.g., (911) (915)) in the NIC framework (900) such that the joint R-D loss L is minimized or optimized.

Various models can be used to determine the distortion loss D and the rate loss R, and thus to determine the joint R-D loss L in Eq. 1. In an example, the distortion loss D (t, t) is expressed as a peak signal-to-noise ratio (PSNR) that is a metric based on mean squared error, a multiscale structural similarity (MS-SSIM) quality index, a weighted combination of the PSNR and MS-SSIM, or the like.

In an example, the target of the training process is to train the encoding neural network (e.g., the encoding DNN), such as a video encoder to be used on an encoder side and the decoding neural network (e.g., the decoding DNN), such as a video decoder to be used on a decoder side. In an example, referring to FIG. 9B, the encoding neural network can include the main encoder network (911), the hyper encoder (921), the hyper decoder (925), the context model NN (916), and the entropy parameter NN (917). The decoding neural network can include the main decoder network (915), the hyper decoder (925), the context model NN (916), and the entropy parameter NN (917). The video encoder and/or the video decoder can include other component(s) that are based on NN(s) and/or not based on NN(s).

The NIC framework (e.g., the NIC framework (900)) can be trained in an E2E fashion. In an example, the encoding neural network and the decoding neural network are updated jointly in the training process based on backpropagated gradients in an E2E fashion.

After the parameters of the neural networks in the NIC framework (900) are trained, one or more components in the NIC framework (900) can be used to encode and/or decode blocks. In an embodiment, on the encoder side, the video encoder is configured to encode the input block x into the encoded block (931) to be transmitted in the bitstream. The video encoder can include multiple components in the NIC framework (900). In an embodiment, on the decoder side, the corresponding video decoder is configured to decode the encoded block (931) in the bitstream into the reconstructed block x. The video decoder can include multiple components in the NIC framework (900).

In an example, the video encoder includes all the components in the NIC framework (900), for example, when content-adaptive online training is employed.

FIG. 16A shows an exemplary video encoder (1600A) according to an embodiment of the disclosure. The video encoder (1600A) includes the main encoder network (911), the quantizer (912), the entropy encoder (913), and the second sub-NN (952) that are described with reference to FIG. 9B and detailed descriptions are omitted for purposes of brevity. FIG. 16B shows an exemplary video decoder (1600B) according to an embodiment of the disclosure. The video decoder (1600B) can correspond to the video encoder (1600A). The video decoder (1600B) can include the main decoder network (915), the entropy decoder (914), the context model NN (916), the entropy parameter NN (917), the entropy decoder (924), and the hyper decoder (925). Referring to FIGS. 16A-16B, on the encoder side, the video encoder (1600A) can generate the encoded block (931) and the encoded bits (932) to be transmitted in the bitstream. On the decoder side, the video decoder (1600B) can receive and decode the encoded block (931) and the encoded bits (932).

FIGS. 17-18 show an exemplary video encoder (1700) and a corresponding video decoder (1800), respectively, according to embodiments of the disclosure. Referring to FIG. 17, the encoder (1700) includes the main encoder network (911), the quantizer (912), and the entropy encoder (913). Examples of the main encoder network (911), the quantizer (912), and the entropy encoder (913) are described with reference to FIG. 9B. Referring to FIG. 18, the video decoder (1800) includes the main decoder network (915) and the entropy decoder (914). Examples of the main decoder network (915) and the entropy decoder (914) are described with reference to FIG. 9B. Referring to FIGS. 17 and 18, the video encoder (1700) can generate the encoded block (931) to be transmitted in the bitstream. The video decoder (1800) can receive and decode the encoded block (931).

As described above, the NIC framework (900) including the video encoder and the video decoder can be trained based on images and/or blocks in the set of training images. In some examples, one or more blocks to be compressed (e.g., encoded) and/or transmitted have properties that are significantly different from the set of training blocks. Thus, encoding and decoding the one or more blocks using the video encoder and the video decoder trained based on the set of training blocks, respectively, can lead to a relatively poor R-D loss L (e.g., a relatively large distortion and/or a relatively large bit rate). Therefore, aspects of the disclosure describe a content-adaptive online training method for NIC, such as a block-wise content-adaptive online training method for NIC.

In the block-wise content-adaptive online training method, an input image can be split into blocks and one or more of the blocks can be used to update one or more parameters in a pretrained NIC framework to be one or more replacement parameters by optimizing rate-distortion performance. Neural network update information indicating the one or more replacement parameters or a subset of the one or more replacement parameters can be encoded into a bitstream along with the encoded one or more of the blocks. At a decoder side, a video decoder can decode the encoded one or more of the blocks and can achieve better compression performance by using the one or more replacement parameters or the subset of the one or more replacement parameters. The block-wise content-adaptive online training method can be used as a preprocessing step (e.g., a pre-encoding step) for boosting the compression performance of a pretrained E2E NIC compression method.

In order to differentiate the training process based on the set of training blocks and the content-adaptive online training process based on the one or more blocks to be compressed (e.g., encoded) and/or transmitted, the NIC framework (900), the video encoder, and the video decoder that are trained by the set of training blocks are referred to as the pretrained NIC framework (900), the pretrained video encoder, and the pretrained video decoder, respectively. Parameters in the pretrained NIC framework (900), the pretrained video encoder, or the pretrained video decoder are referred to as NIC pretrained parameters, encoder pretrained parameters, and decoder pretrained parameters, respectively. In an example, the NIC pretrained parameters includes the encoder pretrained parameters and the decoder pretrained parameters. In an example, the encoder pretrained parameters and the decoder pretrained parameters do not overlap where none of the encoder pretrained parameters is included in the decoder pretrained parameters. For example, the encoder pretrained parameters (e.g., pretrained parameters in the main encoder network (911)) in (1700) and the decoder pretrained parameters (e.g., pretrained parameters in the main decoder network (915)) in (1800) do not overlap. In an example, the encoder pretrained parameters and the decoder pretrained parameters overlap where at least one of the encoder pretrained parameters is included in the decoder pretrained parameters. For example, the encoder pretrained parameters (e.g., pretrained parameters in the context model NN (916)) in (1600A) and the decoder pretrained parameters (e.g., the pretrained parameters in the context model NN (916)) in (1600B) overlap. The NIC pretrained parameters can be obtained based on blocks and/or images in the set of training blocks.

The content-adaptive online training process can be referred to as a finetuning process and is described below. One or more pretrained parameters in the NIC pretrained parameters in the pretrained NIC framework (900) can further be trained (e.g., finetuned) based on the one or more blocks to be encoded and/or transmitted where the one or more blocks can be different from the set of training blocks. The one or more pretrained parameters used in the NIC pretrained parameters can be finetuned by optimizing the joint R-D loss L based on the one or more blocks. The one or more pretrained parameters that have been finetuned by the one or more blocks are referred to as the one or more replacement parameters or the one or more finetuned parameters. In an embodiment, after the one or more pretrained parameters in the NIC pretrained parameters have been finetuned (e.g., replaced) by the one or more replacement parameters, neural network update information is encoded into a bitstream to indicate the one or more replacement parameters or a subset of the one or more replacement parameters. In an example, the NIC framework (900) is updated (or finetuned) where the one or more pretrained parameters are replaced by the one or more replacement parameters, respectively.

In a first scenario, the one or more pretrained parameters includes a first subset of the one or more pretrained parameters and a second subset of the one or more pretrained parameters. The one or more replacement parameters includes a first subset of the one or more replacement parameters and a second subset of the one or more replacement parameters.

The first subset of the one or more pretrained parameters is used in the pretrained video encoder and is replaced by the first subset of the one or more replacement parameters, for example, in the training process. Thus, the pretrained video encoder is updated to the updated video encoder by the training process. The neural network update information can indicate the second subset of the one or more replacement parameters that is to replace the second subset of the one or more replacement parameters. The one or more blocks can be encoded using the updated video encoder and transmitted in the bitstream with the neural network update information.

On the decoder side, the second subset of the one or more pretrained parameters is used in the pretrained video decoder. In an embodiment, the pretrained video decoder receives and decodes the neural network update information to determine the second subset of the one or more replacement parameters. The pretrained video decoder is updated to the updated video decoder when the second subset of the one or more pretrained parameters in the pretrained video decoder is replaced by the second subset of the one or more replacement parameters. The one or more encoded blocks can be decoded using the updated video decoder.

FIGS. 16A-16B show an example of the first scenario. For example, the one or more pretrained parameters include N1 pretrained parameters in the pretrained context model NN (916) and N2 pretrained parameters in the pretrained main decoder network (915). Thus, the first subset of the one or more pretrained parameters include the N1 pretrained parameters, and the second subset of the one or more pretrained parameters are identical to the one or more pretrained parameters. Accordingly, the N1 pretrained parameters in the pretrained context model NN (916) can be replaced by N1 corresponding replacement parameters such that the pretrained video encoder (1600A) can be updated to the updated video encoder (1600A). The pretrained context model NN (916) is also updated to be the updated context model NN (916). On the decoder side, the N1 pretrained parameters can be replaced by the N1 corresponding replacement parameters and the N2 pretrained parameters can be replaced by N2 corresponding replacement parameters, updating the pretrained context model NN (916) to be the updated context model NN (916) and updating the pretrained main decoder network (915) to be the updated main decoder network (915). Thus, the pretrained video decoder (1600B) can be updated to the updated video decoder (1600B).

In a second scenario, none of the one or more pretrained parameters is used in the pretrained video encoder on the encoder side. Rather, the one or more pretrained parameters is used in the pretrained video decoder on the decoder side. Thus, the pretrained video encoder is not updated and continues to be the pretrained video encoder after the training process. In an embodiment, the neural network update information indicates the one or more replacement parameters. The one or more blocks can be encoded using the pretrained video encoder and transmitted in the bitstream with the neural network update information.

On the decoder side, the pretrained video decoder can receive and decode the neural network update information to determine the one or more replacement parameters. The pretrained video decoder is updated to the updated video decoder when the one or more pretrained parameters in the pretrained video decoder is replaced by the one or more replacement parameters. The one or more encoded blocks can be decoded using the updated video decoder.

FIGS. 16A-16B show an example of the second scenario. For example, the one or more pretrained parameters include N2 pretrained parameters in the pretrained main decoder network (915). Thus, none of the one or more pretrained parameters is used in the pretrained video encoder (e.g., the pretrained video encoder (1600A)) on the encoder side. Thus, the pretrained video encoder (1600A) continues to be the pretrained video encoder after the training process. On the decoder side, the N2 pretrained parameters can be replaced by N2 corresponding replacement parameters, which updates the pretrained main decoder network (915) to the updated main decoder network (915). Thus, the pretrained video decoder (1600B) can be updated to the updated video decoder (1600B).

In a third scenario, the one or more pretrained parameters are used in the pretrained video encoder and are replaced by the one or more replacement parameters, for example, in the training process. Thus, the pretrained video encoder is updated to the updated video encoder by the training process. The one or more blocks can be encoded using the updated video encoder and transmitted in the bitstream. No neural network update information is encoded in the bitstream. On the decoder side, the pretrained video decoder is not updated and remains to be the pretrained video decoder. The one or more encoded blocks can be decoded using the pretrained video decoder.

FIGS. 16A-16B show an example of the third scenario. For example, the one or more pretrained parameters are in the pretrained main encoder network (911). Accordingly, the one or more pretrained parameters in the pretrained main encoder network (911) can be replaced by the one or more replacement parameters such that the pretrained video encoder (1600A) can be updated to be the updated video encoder (1600A). The pretrained main encoder network (911) is also updated to be the updated main encoder network (911). On the decoder side, the pretrained video decoder (1600B) is not updated.

In various example, such as described in the first, second, and third scenarios, video decoding may be performed by pretrained decoders having different capabilities, including decoders with and without capabilities to update the pretrained parameters.

In an example, compression performance can be increased by coding the one or more blocks with the updated video encoder and/or the updated video decoder as compared to coding the one or more blocks with the pretrained video encoder and the pretrained video decoder. Therefore, the content-adaptive online training method can be used to adapt a pretrained NIC framework (e.g., the pretrained NIC framework (900)) to target block content (e.g., the one or more blocks to be transmitted), and thus finetuning the pretrained NIC framework. Accordingly, the video encoder on the encoder side and/or the video decoder on the decoder side can be updated.

The content-adaptive online training method can be used as a preprocessing step (e.g., pre-encoding step) for boosting the compression performance of a pretrained E2E NIC compression method.

In an embodiment, the one or more blocks include a single input block, and the finetuning process is performed with the single input block. The NIC framework (900) is trained and updated (e.g., finetuned) based on the single input block. The updated video encoder on the encoder side and/or the updated video decoder on the decoder side can be used to code the single input block and optionally other input blocks. The neural network update information can be encoded into the bitstream together with the encoded single input block.

In an embodiment, the one or more blocks include multiple input blocks, and the finetuning process is performed with the multiple input blocks. The NIC framework (900) is trained and updated (e.g., finetuned) based on the multiple input blocks. The updated video encoder on the encoder side and/or the updated decoder on the decoder side can be used to code the multiple input blocks and optionally other input blocks. The neural network update information can be encoded into the bitstream together with the encoded multiple input blocks.

The rate loss R can increase with the signaling of the neural network update information in the bitstream. When the one or more blocks include the single input block, the neural network update information is signaled for each encoded block, and a first increase to the rate loss R is used to indicate the increase to the rate loss R due to the signaling of the neural network update information per block. When the one or more blocks include the multiple input blocks, the neural network update information is signaled for and shared by the multiple input blocks, and a second increase to the rate loss R is used to indicate the increase to the rate loss R due to the signaling of the neural network update information per block. Because the neural network update information is shared by the multiple input blocks, the second increase to the rate loss R can be less than the first increase to the rate loss R. Thus, in some examples, it can be advantageous to finetune the NIC framework using the multiple input blocks.

In an embodiment, the one or more pretrained parameters to be updated are in one component of the pretrained NIC framework (900). Thus, the one component of the pretrained NIC framework (900) is updated based on the one or more replacement parameters, and other components of the pretrained NIC framework (900) are not updated.

The one component can be the pretrained context model NN (916), the pretrained entropy parameter NN (917), the pretrained main encoder network (911), the pretrained main decoder network (915), the pretrained hyper encoder (921), or the pretrained hyper decoder (925). The pretrained video encoder and/or the pretrained video decoder can be updated depending on which of the components in the pretrained NIC framework (900) is updated.

In an example, the one or more pretrained parameters to be updated are in the pretrained context model NN (916), and thus the pretrained context model NN (916) is updated and the remaining components (911), (915), (921), (917), and (925) are not updated. In an example, the pretrained video encoder on the encoder side and the pretrained video decoder on the decoder side include the pretrained context model NN (916), and thus both the pretrained video encoder and the pretrained video decoder are updated.

In an example, the one or more pretrained parameters to be updated are in the pretrained hyper decoder (925), and thus the pretrained hyper decoder (925) is updated and the remaining components (911), (915), (916), (917), and (921) are not updated. Thus, the pretrained video encoder is not updated and the pretrained video decoder is updated.

In an embodiment, the one or more pretrained parameters to be updated are in multiple components of the pretrained NIC framework (900). Thus, the multiple components of the pretrained NIC framework (900) are updated based on the one or more replacement parameters. In an example, the multiple components of the pretrained NIC framework (900) include all the components configured with neural networks (e.g., DNNs, CNNs). In an example, the multiple components of the pretrained NIC framework (900) include the CNN-based components: the pretrained main encoder network (911), the pretrained main decoder network (915), the pretrained context model NN (916), the pretrained entropy parameter NN (917), the pretrained hyper encoder (921), and the pretrained hyper decoder (925).

As described above, in an example, the one or more pretrained parameters to be updated are in the pretrained video encoder of the pretrained NIC framework (900). In an example, the one or more pretrained parameters to be updated are in the pretrained video decoder of the NIC framework (900). In an example, the one or more pretrained parameters to be updated are in the pretrained video encoder and the pretrained video decoder of the pretrained NIC framework (900).

The NIC framework (900) can be based on neural networks, for example, one or more components in the NIC framework (900) can include neural networks, such as CNNs, DNNs, and/or the like. As described above, the neural networks can be specified by different types of parameters, such as weights, biases, and the like. Each neural network-based component (e.g., the context model NN (916), the entropy parameter NN (917), the main encoder network (911), the main decoder network (915), the hyper encoder (921), or the hyper decoder (925)) in the NIC framework (900) can be configured with suitable parameters, such as respective weights, biases, or a combination of weights and biases. When CNN(s) are used, the weights can include elements in convolution kernels. One or more types of parameters can be used to specify the neural networks. In an embodiment, the one or more pretrained parameters to be updated are bias term(s), and only the bias term(s) are replaced by the one or more replacement parameters. In an embodiment, the one or more pretrained parameters to be updated are weights, and only the weights are replaced by the one or more replacement parameters. In an embodiment, the one or more pretrained parameters to be updated include the weights and bias term(s), and all the pretrained parameters including the weights and bias term(s) are replaced by the one or more replacement parameters. In an embodiment, other parameters can be used to specify the neural networks, and the other parameters can be finetuned.

The finetuning process can include multiple epochs (e.g., iterations) where the one or more pretrained parameters are updated in an iterative finetuning process. The finetuning process can stop when a training loss has flattened or is about to flatten. In an example, the finetuning process stops when the training loss (e.g., a R-D loss L) is below a first threshold. In an example, the finetuning process stops when a difference between two successive training losses is below a second threshold.

Two hyperparameters (e.g., a step size and a maximum number of steps) can be used in the finetuning process together with a loss function (e.g., an R-D loss L). The maximum number of iterations can be used as a threshold of a maximum number of iterations to terminate the finetuning process. In an example, the finetuning process stops when a number of iterations reaches the maximum number of iterations.

The step size can indicate a learning rate of the online training process (e.g., the online finetuning process). The step size can be used in a gradient descent algorithm or a backpropagation calculation performed in the finetuning process. A step size can be determined using any suitable method.

The step size for each block in an image can be different. In an embodiment, different step sizes can be assigned for an image in order to achieve a better compression result (e.g., a better R-D loss L).

In some examples, a video encoder and a video decoder based on a NIC framework (e.g., the NIC framework (900)) can encode and decode an image directly. Thus, the block-wise content-adaptive online training method can be adapted to update certain parameters in the NIC framework and thus the video encoder and/or the video decoder by using one or more images directly. Different images can have different step sizes to achieve optimized compression result.

In an embodiment, different step sizes are used for blocks with different types of contents to achieve optimal results. Different types can refer to different variances. In an example, the step size is determined based on a variance of a block used to update a NIC framework. For example, a step size of a block having a high variance is larger than a step size of a block having a low variance where the high variance is larger than the low variance.

In an embodiment, a step size is chosen based on characteristics of a block or an image, such as RGB variance of the block. In an embodiment, a step size is chosen based on RD performance (e.g., a R-D loss L) of the block. Multiple sets of replacement parameter(s) can be generated based on different step sizes, and the set with the better compression performance (e.g., a smaller R-D loss) can be chosen.

In an embodiment, a first step size can be used to run a certain number (e.g., 100) iterations. Then, a second step size (e.g., the first step size plus or minus a size increment) can be used to run the certain number of iterations. Results from the first step size and the second step size can be compared to determine a step size to be used. More than two step sizes may be tested to determine an optimal step size.

A step size can vary during the finetuning process. The step size can have an initial value at an onset of the finetuning process, and the initial value can be reduced (e.g., halved) at a later stage of the finetuning process, for example, after a certain number of iterations to achieve a finer tuning. The step size or the learning rate can be varied by a scheduler during the iterative online training. The scheduler can include a parameter adjustment method used to adjust the step size. The scheduler can determine a value for the step size such that the step size can increase, decrease, or remain constant in a number of intervals. In an example, the learning rate is altered in each step by the scheduler. A single scheduler or multiple different schedulers can be used for different blocks. Thus, multiple sets of replacement parameter(s) can be generated based on the multiple schedulers, and one of the multiple sets of replacement parameter(s) with the better compression performance (e.g., a smaller R-D loss) can be chosen.

In an embodiment, multiple learning rate schedules are assigned for different blocks in order to achieve better compression result. In an embodiment, all blocks in an image share a same learning rate schedule. In an embodiment, selection of learning rate schedules is based on characteristics of a block, such as a RGB variance of the block. In an embodiment, selection of learning rate schedules is based on the RD performance of the block.

In an embodiment, different blocks can be used to update different parameters in different components (e.g., the context model NN (916) or the hyper decoder (925)) in the NIC framework. For example, a first block is used to update parameters in the context model NN (916), and a second block is used to update parameters in the hyper decoder (925).

In an embodiment, different blocks can be used to update different types of parameters (e.g., biases or weights) in the NIC framework. For example, a first block is used to update at least one bias in one or more neural networks in the NIC framework, and a second block is used to update at least one weight in one or more neural networks in the NIC framework.

In an embodiment, multiple blocks (e.g., all blocks) in an image update the same one or more parameters.

In an embodiment, the one or more parameters to be updated are chosen based on a characteristic of a block, such as a RGB variance of the block. In an embodiment, the one or more parameters to be updated are chosen based on a RD performance of the block.

At the end of the finetuning process, one or more updated parameters can be computed for the respective one or more replacement parameters. In an embodiment, the one or more updated parameters are calculated as differences between the one or more replacement parameters and the corresponding one or more pretrained parameters. In an embodiment, the one or more updated parameters are the one or more replacement parameters, respectively.

In an embodiment, the one or more updated parameters can be generated from the one or more replacement parameters, for example, using a certain linear or nonlinear transform, and the one or more updated parameters are representative parameter(s) generated based on the one or more replacement parameters. The one or more replacement parameters are transformed into the one or more updated parameters for better compression.

A first subset of the one or more updated parameters corresponds to the first subset of the one or more replacement parameters, and a second subset of the one or more updated parameters corresponds to the second subset of the one or more replacement parameters.

In an embodiment, different blocks have different relationships between the one or more updated parameters and the one or more replacement parameters. For example, for a first block the one or more updated parameters are calculated as differences between the one or more replacement parameters and the corresponding one or more pretrained parameters. For a second block, the one or more updated parameters are the one or more replacement parameters, respectively.

In an embodiment, multiple blocks (e.g., all blocks) in an image have a same relationship between the one or more updated parameters and the one or more replacement parameters.

In an embodiment, the relationship between the one or more updated parameters and the one or more replacement parameters is chosen based on characteristics of a block, such as a RGB variance of the block. In an embodiment, the relationship between the one or more updated parameters and the one or more replacement parameters is chosen based on a RD performance of the block.

In an example, the one or more updated parameters can be compressed, for example, using LZMA2 that is a variation of a Lempel-Ziv-Markov chain algorithm (LZMA), a bzip2 algorithm, or the like. In an example, compression is omitted for the one or more updated parameters. In some embodiments, the one or more updated parameters or the second subset of the one or more updated parameters can be encoded into the bitstream as the neural network update information where the neural network update information indicates the one or more replacement parameters or the second subset of the one or more replacement parameters.

In an embodiment, compression methods for the one or more updated parameters are different for different blocks. For example, for a first block, the LZMA2 is used to compress the one or more updated parameters, and for a second block, the bzip2 is used to compress the one or more updated parameters. In an embodiment, a same compression method is used to compress the one or more updated parameters for multiple blocks (e.g., all blocks) in an image. In an embodiment, a compression method is chosen based on characteristics of a block, such as a RGB variance of the block. In an embodiment, a compression method is chosen based on RD performance of the block.

After the finetuning process, in some examples, the pretrained video encoder on the encoder side can be updated or finetuned based on (i) the first subset of the one or more replacement parameters or (ii) the one or more replacement parameters. An input block (e.g., one of the one or more blocks used to in the finetuning process) can be encoded into the bitstream using the updated video encoder. Thus, the bitstream includes both the encoded block and the neural network update information.

If applicable, in an example, the neural network update information is decoded (e.g., decompressed) by the pretrained video decoder to obtain the one or more updated parameters or the second subset of the one or more updated parameters. In an example, the one or more replacement parameters or the second subset of the one or more replacement parameters can be obtained based on the relationship between the one or more updated parameters and the one or more replacement parameters described above. The pretrained video decoder can be finetuned and the updated video decoded can be used to decode the encoded block, as described above.

The NIC framework can include any type of neural networks and use any neural network-based image compression methods, such as a context-hyperprior encoder-decoder framework (e.g., the NIC framework shown in FIG. 9B), a scale-hyperprior encoder-decoder framework, a Gaussian Mixture Likelihoods framework and variants of the Gaussian Mixture Likelihoods framework, an RNN-based recursive compression method and variants of the RNN-based recursive compression method, and the like.

Compared with related E2E image compression methods, the content-adaptive online training methods and apparatus in the disclosure can have the following benefits. Adaptive online training mechanisms are exploited to improve the NIC coding efficiency. Use of a flexible and general framework can accommodate various types of pretrained frameworks and quality metrics. For example, certain pretrained parameters in the various types of pretrained frameworks can be replaced by using online training with blocks to be encoded and transmitted.

Video coding technologies can include filtering operations that are performed on reconstructed samples so that artifacts resulting from lossy compression, such as by quantization, can be reduced. A deblocking filter process is used in one such filtering operation, in which a block boundary (e.g., a boundary region) between two adjacent blocks can be filtered so that a smoother transition of sample values from one block to the other block can be achieved.

In some related examples (e.g., HEVC), the deblocking filter process can be applied to samples adjacent to the block boundary. The deblocking filter process can be performed for each CU in the same order as the decoding process. For example, the deblocking filter process can be performed by horizontal filtering for vertical boundaries for an image first, followed by vertical filtering for horizontal boundaries for the image. Filtering can be applied to 8×8 block boundaries which are determined to be filtered, both for luma and chroma components. In an example, 4×4 block boundaries are not processed in order to reduce the complexity.

A boundary strength (BS) can be used to indicate a degree or strength of the deblocking filter process. In an embodiment, a value of 2 for BS indicates strong filtering, 1 indicates weak filtering, and 0 indicates no deblocking filtering.

FIG. 19 shows a flowchart of a process (1900) for determining a BS value according to an embodiment of the disclosure. An order of the steps in FIG. 19 can be reordered or one or more steps omitted or replaced in other embodiments.

In FIG. 19, P and Q are two adjacent blocks with a boundary between. In a vertical boundary case, P can represent a block located to the left of the boundary and Q can represent a block located to the right of the boundary. In a horizontal boundary case, P can represent a block located above the boundary and Q can represent a block located below the boundary.

In FIG. 19, a BS value can be determined based on a prediction mode (e.g., intra coding mode), a non-zero transform coefficient (or existence of non-zero transform coefficients), a reference picture, a number of motion vectors, and/or a motion vector difference.

At step (S1910), the process (1900) determines whether P or Q is coded in an intra prediction mode. When at least one of P and Q is determined to be coded in the intra prediction mode, the process (1900) determines a first value (e.g., 2) for the BS. Otherwise, the process (1900) proceeds to step (S1920).

At step (S1920), the process (1900) determines whether P or Q has a non-zero transform coefficient. When at least one of P and Q is determined to have a non-zero transform coefficient, the process (1900) determines a second value (e.g., 1) for the BS. Otherwise, the process (1900) proceeds to step (S1930).

At step (S1930), the process (1900) determines whether P and Q have different reference pictures. When P and Q are determined to have different reference pictures, the process (1900) determines a third value (e.g., 1) for the BS. Otherwise, the process (1900) proceeds to step (S1940).

At step (S1940), the process (1900) determines whether P and Q have different numbers of motion vectors. When P and Q are determined to have different numbers of motion vectors, the process (1900) determines a fourth value (e.g., 1) for the BS. Otherwise, the process (1900) proceeds to step (S1950).

At step (S1950), the process (1900) determines whether a motion vector difference between P and Q is above or equal to a threshold T. When the motion vector difference between P and Q is determined to be above or equal to the threshold T, the process (1900) determines a fifth value (e.g., 1) for the BS. Otherwise, the process (1900) determines a sixth value (e.g., 0) for the BS. In an embodiment, the threshold T is set to 1 pixel. In the FIG. 19 example, the MV precision is ¼ pixel, so a value of the MV difference threshold can be set to 4. In another example, if the MV precision is 1/16, the value of the MV difference can be set to 16.

In the FIG. 19 example, the second through the fifth values are set as 1. However, in another example, some or all of the second through the fifth values may be set as different values.

In some embodiments, a BS can be calculated on a 4×4 block basis, and the BS can be re-mapped to an 8×8 grid. For example, a maximum of the two values of BS which correspond to 8 pixels consisting of a line in the 4×4 grid is selected as the BS for the boundaries in the 8×8 grid.

In some related examples such as VVC Test model 5 (VTMS), the deblocking filter process can be based on those used in HEVC and include some modifications. For example, the filter strength of the deblocking filter can be dependent on an averaged luma level of reconstructed samples, a deblocking t_C table can be extended, stronger deblocking filters can be used for luma and chroma components, a luma deblocking filter can be applied on a 4×4 sample grid, and a chroma deblocking filter can be applied on an 8×8 sample grid.

In some related examples such as HEVC, the filter strength of the deblocking filter can be controlled by the variables β and t_C which are derived from an averaged quantization parameters qP_L. In some related examples such as VTM5, the deblocking filter can control the filter strength by adding an offset to the average quantization parameter qPL according to the luma level of the reconstructed samples. The reconstructed luma level LL can be derived as,

LL=((p_0,0+p_0,3+q_0,0+q_0,3)>>2)/(1<<bitDepth)   Eq. 8

where the sample values p_i,k and q_i,k with i=0 . . . 3 and k=0 and 3 are derived as shown in FIG. 20. FIG. 20 shows exemplary sample positions for determining a boundary strength value in accordance with an embodiment.

The variable qPL can be derived as,

qPL=((Qp_Q+Qp_P+1)>>1)+qpOffset   Eq. 9

where Qp_Q and Qp_P denote the quantization parameters of the coding units containing the sample q_0,0 and p_0,0, respectively. The offset qpOffset is dependent on a transfer function and the reconstructed luma level LL. The mapping function of qpOffset and the luma level can be signaled in the sequence parameter set (SPS) and derived according to transfer characteristics of contents since the transfer function can vary among video formats.

In some related examples such as VTMS, maximum QP can be extended to be 63. In order to reflect the corresponding change to the deblocking table which derive values of deblocking parameters based on the block QP, the t_C table can accommodate the extension of the QP range as t_C=[ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 5, 5, 6, 6, 7, 8, 9, 10, 11, 13, 14, 16, 18, 20, 22, 25, 28, 31, 35, 39, 44, 50, 56, 63, 70, 79, 88, 99].

In some related examples, a stronger deblocking filter (e.g., a bilinear filter) can be used when samples at either one side of a boundary belong to a large block. The large block can be defined as when a width of the block is larger than or equal to 32 for a vertical edge, and when a height of the block is larger than or equal to 32 for a horizontal edge. Block boundary samples pi for i=0 to Sp−1 and qi for j=0 to Sq−1 are then replaced by linear interpolation as follows:

p _i′=(f_i*Middle_s,t+(64−f_i)*P_s+32)>>6), clipped to p_i±tcPD_i   Eq. 10

q ₁′=(g_i*Middle_s,t+(64−g_j)*Q_s+32)>6), clipped to q_j±tcPD_j   Eq. 11

where parameters tcPD_i and tcPD_j are position dependent clipping parameters and g_j, f_i, Middle_s,t, P_s, and Q_s are given in the Table 1.

TABLE 1
Sp, Sq      fi = 59 − i * 9, can also be described as f = {59, 50, 41, 32, 23, 14, 5}
7, 7        gj = 59 − j * 9, can also be described as g = {59, 50, 41, 32, 23, 14, 5}
(p side: 7, Middle7, 7 = (2 * (p0 + q0) + p1 + q1 + p2 + q2 + p3 + q3 + p4 + q4 + p5 + q5 + p6 +
q side: 7)  q6 + 8) >> 4
            P7 = (p6 + p7 + 1) >> 1, Q7 = (q6 + q7 + 1) >> 1
7, 3        fi = 59 − i * 9, can also be described as f = {59, 50, 41, 32, 23, 14, 5}
(p side: 7  gj = 53 − j * 21, can also be described as g = {53, 32, 11}
q side: 3)  Middle7, 3 = (2 * (p0 + qo) + q0 + 2 * (q1 + q2) + p1 + q1+ p2 + p3 + p4 + p5 +
            p6 + 8) >> 4
            P7 = (p6 + p7 + 1) >> 1, Q3 = (q2 + q3 + 1) >> 1
3, 7        gj = 59 − j * 9, can also be described as g = {59, 50, 41, 32, 23, 14, 5}
(p side: 3  fi = 53 − i * 21, can also be described as f = {53, 32, 11}
q side: 7)  Middle3, 7 = (2 * (q0 + p0) + p0 + 2 * (p1 + p2) + q1 + p1 + q2 + q3 + q4 + q5 +
            q6 + 8) >> 4
            Q7 = (q6 + q7 + 1) >> 1, P3 = (p2 + p3 + 1) >> 1
7, 5        gj = 58 − j * 13, can also be described as g = {58, 45, 32, 19, 6}
(p side: 7  fi = 59 − i * 9, can also be described as f = {59, 50, 41, 32, 23, 14, 5}
q side: 5)  Middle7, 5 = (2 * (p0 + q0 + p1 + q1) + q2 + p2 + q3 + p3 + q4 + p4 + q5 + p5 +
            8) >> 4
            Q5 = (q4 + q5 + 1) >> 1, P7 = (p6 + p7 + 1) >> 1
5, 7        gj = 59 − j * 9, can also be described as g = {59, 50, 41, 32, 23, 14, 5}
(p side: 5  fi = 58 − i * 13, can also be described as f = {58, 45, 32, 19, 6}
q side: 7)  Middle5, 7 = (2 * (q0 + p0+ p1 + q1) + q2 + p2 + q3 + p3 + q4 + p4 + q5 + p5 +
            8) >> 4
            Q7 = (q6 + q7 + 1) >> P5 = (p4 + p5 + 1) >> 1
5, 5        gj = 58 − j * 13, can also be described as g = {58, 45, 32, 19, 6}
(p side: 5  fi = 58 − i * 13, can also be described as f = {58, 45, 32, 19, 6}
q side: 5)  Middle5, 5 = (2 * (q0 + p0 + p1 + q1 + q2 + p2) + q3 + p3 + q4 + p4 + 8) >> 4
            Q5 = (q4 + q5 + 1) >> P5 = (p4 + p5 + 1) >> 1
5, 3        gj = 53 − j * 21, can also be described as g = {53, 32, 11}
(p side: 5  fi = 58 − i * 13, can also be described as f = {58, 45, 32, 19, 6}
q side: 3)  Middle5, 3 = (q0 + p0 + p1 + q1 + q2 + p2 + q3 + p3 + 4) >> 3
            Q3 = (q2 + q3 + 1) >> 1, P5 = (p4 + p5 + 1) >> 1
3, 5        gj = 58 − j * 13, can also be described as g = {58, 45, 32, 19, 6}
(p side: 3  fi = 53 − i * 21, can also be described as f = {53, 32, 11}
q side: 5)  Middle3, 5 = (q0 + p0 + p1 + q1 + q2 + p2 + q3 + p3 + 4) >> 3
            Q5 = (q4 + q5 + 1) >> 1, P3 = (p2 + p3 + 1) >> 1

In some embodiments, the stronger luma filters can be used only if all of condition1, condition2, and condition 3 are TRUE. The condition 1 is referred to as a large block condition. This condition detects whether the samples at P-side and Q-side belong to large blocks. The condition 2 and condition 3 are determined as follows:

Condition2=(d<β)?TRUE:FALSE   Eq. 12

Condition3=StrongFilterCondition=(dpq is less than (β>>2), sp₃+sq₃ is less than (3*β>>5), and Abs(p₀−q₀) is less than (5*t_C+1)>>1) ? TRUE:FALSE   Eq. 13

where d, dpq, sp and sq are magnitudes of gradient calculations to determine amounts of detail in comparison to a threshold based on β, which is a QP dependent coding noise threshold, to avoid removing details by the filtering. Similarly, it is also checked that the magnitude of the gradient across the boundary is less than a threshold based on t_C, which is a QP dependent deblocking strength threshold.

In some embodiments, a strong deblocking filter for chroma can be defined as follows:

p2′=(3*p3+2*p2+p1+p0+q0+4)>>3   Eq. 14

p1′=(2*p3+p2+2*p1+p0+q0+q1+4)>>3   Eq. 15

p0′=(p3+p2+p1+2*p0+q0+q1+q2+4)>>3   Eq. 16

In an embodiment, the strong deblocking filter for chroma can perform deblocking on an 8×8 chroma sample grid. The chroma strong filter can be used on samples at both sides of the block boundary. For example, the chroma strong filter can be selected when both sides of the block boundary are greater than or equal to 8 (in units of chroma sample) and the following three decisions are satisfied. The first decision is to determine either one of two blocks separated by the block boundary is a large block. The second and third decisions are a deblocking filter on/off decision and a strong filter decision, respectively, which can be the same as those in some related examples such as HEVC. In the first decision, the BS can be modified for chroma filtering as shown in the Table 2. The conditions in the Table 2 are checked sequentially. If a condition is satisfied, then the remaining conditions with lower priorities are skipped.

TABLE 2
Priority	Conditions	Y	U	V
5	At least one of the adjacent blocks is intra	2	2	2
4	At least one of the adjacent blocks	1	1	1
	has non-zero transform coefficients
3	Absolute difference between the motion	1	N/A	N/A
	vectors that belong to the adjacent blocks
	is greater than or equal to one integer
	luma sample
2	Motion prediction in the adjacent blocks	1	N/A	N/A
	refers to vectors is different
1	Otherwise	0	0	0

In an embodiment, the chroma deblocking can be performing when BS is equal to 2, or BS is equal to 1 with a large block boundary being detected. In such a case, the second and third decisions are basically the same as HEVC luma strong filter decision.

In some related examples such as VVC, the deblocking filter can be enabled on a 4×4 grid for luma and an 8×8 grid for chroma. The deblocking filter process can be applied to the CU boundaries and sub-block boundaries. The sub-block boundaries can include the prediction unit boundaries introduced by sub-block-based temporal motion vector prediction (SbTMVP) and affine modes, and the transform unit boundaries introduced by sub-block transform (SBT) and intra sub-partition (ISP) modes.

For SBT and ISP sub-blocks, the deblocking filter used for TU in HEVC can be applied. For example, the deblocking filter can be applied to a TU boundary when there are non-zero coefficients in either of the sub-blocks separated by the boundary.

For SbTMVP and affine sub-blocks on 4×4 grids, the deblocking filter used for PU in HEVC can be applied. For example, the deblocking filter for PU boundaries can be applied with the consideration of the difference between motion vectors and reference pictures of the neighboring sub-blocks.

Blocks of an image can be reconstructed from a coded video bitstream using any suitable methods, such as the embodiments in the disclosure. For example, the blocks can be reconstructed using a video decoder (e.g., (1600B) or (1800)) including neural networks (e.g., CNN(s)) having one or more pretrained parameters replaced by one or more respective replacement parameters that are determined based on the block-wise content-adaptive online training process described above. According to some embodiments of the disclosure, post-processing can be performed on one of a plurality of regions of first two neighboring reconstructed blocks of the reconstructed blocks with at least one post-processing NN. The first two neighboring reconstructed blocks can have a first shared boundary and include a boundary region having samples on both sides of the first shared boundary. The plurality of regions of the first two neighboring reconstructed blocks can include the boundary region and non-boundary regions that are outside the boundary region. The one of the plurality of regions can be replaced with the post-processed one of the plurality of regions of the first two neighboring reconstructed blocks. The post-processing that is performed can be deblocking the boundary region, enhancing one or more of the non-boundary regions, a combination of deblocking and enhancing, and/or the like.

One or more deblocking methods can be used to reduce artifacts among blocks (e.g., the reconstructed blocks in the image). To reduce the artifacts among the blocks, such as artifacts in boundary regions, one or more NN-based deblocking models can be used. The NN-based deblocking models can be DNN-based deblocking models, CNN-based deblocking models, or the like. The NN-based deblocking models can be implemented using NNs, such as DNNs, CNNs, or the like.

In an embodiment, the one of the plurality regions is the boundary region. The at least one post-processing NN includes at least one deblocking NN, such as the main decoder network (915), and deblocking can be performed on the boundary region with the at least one deblocking NN. The boundary region can be replaced with the deblocked boundary region. Examples of deblocking are shown in FIGS. 21A-21C, 22, 23, and 26.

FIGS. 21A-21C show an exemplary deblocking process (2100) according to an embodiment of the disclosure. Referring to FIG. 21A, an image (2101) can be partitioned into a plurality of blocks (2111)-(2114). For brevity, four equal-sized blocks (2111)-(2114) are illustrated in FIG. 21A. In general, an image can be partitioned into any suitable number of blocks, and sizes of the blocks can be different or identical, and the description can be suitably adapted. In some examples, regions that include artifacts, for example, due to partitioning an image to blocks, can be processed by deblocking.

In an example, the blocks (2111)-(2114) are reconstructed blocks from the main decoder network (915). The first two neighboring reconstructed blocks of the reconstructed blocks (2111)-(2114) can include the blocks (2111) and (2113) separated by a first shared boundary (2141). The blocks (2111) and (2113) can include a boundary region A having samples on both sides of the first shared boundary (2141). Referring to FIGS. 21A-21B, the boundary region A can include sub-boundary regions A1 and A2 that are located in the blocks (2111) and (2113), respectively.

Two neighboring reconstructed blocks of the reconstructed blocks (2111)-(2114) can include the blocks (2112) and (2114) separated by a second shared boundary (2142). The blocks (2112) and (2114) can include a boundary region B having samples on both sides of the second shared boundary (2142). Referring to FIGS. 21A-21B, the boundary region B can include sub-boundary regions B1 and B2 that are located in the blocks (2112) and (2114), respectively.

Two neighboring reconstructed blocks of the reconstructed blocks (2111)-(2114) can include the blocks (2111) and (2112) separated by a shared boundary (2143). The blocks (2111) and (2112) can include a boundary region C having samples on both sides of the shared boundary (2143). Referring to FIGS. 21A-21B, the boundary region C can include sub-boundary regions C1 and C2 that are located in the blocks (2111) and (2112), respectively.

Two neighboring reconstructed blocks of the reconstructed blocks (2111)-(2114) can include the blocks (2113) and (2114) separated by a shared boundary (2144). The blocks (2113) and (2114) can include a boundary region D having samples on both sides of the shared boundary (2144). Referring to FIGS. 21A-21B, the boundary region D can include sub-boundary regions D1 and D2 that are located in the blocks (2113) and (2114), respectively.

The sub-boundary regions A1-D1 and A2-D2 (and the boundary regions A-D) can have any suitable sizes (e.g., widths and/or heights). In an embodiment shown in FIG. 21A, the sub-boundary regions A1, A2, B1, and B2 have an identical size of m×n, where n is a width of the blocks (2111)-(2114), m is a height of the sub-boundary regions A1, A2, B1, and B2. Both m and n are positive integers. In an example, m is four pixels or four samples. Thus, the boundary regions A and B have an identical size of 2m×n. The sub-boundary regions C1, C2, D1, and D2 have an identical size of n×m, where n is a height of the blocks (2111)-(2114), m is a width of the sub-boundary regions C1, C2, D1, and D2. Thus, the boundary regions C and D have an identical size of n×2m. As described above, the sub-boundary regions and the boundary regions can have different sizes, such as different widths, different heights, and/or the like. For example, the sub-boundary regions A1 and A2 can have different heights. In an example, the sub-boundary regions C1 and C2 can have different widths. The boundary regions A and B can have different widths. The boundary regions C and D can have different heights.

Referring to FIGS. 21A-21B, the boundary region A includes m lines of samples (e.g., m rows of samples) in the block (2111) from the first shared boundary (2141) and m lines of samples (e.g., m rows of samples) in the block (2113) from the first shared boundary (2141). The boundary region C includes m lines of samples (e.g., m columns of samples) in the block (2111) from the shared boundary (2143) and m lines of samples (e.g., m columns of samples) in the block (2112) from the shared boundary (2143).

Deblocking can be performed on one or more of the boundary regions A-D with the at least one deblocking NN, such as a deblocking NN based on DNN(s), CNN(s), or any suitable NN(s). In an example, the at least one deblocking NN includes a deblocking NN (2130). In an example, the deblocking NN (2130) is implemented using a CNN including one or more convolutional layers. The deblocking NN (2130) can include additional layer(s) described in the disclosure, such as pooling layer(s), fully connected layer(s), normalization layer(s), and/or the like. The layers in the deblocking NN (2130) can be arranged in any suitable order and in any suitable architecture (e.g., a feed-forward architecture, a recurrent architecture). In an example, a convolutional layer is followed by other layer(s), such as pooling layer(s), fully connected layer(s), normalization layer(s), and/or the like.

Deblocking can be performed on the boundary regions A-D with the deblocking NN (2130). One or more of the boundary regions A-D include artifacts. The artifacts may be induced by respective adjacent blocks. The one or more of the boundary regions A-D can be sent to the deblocking NN (2130) to reduce the artifacts. Thus, an input to the deblocking NN (2130) includes the one or more of the boundary regions A-D, and an output from the deblocking NN (2130) includes one or more of the boundary regions A-D that are deblocked.

Referring to FIG. 21B, the boundary regions A-D include artifacts induced by respective adjacent blocks. The boundary regions A-D can be sent to the deblocking NN (2130) to reduce the artifacts. An output from the deblocking NN (2130) includes the deblocked boundary regions A′-D′. In an example, artifacts in the deblocked boundary regions A′-D′ are reduced compared to the artifacts in the boundary regions A-D.

Referring to FIGS. 21B and 21C, the boundary regions A-D in the image (2101) are updated, for example by being replaced by the deblocked boundary regions A′-D′. Thus, an image (2150) is generated and includes the deblocked boundary regions A′-D′ and the non-boundary regions (2121)-(2124).

One or more samples can be in multiple boundary regions. When multiple boundary regions are replaced by corresponding deblocked boundary regions, any suitable method can be used to determine a value of one of the one or more shared samples.

Referring to FIG. 21A, a sample S is in the boundary regions A and C. After obtaining the boundary regions A′ and C′, the following methods can be used to obtain a value of the sample S. In an example, the boundary region A is replaced by the deblocked boundary region A′ and subsequently, the boundary region C is replaced by the deblocked boundary region C′. Thus, the value of the sample S is determined by a value of the sample S in the deblocked boundary region C′.

In an example, the boundary region C is replaced by the deblocked boundary region C′ and subsequently, the boundary region A is replaced by the deblocked boundary region A′. Thus, the value of the sample S is determined by a value of the sample S in the deblocked boundary region A′.

In an example, the value of the sample S is determined by an average (e.g., a weighted average) of the value of the sample S in the deblocked boundary region A′ and the value of the sample S in the deblocked boundary region C′.

A boundary region can include samples of more than two blocks. FIG. 22 shows an example of boundary regions including samples of more than two blocks according to embodiments of the disclosure. A single boundary region AB can include the boundary regions A and B. The boundary region AB can include samples on both sides of the shared boundary (2141) between the two neighboring reconstructed blocks (2111) and (2113), and include samples on both sides of the shared boundary (2142) between the two neighboring reconstructed blocks (2112) and (2114). A single boundary region CD can include the boundary regions C and D. The boundary region CD can include samples on both sides of the shared boundary (2143) between the two neighboring reconstructed blocks (2111) and (2112), and include samples on both sides of the shared boundary (2144) between the two neighboring reconstructed blocks (2113) and (2114).

A deblocking NN, such as the deblocking NN (2130), can perform deblocking on one or more of the boundary regions AB and CD to generate one or more deblocked ones of the boundary regions. Referring to FIG. 22, the boundary regions AB and CD are sent to the deblocking NN (2130) and deblocked boundary regions AB′ and CD′ are generated. The deblocked boundary regions AB′ and CD′ can replace the boundary regions AB and CD in the image (2101), and thus an image (2250) is generated. The image (2250) can include the deblocked boundary regions AB′-CD′ and the non-boundary regions (2121)-(2124).

According to embodiments of the disclosure, a multi-model deblocking method can be used. Different deblocking models can be applied to different types or categories of boundary regions, to remove artifacts. A classification module can be applied to classify the boundary regions into different categories. Any classification module can be applied. In an example, the classification module is based on NN. In an example, the classification module is not based on NN. The boundary regions can be sent to different deblocking models according to the respective categories.

In an embodiment, the at least one deblocking NN includes multiple deblocking NNs implemented based on different deblocking models, respectively. Which of the multiple deblocking NNs to apply to a boundary region can be determined. Deblocking can be performed on the boundary region with the determined deblocking NN. In an example, which of the multiple deblocking NNs to apply is determined by a classification module that is based on a NN (e.g., also referred to as a classification NN), such as a DNN, a CNN, or the like.

FIG. 23 shows an exemplary deblocking process (2300) based on multiple deblocking models according to an embodiment of the disclosure. A classification module (2310) can classify the boundary regions A-D into one or more categories. For example, the boundary regions C-D are classified into a first category, the boundary region B is classified into a second category, and the boundary region A is classified into a third category. Different deblocking models can be applied to boundary regions in different categories. In FIG. 23, a deblocking NN (2330) can be used to perform deblocking, such as a multi-model deblocking based on multiple deblocking models (e.g., deblocking models 1-L). L is a positive integer. When L is 1, the deblocking NN (2330) includes a single deblocking model. When L is larger than 1, the deblocking NN (2330) includes multiple deblocking models.

In an example, the deblocking model 1 is applied to boundary region(s) (e.g., C and D) in the first category, and deblocked boundary region(s) (e.g., C″ and D″) are generated. The deblocking model 2 is applied to boundary region(s) (e.g., B) in the second category, and deblocked boundary region(s) (e.g., B″) are generated. The deblocking model 3 is applied to boundary region(s) (e.g., A) in the third category, and deblocked boundary region(s) (e.g., A″) are generated. The deblocked boundary regions A″-D″ can replace the corresponding boundary regions A-D in the image (2101), and thus an image (2350) is generated. The image (2350) can include the deblocked boundary regions A″-D″ and the non-boundary regions (2121)-(2124).

Any suitable metrics can be applied to classify or categorize a boundary region. In an example, a boundary region is classified according to content of the boundary region. For example, a boundary region with a high frequency content (e.g., content with a relatively large variance) and a boundary region with a low frequency content (e.g., content with a relatively small variance) are classified into different categories corresponding to different deblocking models. Strength of artifacts in a boundary region can be used to classify the boundary region. The multi-model deblocking method can be applied to any suitable boundary regions, such as the boundary regions (e.g., A, B, C, D, AB, and/or CD) between two or more blocks. A frequency of a boundary region may be determined based on a maximum difference of samples within the boundary region. In an example, a first difference of samples near a first edge in a first side of a shared boundary is determined. In an example, a second difference of samples near a second edge in a second side of the shared boundary is determined. In an example, the first difference and the second difference are determined.

A deblocking NN (e.g., the deblocking NN (2130) in FIG. 21B or the deblocking NN (2330) in FIG. 23) can be applied to remove artifacts among blocks. In an example, samples or pixels close to a shared boundary can be deblocked more than samples (or pixels) that are further away from the shared boundary. Referring back to FIG. 21A, the sample S is closer to the shared boundary (2141) than a sample F, and thus the sample S can be deblocked more than the sample F.

A deblocking model in a deblocking NN (e.g., the deblocking NN (2130) in FIG. 21B or the deblocking NN (2330) in FIG. 23) can include one or more convolution layers. For example, a CNN-based attention mechanism (e.g., non-local attention, a Squeeze-and-Excitation Network (SENet)), a residual neural network (ResNet) (e.g., including a set of CNNs or convnets and an activation function), and/or the like may be used. For example, a DNN used by image super-resolution can be used, for example, by changing an output size to be identical to an input size. In image super-resolution, a resolution of an image can be enhanced from a low-resolution to a high-resolution.

How to perform deblocking on boundary region(s) with a NN or other learning-based methods is described above. In some examples, a video encoder and/or a video decoder may select between the deblocking method based on NN or a deblocking method not based on NN. The selection can be made on various levels, such as at a slice level, a picture level, for a group of pictures, a sequence level, and/or the like. The selection can be signaled using a flag. The selection can be inferred from content of a boundary region.

A video encoder and/or a video decoder may apply various level of boundary strength in addition to the methods and embodiments described in the disclosure, for example, when NN derived adjustments on pixels or samples are at a default level of a boundary strength (BS). By analyzing boundary conditions and block coding features, different levels of BS may be assigned to modify (e.g., enlarge or reduce) the default adjustment.

According to an embodiment of the disclosure, the at least one post-processing NN can include at least one enhancement NN. One or more of non-boundary regions of neighboring reconstructed blocks can be enhanced with the at least one enhancement NN. The one or more of the non-boundary regions can be replaced with the enhanced one or more of the non-boundary regions.

A reconstructed image (e.g., the image (2101) in FIG. 21C) can be sent to an enhancement module to generate an enhanced image (e.g., a final reconstructed image). The reconstructed image can be sent to the enhancement module after reducing the artifacts by using a deblocking NN in some embodiments in which deblocking is performed. To enhance the quality of the image, a NN-based post-enhancement model (e.g., a post-enhancement model based on DNN(s) or CNN(s)) can be used in a post-enhancement module, such as a post-enhancement NN (2430) in FIG. 24.

FIG. 24 shows an example enhancement process (2400) according to an embodiment of the disclosure. In some examples, the non-boundary regions (2121)-(2124) (e.g., remaining regions other than the boundary regions A-D) in the image (2101) are not sent to a deblocking module (e.g., the deblocking NN(2130)). In an example, a non-boundary region (e.g., the non-boundary regions (2121)) is from a reconstructed block (e.g., (2111)) in an image (e.g., (2101)), and a size of the boundary region can be (n−m)×(n−m). As described with reference to FIG. 21A, n is the side length (e.g., the width and/or the height) of the reconstructed block (e.g., (2111)), and m is a side length of the sub-boundary region (e.g., A1) for deblocking. One or more of the non-boundary regions (2121)-(2124) can be sent to the enhancement module to further increase a quality of the one or more of the non-boundary regions (2121)-(2124). The enhanced one or more of the non-boundary regions can replace the one or more of the non-boundary regions (2121)-(2124) in the image. Referring to FIG. 24, the non-boundary regions (2121)-(2124) are fed into the post-enhancement NN (2430) to generate enhanced non-boundary regions (2121′)-(2124′). The enhanced non-boundary regions (2121′)-(2124′) can replace the enhanced non-boundary regions (2121)-(2124) to generate the enhanced image (2450).

In an example, a non-boundary region overlaps with a boundary region such that a portion of the non-boundary region is in the boundary region. In an example, the non-boundary region is the entire coding block. Referring to FIG. 24, the block (2111) can be the non-boundary region, and thus the non-boundary region (2111) borders with other neighboring blocks, such as (2112)-(2113).

In some embodiments, the at least one enhancement NN are based on multiple enhancement models (e.g., post-enhancement models), respectively. Which of the multiple enhancement models to apply to a non-boundary region can be determined, for example, by a classification module. The non-boundary region can be enhanced with the determined enhancement model. In an example, which of the multiple enhancement models to apply is determined by a classification module that is based on a NN (e.g., also referred to as a classification NN), such as a DNN, a CNN, or the like. A classification module (e.g., a classification module (2510) used in the post-enhancement process (e.g., (2500)) can be identical to or different from a classification module (e.g., the classification module (2310) used in a deblocking process (e.g., (2300)). A classification module (e.g., a classification module (2510) used in the post-enhancement process can include NNs (e.g., DNN(s) or CNN(s)). In an example, a classification module (e.g., a classification module (2510) used in the post-enhancement process does not include a NN.

FIG. 25 shows an exemplary enhancement process (2500), such as a multi-model post-enhancement module according to an embodiment of the disclosure.

The classification module (2510) can classify the non-boundary regions (2121)-(2124) into one or more categories. For example, the non-boundary regions (2122)-(2123) are classified into a first category, and the non-boundary regions (2121) and (2124) are classified into a second category. Different enhancement models (e.g., post-enhancement models) can be applied to non-boundary regions in different categories. In FIG. 25, an enhancement NN (2530) can be used to perform enhancement, such as a multi-model enhancement based on multiple enhancement models (e.g., enhancement models 1-J). J is a positive integer. When J is 1, the enhancement NN (2530) includes a single enhancement model. When J is larger than 1, the enhancement NN (2530) includes multiple enhancement models.

In an example, the enhancement model 1 is applied to non-boundary region(s) (e.g., (2122)-(2123)) in the first category, and enhanced non-boundary region(s) (e.g., (2122″)-(2123″)) are generated. The enhancement model 2 is applied to non-boundary region(s) (e.g., (2121) and (2124)) in the second category, and enhanced non-boundary region(s) (e.g., (2121″) and (2124″)) are generated. The enhanced non-boundary regions (2121″)-(2124″) can replace the corresponding non-boundary regions (2121)-(2124) where an enhanced image (2550) includes the enhanced non-boundary regions (2121″)-(2124″) and the boundary regions A-D.

Any suitable metrics can be applied to classify or categorize a non-boundary region. In an example, a non-boundary region is classified according to content of the non-boundary region. For example, a non-boundary region with a high frequency content (e.g., content with a relatively large variance) and a non-boundary region with a low frequency content (e.g., content with a relatively small variance) are classified into different categories corresponding to different enhancement models.

An image can be enhanced at a block-level, as described with reference to FIGS. 21-25. An enhancement model (e.g., a post-enhancement model) can enhance an entire image. FIG. 26 shows an exemplary image-level enhancement process (2600) to enhance an entire image according to an embodiment of the disclosure. The image (2101) includes the non-boundary regions (2121)-(2124) and the boundary regions A-D, as describe in FIG. 21A. In an example, the image (2101) is a reconstructed image including the reconstructed blocks (2111)-(2114), as described above. Artifact in boundary regions can be reduced, and non-boundary regions can be enhanced with improved visual quality.

Referring to FIG. 26, the image (2101) including the boundary regions A-D and the non-boundary regions (2121)-(2124) can be fed into an enhancement module (2630). The enhancement module (2630) can generate enhanced boundary regions E-H corresponding to the boundary regions A-D, respectively, for example, by deblocking the boundary regions A-D. The enhancement module (2630) can generate enhanced non-boundary regions (2621)-(2624) corresponding to the non-boundary regions (2121)-(2124), respectively. The enhanced boundary regions E-H can replace the boundary regions A-D, respectively, and the enhanced non-boundary regions (2621)-(2624) can replace the non-boundary regions (2121)-(2124), respectively, and thus an enhanced image (2650) is generated based on the reconstructed image (2101).

In an example, the image based enhancement module (2630) includes an enhancement NN that can perform both deblocking and enhancement. In an example, the image based enhancement module (2630) includes an enhancement NN that can perform enhancement and a deblocking NN that can perform deblocking.

The enhancement modules (e.g., (2430), (2530), and (2630)) described with reference to FIGS. 24-26 can enhance quality of an image. The enhancement modules (e.g., (2430), (2530), and (2630)) can include one or more convolution layers. CNN-based attention mechanism (e.g., non-local attention, SENet), a ResNet (e.g., including a set of CNNs or convnets and an activation function), and/or the like may be used. For example, a DNN used by image super-resolution can be used, for example, by changing an output size to be identical to an input size.

Boundary regions and non-boundary regions in an image can be processed by an enhancement NN and a deblocking NN in any suitable order, such as sequentially or concurrently. In an example, the boundary regions are deblocked by the deblocking NN, and subsequently, the non-boundary regions are processed by the enhancement NN. In an example, the non-boundary regions are processed by the enhancement NN, and subsequently, the boundary regions are deblocked by the deblocking NN.

According to an embodiment of the disclosure, an enhancement NN (e.g., (2430), (2530), or (2630)), a deblocking NN (e.g., (2130) or (2330)), and/or a classification NN (e.g., (2310) or (2510)) can include any neural network architecture, can include any number of layers, can include one or more sub-neural networks, as described in the disclosure, and can be trained with any suitable training images or training blocks. The training images can include raw images or images including residue data. The training blocks can be from raw images or images including residue data.

Content-adaptive online training can be applied to update one or more pretrained parameters in one of the enhancement NN (e.g., (2430), (2530), or (2630)), the deblocking NN (e.g., (2130) or (2330)), and/or the classification NN (e.g., (2310) or (2510)), as described in the disclosure.

The enhancement NN (e.g., (2430), (2530), or (2630)), the deblocking NN (e.g., (2130) or (2330)), and/or the classification NN (e.g., (2310) or (2510)) can be trained separately, for example, a single deblocking NN is trained to determine pretrained parameters in the deblocking NN. The enhancement NN (e.g., (2430), (2530), or (2630)), the deblocking NN (e.g., (2130) or (2330)), and/or the classification NN (e.g., (2310) or (2510)) can be trained (either pretrained or trained online) as a component in a NIC framework. For example, the NIC framework (900) and at least one of the enhancement NN (e.g., (2430), (2530), or (2630)), the deblocking NN (e.g., (2130) or (2330)), and/or the classification NN (e.g., (2310) or (2510)) can be trained jointly.

The enhancement process (e.g., (2400), (2500), or (2600)) can be referred to as the post-enhancement process, for example, as the enhancement process is performed after blocks are reconstructed. For the same reason, the enhancement module (e.g., (2430), (2530), or (2630)) can be referred to as the post-enhancement module or the post-enhancement NN.

In some examples, the reconstructed image (2101) include residue data.

Shared samples in two overlapped regions can be modified in different processes, for example, by an enhancement module and a deblocking module. FIG. 27 shows an example of shared samples according to an embodiment of the disclosure. FIG. 27 shows a portion of an image (2701). The image (2701) can be a reconstructed image by a video decoder (e.g., (1600B) or (1800)). A region (2710) and a region (2720) within the image (2701) share a region (2730) such that the shared region (2730) overlaps the region (2710) and the region (2720). Samples within the shared region (2730) are shared samples by the regions (2710) and (2720). In an example, the region (2710) is modified by a deblocking module, and the region (2720) is modified by an enhancement module.

Sample values of the shared samples from the enhancement module are denoted as Pi where i can be 1, 2, . . . and K and K is a number of the shared samples in the shared region (2730). Sample values of the shared samples from the deblocking module are denoted as Di. A weighted average can be applied to determine final samples values (denoted as Ai) of the shared samples. The process is referred to as a pixel blending at a boundary region. For example, Ai=wi*Pi+(1−wi)*Di, where wi is a weight parameter designed for a sample position i in the shared region (2730). In an example, wi is set to be 0.5, and is identical for different sample positions. In an example, for different positions, weights can be different. wi can depend on positions of the sample within the two regions (e.g., (2710) and (2720)). For example, the sample 51 is located at an edge of the region (2710), and is located at a column away from an edge of the region (2720). Thus, the sample 51 is located closer to a center of the region (2720) than to a center of the region (2710). For the sample S1, a larger weight is assigned to P1. For example, A1=5/8*P1+3/8*D1. For example, the sample S2 is located at the edge of the region (2720), and is located at a column away from the edge of the region (2721). Thus, the sample S2 is located closer to the center of the region (2710) than to the center of the region (2720). For the sample S2, a larger weight is assigned to P2. For example, A2=3/8*P2+5/8*D2.

The above description can be adapted and applied when more than two regions include a shared region. The above description can be adapted and applied when multiple regions include boundary regions that are deblocked, non-boundary regions that are enhanced, or a combination of boundary regions that are deblocked and non-boundary regions that are enhanced.

A shared sample can be located in an overlapping portion of boundary regions, or located in an overlapping portion of a boundary region and a non-boundary region. As described above, a non-boundary region can be enhanced with an enhancement NN, and a boundary region can be deblocked. A value of the shared sample can be replaced with a weighted average of values of the overlapping portion. For example, a value of the shared sample can be replaced with a weighted value of a value of the shared sample in the deblocked boundary region and a value of the shared sample in the enhanced non-boundary region.

FIG. 28 shows a flow chart outlining a process (2800) according to an embodiment of the disclosure. The process (2800) can be used in the reconstruction of an encoded block. In various embodiments, the process (2800) is executed by processing circuitry, such as the processing circuitry in the terminal devices (310), (320), (330) and (340), the processing circuitry that performs functions of the video decoder (1600B), the processing circuitry that performs functions of the video decoder (1800). In an example, the processing circuitry performs a combination of functions of (i) one of the video decoder (410), the video decoder (510), and the video decoder (810) and (ii) one of the video decoder (1600B) or the video decoder (1800). In some embodiments, the process (2800) is implemented in software instructions, thus when the processing circuitry executes the software instructions, the processing circuitry performs the process (2800). The process starts at (S2801), and proceeds to (S2010).

At (S2810), blocks of an image can be reconstructed from a coded video bitstream using any suitable method. The blocks can be reconstructed by a video decoder (e.g., (1600B) or (1800)) based on NNs, such as CNNs. In an example, replacement parameters for pretrained parameters in the video decoder can be signaled in the coded video bitstream, and the video decoder is updated. The updated video decoder can reconstruct the blocks in the image.

At (S2820), post-processing can be performed on one of a plurality of regions of first two neighboring reconstructed blocks of the reconstructed blocks with at least one post-processing NN. The first two neighboring reconstructed blocks (e.g., (2111) and (2113) in FIG. 21A) can have a first shared boundary (e.g., (2141)) and include a boundary region (e.g., the boundary region A) having samples on both sides of the first shared boundary. The plurality of regions of the first two neighboring reconstructed blocks can include the boundary region (e.g., the boundary region A) and non-boundary regions (e.g., (2121) and (2123)) that are outside the boundary region, such as described with reference to FIGS. 21A-21C and 22-27.

In an example, the one of the plurality regions is the boundary region, the at least one post-processing NN includes at least one deblocking NN, and deblocking can be performed on the boundary region with the at least one deblocking NN. The boundary region can be replaced with the deblocked boundary region, such as that described in FIGS. 21A-21C.

In an example, the boundary region (e.g., the boundary region AB in FIG. 22) further includes samples on both sides of a second shared boundary (e.g., (2142)) between second two neighboring reconstructed blocks (e.g., (2112) and (2114)) of the reconstructed blocks, and the first two neighboring reconstructed blocks (e.g., (2111) and (2113)) are different from the second two neighboring reconstructed blocks (e.g., (2112) and (2114)), as described in FIG. 22.

In an example, the at least one deblocking NN (e.g., (2330)) are based on multiple deblocking models, respectively. Which of the multiple deblocking models to apply to the boundary region can be determined. Deblocking can be performed on the boundary region with the determined deblocking model, as described in FIG. 23.

In an example, the at least one post-processing NN includes at least one enhancement NN (e.g., (2430)). One of the non-boundary regions can be enhanced with the at least one enhancement NN, as described in FIGS. 24-25.

In an example, deblocking can be performed on the boundary region, and the non-boundary regions are enhanced, as described in FIG. 26.

At (S2030), the one of the plurality of regions can be replaced with the post-processed one of the plurality of regions of the first two neighboring reconstructed blocks, as described with references to FIGS. 21A-21C and 22-26.

The process (2800) proceeds to (S2899), and terminates.

The process (2800) can be suitably adapted to various scenarios and steps in the process (2800) can be adjusted accordingly. One or more of the steps in the process (2800) can be adapted, omitted, repeated, and/or combined. Any suitable order can be used to implement the process (2800). Additional step(s) can be added.

Embodiments in the disclosure may be used separately or combined in any order. Further, each of the methods (or embodiments), an encoder, and a decoder may be implemented by processing circuitry (e.g., one or more processors or one or more integrated circuits). In one example, the one or more processors execute a program that is stored in a non-transitory computer-readable medium.

This disclosure does not put any restrictions on methods used for an encoder such as a neural network based encoder, a decoder such as a neural network based decoder. Neural network(s) used in an encoder, a decoder, and/or the like can be any suitable types of neural network(s), such as a DNN, a CNN, and the like.

Thus, the content-adaptive online training methods of this disclosure can accommodate different types of NIC frameworks, e.g., different types of encoding DNNs, decoding DNNs, encoding CNNs, decoding CNNs, and/or the like.

The techniques described above, can be implemented as computer software using computer-readable instructions and physically stored in one or more computer-readable media. For example, FIG. 29 shows a computer system (2900) suitable for implementing certain embodiments of the disclosed subject matter.

The computer software can be coded using any suitable machine code or computer language, that may be subject to assembly, compilation, linking, or like mechanisms to create code comprising instructions that can be executed directly, or through interpretation, micro-code execution, and the like, by one or more computer central processing units (CPUs), Graphics Processing Units (GPUs), and the like.

The instructions can be executed on various types of computers or components thereof, including, for example, personal computers, tablet computers, servers, smartphones, gaming devices, internet of things devices, and the like.

The components shown in FIG. 29 for computer system (2900) are exemplary in nature and are not intended to suggest any limitation as to the scope of use or functionality of the computer software implementing embodiments of the present disclosure. Neither should the configuration of components be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary embodiment of a computer system (2900).

Computer system (2900) may include certain human interface input devices. Such a human interface input device may be responsive to input by one or more human users through, for example, tactile input (such as: keystrokes, swipes, data glove movements), audio input (such as: voice, clapping), visual input (such as: gestures), olfactory input (not depicted). The human interface devices can also be used to capture certain media not necessarily directly related to conscious input by a human, such as audio (such as: speech, music, ambient sound), images (such as: scanned images, photographic images obtain from a still image camera), video (such as two-dimensional video, three-dimensional video including stereoscopic video).

Input human interface devices may include one or more of (only one of each depicted): keyboard (2901), mouse (2902), trackpad (2903), touch screen (2910), data-glove (not shown), joystick (2905), microphone (2906), scanner (2907), camera (2908).

Computer system (2900) may also include certain human interface output devices. Such human interface output devices may be stimulating the senses of one or more human users through, for example, tactile output, sound, light, and smell/taste. Such human interface output devices may include tactile output devices (for example tactile feedback by the touch-screen (2910), data-glove (not shown), or joystick (2905), but there can also be tactile feedback devices that do not serve as input devices), audio output devices (such as: speakers (2909), headphones (not depicted)), visual output devices (such as screens (2910) to include CRT screens, LCD screens, plasma screens, OLED screens, each with or without touch-screen input capability, each with or without tactile feedback capability—some of which may be capable to output two dimensional visual output or more than three dimensional output through means such as stereographic output; virtual-reality glasses (not depicted), holographic displays and smoke tanks (not depicted)), and printers (not depicted).

Computer system (2900) can also include human accessible storage devices and their associated media such as optical media including CD/DVD ROM/RW (2920) with CD/DVD or the like media (2921), thumb-drive (2922), removable hard drive or solid state drive (2923), legacy magnetic media such as tape and floppy disc (not depicted), specialized ROM/ASIC/PLD based devices such as security dongles (not depicted), and the like.

Those skilled in the art should also understand that term “computer readable media” as used in connection with the presently disclosed subject matter does not encompass transmission media, carrier waves, or other transitory signals.

Computer system (2900) can also include an interface (2954) to one or more communication networks (2955). Networks can for example be wireless, wireline, optical. Networks can further be local, wide-area, metropolitan, vehicular and industrial, real-time, delay-tolerant, and so on. Examples of networks include local area networks such as Ethernet, wireless LANs, cellular networks to include GSM, 3G, 4G, 5G, LTE and the like, TV wireline or wireless wide area digital networks to include cable TV, satellite TV, and terrestrial broadcast TV, vehicular and industrial to include CANBus, and so forth. Certain networks commonly require external network interface adapters that attached to certain general purpose data ports or peripheral buses (2949) (such as, for example USB ports of the computer system (2900)); others are commonly integrated into the core of the computer system (2900) by attachment to a system bus as described below (for example Ethernet interface into a PC computer system or cellular network interface into a smartphone computer system). Using any of these networks, computer system (2900) can communicate with other entities. Such communication can be uni-directional, receive only (for example, broadcast TV), uni-directional send-only (for example CANbus to certain CANbus devices), or bi-directional, for example to other computer systems using local or wide area digital networks. Certain protocols and protocol stacks can be used on each of those networks and network interfaces as described above.

Aforementioned human interface devices, human-accessible storage devices, and network interfaces can be attached to a core (2940) of the computer system (2900).

The core (2940) can include one or more Central Processing Units (CPU) (2941), Graphics Processing Units (GPU) (2942), specialized programmable processing units in the form of Field Programmable Gate Areas (FPGA) (2943), hardware accelerators for certain tasks (2944), graphics adapters (2950), and so forth. These devices, along with Read-only memory (ROM) (2945), Random-access memory (2946), internal mass storage such as internal non-user accessible hard drives, SSDs, and the like (2947), may be connected through a system bus (2948). In some computer systems, the system bus (2948) can be accessible in the form of one or more physical plugs to enable extensions by additional CPUs, GPU, and the like. The peripheral devices can be attached either directly to the core's system bus (2948), or through a peripheral bus (2949). In an example, the screen (2910) can be connected to the graphics adapter (2950). Architectures for a peripheral bus include PCI, USB, and the like.

CPUs (2941), GPUs (2942), FPGAs (2943), and accelerators (2944) can execute certain instructions that, in combination, can make up the aforementioned computer code. That computer code can be stored in ROM (2945) or RAM (2946). Transitional data can be also be stored in RAM (2946), whereas permanent data can be stored for example, in the internal mass storage (2947). Fast storage and retrieve to any of the memory devices can be enabled through the use of cache memory, that can be closely associated with one or more CPU (2941), GPU (2942), mass storage (2947), ROM (2945), RAM (2946), and the like.

The computer readable media can have computer code thereon for performing various computer-implemented operations. The media and computer code can be those specially designed and constructed for the purposes of the present disclosure, or they can be of the kind well known and available to those having skill in the computer software arts.

As an example and not by way of limitation, the computer system having architecture (2900), and specifically the core (2940) can provide functionality as a result of processor(s) (including CPUs, GPUs, FPGA, accelerators, and the like) executing software embodied in one or more tangible, computer-readable media. Such computer-readable media can be media associated with user-accessible mass storage as introduced above, as well as certain storage of the core (2940) that are of non-transitory nature, such as core-internal mass storage (2947) or ROM (2945). The software implementing various embodiments of the present disclosure can be stored in such devices and executed by core (2940). A computer-readable medium can include one or more memory devices or chips, according to particular needs. The software can cause the core (2940) and specifically the processors therein (including CPU, GPU, FPGA, and the like) to execute particular processes or particular parts of particular processes described herein, including defining data structures stored in RAM (2946) and modifying such data structures according to the processes defined by the software. In addition or as an alternative, the computer system can provide functionality as a result of logic hardwired or otherwise embodied in a circuit (for example: accelerator (2944)), which can operate in place of or together with software to execute particular processes or particular parts of particular processes described herein. Reference to software can encompass logic, and vice versa, where appropriate. Reference to a computer-readable media can encompass a circuit (such as an integrated circuit (IC)) storing software for execution, a circuit embodying logic for execution, or both, where appropriate. The present disclosure encompasses any suitable combination of hardware and software.

Appendix A: Acronyms

• JEM: joint exploration model
• VVC: versatile video coding
• BMS: benchmark set
• MV: Motion Vector
• HEVC: High Efficiency Video Coding
• SEI: Supplementary Enhancement Information
• VUI: Video Usability Information
• GOPs: Groups of Pictures
• TUs: Transform Units,
• PUs: Prediction Units
• CTUs: Coding Tree Units
• CTBs: Coding Tree Blocks
• PBs: Prediction Blocks
• HRD: Hypothetical Reference Decoder
• SNR: Signal Noise Ratio
• CPUs: Central Processing Units
• GPUs: Graphics Processing Units
• CRT: Cathode Ray Tube
• LCD: Liquid-Crystal Display
• OLED: Organic Light-Emitting Diode
• CD: Compact Disc
• DVD: Digital Video Disc
• ROM: Read-Only Memory
• RAM: Random Access Memory
• ASIC: Application-Specific Integrated Circuit
• PLD: Programmable Logic Device
• LAN: Local Area Network
• GSM: Global System for Mobile communications
• LTE: Long-Term Evolution
• CANBus: Controller Area Network Bus
• USB: Universal Serial Bus
• PCI: Peripheral Component Interconnect
• FPGA: Field Programmable Gate Areas
• SSD: solid-state drive
• IC: Integrated Circuit
• CU: Coding Unit
• NIC: Neural Image Compression
• R-D: Rate-Distortion
• E2E: End to End
• ANN: Artificial Neural Network
• DNN: Deep Neural Network
• CNN: Convolution Neural Network

While this disclosure has described several exemplary embodiments, there are alterations, permutations, and various substitute equivalents, which fall within the scope of the disclosure. It will thus be appreciated that those skilled in the art will be able to devise numerous systems and methods which, although not explicitly shown or described herein, embody the principles of the disclosure and are thus within the spirit and scope thereof.

Claims

1. A method for video decoding in a video decoder, comprising: reconstructing blocks of an image from a coded video bitstream;performing post-processing on one of a plurality of regions of first two neighboring reconstructed blocks of the reconstructed blocks with at least one post-processing neural network (NN), the first two neighboring reconstructed blocks having a first shared boundary and including a boundary region having samples on both sides of the first shared boundary, the plurality of regions of the first two neighboring reconstructed blocks including the boundary region and non-boundary regions that are outside the boundary region; andreplacing the one of the plurality of regions with the post-processed one of the plurality of regions of the first two neighboring reconstructed blocks.

2. The method of claim 1, wherein the one of the plurality regions is the boundary region,the at least one post-processing NN includes at least one deblocking NN,the performing the post-processing includes performing deblocking on the boundary region with the at least one deblocking NN, andthe replacing includes replacing the boundary region with the deblocked boundary region.

3. The method of claim 2, wherein the boundary region further includes samples on both sides of a second shared boundary between second two neighboring reconstructed blocks of the reconstructed blocks, andthe first two neighboring reconstructed blocks are different from the second two neighboring reconstructed blocks.

4. The method of claim 2, wherein the at least one deblocking NN are based on multiple deblocking models, respectively, andthe performing deblocking further includes: determining which of the multiple deblocking models to apply to the boundary region, andperforming deblocking on the boundary region with the determined deblocking model.

5. The method of claim 4, wherein the determining which of the multiple deblocking models to apply is performed by a classification NN.

6. The method of claim 1, wherein the at least one post-processing NN includes at least one enhancement NN,the performing the post-processing includes enhancing one of the non-boundary regions with the at least one enhancement NN, andthe replacing includes replacing the one of the non-boundary regions with the enhanced one of the non-boundary regions.

7. The method of claim 6, wherein the at least one enhancement NN are based on multiple enhancement models, respectively, andthe enhancing further includes: determining which of the multiple enhancement models to apply to the one of the non-boundary regions, andenhancing the one of the non-boundary regions with the determined enhancement model.

8. The method of claim 1, wherein the performing includes performing deblocking on the boundary region, andenhancing the non-boundary regions, andthe replacing includes replacing the boundary region with the deblocked boundary region, andreplacing the non-boundary regions with the enhanced non-boundary regions, respectively.

9. The method of claim 2, wherein a shared sample is located in the boundary region and one of the non-boundary regions,the at least one post-processing NN further includes at least one enhancement NN,the performing the post-processing further includes enhancing the one of the non-boundary regions with the at least one enhancement NN, andthe replacing further includes replacing the one of the non-boundary regions with the enhanced one of the non-boundary regions, a value of the shared sample being replaced with a weighted average of a value of the shared sample in the deblocked boundary region and a value of the shared sample in the enhanced one of the non-boundary regions.

10. The method of claim 1, wherein the method further includes decoding neural network update information in the coded video bitstream, the neural network update information corresponding to one of the blocks and indicating a replacement parameter corresponding to a pretrained parameter in a neural network in the video decoder; andthe reconstructing the blocks includes reconstructing the one of the blocks based on the neural network updated with the replacement parameter.

11. An apparatus for video decoding, comprising: processing circuitry configured to: reconstruct blocks of an image from a coded video bitstream;perform post-processing on one of a plurality of regions of first two neighboring reconstructed blocks of the reconstructed blocks with at least one post-processing neural network (NN), the first two neighboring reconstructed blocks having a first shared boundary and including a boundary region having samples on both sides of the first shared boundary, the plurality of regions of the first two neighboring reconstructed blocks including the boundary region and non-boundary regions that are outside the boundary region; andreplace the one of the plurality of regions with the post-processed one of the plurality of regions of the first two neighboring reconstructed blocks.

12. The apparatus of claim 11, wherein the one of the plurality regions is the boundary region,the at least one post-processing NN includes at least one deblocking NN, andthe processing circuitry is configured to: perform deblocking on the boundary region with the at least one deblocking NN, andreplace the boundary region with the deblocked boundary region.

13. The apparatus of claim 12, wherein the boundary region further includes samples on both sides of a second shared boundary between second two neighboring reconstructed blocks of the reconstructed blocks, andthe first two neighboring reconstructed blocks are different from the second two neighboring reconstructed blocks.

14. The apparatus of claim 12, wherein the at least one deblocking NN are based on multiple deblocking models, respectively, andthe processing circuitry is configured to: determine which of the multiple deblocking models to apply to the boundary region, andperform deblocking on the boundary region with the determined deblocking model.

15. The apparatus of claim 11, wherein the at least one post-processing NN includes at least one enhancement NN, andthe processing circuitry is configured to: enhance one of the non-boundary regions with the at least one enhancement NN, andreplace the one of the non-boundary regions with the enhanced one of the non-boundary regions.

16. The apparatus of claim 15, wherein the at least one enhancement NN are based on multiple enhancement models, respectively, andthe processing circuitry is configured to: determine which of the multiple enhancement models to apply to the one of the non-boundary regions, andenhance the one of the non-boundary regions with the determined enhancement model.

17. The apparatus of claim 11, wherein the processing circuitry is configured to: perform deblocking on the boundary region,enhance the non-boundary regions,replace the boundary region with the deblocked boundary region, andreplace the non-boundary regions with the enhanced non-boundary regions, respectively.

18. The apparatus of claim 12, wherein a shared sample is located in the boundary region and one of the non-boundary regions,the at least one post-processing NN further includes at least one enhancement NN, andthe processing circuitry is configured to: enhance the one of the non-boundary regions with the at least one enhancement NN, andreplace the one of the non-boundary regions with the enhanced one of the non-boundary regions, a value of the shared sample being replaced with a weighted average of a value of the shared sample in the deblocked boundary region and a value of the shared sample in the enhanced one of the non-boundary regions.

19. The apparatus of claim 11, wherein the processing circuitry is configured to: decode neural network update information in the coded video bitstream, the neural network update information corresponding to one of the blocks and indicating a replacement parameter corresponding to a pretrained parameter in a neural network in the video decoder; andreconstruct the one of the blocks based on the neural network updated with the replacement parameter.

20. A non-transitory computer-readable storage medium storing a program executable by at least one processor to perform: reconstructing blocks of an image from a coded video bitstream;performing post-processing on one of a plurality of regions of first two neighboring reconstructed blocks of the reconstructed blocks with at least one post-processing neural network (NN), the first two neighboring reconstructed blocks having a first shared boundary and including a boundary region having samples on both sides of the first shared boundary, the plurality of regions of the first two neighboring reconstructed blocks including the boundary region and non-boundary regions that are outside the boundary region; andreplacing the one of the plurality of regions with the post-processed one of the plurality of regions of the first two neighboring reconstructed blocks.