Video coding and decoding method and device
By using advanced syntax to control explicit and implicit multi-transform selection in video decoder, combining NSST and MIP, the transformation type of intra-encoded blocks is optimized, and the problem of inefficient video encoding and decoding in the prior art is solved, and the improvement is achieved Efficient video signal compression.
Patent Information
- Application Number
- CN202411170843.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2020-05-19
- Filing Date
- 2020-05-22
- Publication Date
- 2024-11-19
AI Technical Summary
Existing video encoding and decoding technologies have problems with inefficiency when compressing video signals, especially in intra-coding and motion compensation prediction. It is difficult to effectively utilize advanced syntax control to optimize transformation selection, resulting in low encoding efficiency.
Enable or disable explicit multi-transform selection (MTS) by receiving high-level syntax elements and enable implicit MTS in intra-encoded blocks, determine the transformation type based on the size of intra-encoded blocks, combined with inseparable quadratic transformation (NSST) and matrix-based intra prediction (MIP) to optimize transform encoding.
It improves the encoding efficiency of video encoding and decoding, reduces bit rate and storage requirements, enhances the compression ability of video signals, and is suitable for high resolution and high frame rate video data.
Smart Images

Figure CN118984384A_ABST
Abstract
Description
[0001] Incorporated herein by reference
[0002] This application claims priority to U.S. Patent Application No. 16 / 878,390, filed on May 19, 2020, entitled “Video Codec Method and Apparatus,” which claims priority to U.S. Provisional Application No. 62 / 860,149, filed on June 11, 2019, entitled “Advanced Syntax Control Enabling Implicit Transform Selection.” The disclosure of the prior application is incorporated herein by reference in its entirety. Technical Field
[0003] This disclosure describes embodiments that generally relate to video encoding and decoding. Background Art
[0004] Video encoding and decoding can be performed using inter-picture prediction with motion compensation. An uncompressed digital video can include a series of pictures, each picture having spatial dimensions of, for example, 1920×1080 luma samples and associated chroma samples. The series of pictures can have a fixed or variable picture rate (also informally referred to as a frame rate), such as 60 pictures per second or 60Hz. Uncompressed video has very high bitrate requirements. For example, 1080p60 4:2:0 video (1920x1080 luma sample resolution at 60Hz frame rate) with 8 bits per sample requires close to 1.5Gbit / s of bandwidth. One hour of such video requires more than 600GB of storage space.
[0005] One goal of video encoding and decoding is to reduce the redundancy of the input video signal through compression. Compression can help reduce the bandwidth or storage space requirements mentioned above, in some cases by two or more orders of magnitude. Both lossless and lossy compression, and combinations of the two, can be used. Lossless compression refers to the technique of reconstructing an exact copy of the original signal from the compressed original signal. When lossy compression is used, the reconstructed signal may not be exactly the same as the original signal, but the distortion between the original and the reconstructed signal is small enough that the reconstructed signal can be used for the intended application. Lossy compression is widely used in video. The amount of distortion allowed depends on the application. For example, users of some consumer streaming applications can tolerate higher distortion than users of television applications. The achievable compression ratio reflects that higher allowed / tolerable distortion produces higher compression ratios.
[0006] Video encoders and decoders may utilize several broad categories of techniques including, for example: motion compensation, transforms, quantization, and entropy coding.
[0007] Video codec techniques may include known intra-frame coding techniques. In intra-frame coding, sample values are represented without reference to samples or other data of previously reconstructed reference pictures. In some video codecs, pictures are spatially subdivided into sample blocks. When all sample blocks are coded and decoded in intra-frame mode, the picture may be an intra-frame picture. Intra-frame pictures and their derivatives (e.g., independent decoder refresh pictures) may be used to reset decoder states, and may therefore be used as the first picture in an encoded video bitstream and video session, or as a still image. Samples of intra-frame blocks may be used for transformation, and transform coefficients may be quantized before entropy coding. Intra-frame prediction may be a technique for minimizing sample values in a pre-transform domain. In some cases, the smaller the transformed DC value and the smaller the AC coefficient, the fewer bits are required to represent the entropy-coded block at a given quantization step size.
[0008] Conventional intra-frame codecs, as known from codecs such as MPEG-2, do not use intra-frame prediction. However, some newer video compression techniques include techniques that attempt to derive data blocks from, for example, surrounding sample data and / or metadata that are obtained during encoding / decoding of spatially neighboring blocks and before the decoding order. Such techniques have subsequently been referred to as "intra-frame prediction" techniques. It should be noted that, at least in some cases, intra-frame prediction uses only reference data of the current picture being reconstructed, and not reference data of reference pictures.
[0009] There can be many different forms of intra prediction. When more than one such technique can be used in a given video codec, the techniques used can be coded per intra prediction mode. In some cases, a mode can have sub-modes and / or parameters, and these modes can be coded individually or contained in a mode codeword. Which codeword is used for a given mode / sub-mode / parameter combination affects the codec efficiency gain obtained through intra prediction, and therefore the entropy coding technique used to convert the codewords into a bitstream.
[0010] H.264 introduced an intra prediction mode, which was improved in H.265 and further improved in newer codecs such as the Joint Exploitation Model (JEM), Versatile Video Codec (VVC), Benchmark Sets (BMS), etc. A prediction block can be formed using neighboring sample values belonging to samples that are already available. Sample values of neighboring samples are copied into the prediction block in a certain direction. A reference to the direction used can be encoded in the bitstream or can itself be predicted.
[0011] Motion compensation may be a lossy compression technique and may involve a technique where a block of sample data from a previously reconstructed picture or part of a reconstructed picture (reference picture) is used for prediction of a newly reconstructed picture or part of a picture after being spatially shifted in the direction indicated by a motion vector (hereinafter MV). In some cases, the reference picture may be the same as the picture currently being reconstructed. The MV may have two dimensions, X and Y, or three dimensions, where the third dimension indicates the reference picture being used (the latter may indirectly be the temporal dimension).
[0012] In some video compression techniques, the MV applied to a region of sample data can be predicted based on other MVs, such as those MVs related to another region of sample data that is spatially adjacent to the region being reconstructed and that precede the MV in decoding order. Doing so can greatly reduce the amount of data required to encode and decode the MV, thereby eliminating redundancy and increasing the amount of compression. MV prediction can be done efficiently, for example, because when encoding and decoding an input video signal derived from a camera (called natural video), there is a statistical probability that regions larger than the region applicable to a single MV move in a similar direction, so in some cases, similar motion vectors derived from MVs of adjacent regions can be used for prediction. This results in the MV found for a given region being similar or identical to the MV predicted from the surrounding MVs, and after entropy encoding and decoding, it can be represented with fewer bits than the number of bits used when the MV is directly encoded and decoded. In some cases, MV prediction can be an example of lossless compression of a signal (i.e., MV) derived from the original signal (i.e., sample stream). In other cases, MV prediction itself may be lossy, for example due to rounding errors generated when calculating predicted values based on several surrounding MVs.
[0013] H.265 / HEVC (ITU-T H.265 Recommendation, "High Efficiency Video Coding", December 2016) describes various MV prediction mechanisms. Among the various MV prediction mechanisms provided by H.265, this disclosure describes a technique referred to below as "spatial merging".
[0014] Reference Figure 1 , the current block (101) includes samples found by the encoder during motion search, which can be predicted based on a previous block of the same size that has been spatially shifted. The MV is not encoded or decoded directly, but instead the MV associated with any of the five surrounding samples is derived from metadata associated with one or more reference pictures, for example, the most recent (in decoding order) reference picture. The five surrounding samples are represented by A0, A1 and B0, B1, B2 (102 to 106 respectively). In H.265, MV prediction can use the prediction value of the same reference picture being used by the neighboring blocks. Summary of the invention
[0015] Aspects of the present disclosure provide a first method for performing video decoding at a video decoder. The method may include: receiving a first high-level syntax (HLS) element, the first HLS element indicating whether to enable or disable explicit multi-transform selection (MTS) for an intra-coded block; receiving a second HLS element, the second HLS element indicating whether to enable or disable the explicit MTS for an inter-coded block. The first HLS element and the second HLS element control the same group of coding blocks, the same group of coding blocks including the intra-coded blocks and the inter-coded blocks. When the first HLS element indicates that the explicit MTS is disabled for the intra-coded block, and the second HLS element indicates that the explicit MTS is enabled for the inter-coded block, implicit MTS is enabled for the intra-coded block.
[0016] An embodiment of the method may further include applying the implicit MTS to the intra-coded block. The transform type used to process the intra-coded block is determined according to the size of the intra-coded block. In various examples, the first HLS element or the second HLS element is one of: a video parameter set (VPS) syntax element, a sequence parameter set (SPS) syntax element, a picture parameter set (PPS) syntax element, a slice header syntax element, a tile header syntax element, or a tile group header syntax element. In an embodiment, the intra-coded block is not encoded using an intra sub-partitioning (ISP) mode. In an embodiment, the method may further include: receiving a third HLS element, the third HLS element indicating that MTS is enabled for each of the inter-coded block and the intra-coded block.
[0017] Aspects of the present disclosure provide a second method for performing video decoding at a video decoder. The second method may include: receiving a first HLS element, the first HLS element indicating whether explicit MTS is enabled or disabled for an intra-coded block; receiving a second HLS element, the second HLS element indicating whether non-separable secondary transform (NSST) or matrix-based intra prediction (MIP) is disabled or enabled for the intra-coded block. When the first HLS element indicates that the explicit MTS is disabled for the intra-coded block, and the second HLS element indicates that the NSST or the MIP is disabled for the intra-coded block, implicit MTS is enabled for the intra-coded block.
[0018] The present disclosure also provides a third method for performing video decoding at a video decoder. The third method may include: receiving an intra-coded block associated with a first block-level syntax element and a second block-level syntax element, wherein the first block-level syntax element indicates whether MTS is applied, and the second block-level syntax element indicates whether NSST is applied. When the first block-level syntax element indicates that the MTS is not applied, and the second block-level syntax element indicates that the NSST is not applied, implicit MTS is enabled for the intra-coded block.
[0019] Note that although the present application relates to NSST, the disclosed methods and systems can be applied to variants of NSST, such as reduced size transform (RST) and low frequency non-separable quadratic transform (LFNST). Therefore, NSST, RST and / or LFNST can be used interchangeably throughout the present application. BRIEF DESCRIPTION OF THE DRAWINGS
[0020] Other features, properties and various advantages of the disclosed subject matter will become more apparent from the following detailed description and accompanying drawings.
[0021] in:
[0022] Figure 1 Schematic diagram of the current block and its surrounding spatial merging candidates in an example.
[0023] Figure 2 is a schematic diagram of a simplified block diagram of a communication system according to an embodiment.
[0024] Figure 3 is a schematic diagram of a simplified block diagram of a communication system according to an embodiment.
[0025] Figure 4 is a schematic diagram of a simplified block diagram of a decoder according to an embodiment.
[0026] Figure 5 is a schematic diagram of a simplified block diagram of an encoder according to an embodiment.
[0027] Figure 6 A block diagram of an encoder according to another embodiment is shown.
[0028] Figure 7 A block diagram of a decoder according to another embodiment is shown.
[0029] Figures 8A-8D Example transform kernel matrices for 4-point, 8-point, 16-point, and 32-point DCT-2 according to embodiments are shown, respectively.
[0030] Figures 9A-9D Shown are sub-block types, sizes, and positions supported in a sub-block transform (SBT) according to an embodiment.
[0031] Fig.10 It is shown that the number of sub-partitions depends on the block size in the intra sub-partitioning (ISP) coding mode according to an embodiment.
[0032] Fig.11 An example of dividing a block into two sub-partitions in ISP encoding mode is shown.
[0033] Fig.12 An example of dividing a block into four sub-partitions in ISP encoding mode is shown.
[0034] Figures 13A-13E A 64x64 transform kernel matrix for a 64-point DCT-2 transform according to an embodiment is shown.
[0035] Fig.14 The transform basis functions of the DST / DCT transform according to the embodiment are shown.
[0036] Fig.15 A table illustrating a mapping relationship between an mts_idx value and a corresponding horizontal or vertical transform according to an embodiment is shown.
[0037] Figures 16A-16D A transform kernel matrix of a DST-7 transform type according to an embodiment is shown.
[0038] Figures 17A-17D A transform kernel matrix of a DCT-8 transform type according to an embodiment is shown.
[0039] Fig.18 An example of using a sequence parameter set (SPS) syntax element to control the use of multiple transform selection (MTS) is shown.
[0040] Fig.19 A mapping table between intra prediction modes and transform sets according to an embodiment is shown.
[0041] Figure 20-21 Two optional transform coding processes of RST8x8 using a 16x64 transform core and a 16x48 transform core respectively according to an embodiment are shown.
[0042] Fig. 22 An example CU level syntax table is shown, where a syntax element lfnst_idx is signaled at the end of the CU level syntax, indicating the selection of a Low Frequency Non-Separable Secondary Transform (LFNST) kernel.
[0043] Fig.23 A process of downscaling transformation and a process of inverse downscaling transformation according to an embodiment are shown.
[0044] Fig.24AThe entire upper left 8x8 coefficients of the residual block are shown (shaded sub-block), which are used as input to calculate the secondary transform in RST8x8.
[0045] Fig. 24B The top left three 4x4 sub-block coefficients (shaded sub-blocks) of the residual block are shown, which are used as input to calculate the secondary transform in RST8x8.
[0046] Fig.25 A table showing transform set selection based on intra prediction mode according to an embodiment is shown.
[0047] Fig.26 An example process for matrix-based intra prediction (MIP) mode is shown.
[0048] Fig. 27 A CU level syntax table according to an embodiment is shown, where a flag signaling a matrix-based intra prediction (MIP) mode is shown in a frame.
[0049] Figures 28A-28B The combination shows a text that specifies a transform coding process to perform an explicit or implicit transform selection on a current block based on relevant syntax elements received from a bitstream.
[0050] Fig.29 Modifications to the text are shown that correspond to an implicit transform enabled scheme, where implicit transforms for intra residual blocks and explicit transforms for inter residual blocks can coexist.
[0051] Fig.30 Modifications to the text are shown that correspond to the case where implicit transforms are enabled when the Non-Separable Quadratic Transform (NSST) is disabled.
[0052] Fig.31 Modifications to the text are shown that correspond to the case where implicit transforms are enabled when MIP is disabled.
[0053] Fig.32 A modification to the text is shown, which corresponds to the situation where neither MTS nor NSST is applied to the current block.
[0054] Fig.33 A modification to the text is shown that corresponds to the situation where none of MTS, NSST or MIP applies to the current block.
[0055] Figure 34-36 A flowchart of a transform coding process according to some embodiments of the present disclosure is shown.
[0056] Fig.37 is a schematic diagram of a computer system according to an embodiment. DETAILED DESCRIPTION
[0057] I. Encoders and decoders for video encoding and decoding
[0058] Figure 2 A simplified block diagram of a communication system (200) according to an embodiment of the present disclosure is shown. The communication system (200) includes a plurality of terminal devices that can communicate with each other via, for example, a network (250). For example, the communication system (200) includes a first pair of terminal devices (210) and (220) interconnected via the network (250). Figure 2 In an embodiment, a first pair of terminal devices (210) and (220) perform unidirectional data transmission. For example, the terminal device (210) may encode video data (e.g., a video picture stream collected by the terminal device (210)) for transmission to another terminal device (220) via the network (250). The encoded video data is transmitted in the form of one or more encoded video code streams. The terminal device (220) may receive the encoded video data from the network (250), decode the encoded video data to restore the video data, and display the video picture based on the restored video data. Unidirectional data transmission is more common in applications such as media services.
[0059] In another embodiment, the communication system (200) includes a second pair of terminal devices (230) and (240) that perform bidirectional transmission of encoded video data, which can occur, for example, during a video conference. For bidirectional data transmission, in one example, each of the terminal devices (230) and (240) can encode video data (e.g., a video picture stream collected by the terminal device) for transmission to the other terminal device (230) and (240) via the network (250). Each of the terminal devices (230) and (240) can also receive the encoded video data transmitted by the other terminal device (230) and (240), and can decode the encoded video data to restore the video data, and can display the video picture on an accessible display device based on the restored video data.
[0060] exist Figure 2In an embodiment of the present disclosure, the terminal devices (210), (220), (230) and (240) may be servers, personal computers and smart phones, but the principles of the present disclosure may not be limited thereto. Embodiments of the present disclosure are applicable to laptop computers, tablet computers, media players and / or dedicated video conferencing equipment. Network (250) represents any number of networks that transmit encoded video data between terminal devices (210), (220), (230) and (240), including, for example, wired (wired) and / or wireless communication networks. The communication network (250) may exchange data in circuit switching and / or packet switching channels. The network may include a telecommunications network, a local area network, a wide area network and / or the Internet. For the purposes of the present disclosure, unless explained below, the architecture and topology of the network (250) may be irrelevant to the operation of the present disclosure.
[0061] As an embodiment of the disclosed subject matter, Figure 3 The placement of the video encoder and video decoder in a streaming environment is shown. The disclosed subject matter is equally applicable to other video-enabled applications including, for example, video conferencing, digital TV, storing compressed video on digital media including CDs, DVDs, memory sticks, etc., and the like.
[0062] The streaming system may include an acquisition subsystem (313), which may include a video source (301) such as a digital camera, which creates an uncompressed video picture stream (302). In an embodiment, the video picture stream (302) includes samples taken by a digital camera. Compared to the encoded video data (304) (or the encoded video bitstream), the video picture stream (302) is depicted as a thick line to emphasize the high data volume of the video picture stream, and the video picture stream (302) can be processed by an electronic device (320), which includes a video encoder (303) coupled to the video source (301). The video encoder (303) may include hardware, software, or a combination of hardware and software to implement or implement various aspects of the disclosed subject matter as described in more detail below. Compared to the video picture stream (302), the encoded video data (304) (or the encoded video bitstream (304)) is depicted as a thin line to emphasize the lower amount of data of the encoded video data (304) (or the encoded video bitstream (304)), which can be stored on the streaming server (305) for future use. One or more streaming client subsystems, such as Figure 3A client subsystem (306) and a client subsystem (308) in a streaming server (305) may access a streaming server (305) to retrieve a copy (307) and a copy (309) of the encoded video data (304). The client subsystem (306) may include, for example, a video decoder (310) in an electronic device (330). The video decoder (310) decodes the incoming copy (307) of the encoded video data and generates an output video picture stream (311) that can be presented on a display (312) (e.g., a display screen) or another presentation device (not depicted). In some streaming systems, the encoded video data (304), the video data (307), and the video data (309) (e.g., a video bitstream) may be encoded according to certain video encoding / compression standards. Examples of such standards include ITU-T H.265. In an embodiment, the video codec standard under development is informally referred to as Versatile Video Coding (VVC), and the disclosed subject matter may be used in the context of the VVC standard.
[0063] It should be noted that the electronic device (320) and the electronic device (330) may include other components (not shown). For example, the electronic device (320) may include a video decoder (not shown), and the electronic device (330) may also include a video encoder (not shown).
[0064] Figure 4 A block diagram of a video decoder (410) according to an embodiment of the present disclosure is shown. The video decoder (410) may be provided in an electronic device (430). The electronic device (430) may include a receiver (431) (e.g., a receiving circuit). The video decoder (410) may be used to replace Figure 3 A video decoder (310) of an embodiment.
[0065] The receiver (431) may receive one or more encoded video sequences to be decoded by the video decoder (410); in the same or another embodiment, one encoded video sequence is received at a time, wherein the decoding of each encoded video sequence is independent of the other encoded video sequences. The encoded video sequence may be received from a channel (401), which may be a hardware / software link to a storage device storing the encoded video data. The receiver (431) may receive the encoded video data as well as other data, such as encoded audio data and / or auxiliary data streams that may be forwarded to their respective consuming entities (not shown). The receiver (431) may separate the encoded video sequence from the other data. To prevent network jitter, a buffer memory (415) may be coupled between the receiver (431) and the entropy decoder / parser (420) (hereinafter referred to as "parser (420)"). In some applications, the buffer memory (415) is part of the video decoder (410). In other cases, the buffer memory (415) may be provided external to the video decoder (410) (not shown). In other cases, a buffer memory (not shown) is provided outside the video decoder (410) to prevent network jitter, for example, and another buffer memory (415) may be configured inside the video decoder (410) to handle broadcast timing, for example. When the receiver (431) receives data from a storage / forward device with sufficient bandwidth and controllability or from an isochronous network, it may not be necessary to configure the buffer memory (415), or the buffer memory may be made smaller. Of course, in order to use on a service packet network such as the Internet, a buffer memory (415) may also be required, and the buffer memory may be relatively large and have an adaptive size, and may be at least partially implemented in an operating system or a similar element (not shown) outside the video decoder (410).
[0066] The video decoder (410) may include a parser (420) to reconstruct symbols (421) from the encoded video sequence. The types of symbols include information used to manage the operation of the video decoder (410) and potential information used to control a display device such as a display device (412) (e.g., a display screen) that is not part of the electronic device (430) but can be coupled to the electronic device (430), such as Figure 4As shown in . The control information for the display device may be a parameter set fragment (not indicated) of Supplemental Enhancement Information (SEI message) or Video Usability Information (VUI). The parser (420) may parse / entropy decode the received coded video sequence. The encoding of the coded video sequence may be performed according to a video coding technique or standard, and may follow various principles, including variable length coding, Huffman coding, arithmetic coding with or without context sensitivity, and the like. The parser (420) may extract a subgroup parameter set of at least one subgroup of the subgroups of pixels in the video decoder from the coded video sequence based on at least one parameter corresponding to the group. The subgroup may include a Group of Pictures (GOP), a picture, a tile, a slice, a macroblock, a Coding Unit (CU), a block, a Transform Unit (TU), a Prediction Unit (PU), and the like. The parser (420) may also extract information from the encoded video sequence, such as transform coefficients, quantizer parameter values, motion vectors, and so on.
[0067] The parser (420) may perform entropy decoding / parsing operations on the video sequence received from the buffer memory (415), thereby creating symbols (421).
[0068] Depending on the type of coded video picture or portion of coded video picture (e.g., inter- and intra-pictures, inter- and intra-blocks) and other factors, the reconstruction of the symbol (421) may involve multiple different units. Which units are involved and how they are involved may be controlled by subgroup control information parsed by the parser (420) from the coded video sequence. For the sake of brevity, such subgroup control information flow between the parser (420) and the multiple units below is not described.
[0069] In addition to the functional blocks already mentioned, the video decoder (410) can be conceptually subdivided into several functional units as described below. In a practical embodiment operating under commercial constraints, many of these units interact closely with each other and can be integrated with each other. However, for the purpose of describing the disclosed subject matter, the conceptual subdivision into the following functional units is appropriate.
[0070] The first unit is a sealer / inverse transform unit (451). The sealer / inverse transform unit (451) receives quantized transform coefficients as symbols (421) from the parser (420) and control information, including which transform method to use, block size, quantization factor, quantization scaling matrix, etc. The sealer / inverse transform unit (451) can output a block including sample values, which can be input into an aggregator (455).
[0071] In some cases, the output samples of the scaler / inverse transform unit (451) may belong to an intra-coded block; that is, a block that does not use predictive information from a previously reconstructed picture, but may use predictive information from a previously reconstructed portion of the current picture. Such predictive information may be provided by an intra-picture prediction unit (452). In some cases, the intra-picture prediction unit (452) generates a block of the same size and shape as the block being reconstructed using surrounding reconstructed information extracted from a current picture buffer (458). For example, the current picture buffer (458) buffers a partially reconstructed current picture and / or a fully reconstructed current picture. In some cases, the aggregator (455) adds the prediction information generated by the intra-prediction unit (452) to the output sample information provided by the scaler / inverse transform unit (451) on a per-sample basis.
[0072] In other cases, the output samples of the scaler / inverse transform unit (451) may belong to an inter-frame coded and potentially motion compensated block. In this case, the motion compensated prediction unit (453) may access the reference picture memory (457) to extract samples for prediction. After the extracted samples are motion compensated according to the symbols (421), these samples may be added to the output of the scaler / inverse transform unit (451) (in this case referred to as residual samples or residual signals) by the aggregator (455) to generate output sample information. The acquisition of the predicted samples by the motion compensated prediction unit (453) from the address in the reference picture memory (457) may be controlled by a motion vector, and the motion vector is provided to the motion compensated prediction unit (453) in the form of the symbols (421), for example, including X, Y and reference picture components. Motion compensation may also include interpolation of sample values extracted from the reference picture memory (457) when using sub-sample accurate motion vectors, motion vector prediction mechanisms, and the like.
[0073] The output samples of the aggregator (455) may be employed by various loop filtering techniques in a loop filter unit (456). The video compression techniques may include in-loop filter techniques controlled by parameters included in the encoded video sequence (also referred to as the encoded video bitstream) and available to the loop filter unit (456) as symbols (421) from the parser (420). However, in other embodiments, the video compression techniques may also be responsive to meta-information obtained during decoding of a previous (in decoding order) portion of an encoded picture or encoded video sequence, as well as to previously reconstructed and loop filtered sample values.
[0074] The output of the loop filter unit (456) may be a sample stream that may be output to a display device (412) and stored in a reference picture memory (457) for subsequent inter-picture prediction.
[0075] Once fully reconstructed, certain coded pictures may be used as reference pictures for future prediction. For example, once the coded picture corresponding to the current picture is fully reconstructed, and the coded picture is identified as a reference picture (e.g., by the parser (420)), the current picture buffer (458) may become part of the reference picture memory (457), and a new current picture buffer may be reallocated before starting to reconstruct a subsequent coded picture.
[0076] The video decoder (410) may perform decoding operations according to a predetermined video compression technique, such as in the ITU-T H.265 standard. The encoded video sequence may conform to the syntax specified by the video compression technique or standard used in the sense that the encoded video sequence follows the syntax of the video compression technique or standard and the profile recorded in the video compression technique or standard. Specifically, the profile may select certain tools from all the tools available in the video compression technique or standard as the only tools available for use under the profile. For compliance, the complexity of the encoded video sequence is also required to be within the range defined by the hierarchy of the video compression technique or standard. In some cases, the hierarchy limits the maximum picture size, the maximum frame rate, the maximum reconstruction sampling rate (measured in, for example, mega samples per second), the maximum reference picture size, etc. In some cases, the limits set by the hierarchy may be further limited by the Hypothetical Reference Decoder (HRD) specification and metadata of the HRD buffer management signaled in the encoded video sequence.
[0077] In an embodiment, the receiver (431) may receive additional (redundant) data along with the encoded video. The additional data may be part of the encoded video sequence. The additional data may be used by the video decoder (410) to properly decode the data and / or more accurately reconstruct the original video data. The additional data may be in the form of, for example, temporal, spatial or signal-to-noise ratio (SNR) enhancement layers, redundant slices, redundant pictures, forward error correction codes, etc.
[0078] Figure 5 A block diagram of a video encoder (503) according to an embodiment of the present disclosure is shown. The video encoder (503) is disposed in an electronic device (520). The electronic device (520) includes a transmitter (540) (e.g., a transmission circuit). The video encoder (503) can be used to replace Figure 3 A video encoder (303) in an embodiment.
[0079] The video encoder (503) can be used to obtain the video source (501) (not Figure 5 In another embodiment, the video source (501) is a part of the electronic device (520) to receive video samples, and the video source can collect video images to be encoded by the video encoder (503). In another embodiment, the video source (501) is a part of the electronic device (520).
[0080] The video source (501) may provide a source video sequence in the form of a digital video sample stream to be encoded by the video encoder (503), wherein the digital video sample stream may have any suitable bit depth (e.g., 8-bit, 10-bit, 12-bit, ...), any color space (e.g., BT.601 Y CrCB, RGB, ...), and any suitable sampling structure (e.g., Y CrCb 4:2:0, Y CrCb 4:4:4). In a media service system, the video source (501) may be a storage device storing previously prepared videos. In a video conferencing system, the video source (501) may be a camera that captures local image information as a video sequence. The video data may be provided as a plurality of separate pictures that are given motion when viewed sequentially. The pictures themselves may be constructed as a spatial pixel array, wherein each pixel may include one or more samples depending on the sampling structure, color space, etc. used. The relationship between pixels and samples may be easily understood by those skilled in the art. The following description focuses on the samples.
[0081] According to an embodiment, the video encoder (503) may encode and compress pictures of a source video sequence into an encoded video sequence (543) in real time or under any other time constraints required by the application. Implementing an appropriate encoding speed is a function of the controller (550). In some embodiments, the controller (550) controls other functional units as described below and is functionally coupled to these units. For the sake of simplicity, couplings are not shown in the figure. The parameters set by the controller (550) may include rate control related parameters (picture skipping, quantizer, lambda value of rate distortion optimization technology, etc.), picture size, group of pictures (GOP) layout, maximum motion vector search range, etc. The controller (550) can be used to have other suitable functions that are related to the video encoder (503) optimized for a certain system design.
[0082] In some embodiments, the video encoder (503) operates in an encoding loop. As a simplified description, in embodiments, the encoding loop may include a source encoder (530) (e.g., responsible for creating symbols, such as a symbol stream, based on an input picture to be encoded and a reference picture) and a (local) decoder (533) embedded in the video encoder (503). The decoder (533) reconstructs the symbols to create sample data in a manner similar to how the (remote) decoder creates sample data (because in the video compression techniques considered in the disclosed subject matter, any compression between the symbols and the encoded video code stream is lossless). The reconstructed sample stream (sample data) is input to a reference picture memory (534). Since the decoding of the symbol stream produces bit-accurate results that are independent of the decoder location (local or remote), the contents of the reference picture memory (534) are also bit-accurately corresponding between the local encoder and the remote encoder. In other words, the reference picture samples "seen" by the prediction part of the encoder are exactly the same as the sample values that the decoder will "see" when using the prediction during decoding. This basic principle of reference picture synchronization (and the drift that occurs when synchronization cannot be maintained, eg due to channel errors) is also used in some related techniques.
[0083] The operation of the "local" decoder (533) may be combined with, for example, Figure 4 The "remote" decoder described in detail for the video decoder (410) is identical. However, additional brief reference is made to Figure 4 , when symbols are available and the entropy encoder (545) and parser (420) are capable of losslessly encoding / decoding the symbols into an encoded video sequence, the entropy decoding portion of the video decoder (410), including the buffer memory (415) and the parser (420), may not be fully implemented in the local decoder (533).
[0084] At this point it can be observed that any decoder techniques other than parsing / entropy decoding present in the decoder must also be present in the corresponding encoder in substantially the same functional form. For this reason, the disclosed subject matter focuses on decoder operation. The description of encoder techniques can be simplified because encoder techniques are mutually inverse to the decoder techniques described comprehensively. A more detailed description is only required in certain areas and is provided below.
[0085] During operation, in some embodiments, the source encoder (530) may perform motion compensated predictive coding. The motion compensated predictive coding predictively encodes an input picture with reference to one or more previously encoded pictures from a video sequence designated as "reference pictures." In this manner, the encoding engine (532) encodes the differences between pixel blocks of the input picture and pixel blocks of a reference picture that may be selected as a prediction reference for the input picture.
[0086] The local video decoder (533) may decode the encoded video data that may be designated as a reference picture based on the symbol created by the source encoder (530). The operation of the encoding engine (532) may be a lossy process. When the encoded video data is available at the video decoder ( Figure 5 When the video sequence is decoded at a remote location (not shown), the reconstructed video sequence may typically be a copy of the source video sequence with some errors. The local video decoder (533) replicates the decoding process that may be performed by the video decoder on the reference picture and may cause the reconstructed reference picture to be stored in the reference picture cache (534). In this way, the video encoder (503) may locally store a copy of the reconstructed reference picture that has common content (absent transmission errors) with the reconstructed reference picture to be obtained by the remote video decoder.
[0087] The predictor (535) may perform a prediction search for the encoding engine (532). That is, for a new picture to be encoded, the predictor (535) may search the reference picture memory (534) for sample data (as candidate reference pixel blocks) or certain metadata, such as reference picture motion vectors, block shapes, etc., that may serve as appropriate prediction references for the new picture. The predictor (535) may operate pixel-by-pixel based on sample blocks to find a suitable prediction reference. In some cases, based on the search results obtained by the predictor (535), it may be determined that the input picture may have prediction references taken from a plurality of reference pictures stored in the reference picture memory (534).
[0088] The controller (550) may manage encoding operations of the source encoder (530), including, for example, setting parameters and subgroup parameters for encoding video data.
[0089] The outputs of all the above functional units may be entropy encoded in an entropy encoder (545). The entropy encoder (545) performs lossless compression on the symbols generated by the various functional units according to techniques such as Huffman coding, variable length coding, arithmetic coding, etc., thereby converting the symbols into a coded video sequence.
[0090] The transmitter (540) may buffer the encoded video sequence created by the entropy encoder (545) in preparation for transmission over a communication channel (560), which may be a hardware / software link to a storage device where the encoded video data will be stored. The transmitter (540) may combine the encoded video data from the video encoder (503) with other data to be transmitted, such as encoded audio data and / or ancillary data streams (source not shown).
[0091] The controller (550) may manage the operation of the video encoder (503). During encoding, the controller (550) may assign a certain coded picture type to each coded picture, but this may affect the coding techniques that can be applied to the corresponding picture. For example, a picture may generally be assigned to any of the following picture types:
[0092] An intra picture (I picture) may be a picture that can be encoded and decoded without using any other picture in the sequence as a prediction source. Some video codecs allow different types of intra pictures, including, for example, Independent Decoder Refresh ("IDR") pictures. Those skilled in the art are aware of the variations of I pictures and their corresponding applications and features.
[0093] A predictive picture (P picture) may be a picture that can be encoded and decoded using intra prediction or inter prediction, which uses at most one motion vector and a reference index to predict sample values for each block.
[0094] Bidirectional predictive pictures (B pictures), which can be pictures that can be encoded and decoded using intra prediction or inter prediction, which uses up to 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 reconstruction of a single block.
[0095] The source picture may typically be spatially subdivided into blocks of samples (e.g., blocks of 4×4, 8×8, 4×8, or 16×16 samples), and coded block by block. These blocks may be predictively coded with reference to other (already coded) blocks, which are determined according to the coding allocation applied to the block's corresponding picture. For example, blocks of an I picture may be non-predictively coded, or the blocks may be predictively coded (spatial prediction or intra prediction) with reference to already coded blocks of the same picture. Blocks of pixels of a P picture may be predictively coded by spatial prediction with reference to one previously coded reference picture or by temporal prediction. Blocks of a B picture may be predictively coded by spatial prediction with reference to one or two previously coded reference pictures or by temporal prediction.
[0096] The video encoder (503) may perform encoding operations according to a predetermined video encoding technique or standard, such as ITU-T H.265 Recommendation. In operation, the video encoder (503) may perform various compression operations, including predictive encoding operations that exploit temporal and spatial redundancy in an input video sequence. Thus, the encoded video data may conform to the syntax specified by the video encoding technique or standard used.
[0097] In an embodiment, the transmitter (540) may transmit additional data when transmitting the encoded video. The source encoder (530) may include such data as part of the encoded video sequence. The additional data may include other forms of redundant data such as temporal / spatial / SNR enhancement layers, redundant pictures and slices, supplemental enhancement information (SEI) messages, visual usability information (VUI) parameter set fragments, etc.
[0098] The captured video may be taken as a plurality of source pictures (video pictures) in a temporal sequence. Intra-picture prediction (often simplified to intra-prediction) exploits spatial correlations in a given picture, while inter-picture prediction exploits (temporal or other) correlations between pictures. In an embodiment, a particular picture being encoded / decoded is divided into blocks, and the particular picture being encoded / decoded is referred to as the current picture. When a block in the current picture is similar to a reference block in a reference picture that was previously encoded in the video and is still buffered, the block in the current picture may be encoded by a vector called a motion vector. The motion vector points to a reference block in a reference picture, and in the case where multiple reference pictures are used, the motion vector may have a third dimension that identifies the reference picture.
[0099] In some embodiments, bidirectional prediction techniques may be used in inter-picture prediction. According to the bidirectional prediction technique, two reference pictures are used, for example, a first reference picture and a second reference picture that are both before the current picture in the video in decoding order (but may be in the past and future in display order, respectively). A block in the current picture may be encoded by a first motion vector pointing to a first reference block in the first reference picture and a second motion vector pointing to a second reference block in the second reference picture. Specifically, the block may be predicted by a combination of the first reference block and the second reference block.
[0100] In addition, merge mode technology can be used in inter-picture prediction to improve coding efficiency.
[0101] According to some embodiments of the present disclosure, predictions such as inter-picture prediction and intra-picture prediction are performed in blocks. For example, according to the HEVC standard, pictures in a video picture sequence are divided into coding tree units (CTUs) for compression, and the CTUs in the pictures 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 a luminance CTB and two chrominance CTBs. Furthermore, each CTU can be split into one or more coding units (CUs) using a quadtree. For example, a 64×64 pixel CTU can be split into a 64×64 pixel CU, or 4 32×32 pixel CUs, or 16 16×16 pixel CUs. In an embodiment, each CU is analyzed to determine the prediction type for the CU, such as an inter-prediction type or an intra-prediction type. In addition, depending on temporal and / or spatial predictability, the CU is split into one or more prediction units (PUs). Typically, each PU includes a luma prediction block (PB) and two chroma PBs. In an embodiment, the prediction operation in encoding (encoding / decoding) is performed in units of prediction blocks. Taking the luma prediction block as an example of a prediction block, the prediction block includes a matrix of pixel values (e.g., luma values), such as 8×8 pixels, 16×16 pixels, 8×16 pixels, 16×8 pixels, and the like.
[0102] Figure 6 A schematic diagram of a video encoder (603) according to another embodiment of the present disclosure is shown. The video encoder (603) is used to receive a processing block (e.g., a prediction block) of sample values in a current video picture in a video picture sequence, and encode the processing block into an encoded picture that is part of an encoded video sequence. In this embodiment, the video encoder (603) is used to replace Figure 3A video encoder (303) in an embodiment.
[0103] In an HEVC embodiment, a video encoder (603) receives a matrix of sample values for a processing block, such as a prediction block of 8×8 samples. The video encoder (603) uses, for example, rate-distortion optimization to determine whether to use intra mode, inter mode, or bidirectional prediction mode to encode the processing block. When encoding the processing block in intra mode, the video encoder (603) may use intra prediction techniques to encode the processing block into an encoded picture; and when encoding the processing block in inter mode or bidirectional prediction mode, the video encoder (603) may use inter prediction or bidirectional prediction techniques to encode the processing block into an encoded picture, respectively. In some video encoding techniques, the merge mode may be an inter-picture prediction submode, in which a motion vector is derived from one or more motion vector predictors without the aid of an encoded motion vector component external to the predictor. In some other video encoding techniques, there may be a motion vector component applicable to the subject block. In an embodiment, the video encoder (603) includes other components, such as a mode decision module (not shown) for determining the processing block mode.
[0104] exist Figure 6 In an embodiment of the present invention, the video encoder (603) includes: Figure 6 Shown are an inter-frame encoder (630), an intra-frame encoder (622), a residual calculator (623), a switch (626), a residual encoder (624), a common controller (621), and an entropy encoder (625) coupled together.
[0105] The inter-frame encoder (630) is used to receive samples of a current block (e.g., a processing block), compare the block with one or more reference blocks in a reference picture (e.g., blocks in a previous picture and a subsequent picture), generate inter-frame prediction information (e.g., redundant information description according to an inter-frame coding technique, motion vectors, merge mode information), and calculate an inter-frame prediction result (e.g., a predicted block) based on the inter-frame prediction information using any suitable technique. In some embodiments, the reference picture is a decoded reference picture decoded based on the encoded video information.
[0106] The intra-frame encoder (622) is used to receive samples of a current block (e.g., a processing block), compare the block with an encoded block in the same picture in some cases, generate quantization coefficients after transformation, and in some cases also generate intra-frame prediction information (e.g., intra-frame prediction direction information according to one or more intra-frame coding techniques). In an embodiment, the intra-frame encoder (622) also calculates an intra-frame prediction result (e.g., a predicted block) based on the intra-frame prediction information and a reference block in the same picture.
[0107] The general controller (621) is used to determine the general control data and control other components of the video encoder (603) based on the general control data. In an embodiment, the general controller (621) determines the mode of the block and provides a control signal to the switch (626) based on the mode. For example, when the mode is intra mode, the general controller (621) controls the switch (626) to select the intra mode result for use by the residual calculator (623) and controls the entropy encoder (625) to select the intra prediction information and add the intra prediction information to the bitstream; and when the mode is inter mode, the general controller (621) controls the switch (626) to select the inter prediction result for use by the residual calculator (623) and controls the entropy encoder (625) to select the inter prediction information and add the inter prediction information to the bitstream.
[0108] The residual calculator (623) is used to calculate the difference (residual data) between the received block and the prediction result selected from the intra-frame encoder (622) or the inter-frame encoder (630). The residual encoder (624) is used to operate based on the residual data to encode the residual data to generate a transform coefficient. In an embodiment, the residual encoder (624) is used to convert the residual data from the spatial domain to the frequency domain and generate a transform coefficient. The transform coefficient is then processed by quantization to obtain a quantized transform coefficient. In various embodiments, the video encoder (603) also includes a residual decoder (628). The residual decoder (628) is used to perform an inverse transform and generate decoded residual data. The decoded residual data can be used appropriately by the intra-frame encoder (622) and the inter-frame encoder (630). For example, the inter-frame encoder (630) can generate a decoded block based on the decoded residual data and the inter-frame prediction information, and the intra-frame encoder (622) can generate a decoded block based on the decoded residual data and the intra-frame prediction information. The decoded blocks are appropriately processed to generate a decoded picture, and in some embodiments, the decoded picture may be buffered in a memory circuit (not shown) and used as a reference picture.
[0109] The entropy encoder (625) is used to format the code stream to produce an encoded block. The entropy encoder (625) generates various information according to a suitable standard such as the HEVC standard. In an embodiment, the entropy encoder (625) is used to obtain general control data, selected prediction information (such as intra-frame prediction information or inter-frame prediction information), residual information, and other suitable information in the code stream. It should be noted that according to the disclosed subject matter, when the block is encoded in the inter-frame mode or the merge sub-mode of the bidirectional prediction mode, there is no residual information.
[0110] Figure 7FIG. 7 is a schematic diagram of a video decoder (710) according to another embodiment of the present disclosure. The video decoder (710) is used to receive an encoded image as part of an encoded video sequence, and decode the encoded image to generate a reconstructed picture. In an embodiment, the video decoder (710) is used to replace Figure 3 A video decoder (310) of an embodiment.
[0111] exist Figure 7 In one embodiment, the video decoder (710) includes: Figure 7 An entropy decoder (771), an inter-frame decoder (780), a residual decoder (773), a reconstruction module (774) and an intra-frame decoder (772) coupled together are shown in FIG.
[0112] The entropy decoder (771) may be used to reconstruct certain symbols from the encoded picture, which represent syntax elements constituting the encoded picture. Such symbols may include, for example, a mode for encoding the block (e.g., intra mode, inter mode, bidirectional prediction mode, a merged sub-mode of the latter two, or another sub-mode), prediction information (e.g., intra prediction information or inter prediction information) that may identify certain samples or metadata for prediction by the intra decoder (772) or the inter decoder (780), respectively, residual information in the form of, for example, quantized transform coefficients, and the like. In an embodiment, when the prediction mode is inter or bidirectional prediction mode, the inter prediction information is provided to the inter decoder (780); and when the prediction type is an intra prediction type, the intra prediction information is provided to the intra decoder (772). The residual information may be inverse quantized and provided to the residual decoder (773).
[0113] The inter-frame decoder (780) is used for receiving the inter-frame prediction information and generating an inter-frame prediction result based on the inter-frame prediction information.
[0114] The intra-frame decoder (772) is used to receive intra-frame prediction information and generate a prediction result based on the intra-frame prediction information.
[0115] The residual decoder (773) is used to perform inverse quantization to extract dequantized transform coefficients, and process the dequantized transform coefficients to convert the residual from the frequency domain to the spatial domain. The residual decoder (773) may also require some control information (to obtain the quantizer parameter QP), and this information can be provided by the entropy decoder (771) (the data path is not indicated because this is only low-volume control information).
[0116] The reconstruction module (774) is used to combine the residual output by the residual decoder (773) with the prediction result (which can be output by the inter-frame prediction module or the intra-frame prediction module) in the spatial domain to form a reconstructed block, which can be part of a reconstructed picture, which in turn can be part of a reconstructed video. It should be noted that other suitable operations such as deblocking operations can be performed to improve visual quality.
[0117] It should be noted that the video encoder (303), video encoder (503) and video encoder (603) and video decoder (310), video decoder (410) and video decoder (710) may be implemented using any suitable technology. In an embodiment, the video encoder (303), video encoder (503) and video encoder (603) and video decoder (310), video decoder (410) and video decoder (710) may be implemented using one or more integrated circuits. In another embodiment, the video encoder (303), video encoder (503) and video encoder (603) and video decoder (310), video decoder (410) and video decoder (710) may be implemented using one or more processors that execute software instructions.
[0118] II. Transform Coding and Related Technologies
[0119] 1. DCT-2 main transform example
[0120] In some embodiments, 4-point, 8-point, 16-point, and 32-point DCT-2 transforms are used as the primary transform. Figures 8A-8D The transform kernel matrices of 4-point, 8-point, 16-point and 32-point DCT-2 are shown respectively. The elements of these transform kernel matrices can be represented by 8-bit integers, so these transform kernel matrices are called 8-bit transform kernels. As shown in the figure, the transform kernel matrix of the smaller DCT-2 is a part of the transform kernel matrix of the larger DCT-2.
[0121] The DCT-2 kernel matrix exhibits symmetric / antisymmetric properties. Therefore, it is possible to support so-called "partial butterfly" implementations to reduce the number of operations (multiplication, addition / subtraction, shift). Compared to implementations that do not use partial butterfly, implementations that use partial butterfly can achieve the same matrix multiplication results.
[0122] 2. Sub-block transform coding example
[0123] 2.1 Sub-Block Transform (SBT)
[0124] In some embodiments, a sub-block transform (SBT), also known as a spatially varying transform (SVT), is used. In some embodiments, the SBT is applied to the inter-frame prediction residual. For example, the coding block can be divided into multiple sub-blocks, and only a portion of these sub-blocks are processed at the residual block. The remaining portions of these sub-blocks are assumed to be zero residuals. Therefore, the residual block is smaller than the coding block, and the transform size in the SBT is smaller than the coding block size. For areas not covered by the residual block, no transform processing is performed.
[0125] Figures 9A-9D The sub-block types (SVT-H, SVT-V) supported in SBT are shown (e.g., vertical or horizontal partitioning), sizes and positions (e.g., left half, left quarter, right half, right quarter, upper half, upper quarter, lower half, lower quarter). The shaded area marked with the letter "A" is the residual block to be transformed and coded, and other areas are assumed to be zero residual and not transformed.
[0126] 2.2. Intra-frame sub-partitioning (ISP) coding mode
[0127] In some embodiments, intra sub-partitioning (ISP) coding mode is used. In ISP coding mode, the luma intra prediction block can be divided into 2 or 4 sub-partitions vertically or horizontally. The number of sub-partitions may depend on the size of the block. Fig.10 The number of sub-partitions depending on the block size is shown. Fig.11 A situation where a block is divided into two sub-partitions is shown. Fig.12 The case where a block is divided into four sub-partitions is shown. In the example, all sub-partitions satisfy the condition of having at least 16 samples. In the example, ISP is not applied to chroma components.
[0128] In the example, for each sub-partition divided from the coding block, a residual signal is generated by entropy decoding the individual coefficients sent by the encoder and then inverse quantizing and inverse transforming them. Then, the first of these sub-partitions is intra-predicted to generate a prediction signal. The prediction signal is added to the respective residual signals of the first sub-partition to obtain the corresponding reconstructed samples. Thereafter, the reconstructed sample values of the first sub-partition can be used to generate a prediction of the second sub-partition of these sub-partitions. This process can be repeated sub-partition by sub-partition until all sub-partitions in the coding block are reconstructed. In the example, all sub-partitions share the same intra mode.
[0129] In an embodiment, the ISP coding mode is tested only with intra modes that are part of the most probable mode (MPM) list. Therefore, if a block uses ISP, the MPM flag can be inferred to be 1. In addition, when ISP is used for a block, the corresponding MPM list is modified to exclude DC mode and prioritize horizontal intra modes for ISP horizontal partitioning and vertical intra modes for vertical partitioning.
[0130] In the ISP coding mode, since transformation and reconstruction are performed separately on each sub-partition, each sub-partition can be regarded as a sub-TU.
[0131] 3. Transform coding using extended DCT-2 transform and multiple transform selection (MTS)
[0132] In some embodiments, when the height and width of the coding block are both less than or equal to 64 samples, the transform size is always the same as the coding block size. When the height or width of the coding block is greater than 64 samples, when performing transform or intra prediction, the coding block is further divided into multiple sub-blocks, where the width and height of each sub-block are less than or equal to 64, and the transform process is performed on each sub-block.
[0133] 3.1 Transform Coding Using Extended DCT-2 Transform
[0134] In some embodiments, in addition to the 4-point, 8-point, 16-point, and 32-point DCT-2 transforms described above, 2-point and 64-point DCT-2 transforms may also be used. Figures 13A-13E A 64x64 transform kernel matrix for a 64-point DCT-2 transform is shown.
[0135] 3.2 Explicitly Signaled Transformations
[0136] In some embodiments, in addition to DCT-2 and 4×4 DST-7 transform coding, multiple transform selection (MTS) (also known as enhanced multiple transform (EMT) or adaptive multiple transform (AMT)) can also be used for residual coding of inter-frame and intra-frame coded blocks. MTS uses multiple transforms selected from the discrete cosine transform (DCT) / discrete sine transform (DST) family, in addition to DCT-2 and 4×4 DST-7 transforms. The selection can be performed at the encoder and explicitly signaled from the encoder to the decoder. For example, the selected transform can include a DST-7 or DCT-8 transform. Fig.14 The transform basis functions of the DST / DCT transform are shown. In some embodiments, the DST / DCT transform kernel matrix used in the MTS is represented by an 8-bit integer.
[0137] In some embodiments, MTS can be applied to CUs whose width and height are both less than or equal to 32 samples. Whether MTS is applied can be controlled by a flag represented by mts_flag. For example, when mts_flag is equal to 0, only DCT-2 is applied to encode the residual block. When mts_flag is equal to 1, it indicates that MTS is applied and the selected transform can be used. For example, the index represented by mts_idx can be further signaled using 2 binary numbers (bins) to specify the horizontal transform and vertical transform to be used.
[0138] Fig.15 A table (1500) illustrating the mapping relationship between the mts_idx value and the corresponding horizontal transform or vertical transform is shown. The row (1301) where the mts_idx value is -1 corresponds to a scene where mts_flag is equal to 0 (which indicates that MTS is not applied) and DCT-2 transform is used. The rows (1302)-(1305) where the mts_idx value is 0, 1, 2 or 3 correspond to scenes where mts_flag is equal to 1 (which indicates that MTS is applied). In the right two columns of the table (1500), 0 represents a transform type of DCT-2, 1 represents a transform type of DST-7, and 2 represents a transform type of DCT-8.
[0139] Figures 16A-16D A transform kernel matrix of the DST-7 transform type is shown. Figures 17A-17D A transform kernel matrix of a DCT-8 transform type is shown.
[0140] In some embodiments, MTS may be enabled or disabled using a high-level syntax (HLS) element. Each HLS element may be a video parameter set (VPS) syntax element, a sequence parameter set (SPS) syntax element, a picture parameter set (PPS) syntax element, a slice header syntax element, a tile header syntax element, or a tile group header syntax element, etc. Fig.18 An example of using SPS syntax elements to control the use of MTS is shown. As shown, the SPS syntax element sps_mts_enabled_flag can be signaled to indicate whether MTS is enabled for a video sequence. When MTS is enabled, two syntax elements sps_explicit_mts_intra_enabled_flag and sps_explicit_mts_inter_enabled_flag can be signaled to indicate whether MTS is enabled to encode an inter-predicted block or an intra-predicted block, respectively.
[0141] In an embodiment, if the above-mentioned signaling-based MTS (referred to as explicit MTS) is not used, an implicit MTS is applied. Using implicit MTS, transform selection can be made based on block width and height rather than based on signaling. For example, using implicit MTS, a DST-7 transform can be selected for the shorter side of a transform block, and a DCT-2 transform can be selected for the longer side of a transform block.
[0142] 3.3 Scenarios where implicit transformation selection is applied
[0143] In various embodiments, for certain scenarios, DST-7 and / or DCT-8 may be used without explicit signaling. For example, DST-7 and / or DCT-8 may be used implicitly based on information available to both the encoder and the corresponding decoder. These scenarios include:
[0144] 3.3.1 Intra-frame Sub-partitioning (ISP)
[0145] For the residual block encoded in ISP mode, as long as the block width of the residual block is greater than or equal to 4 and less than or equal to 16, the horizontal transform is selected as DST-7, and as long as the block height of the residual block is greater than or equal to 4 and less than or equal to 16, the vertical transform is selected as DST-7.
[0146] 3.3.2 Sub-Block Transform (SBT)
[0147] For SBT mode, for sub-TUs located in the left half (or quarter) or right half (or quarter) of the current CU, the horizontal transform can be DCT-8 or DST-7, respectively. Otherwise (the sub-TU has the same width as the current CU), DCT-2 can be used. For sub-TUs located in the upper half (or quarter) or lower half (or quarter) of the current CU, the vertical transform can be DCT-8 or DST-7, respectively. Otherwise (the sub-TU has the same height as the current CU), DCT-2 can be used.
[0148] 3.3.3 Disabling MTS via HLS elements
[0149] For example, when sps_mts_enabled_flag is signaled as true, but sps_explicit_mts_intra_enabled_flag and sps_explicit_mts_inter_enabled_flag are both signaled as false, then for intra prediction residuals, the horizontal transform may be selected as DST-7 as long as the corresponding block width is greater than or equal to 4 and less than or equal to 16, and the vertical transform may be selected as DST-7 as long as the corresponding block height is greater than or equal to 4 and less than or equal to 16.
[0150] 4. Non-separable quadratic transform (NSST)
[0151] 4.1 Preliminary Design of NSST
[0152] In some embodiments, a mode-dependent non-separable secondary transform (NSST) may be applied between the forward kernel transform and quantization (at the encoder) and between dequantization and the inverse kernel transform (at the corresponding decoder). To keep complexity low, in some embodiments, NSST may only be applied to low-frequency coefficients after the primary transform. If both the width (W) and height (H) of the transform coefficient block are greater than or equal to 8, an 8×8 non-separable secondary transform may be applied to the upper left 8×8 region of the transform coefficient block. Otherwise, if W or H of the transform coefficient block is equal to 4, a 4×4 non-separable secondary transform may be applied, and a 4×4 non-separable transform may be performed on the upper left min(8, W)×min(8, H) region of the transform coefficient block. The above transform selection rules may be applied to both luminance and chrominance components.
[0153] The following describes the implementation of matrix multiplication of non-separable transformation using a 4×4 input block as an example.
[0154]
[0155] Represented as a vector
[0156]
[0157] The non-separable transformation is calculated as:
[0158]
[0159] in Indicates the transform coefficient vector, T is the 16×16 transform matrix. 16×1 coefficient vector The blocks are then reorganized into 4×4 blocks using the scan order (horizontally, vertically or diagonally) of the block. Coefficients with smaller indices are placed in the 4×4 coefficient blocks with smaller scan indices. In an example, a Hypercube-Givens transform (HyGT) with a butterfly implementation is used instead of matrix multiplication to reduce the complexity of the non-separable transform.
[0160] In the example of NSST, there can be a total of 35×3 non-separable secondary transforms for 4×4 block size and 8×8 block size, where 35 is the number of transform sets, each transform set corresponds to an intra prediction mode, and 3 is the number of NSST candidates for each intra prediction mode. Fig.19The mapping from intra prediction modes to transform sets is defined in Table (1900) shown in FIG. 1900. For example, according to Table (1900), the transform set applied to the luma / chroma transform coefficients may be specified by the corresponding luma / chroma intra prediction mode. For intra prediction modes greater than 34 (e.g., diagonal prediction directions), the transform coefficient blocks are transposed at the encoder / decoder before / after the secondary transform.
[0161] For each transform set, the selected inseparable secondary transform candidate is further specified by an explicitly signaled CU-level NSST index. The index is signaled once in the bitstream for each intra-CU after using the transform coefficients and truncated unary binarization. In the case of planar or DC mode, the truncation value is 2, and in the case of angular intra prediction mode, the truncation value is 3. The NSST index is signaled only when there is more than one non-zero coefficient in the CU. When not signaled, the default value is zero. A value of zero for this syntax element indicates that the secondary transform is not applied to the current CU, and values 1-3 indicate which secondary transform in the set should be applied.
[0162] NSST may not be applicable for blocks coded in transform skip mode. When the NSST index is signaled for a CU and the NSST index is not equal to zero, NSST is not used for blocks of components coded in transform skip mode in the CU. When a CU with blocks including all components is coded in transform skip mode or the number of non-zero coefficients of a non-transform skip mode CB is less than 2, the NSST index is not signaled for the CU.
[0163] 4.2 Reduced Size Transform (RST)
[0164] In some embodiments, a variant of NSST is used, called reduced size transform (RST), or low-frequency non-separable secondary transform (LFNST). RST uses a transform zeroing scheme. Check whether the intra prediction mode is planar or DC to entropy encode the transform index of NSST.
[0165] In the example, four transform sets are applied, and each transform set includes three RST transform kernels. The size of the RST transform kernel can be 16×48 (or 16×64) (applicable to transform coefficient blocks with height and width greater than or equal to 8) or 16×16 (applicable to transform coefficient blocks with height or width equal to 4). For ease of representation, the 16×48 (or 16×64) transform is represented as RST8×8 and the 16×16 transform is represented as RST4×4.
[0166] For RST8×8, two optional transform coding processes (2000) and (2100) using 16×64 transform kernel and 16×48 transform kernel are respectively Fig. 20 and Fig.21 As shown in VVC draft 5, a transform coding process using a 16×48 transform kernel is adopted.
[0167] exist Fig. 20 In the example process (2000), at the encoder side, a forward main transform (2010) may be first performed on the residual block, and then a forward secondary transform (2012) may be performed on the coefficients generated from the forward main transform (2010). In the forward secondary transform (2012), the 64 coefficients of the 4x4 sub-block A / B / C / D at the upper left corner of the coefficient block (2013) are represented as a 64-length vector and multiplied with a transform matrix of size 16x64 according to the equation (Equation 3) to obtain a 16-length vector. The elements in the 16-length vector are filled back into the upper left 4x4 sub-block A of the coefficient block (2013). The coefficients in sub-blocks B / C / D may take zero values. Then, at step (2014), the coefficients obtained after the forward secondary transform (2012) are quantized and entropy encoded to generate coded bits in the bitstream (2016).
[0168] The coded bits may be received at the decoder side and entropy decoded and then dequantized (2024) to generate a coefficient block (2023). An inverse secondary transform (2022) may be performed on the 16 coefficients at the upper left 4x4 sub-block E to obtain 64 coefficients, which are filled back into the 4x4 sub-blocks E / F / G / H. Thereafter, the coefficients in the block (2023) after the inverse secondary transform (2022) may be processed using an inverse primary transform (2020) to obtain a recovered residual block.
[0169] Fig.21 The exemplary process (2100) is similar to the process (2000), except that fewer coefficients (48) are processed during the forward secondary transform (2012). Specifically, the 48 coefficients in sub-blocks A / B / C are processed using a smaller transform matrix of size 16x48. Using a smaller transform matrix can reduce the memory size used to store the transform matrix and the corresponding computational complexity.
[0170] Fig. 22 An example CU level syntax table (2200) is shown, where a syntax element lfnst_idx is signaled at the end of the CU level syntax, indicating the selection of the LFNST kernel.
[0171] 4.3 Example of RST calculation
[0172] The main idea of the reduction transform (RT) is to map an N-dimensional vector to an R-dimensional vector in a different space, where R / N (R < N) is the reduction factor.
[0173] The RST matrix is an R×N matrix as follows:
[0174]
[0175] Among them, the R rows of the transform are the R bases in the N-dimensional space. The inverse transform matrix of RT is the transpose of its forward transform.
[0176] Fig.23 The process of the reduction transform (2301) and the process of the reduction inverse transform (2302) are shown. T represents the RST transform matrix of R×N dimensions, and T T represents the transpose matrix of T of N×R dimensions.
[0177] In RST8×8, a reduction factor of 4 (1 / 4 size) is implemented. For example, a 16×64 direct matrix is used instead of 64×64 (which is the size of the traditional 8×8 non-separable transform matrix). An inverse RST matrix of 64×16 is used on the decoder side to generate kernel (main) transform coefficients in the upper left 8×8 region. The forward RST8×8 uses a 16×64 (or 8×64 for an 8×8 block) matrix, such that the forward RST8×8 only produces non-zero coefficients in the upper left 4×4 region within a given 8×8 region. In other words, if RST is applied, the 8×8 region except for the upper left 4×4 region will only have zero coefficients. For RST4×4, a 16×16 (or 8×16 for a 4×4 block) direct matrix multiplication can be applied.
[0178] In addition, for RST8×8, in order to further reduce the transform matrix size, instead of using the entire upper left 8×8 coefficients (the shaded sub-block in Fig.24A the residual block (2410)) as the input for calculating the secondary transform, the upper left three 4×4 sub-block coefficients (the shaded sub-block in Fig. 24B the residual block (2410)) are used as the input for calculating the secondary transform.
[0179] In the example, when the following two conditions are met, the inverse RST is conditionally applied: (i) the corresponding block size is greater than or equal to a given threshold (W≥4 && H≥4); and (ii) the transform skip mode flag is equal to zero. For example, if both the width (W) and height (H) of the transform coefficient block are greater than 4, RST8×8 is applied to the upper left 8×8 region of the transform coefficient block. Otherwise, RST4x4 is applied to the upper left min(8, W)×min(8, H) region of the transform coefficient block.
[0180] In the example, when the RST index is equal to 0, RST is not applied. Otherwise, RST is applied and the kernel with the RST index is selected. For example, RST is applied to intra CUs in intra slices and inter slices, as well as luma and chroma. If dual tree is enabled, the RST indexes for luma and chroma are signaled separately. For inter slices (dual tree disabled), a single RST index is signaled and used for luma and chroma. When ISP mode is selected, RST is disabled and the RST index is not signaled.
[0181] 4.4 Example of RST transformation matrix selection
[0182] In the example, the RST matrix can be selected from four transform sets, and each transform set consists of two transforms. Which transform set to apply can be determined according to the applied intra prediction mode as follows. When one of the three cross-component linear model (CCLM) modes is indicated, transform set 0 can be selected. Otherwise, it can be determined according to Fig.25 The table (2500) shown in performs transform set selection. The index (denoted by IntraPredMode) accessing the table (2500) may be in the range of [-14, 83], for example, it is a transform mode index for wide angle intra prediction.
[0183] 5. Matrix-based intra prediction (MIP) mode
[0184] In some embodiments, a matrix-based intra prediction (MIP) mode is employed. Fig.26 An example process (2600) of MIP mode is shown. To predict samples of a rectangular block (2610) of width W and height H, MIP takes as input a column of H reconstructed neighboring boundary samples to the left of the block (2610) and a row of W reconstructed neighboring boundary samples above the block (2610). If reconstructed samples are not available, they can be generated in a manner similar to traditional intra prediction.
[0185] The prediction signal can be generated based on the following three steps (2601) to (2603): In step (2601), among boundary samples, four samples in the case of W=H=4 and eight samples in all other cases are extracted by averaging.
[0186] In step (2602), the average sample bdry red As input, perform matrix-vector multiplication A k ·bdry red , and then add the offset b k The result is a reduction in the prediction signal over the subsampled set of samples (2621) in the original block. Matrix A k and offset b kIt can be selected based on the MIP mode index k.
[0187] In step (2603), the prediction signals at the remaining positions (2622) are generated from the prediction signals on the sub-sampling set (2621) by linear interpolation, and the linear interpolation is a single step linear interpolation in each direction.
[0188] The matrix A required to generate the prediction signal k and the offset vector b k It can be taken from three sets of matrices S0, S1, and S2. Set S0 consists of 18 matrices Each matrix has 16 rows, 4 columns and 18 offset vectors Each offset vector has a size of 16. This set of matrices and offset vectors is used for blocks of size 4×4. Set S1 consists of 10 matrices Each matrix has 16 rows, 8 columns and 10 offset vectors. Each offset vector has a size of 16. This set of matrices and offset vectors is used for blocks of size 4×8, 8×4, and 8×8. Finally, the set S2 consists of 6 matrices Each matrix has 64 rows, 8 columns and 6 offset vectors of size 64. This set of matrices and offset vectors or a portion of these matrices and offset vectors are used for all other block shapes.
[0189] As shown, given an 8×8 block (2610), the MIP takes four averages along each axis of the boundary. The resulting eight input samples enter the matrix-vector multiplication. The matrix is taken from set S1. This produces 16 samples (2621) at odd positions in the predicted block. Therefore, a total of (8·16) / (8·8)=2 multiplications are performed for each sample. After adding the offset, these samples are vertically interpolated using the reduced upper boundary samples. Horizontal interpolation is then performed using the original left boundary samples. In this case, the interpolation process does not require any multiplications.
[0190] 5.1 Signaling in MIP Mode
[0191] In some embodiments, for each coding unit (CU) in intra mode, a flag may be sent in the bitstream indicating whether the MIP mode is applied to the corresponding prediction unit (PU). If the MIP mode is applied, the index predmode of the MIP mode is signaled using an MPM list including 3 MPMs.
[0192] The derivation of MPM can be performed using the intra modes of the upper and left PUs as follows. There are three fixed mapping tables map_angular_to_mip idx , idx∈{0,1,2}, and each table converts the traditional intra prediction mode predmode Angular is associated with a specific MIP mode as described below.
[0193] predmode MIP =map_angular_to_mip[predmode Angular ].(Equation 5)
[0194] Among them, map_angular_to_mip is a fixed lookup table. The index of the mapping table is determined based on the width W and height H of the PU, and a total of three indexes are available, as described below.
[0195] idx(PU)=idx(W,H)∈{0,1,2}(Equation 6)
[0196] It indicates from which of the three sets the above MIP parameters are obtained.
[0197] In the example, in order to generate the MPM list of the current block encoded using the MIP mode, the upper MIP mode (ie ) and left MIP mode (i.e. ).
[0198] The value of can be derived as follows:
[0199] If you go to PU PU above Available, and it belongs to the same CTU where the current PU is located, and the PU above Using MIP mode via MIP Encode, and idx(PU)=idx(PU above )(Equation 7), then
[0200]
[0201] If you go to PU PU above Available, and it belongs to the same CTU where the current PU is located, and the PU above Use traditional intra prediction mode To encode,
[0202]
[0203] otherwise,
[0204]
[0205] This means that the mode is not available.
[0206] Use and export of values The same method is used to derive the PU, but it does not check whether the left PU belongs to the same CTU as the current PU.
[0207] Finally, given the exported and And three predefined fixed default MPM lists list idx , idx∈{0,1,2}, where each MPM list contains three different MIP modes, construct the MPM list. The MPM list is based on the given default list list idx(PU) and and Constructed by replacing -1 with default values and removing duplicate MIP patterns.
[0208] As an example, Fig. 27 A CU level syntax table is shown, where a flag signaling the MIP mode is shown in a frame (2701).
[0209] 5.2 Derivation of MPM List for Traditional Intra Prediction Mode
[0210] In some embodiments, MIP modes are coordinated with MPM-based encoding of legacy intra prediction modes as follows: The derivation process for luma and chroma MPM lists for legacy intra prediction modes uses separate fixed tables map_mip_to_angular idx , idx∈{0,1,2}, the fixed table will MIP mode predmode MIP Mapped to one of the traditional intra prediction modes
[0211] predmode Angular =map_mip_to_angular[predmode MIP ].(Equation 11)
[0212] Where map_mip_to_angular is a fixed lookup table. For the derivation of the brightness MPM list, whenever the MIP mode predmode is passed MIP When encoding adjacent luminance blocks, the block can be considered to use the traditional intra prediction mode predmode Angular For the derivation of the chroma MPM list, whenever the current luma block uses a MIP mode, the same mapping is used to convert the MIP mode to a conventional intra prediction mode.
[0213] III. Enabling implicit transform selection based on high-level syntax elements or block-level syntax elements
[0214] In some embodiments, two transform coding schemes may be adopted: implicit transform (or referred to as implicit transform selection) and explicit transform (or referred to as explicit transform selection).
[0215] In implicit transformation, a set of non-DCT-2 transforms (e.g., DST-1, DCT-5, DST-7, DCT-8, DST-4, DCT-4) can be selected without transform index signaling. For example, a set of non-DCT-2 transforms can be selected using encoded information available to both the encoder and the corresponding decoder. The encoded information may include, but is not limited to, intra-frame prediction mode (e.g., planar mode, DC mode, angular mode), block size, block width, block height, block aspect ratio, block area size, intra-frame coding mode (e.g., whether to use multiple reference lines (MRL), ISP, MIP), the position of the selected spatial merge candidate (e.g., upper merge candidate, left merge candidate), inter-frame prediction mode (e.g., inter-position-dependent prediction combination (inter-PDPC) mode, combined inter-frame intra-frame prediction (CIIP) mode).
[0216] In contrast, in an explicit transform, a transform may be selected from a set of transform type candidates (e.g., DCT-2, DST-1, DCT-5, DST-7, DCT-8, DST-4, DCT-4) with a signaled index to indicate which transform type was selected.
[0217] 1. Enable implicit transformation when explicit MTS is disabled
[0218] In some embodiments, as described in Section II.3.2, for intra-prediction residual blocks that are not ISP-encoded, implicit transform selection may be enabled when explicit MTS is disabled for intra- and inter-prediction residual blocks indicated by a high-level syntax (HLS) element. For example, when the SPS syntax elements sps_explicit_mts_intra_enabled_flag and sps_explicit_mts_inter_enabled_flag are both 0, the decoder may determine that implicit transform selection is enabled for the picture or block associated with the SPS syntax element.
[0219] For example, Figures 28A-28B The combination shows a text (2800) that specifies a transform coding process that performs explicit or implicit transform selection on a current block based on relevant syntax elements received from a bitstream. The text (2800) can be used as part of a video coding standard. Fig.28A Two parts (2801) and (2802) are shown in FIG. Fig.28B A portion (2803) and two tables (2804) and (2805) are shown.
[0220] In section (2801), the input and output of the transform coding process are described. Specifically, the position, size, color components, and inverse quantized transform coefficients of the current block are inputs, and the residual samples after inverse transform processing using the selected transform are outputs.
[0221] In section (2802), the derivation of a variable represented by implicitMtsEnabled is described. The variable indicates whether implicit selection is enabled. As described above, if the SPS syntax element sps_mts_enabled_flag is equal to 1 (which indicates that MTS is enabled for the picture or block associated with the SPS syntax element), implicitMtsEnabled is equal to 1 when one of the following three conditions is true: (i) ISP is used to encode the current block; (ii) SBT is enabled and both edges of the current block are less than or equal to 32, which indicates that SBT is used; or (iii) sps_explicit_mts_intra_enabled_flag and sps_explicit_mts_inter_enabled_flag are both equal to 0 (which indicates that explicit MTS is disabled for both intra-frame and inter-frame coded blocks), and the current block is intra-frame coded. Otherwise, implicitMtsEnabled is set to 0, which indicates that implicit transform selection is disabled for the current block.
[0222] As described in section (2802), according to condition (i), for an intra-frame prediction block encoded using the ISP mode, an implicit transform can be enabled to encode the intra-frame prediction block. According to condition (iii), for an intra-frame prediction block not encoded using the ISP mode, when explicit MTS is disabled for intra-frame and inter-frame prediction blocks, an implicit transform can be enabled to encode the intra-frame prediction block not encoded using the ISP mode.
[0223] In part (2803), the vertical and horizontal transforms are determined according to the variable implicitMtsEnabled, the input of the process and the relevant syntax elements. For example, when sps_explicit_mts_intra_enabled_flag and sps_explicit_mts_inter_enabled_flag are both equal to 0, a horizontal transform kernel (represented by trTypeHor) and a vertical transform kernel (represented by trTypeBer) can be provided for the current block (the current block is of the luminance component and is intra-predicted) according to expressions (3-1) and (3-2), respectively.
[0224] In tables (2804) and (2805), numbers 1 and 2 indicating horizontal or vertical transform kernel types indicate DST-7 transform and DCT-8 transform, respectively, while number 0 indicates DCT-2 transform. In some examples, DST-4 transform may be used instead of DST-7 transform.
[0225] exist Figures 28A-28B In the example of , for blocks controlled by the HLS elements sps_explicit_mts_intra_enabled_flag and sps_explicit_mts_inter_enabled_flag, explicit MTS for inter-coded blocks and implicit transform for intra-coded blocks (non-ISP coded) cannot coexist. However, the implicit transform selection on intra-prediction residual blocks does not have to depend on the HLS element (e.g., sps_explicit_mts_inter_enabled_flag) that controls the enabling of MTS for inter-prediction residual. Therefore, in some embodiments, for intra-coded blocks that are not predicted by the ISP mode, whether the implicit transform can be applied depends on whether MTS can be applied to intra-prediction residuals (e.g., the value of sps_explicit_mts_intra_enabled_flag), but does not depend on whether MTS can be applied to inter-prediction residuals (the value of sps_explicit_mts_inter_enabled_flag). This control mechanism allows both inter-MTS (explicit MTS applied to inter-prediction residual blocks) and implicit transform (for intra-prediction residual) to be enabled simultaneously.
[0226] For example, a first HLS element and a second HLS element may be received at a decoder. The first HLS element and the second HLS element control the same set of pictures or regions (e.g., video sequences, pictures, slices, tiles, etc.), which may include intra-coded residual blocks and inter-coded residual blocks. The first HLS element indicates whether explicit MTS is enabled or disabled for each intra-coded residual block, and the second HLS element indicates whether explicit MTS is enabled or disabled for each inter-coded residual block. Regarding the terminology of inter-frame MTS, an explicit MTS applied to an intra-coded residual block may be referred to as an intra-frame MTS.
[0227] When the first HLS element indicates that explicit MTS is disabled for intra-coded residual blocks, the decoder can accordingly determine to enable implicit transform (or implicit MTS) for intra-coded blocks, regardless of the value of the second HLS element. For example, the second HLS element can be 0 or 1, which does not affect the enabling of implicit transform for intra-coded residual blocks.
[0228] As an example, Fig.29Modifications (2900) to the text (2800) are shown, corresponding to an implicit transform enabled scheme, where implicit transforms for intra residual blocks and explicit transforms for inter residual blocks can coexist. In the modification (2900), the removed text is marked with a strikethrough, while the added text is marked with an underline. As shown, the condition that sps_explicit_mts_inter_enabled_flag is 0 has been removed.
[0229] 2. Disable implicit conversion when other encoding tools are enabled
[0230] In some embodiments, whether an implicit transform can be applied to an intra-coded block (which is not predicted by the ISP mode) depends on whether specific coding tools are enabled as indicated by the HLS element.
[0231] 2.1 When NSST is enabled
[0232] In an embodiment, when the HLS element indicates that NSST is enabled, implicit transforms may be disabled for intra-coded blocks (which are not predicted by the ISP mode). For example, as described in Section II.4.1, a transform matrix T is used in the equation (Equation 3) for secondary transform processing. The transform matrix T may include constant elements and is designed assuming specific statistics of the target coefficient block (e.g., the coefficient block produced by the explicit transform selection). Therefore, the coefficient block produced by the implicit transform selection may not match the NSST in terms of the statistics of the individual coefficients. For example, applying NSST to the result of the implicit transform may not improve codec performance. For the reasons described above, it may be desirable to disable implicit transforms when NSST is enabled.
[0233] In this disclosure, the term NSST may be used to refer to an initial design of a family of non-separable secondary transform coding schemes, such as NSST, RST, LFNST, etc.
[0234] For example, a decoder may receive two HLS elements: one HLS element (e.g., sps_explicit_mts_intra_enabled_flag) indicates that explicit MTS is disabled, and another HLS element (e.g., sps_lfnst_enabled_flag) indicates that NSST is enabled. Therefore, the decoder may determine that implicit transforms are not enabled for intra-coded blocks controlled by these two HLS elements. Conversely, if one HLS element indicates that explicit MTS is disabled and another HLS element indicates that NSST is also disabled, the decoder may determine that implicit transforms are enabled for individual intra-coded blocks.
[0235] As an example, Fig.30A modification (3000) to the text (2800) is shown corresponding to the case where implicit transformation is enabled when NSST is disabled. As shown, an additional constraint "sps_lfnst_enabled_flag equals 0" is added to condition (iii) to derive the variable implicitNtsEnabled.
[0236] 2.2 When MIP is enabled
[0237] Similar to the scenario of enabling NSST, in some embodiments, when the HLS element indicates that MIP is enabled, implicit transforms are disabled for intra-coded blocks (which are not predicted by the ISP mode). For example, applying the MIP intra-coding mode to a block may result in a residual block having different statistics than a residual block encoded using a conventional intra-mode. Therefore, a residual block encoded using MIP may not match the implicit transform, which may assume residual statistics produced by a conventional intra-mode. Therefore, it may be desirable to disable implicit transforms when MIP is enabled.
[0238] For example, a decoder may receive two HLS elements: one HLS element (e.g., sps_explicit_mts_intra_enabled_flag) indicates that explicit MTS is disabled, and another HLS element (e.g., sps_mip_enabled_flag) indicates that MIP is enabled. Therefore, the decoder may determine that implicit transforms are not enabled for intra-coded blocks controlled by these two HLS elements. Conversely, if both explicit MTS and MIP are disabled as indicated by these two HLS elements, the decoder may determine that implicit transforms are enabled for individual intra-coded blocks.
[0239] As an example, Fig.31 A modification (3100) to the text (2800) is shown corresponding to the case where implicit transform is enabled when MIP is disabled. As shown, an additional constraint "sps_mip_enabled_flag equals 0" is added to condition (iii) to derive the variable implicitNtsEnabled.
[0240] 3. Enable implicit transformation based on instructions from block-level syntax elements
[0241] In some embodiments, whether an implicit transform can be applied to an intra-coded block (which is not predicted by the ISP mode) depends on whether MTS, NSST or MIP is applied to the intra-coded block as indicated by the block level syntax elements.
[0242] 3.1 When MTS and NSST are not applied
[0243] In an embodiment, whether implicit transform can be applied to an intra-coded block depends on whether MTS and NSST are not applied to the intra-coded block as indicated by the block level syntax elements.
[0244] For example, the decoder may receive first and second CU-level (or block-level) syntax elements associated with a current block, where the current block is intra-coded and not predicted by the ISP mode. The current block may be located at coordinates [x0][y0] within the picture.
[0245] The first CU level syntax element (e.g., tu_mts_idx[x0][y0]) may indicate that DCT-2 transform is used for the current block instead of the transform used in MTS (e.g., DST-7, DCT-8, DCT-4, etc.). As an example, in Table (2804), when the value of tu_mts_idx[x0][y0] is 0, the values of the variables trTypeHor and trTypeVer are both 0, which indicates that both the horizontal transform and the vertical transform are DCT-2 transforms, and DST-7 or DCT-8 transforms are not applied. The second CU level syntax element (e.g., lfnst_idx[x0][y0]) may indicate that NSST is not applied to the current block. Based on the above first CU level syntax element and the second CU level syntax element, the decoder may determine that implicit MTS is enabled for the current block.
[0246] Conversely, if the first CU level syntax element and the second CU level syntax element indicate that MTS is applied (the value of tu_mts_idx[x0][y0] is 1, 2, 3, or 4), or NSST is applied (lfnst_idx[x0][y0] has a non-zero value), the decoder may determine that implicit MTS is disabled.
[0247] As an example, Fig.32 A modification (3200) to the text (2800) is shown, which corresponds to the situation where neither MTS nor NSST is applied to the current block. As shown, the original condition (iii) in the text (2800) is replaced by the condition that two CU-level syntax elements "tu_mts_idx[x0][y0] and lfnst_idx[x0][y0] are both equal to 0".
[0248] 3.2 When MTS, NSST, and MIP are not applied
[0249] In an embodiment, whether implicit transform can be applied to an intra-coded block depends on whether MTS, NSST and MIP are not applied to the intra-coded block as indicated by the block level syntax elements.Compared to Section III.3.1, an additional coding tool MIP is considered.
[0250] For example, the decoder may receive first, second, and third CU-level (or block-level) syntax elements associated with a current block, where the current block is intra-coded and not predicted by the ISP mode. The current block may be located at coordinates [x0][y0] within the picture.
[0251] The first CU level syntax element (e.g., tu_mts_idx[x0][y0]) may indicate that DCT-2 transform is used for the current block instead of the transform used in MTS. The second CU level syntax element (e.g., lfnst_idx[x0][y0]) may indicate that NSST is not applied to the current block. The third CU level syntax element (e.g., tu_mip_flag) may indicate that MIP is not applied to the current block. Based on the above three CU level syntax elements, the decoder may determine that implicit MTS is enabled for the current block.
[0252] On the contrary, if the above three CU-level syntax elements indicate that MTS is applied (the value of tu_mts_idx[x0][y0] is 1, 2, 3 or 4), NSST is applied (lfnst_idx[x0][y0] has a non-zero value), or MIP is applied (the value of tu_mip_flag is 1), the decoder can determine that implicit MTS is disabled.
[0253] As an example, Fig.33 A modification (3300) to the text (2800) is shown, which corresponds to the situation where neither MTS, NSST nor MIP is applied to the current block. As shown, the original condition (iii) in the text (2800) is replaced by the condition that the three CU-level syntax elements "tu_mts_idx[x0][y0], intra_mip_flag[x0][y0] and lfnst_idx[x0][y0] are all equal to 0".
[0254] 4. Example of Transform Coding Process
[0255] Figure 34-36Flowcharts of transform coding processes (3400), (3500) and (3600) according to some embodiments of the present disclosure are shown. Processes (3400), (3500) and (3600) may be used for inverse transform processing at a decoder to generate a residual block for a block being reconstructed. In various embodiments, processes (3400), (3500) and (3600) may be performed by processing circuits, such as processing circuits in terminal devices (210), (220), (230) and (240), processing circuits that perform the functions of a video decoder (310), processing circuits that perform the functions of a video decoder (410), etc. In some embodiments, processes (3400), (3500) and (3600) are implemented in software instructions, so that when the processing circuit executes the software instructions, the processing circuit performs processes (3400), (3500) and (3600).
[0256] 4.1 Process (3400): Enabling Implicit Transformation When Implicit MTS is Disabled
[0257] The process (3400) starts from (S3401) and proceeds to (S3410).
[0258] At (S3410), a first HLS element is received at a decoder. The first HLS element may indicate whether explicit MTS is disabled for an intra-coded block. For example, an intra-coded block is being reconstructed and may therefore be referred to as a current block. The first HLS element may be associated with a set of coded blocks including the current block.
[0259] At (S3420), a second HLS element is received at the decoder. The second HLS element may indicate whether explicit MTS is enabled for the inter-coded block. For example, the second HLS element may be associated with the same set of coded blocks associated with the first HLS element. Both the current block and the inter-coded block are included in the set of coded blocks.
[0260] At (S3430), when the first HLS element indicates that explicit MTS is disabled for intra-coded blocks and the second HLS element indicates that explicit MTS is enabled for inter-coded blocks, the decoder may determine to enable implicit MTS for the current block. The process (3400) may proceed to (S3499) and end at (S3499).
[0261] 4.2 Process (3500): Disabling implicit transformations when other coding tools are enabled
[0262] Process (3500) starts from (S3501) and proceeds to (S3510).
[0263] At (S3510), a first HLS element is received at a decoder. The first HLS element may indicate whether explicit MTS is enabled for an intra-coded block. The intra-coded block may be a block being reconstructed. The first HLS element controls a set of coded blocks including the intra-coded block.
[0264] At (S3520), a second HLS element is received at the decoder. The second HLS element may indicate whether NSST or MIP is disabled for intra-coded blocks. For example, the second HLS element may control the same set of coded blocks as the first HLS element.
[0265] At (S3530), the decoder may determine whether to enable implicit MTS to process the intra-coded block based on the first HLS element and the second HLS element. For example, when the first HLS element indicates that explicit MTS is disabled for the intra-coded block, and the second HLS element indicates that NSST or MIP is disabled for the intra-coded block, the decoder may determine that implicit MTS is enabled for the intra-coded block. Alternatively, when the first HLS element indicates that explicit MTS is disabled for the intra-coded block, but the second HLS element indicates that NSST or MIP is enabled for the intra-coded block, the decoder may determine that implicit MTS is disabled for the intra-coded block. Process (3500) may proceed to (S3599) and end at (S3599).
[0266] 4.3 Process (3600): Enable implicit transformation based on block-level syntax element indication
[0267] The process (3600) starts from (S3601) and proceeds to (S3610).
[0268] At (S3610), an intra-coded block is received at a decoder. The intra-coded block may be associated with a first block-level syntax element indicating whether MTS is applied and a second block-level syntax element indicating whether NSST is applied. For example, the intra-coded block belongs to a CU including a CU-level syntax element including a first block-level syntax element and a second block-level syntax element.
[0269] At (S3620), the decoder may determine whether to enable implicit MTS for an intra-coded block based on a first block-level syntax element and a second block-level syntax element. For example, when the first block-level syntax element indicates that MTS is not applied and the second block-level syntax element indicates that NSST is not applied, the decoder may determine that implicit MTS is enabled for an intra-coded block. Alternatively, when the first block-level syntax element indicates that MTS is not applied but the second block-level syntax element indicates that NSST is applied, the decoder may determine that implicit MTS is disabled for an intra-coded block. Process (3600) may proceed to (S3699) and end at (S3699).
[0270] IV. Computer System
[0271] The above techniques may be implemented as computer software via computer-readable instructions and physically stored in one or more computer-readable media. Fig.37 A computer system (3700) is shown that is suitable for implementing certain embodiments of the disclosed subject matter.
[0272] The computer software may be encoded in any suitable machine code or computer language, and may be assembled, compiled, linked, or the like to create a code comprising instructions, which may be directly executed by one or more computer central processing units (CPUs), graphics processing units (GPUs), etc., or executed by decoding, microcode, or the like.
[0273] The instructions may be executed on various types of computers or components thereof, including, for example, personal computers, tablets, servers, smartphones, gaming devices, IoT devices, etc.
[0274] Fig.37 The components shown for the computer system (3700) are exemplary in nature and are not intended to impose any limitations on the scope of use or functionality of computer software implementing the disclosed embodiments. Nor should the configuration of the components be interpreted as having any dependency or requirement on any one or combination of components shown in the exemplary embodiment of the computer system (3700).
[0275] The computer system (3700) may include certain human-computer interface input devices. Such human-computer interface input devices may respond to input from one or more human users through tactile input (e.g., keyboard input, sliding, data glove movement), audio input (e.g., sound, applause), visual input (e.g., gestures), and olfactory input (not shown). The human-computer interface devices may also be used to capture certain media that are not necessarily directly related to human conscious input, such as audio (e.g., speech, music, ambient sound), images (e.g., scanned images, photographic images obtained from a still image camera), and videos (e.g., two-dimensional video, three-dimensional video including stereoscopic video).
[0276] The human-computer interface input device may include one or more of the following (only one of which is drawn): keyboard (3701), mouse (3702), touchpad (3703), touch screen (3710), data gloves (not shown), joystick (3705), microphone (3706), scanner (3707), camera (3708).
[0277] The computer system (3700) may also include certain human-computer interface output devices. Such human-computer interface output devices may stimulate the senses of one or more human users through, for example, tactile output, sound, light, and smell / taste. Such human-computer interface output devices may include tactile output devices (e.g., tactile feedback through a touch screen (3710), a data glove (not shown), or a joystick (3705), but there may also be tactile feedback devices that are not used as input devices), audio output devices (e.g., speakers (3709), headphones (not shown)), visual output devices (e.g., screens (3710) including cathode ray tube screens, liquid crystal screens, plasma screens, organic light emitting diode screens, each of which has or does not have a touch screen input function, each of which has or does not have a tactile feedback function - some of which can output two-dimensional visual output or output of more than three dimensions by means such as stereoscopic image output; virtual reality glasses (not shown), holographic displays, and smoke boxes (not shown)) and printers (not shown).
[0278] The computer system (3700) may also include human-accessible storage devices and their associated media, such as optical media including high-density read-only / rewritable optical disks (CD / DVD ROM / RW) (3720) with CD / DVD or similar media (3721), thumb drives (3722), removable hard disk drives or solid state drives (3723), traditional magnetic media such as tapes and floppy disks (not shown), special-purpose ROM / ASIC / PLD-based devices such as security software protectors (not shown), and the like.
[0279] Those skilled in the art should also understand that the term "computer-readable media" used in connection with the disclosed subject matter does not include transmission media, carrier waves, or other transient signals.
[0280] The computer system (3700) may also include an interface to one or more communication networks. For example, the network may be wireless, wired, or optical. The network may also be a local area network, a wide area network, a metropolitan area network, an in-vehicle network, an industrial network, a real-time network, a delay-tolerant network, and the like. The network also includes local area networks such as Ethernet, wireless local area networks, cellular networks (GSM, 3G, 4G, 5G, LTE, etc.), television wired or wireless wide area digital networks (including cable television, satellite television, and terrestrial broadcast television), in-vehicle and industrial networks (including CANBus), and the like. Some networks typically require an external network interface adapter for connecting to some universal data ports or peripheral buses (3749) (e.g., a USB port of the computer system (3700)); other systems are typically integrated into the core of the computer system (3700) by connecting to the system bus as described below (e.g., an Ethernet interface integrated into a PC computer system or a cellular network interface integrated into a smart phone computer system). By using any of these networks, the computer system (3700) can communicate with other entities. The communication can be one-way, for receiving only (e.g., wireless television), one-way for sending only (e.g., CAN bus to certain CAN bus devices), or two-way, such as to other computer systems via a local or wide area digital network. Each of the above networks and network interfaces can use certain protocols and protocol stacks.
[0281] The above-mentioned human-machine interface devices, human-accessible storage devices, and network interfaces can be connected to the core (3740) of the computer system (3700).
[0282] The core (3740) may include one or more central processing units (CPUs) (3741), graphics processing units (GPUs) (3742), dedicated programmable processing units in the form of field programmable gate arrays (FPGAs) (3743), hardware accelerators for specific tasks (3744), etc. These devices, as well as read-only memory (ROM) (3745), random access memory (3746), internal mass storage (e.g., internal non-user accessible hard disk drives, solid-state drives, etc.) (3747), etc., may be connected via a system bus (3748). In some computer systems, the system bus (3748) may be accessed in the form of one or more physical plugs so that it can be expanded by additional central processing units, graphics processing units, etc. Peripheral devices may be directly attached to the core's system bus (3748) or connected via a peripheral bus (3749). The architecture of the peripheral bus includes PCI, USB, etc.
[0283] The CPU (3741), GPU (3742), FPGA (3743) and accelerator (3744) can execute certain instructions, which can be combined to form the above-mentioned computer code. The computer code can be stored in ROM (3745) or RAM (3746). Transition data can also be stored in RAM (3746), while permanent data can be stored in, for example, internal mass storage (3747). Fast storage and retrieval of any memory device can be achieved by using a cache memory, which can be closely associated with one or more CPUs (3741), GPUs (3742), mass storage (3747), ROM (3745), RAM (3746), etc.
[0284] The computer readable medium may have computer code thereon for performing various computer-implemented operations. The medium and computer code may be specially designed and constructed for the purposes of the present disclosure, or may be the medium and code well known and available to those skilled in the art of computer software.
[0285] As an example and not a limitation, a computer system having an architecture (3700), in particular a core (3740), can provide the function of executing software contained in one or more tangible computer-readable media as a processor (including a CPU, a GPU, an FPGA, an accelerator, etc.). Such a computer-readable medium can be a medium associated with the above-mentioned user-accessible mass storage, as well as a specific memory of the core (3740) having non-volatility, such as a core internal mass storage (3747) or a ROM (3745). Software implementing various embodiments of the present disclosure can be stored in such a device and executed by the core (3740). Depending on specific needs, the computer-readable medium may include one or more storage devices or chips. The software can enable the core (3740), in particular the processor therein (including a CPU, a GPU, an FPGA, etc.) to perform a specific process or a specific part of a specific process described herein, including defining a data structure stored in the RAM (3746) and modifying such a data structure according to a software-defined process. Additionally or alternatively, the computer system may provide functionality hardwired in logic or otherwise contained in circuitry (e.g., accelerator (3744)) that may operate in place of or in conjunction with software to perform specific processes or specific portions of specific processes described herein. Where appropriate, references to software may include logic and vice versa. Where appropriate, references to computer-readable media may include circuitry (such as an integrated circuit (IC)) storing execution software, circuitry containing execution logic, or both. The present disclosure includes any suitable combination of hardware and software.
[0286] Appendix A: Acronyms
[0287] AMT: Adaptive Multiple Transform
[0288] ASIC: Application-Specific Integrated Circuit
[0289] BMS: Benchmark set
[0290] CANBus: Controller Area Network Bus
[0291] CCLM: Cross-Component Linear Model
[0292] CD: Compact Disc
[0293] COT: Compound Orthonormal Transform
[0294] CPUs: Central Processing Units
[0295] CRT: Cathode Ray Tube
[0296] CTBs: Coding Tree Blocks
[0297] CTUs: Coding Tree Units
[0298] CU: Coding Unit
[0299] DVD: Digital Video Disc
[0300] EMT: Enhanced Multiple Transform
[0301] FPGA: Field Programmable Gate Areas
[0302] GOPs: Groups of Pictures
[0303] GPUs: Graphics Processing Units
[0304] GSM: Global System for Mobile communications
[0305] HDR: high dynamic range
[0306] HEVC: High Efficiency Video Coding
[0307] HLS: High-Level Syntax
[0308] HRD: Hypothetical Reference Decoder
[0309] IBC: Intra Block Copy
[0310] IC:Integrated Circuit
[0311] IDT: Identity transform
[0312] ISP: Intra Sub-Partitioning
[0313] JEM: Joint Exploration Model
[0314] JVET: Joint Video Exploration Team
[0315] KLT: KL Transform (Karhunen-Loève Transform)
[0316] LAN: Local Area Network
[0317] LCD: Liquid-Crystal Display
[0318] LFNST: Low-Frequency Non-Separable Secondary Transform
[0319] LTE: Long-Term Evolution
[0320] MIP: Matrix-based Intra Prediction Mode
[0321] MRL (or MRLP): Multiple reference line prediction
[0322] MTS: Multiple Transform Selection
[0323] MV: Motion Vector
[0324] NSST: Non-Separable Secondary Transform
[0325] OLED: Organic Light-Emitting Diode
[0326] PBs: Prediction Blocks
[0327] PCI: Peripheral Component Interconnect
[0328] PLD: Programmable Logic Device
[0329] PPS: Picture Parameter Set
[0330] PU: Prediction Unit
[0331] RAM: Random Access Memory
[0332] ROM: Read-Only Memory
[0333] RST: Reduced-Size Transform
[0334] SBT: Sub-block Transform
[0335] SDR: standard dynamic range
[0336] SEI: Supplementary Enhancement Information
[0337] SNR: Signal Noise Ratio
[0338] SPS: Sequence Parameter Set
[0339] SSD: solid-state drive
[0340] SVT: Spatially Varying Transform
[0341] TSM: Transform Skip Mode
[0342] TUs: Transform Units
[0343] USB: Universal Serial Bus
[0344] VPS: Video Parameter Set
[0345] VUI: Video Usability Information
[0346] VVC: universal video coding
[0347] Although the present disclosure has described a number of exemplary embodiments, various changes, arrangements and various equivalent substitutions of the embodiments are within the scope of the present disclosure. It should therefore be understood that those skilled in the art are capable of designing a variety of systems and methods, which, although not explicitly shown or described herein, embody the principles of the present disclosure and are therefore within the spirit and scope of the present disclosure.
Claims
1. A video decoding method, characterized in that: include: Receiving a first high-level syntax HLS element, the first HLS element indicating whether explicit multi-transform selection (MTS) is enabled or disabled for an intra-coded block; Receiving a second HLS element, the second HLS element indicating whether the explicit MTS is enabled or disabled for an inter-coded block, wherein the first HLS element and the second HLS element control a same set of coded blocks, the same set of coded blocks including the intra-coded block and the inter-coded block; When the first HLS element indicates that the explicit MTS is disabled for the intra-coded block, enabling implicit MTS for the intra-coded block; as well as When the second HLS element indicates that the explicit MTS is enabled for the inter-frame coding block, the explicit MTS is enabled for the inter-frame coding block; when the second HLS element indicates that the implicit MTS is enabled for the inter-frame coding block, the implicit MTS is enabled for the inter-frame coding block.
2. The method according to claim 1, characterized in that Further including: The implicit MTS is applied to the intra-coded block, wherein a transform type used to process the intra-coded block is determined according to a size of the intra-coded block.
3. The method according to claim 1, characterized in that The first HLS element or the second HLS element is one of the following: Video parameter set VPS syntax elements, Sequence parameter set SPS syntax element, Picture parameter set PPS syntax element, Slice header syntax elements, The tile header syntax element, or Tile group header syntax element.
4. The method according to claim 1, characterized in that The intra-coded block is not encoded using the intra sub-partition ISP mode.
5. The method according to any one of claims 1 to 4, characterized in that: Further including: A third HLS element is received, the third HLS element indicating that MTS is enabled for each of the inter-coded block and the intra-coded block.
6. A method for video decoding, characterized in that: include: receiving a first high-level syntax HLS element, the first HLS element indicating whether an explicit multi-transform selection (MTS) is enabled or disabled for an intra-coded block, wherein transform type information indicating a transform type is signaled in the explicit MTS; receiving a second HLS element sps_lfnst_enabled_flag, the second HLS element indicating whether to disable a low frequency non-separable secondary transform LFNST for the intra-coded block; and Implicit MTS is enabled for the intra-coded block if: (i) the first HLS element indicates that the explicit MTS is disabled for the intra-coded block, and (ii) The second HLS element indicates that the LFNST is disabled for the intra-coded block, wherein when the LFNST is disabled, the sps_lfnst_enabled_flag is equal to 0, the MTS index is equal to 0, and lfnst_idx is not signaled.
7. The method according to claim 6, characterized in that Further including: The implicit MTS is applied to the intra-coded block, wherein a transform type used to process the intra-coded block is determined according to a size of the intra-coded block.
8. The method according to claim 6, characterized in that The first HLS element is one of the following: Video parameter set VPS syntax elements, Sequence parameter set SPS syntax element, Picture parameter set PPS syntax element, Slice header syntax elements, The tile header syntax element, or Tile group header syntax element.
9. The method according to claim 6, characterized in that The intra-coded block is not encoded using the intra sub-partition ISP mode.
10. The method according to claim 6, characterized in that Further including: A third HLS element is received, the third HLS element indicating that MTS is enabled for each of the inter-coded blocks and the intra-coded blocks.
11. The method according to any one of claims 6 to 10, characterized in that: The transform type information includes the MTS index, and the MTS index signals the display MTS.
12. A coding method for generating a video code stream, characterized in that: include: signaling a first high-level syntax HLS element, the first HLS element indicating whether explicit multi-transform selection (MTS) is enabled or disabled for an intra-coded block; signaling a second HLS element, the second HLS element indicating whether the explicit MTS is enabled or disabled for an inter-coded block, wherein the first HLS element and the second HLS element control a same set of coded blocks, the same set of coded blocks including the intra-coded block and the inter-coded block; When the first HLS element indicates that the explicit MTS is disabled for the intra-coded block, enabling implicit MTS for the intra-coded block; as well as When the second HLS element indicates that the explicit MTS is enabled for the inter-frame coding block, the explicit MTS is enabled for the inter-frame coding block; when the second HLS element indicates that the implicit MTS is enabled for the inter-frame coding block, the implicit MTS is enabled for the inter-frame coding block.
13. A coding method for generating a video code stream, characterized in that: include: generating a first high-level syntax HLS element, the first HLS element indicating whether an explicit multi-transform selection (MTS) is enabled or disabled for an intra-coded block, wherein transform type information indicating a transform type is signaled in the explicit MTS; generating a second HLS element sps_lfnst_enabled_flag, the second HLS element indicating whether to disable a low frequency non-separable secondary transform LFNST for the intra-coded block; and The first HLS element and the second HLS element are encoded in a bitstream, wherein Implicit MTS is enabled for the intra-coded block if: (i) the first HLS element indicates that the explicit MTS is disabled for the intra-coded block, and (ii) The second HLS element indicates that the LFNST is disabled for the intra-coded block, wherein when the LFNST is disabled, the sps_lfnst_enabled_flag is equal to 0, the MTS index is equal to 0, and lfnst_idx is not signaled.
14. A video decoding device, characterized in that: The method comprises a processing circuit configured to execute the method according to any one of claims 1 to 11.
15. A video encoding device, characterized in that: The method comprises a processing circuit configured to perform the encoding method according to claim 12 or 13.
16. A non-volatile computer readable medium, characterized in that: The device is used for storing instructions, and when the instructions are executed by a computer for video encoding / decoding, the computer executes the method according to any one of claims 1 to 13.
17. A method for processing a code stream, characterized in that: A video code stream is stored on a non-volatile computer-readable storage medium, wherein the video code stream is generated according to the video encoding method according to claim 12 or 13, or is decoded based on the video decoding method according to any one of claims 1-5 or any one of claims 6-11.
Citation Information
Cited By
Mode configuration using spatial information in video coding
WO2026218395A1
