Video coding and decoding method and device and storage medium

By controlling the use of encoding tools in video data, especially by disabling or enabling intra-frame prediction and motion compensation, the encoding process of video data is optimized, solving the problem of low encoding efficiency in existing technologies and achieving more efficient storage and transmission.

CN118972612APending Publication Date: 2024-11-15TENCENT AMERICA LLC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410934417.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2022-03-31
Filing Date
2022-04-29
Publication Date
2024-11-15

AI Technical Summary

Technical Problem

Existing video coding technologies struggle to effectively utilize intra-frame prediction and motion compensation techniques to reduce redundant information when processing video data, resulting in low coding efficiency, especially in high-resolution and high-frame-rate video data where storage and transmission bandwidth requirements are significant.

Method used

By controlling the use of encoding tools in video data processing, especially the positional encoding of transform coefficients, and utilizing syntax elements to disable or enable specific encoding tools such as intra-frame prediction and motion compensation, the encoding and decoding process of video data can be optimized.

Benefits of technology

It improves the efficiency of video encoding, reduces storage and transmission requirements, adapts to video data processing of different resolutions and levels, and enhances the flexibility and efficiency of encoding tools.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118972612A_ABST
    Figure CN118972612A_ABST
Patent Text Reader

Abstract

Aspects of the present disclosure provide methods and apparatus for video data processing. In some examples, an apparatus for video data processing includes processing circuitry. For example, processing circuitry determines a first syntax element for encoding control in a first range of encoded video data in a code stream. The first syntax element is associated with a coding tool for coding a position of a last significant coefficient during entropy coding of transform coefficients. Then, in response to the first syntax element being a first value indicating that the encoding tool is disabled in the first range, the processing circuitry decodes the first range of encoded video data in the bitstream without invoking the encoding tool, the first range of encoded video data comprising one or more second ranges of encoded video data.
Need to check novelty before this filing date? Find Prior Art

Description

Incorporation by Reference

[0001] This application claims priority to U.S. Patent Application No. 17 / 710,748, filed on March 31, 2022, "TECHNIQUES FOR CONSTRAINTFLAG SIGNALING FOR RANGE EXTENSION WITH CODING FOR LAST SIGNIFICANTCOEFFICIENT," which claims priority to U.S. Provisional Application No. 63 / 250,155, filed on September 29, 2021, "TECHNIQUES FOR CONSTRAINTFLAG SIGNALING FOR RANGE EXTENSION WITH REVERSE LAST SIGNIFICANTCOEFFICIENT." The disclosures of the prior applications are hereby incorporated by reference in their entirety. Technical Field

[0002] This disclosure describes embodiments that generally relate to video encoding. Background Art

[0003] The background description provided herein is intended to present the background of the present application as a whole. The extent to which the work of the presently named inventors described in the background section and various aspects of this specification is performed does not indicate that it is prior art at the time of filing this application, and it is never explicitly or implicitly admitted that it is prior art for this application.

[0004] Video encoding and decoding are enabled by inter-picture prediction techniques with motion compensation. An uncompressed digital video may include a series of pictures, each picture having spatial dimensions such as 1920×1080 luminance samples and associated chrominance samples. The series of pictures has 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 specific bitrate requirements. For example, 1080p60 4:2:0 video (1920x1080 luminance sample resolution, 60Hz frame rate) with 8 bits per sample requires close to 1.5Gbit / s bandwidth. One hour of such video requires more than 600GB of storage space.

[0005] One goal of video encoding and decoding is to reduce redundant information in the input video signal through compression. Video compression can help reduce the bandwidth and / or storage space requirements mentioned above, in some cases by two or more orders of magnitude. Both lossless and lossy compression, as well as combinations of the two, can be used. Lossless compression refers to techniques that reconstruct an exact replica 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 may be able to tolerate higher distortion than users of television applications. The achievable compression ratio reflects that higher allowed / tolerant distortion results in higher compression ratios.

[0006] Video encoders and decoders may utilize techniques from several broad categories including, for example, motion compensation, transforms, quantization, and entropy coding and decoding.

[0007] Video codec techniques may include techniques known as intra-frame coding. In intra-frame coding, sample values ​​are represented without reference to samples or other data from previously reconstructed reference pictures. In some video codecs, pictures are spatially subdivided into blocks of samples. When all sample blocks are encoded in intra-frame mode, the picture may be an intra-frame picture. Intra-frame pictures and their derivatives (such as independent decoder refresh pictures) can be used to reset the decoder state, and can therefore be used as the first picture in an encoded video stream and video session, or as a still image. Samples of intra-frame blocks can be exposed to transformation, and transform coefficients can be quantized before entropy coding and decoding. Intra-frame prediction can be a technique for minimizing sample values ​​in the pre-transform domain. In some cases, the smaller the DC value after transformation, 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, such as those known from, for example, the MPEG-2 generation of codecs, do not use intra-frame prediction. However, some newer video compression techniques include techniques that attempt to use intra-frame prediction from, for example, surrounding sample data and / or metadata that is obtained during encoding / decoding of spatially adjacent data blocks and precedes the data blocks in decoding order. Such techniques are hereinafter referred to as "intra-frame prediction" techniques. Note that, in at least some cases, intra-frame prediction uses only reference data from the current picture being reconstructed, and not reference data from reference pictures.

[0009] There can be many different forms of intra-frame prediction. When more than one such technique can be used in a given video codec technique, the technique used can be encoded in the intra-frame prediction mode. In some cases, a mode can have sub-modes and / or parameters, and these sub-modes and / or parameters can be encoded separately or included in the mode codeword. The codeword to be used for a given mode / sub-mode / parameter combination may have an impact on the coding efficiency gain through intra-frame prediction, and the same is true for the entropy coding and decoding technique that converts the codeword into a bitstream.

[0010] Some mode of intra prediction was introduced with H.264, improved in H.265, and further improved in newer codecs such as joint exploration model (JEM), versatile video coding (VVC), and benchmark set (BMS). The predictor block can be formed using neighboring sample values ​​belonging to samples that are already available. Sample values ​​of neighboring samples are copied into the predictor block according to the direction. A reference to the direction in use can be encoded in the bitstream, or it can be predicted itself.

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

[0012] Still referring to FIG. 1A , a square block (104) comprising 4×4 samples is shown at the upper left (indicated by the thick dashed line). The square block (104) comprises 16 samples, each of which is labeled with “S”, and its position in the Y dimension (e.g., row index) and its position in the X dimension (e.g., column index). For example, sample S21 is the second sample in the Y dimension (starting from the top) and the first sample in the X dimension (starting from the left). Similarly, sample S44 is the fourth sample in the block (104) in both the X and Y dimensions. Since the block is a 4×4 size sample, S44 is located in the lower right corner. Reference samples following a similar numbering scheme are also shown. The reference samples are labeled with “R”, and their Y position (e.g., row index) and X position (e.g., column index) relative to the block (104). In H.264 and H.265, the prediction samples are adjacent to the block being reconstructed, so there is no need to use negative values.

[0013] Intra-picture prediction can be performed by copying reference sample values ​​from neighboring samples occupied by a signaled prediction direction. For example, assume that the encoded video bitstream includes signaling that indicates, for this block, a prediction direction consistent with arrow (102), i.e., predicting samples based on one or more prediction samples to the upper right at a 45 degree angle to the horizontal. In this case, samples S41, S32, S23, and S14 are predicted based on the same reference sample R05. Sample S44 is predicted based on reference sample R08.

[0014] In some cases, for example by interpolation, the values ​​of multiple reference samples may be combined in order to calculate the reference sample, particularly when the direction is not divisible by 45 degrees.

[0015] As video coding techniques have evolved, the number of possible directions has increased. In H.264 (2003), nine different directions could be represented. This increased to 33 in H.265 (2013) and JEM / VVC / BMS, and at the time of this application, up to 65 directions can be supported. Experiments have been conducted to identify the most likely directions, and certain techniques in entropy coding are used to represent those possible directions using a small number of bits, accepting some penalty for less likely directions. Additionally, the direction itself can sometimes be predicted based on neighboring directions used in adjacent, already decoded blocks.

[0016] FIG. 1B shows a schematic diagram ( 105 ) depicting 65 intra prediction directions according to JEM to illustrate the increasing number of prediction directions over time.

[0017] The mapping of the intra-frame prediction direction bits representing directions in the coded video bitstream can vary depending on the video coding technique, and can range from simple direct mapping of prediction directions to intra-frame prediction modes to codewords, to complex adaptive schemes involving the most probable mode, and similar techniques, for example. However, in all cases, there may be certain directions in the video content that are statistically less likely to occur than certain other directions. Since the goal of video compression is to reduce redundancy, in well-working video coding techniques, those unlikely directions will be represented by a larger number of bits than more likely directions.

[0018] 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 in use (the latter may indirectly be the temporal dimension).

[0019] 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 associated with 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 the MV, thereby eliminating redundant information and increasing the amount of compression. MV prediction can be done effectively, for example, when encoding an input video signal derived from a camera (called natural video), there is a statistical probability that regions larger than the region to which a single MV applies will move in a similar direction, so in some cases, similar motion vectors derived from MVs of neighboring 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 coding, it can be represented with fewer bits than the number of bits used when the MV is directly encoded. 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 when calculating predicted values ​​based on several surrounding MVs.

[0020] H.265 / HEVC (ITU-T Rec. H.265, "High Efficiency Video Coding", December 2016) describes various MV prediction mechanisms. Among the various MV prediction mechanisms provided by H.265, this article describes a technique hereinafter referred to as "spatial merging".

[0021] Referring to Figure 2, the current block (201) includes samples found by the encoder during motion search, which can be predicted based on the previous block that has been spatially moved by the same size. The MV is not encoded directly, but is derived from metadata associated with one or more reference pictures, such as the most recent (in decoding order) reference picture, by using the MV associated with any of the five surrounding samples. The five surrounding samples are represented by A0, A1 and B0, B1, B2 (from 202 to 206). 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

[0022] Various aspects of the present disclosure provide methods and apparatus for video data processing. In some examples, an apparatus for video data processing includes a processing circuit. For example, the processing circuit determines a first syntax element for encoding control in a first range of encoded video data in a code stream. The first syntax element is associated with a coding tool that is used to encode the position of the last significant coefficient during entropy coding of transform coefficients. Then, in response to the first syntax element being a first value indicating that the coding tool is disabled in the first range, the processing circuit decodes the first range of encoded video data in the code stream without calling the coding tool, and the first range of encoded video data includes one or more second ranges of encoded video data.

[0023] In some examples, the first syntax element is in general constraint information, the general constraint information being used to control coding of pictures in an output layer set. The first value of the first syntax element is used to indicate that the coding tool is disabled in each coded layer video sequence CLVS in the output layer set. The coding tool encodes the position of the last significant coefficient in a transform block relative to a lower right corner of the transform block. In some examples, the value of the second syntax element indicates that a slice header flag associated with the coding tool is not present in a slice header of a slice in a picture of the CLVS.

[0024] In some instances, in response to the first syntax element being a second value, the processing circuit determines a value of a second syntax element for encoding control of a coded layer video sequence CLVS in the codestream, the second syntax element indicating enablement / disablement of the encoding tool in the coded layer video sequence CLVS. Further, in some examples, in response to the value of the second syntax element indicating enablement of the encoding tool in the coded layer video sequence CLVS, the processing circuit decodes a slice header flag in a slice header of a slice, the slice header flag indicating use / non-use of the encoding tool for encoding the slice.

[0025] In some examples, to determine the value of the second syntax element, the processing circuit infers the value of the second syntax element for indicating disabling of the encoding tool in the coded layer video sequence CLVS in response to the second syntax element not being present in the sequence parameter set SPS of the coded layer video sequence CLVS.

[0026] In some examples, to determine the first syntax element, the processing circuit decodes the first syntax element from a syntax structure of generic constraint information in response to a syntax element in the syntax structure having additional bits indicating generic constraint information in the syntax structure.

[0027] Various aspects of the present disclosure also provide a non-transitory computer-readable storage medium storing instructions, which, when executed by a computer for video decoding, cause the computer to perform the method for video decoding. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] Other features, properties and various advantages of the disclosed subject matter will become more apparent from the following detailed description and accompanying drawings, in which:

[0029] FIG. 1A is a diagram illustrating an exemplary subset of intra prediction modes.

[0030] FIG. 1B is a diagram of exemplary intra prediction directions.

[0031] FIG. 2 is a schematic diagram of an exemplary current block and its surrounding spatial merging candidates.

[0032] Figure 3 is a schematic diagram of a simplified block diagram of a communication system (300) according to an embodiment.

[0033] Figure 4 is a schematic diagram of a simplified block diagram of a communication system (400) according to an embodiment.

[0034] Figure 5 is a schematic diagram of a simplified block diagram of a decoder according to an embodiment.

[0035] Figure 6 is a schematic diagram of a simplified block diagram of an encoder according to an embodiment.

[0036] Figure 7 A block diagram of an encoder according to another embodiment is shown.

[0037] Figure 8 A block diagram of a decoder according to another embodiment is shown.

[0038] Fig. 9 An example of signaling adaptive resolution change (ARC) parameters according to an embodiment of the present disclosure is shown.

[0039] Fig.10 An example of a table (1000) for mapping upsampling factors or downsampling factors, codewords, and exponential-Golomb codes is shown.

[0040] Fig.11 Some examples of ARC parameter signaling according to some embodiments of the present disclosure are shown.

[0041] Fig.12 Examples of syntax structures of PTL syntax element sets in some examples are shown.

[0042] Fig.13 An example of the syntax structure of general constraint information in some examples is shown.

[0043] FIG. 14A to FIG. 14B An example of PTL information including a PTL syntax structure and a general constraint information syntax structure according to some embodiments of the present disclosure is shown.

[0044] FIG. 15A to FIG. 15B An example of a general constraint information syntax structure according to an embodiment of the present disclosure is shown.

[0045] Fig.16 The grammatical structure of general constraint information according to some embodiments of the present disclosure is shown.

[0046] Fig.17 An example of a syntax structure for sequence parameter set (SPS) range extension according to some embodiments of the present disclosure is shown.

[0047] Fig.18 A flowchart outlining a process according to an embodiment of the present disclosure is shown.

[0048] Fig.19 A flowchart outlining a process according to an embodiment of the present disclosure is shown.

[0049] Fig. 20 is a schematic diagram of a computer device according to an embodiment. DETAILED DESCRIPTION

[0050] According to the embodiment Figure 3 3 is a simplified block diagram of a communication system (300) according to an embodiment disclosed in the present application. The communication system (300) includes a plurality of terminal devices, which can communicate with each other through, for example, a network (350). For example, the communication system (300) includes a first pair of terminal devices (310) and a terminal device (320) interconnected through the network (350). Figure 3 In an embodiment, the terminal device (310) and the terminal device (320) perform unidirectional data transmission. For example, the terminal device (310) may encode video data (e.g., a video picture stream collected by the terminal device (310)) for transmission to another terminal device (320) via the network (350). The encoded video data is transmitted in the form of one or more encoded video code streams. The terminal device (320) may receive the encoded video data from the network (350), 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.

[0051] In another embodiment, the communication system (300) includes a second pair of terminal devices (330) and (340) that perform bidirectional transmission of encoded video data, which can occur, for example, during a video conference. For bidirectional data transmission, each of the terminal devices (330) and the terminal device (340) can encode video data (e.g., a video picture stream collected by the terminal device) for transmission to the other terminal device (330) and the terminal device (340) through the network (350). Each of the terminal devices (330) and the terminal device (340) can also receive the encoded video data transmitted by the other terminal device (330) and the terminal device (340), 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.

[0052] exist Figure 3 In the embodiment of the present invention, the terminal device (310), the terminal device (320), the terminal device (330) and the terminal device (340) may be a server, a personal computer and a smart phone, but the principles disclosed in the present application may not be limited thereto. The embodiments disclosed in the present application are applicable to laptop computers, tablet computers, media players and / or dedicated video conferencing equipment. The network (350) represents any number of networks that transmit encoded video data between the terminal devices (310), the terminal devices (320), the terminal devices (330) and the terminal devices (340), including, for example, wired (wired) and / or wireless communication networks. The communication network (350) 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 purpose of this discussion, unless explained below, the architecture and topology of the network (350) may be irrelevant to the operation disclosed in the present application.

[0053] As an example, Figure 4 The video encoder and video decoder are shown in a streaming environment. The subject matter disclosed in this application 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.

[0054] The streaming system may include an acquisition subsystem (413), which may include a video source (401) such as a digital camera, which creates an uncompressed video picture stream (402). In an embodiment, the video picture stream (402) includes samples taken by a digital camera. Compared to the encoded video data (404) (or the encoded video bitstream), the video picture stream (402) is depicted as a thick line to emphasize the high data volume of the video picture stream, and the video picture stream (402) can be processed by an electronic device (420), which includes a video encoder (403) coupled to the video source (401). The video encoder (403) 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 (402), the encoded video data (404) (or the encoded video bitstream (404)) is depicted as a thin line to emphasize the lower amount of data of the encoded video data (404) (or the encoded video bitstream (404)), which can be stored on the streaming server (405) for future use. One or more streaming client subsystems, such as Figure 4 The client subsystem (406) and the client subsystem (408) in the video transmission system can access the streaming server (405) to retrieve the copy (407) and the copy (409) of the encoded video data (404). The client subsystem (406) may include, for example, a video decoder (410) in the electronic device (430). The video decoder (410) decodes the incoming copy (407) of the encoded video data and generates an output video picture stream (411) that can be presented on a display (412) (e.g., a display screen) or another presentation device (not depicted). In some streaming transmission systems, the encoded video data (404), the video data (407), and the video data (409) (e.g., a video bitstream) can be encoded according to certain video encoding / compression standards. Examples of these standards include ITU-T H.265. In an embodiment, the video coding standard under development is informally referred to as Versatile Video Coding (VVC), and the present application can be used in the context of the VVC standard.

[0055] It should be noted that the electronic device (420) and the electronic device (430) may include other components (not shown). For example, the electronic device (420) may include a video decoder (not shown), and the electronic device (430) may also include a video encoder (not shown).

[0056] Figure 5is a block diagram of a video decoder (510) according to an embodiment disclosed in the present application. The video decoder (510) may be provided in an electronic device (530). The electronic device (530) may include a receiver (531) (e.g., a receiving circuit). The video decoder (510) may be used to replace Figure 4 A video decoder (410) of an embodiment.

[0057] The receiver (531) may receive one or more encoded video sequences to be decoded by the video decoder (510); 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 (501), which may be a hardware / software link to a storage device storing the encoded video data. The receiver (531) 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 (531) may separate the encoded video sequence from the other data. To prevent network jitter, a buffer memory (515) may be coupled between the receiver (531) and the entropy decoder / parser (520) (hereinafter referred to as "parser (520)"). In some applications, the buffer memory (515) is part of the video decoder (510). In other cases, the buffer memory (515) may be provided external to the video decoder (510) (not shown). In other cases, a buffer memory (not shown) is provided outside the video decoder (510) to prevent network jitter, for example, and another buffer memory (515) may be configured inside the video decoder (510) to handle broadcast timing, for example. When the receiver (531) 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 (515), 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 (515) 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 (510).

[0058] The video decoder (510) may include a parser (520) to reconstruct symbols (521) from the encoded video sequence. The types of symbols include information used to manage the operation of the video decoder (510) and potential information used to control a display device such as a display device (512) (e.g., a display screen) that is not part of the electronic device (530) but can be coupled to the electronic device (530), such as Figure 5As 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 (520) 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 (520) 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 (520) may also extract information from the encoded video sequence, such as transform coefficients, quantizer parameter values, motion vectors, and so on.

[0059] The parser (520) may perform entropy decoding / parsing operations on the video sequence received from the buffer memory (515), thereby creating symbols (521).

[0060] 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 (521) 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 (520) from the coded video sequence. For the sake of brevity, such subgroup control information flow between the parser (520) and the multiple units below is not described.

[0061] In addition to the functional blocks already mentioned, the video decoder (510) 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.

[0062] The first unit is a sealer / inverse transform unit (551). The sealer / inverse transform unit (551) receives quantized transform coefficients as symbols (521) from the parser (520) and control information, including which transform method to use, block size, quantization factor, quantization scaling matrix, etc. The sealer / inverse transform unit (551) can output a block including sample values, which can be input into an aggregator (555).

[0063] In some cases, the output samples of the scaler / inverse transform unit (551) 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 (552). In some cases, the intra-picture prediction unit (552) generates surrounding blocks of the same size and shape as the block being reconstructed using reconstructed information extracted from a current picture buffer (558). For example, the current picture buffer (558) buffers a partially reconstructed current picture and / or a fully reconstructed current picture. In some cases, the aggregator (555) adds the prediction information generated by the intra-prediction unit (552) to the output sample information provided by the scaler / inverse transform unit (551) on a per-sample basis.

[0064] In other cases, the output samples of the scaler / inverse transform unit (551) may belong to an inter-frame coded and potentially motion compensated block. In this case, the motion compensated prediction unit (553) may access the reference picture memory (557) to extract samples for prediction. After the extracted samples are motion compensated according to the symbols (521), these samples may be added to the output of the scaler / inverse transform unit (551) (in this case referred to as residual samples or residual signals) by the aggregator (555) to generate output sample information. The acquisition of the predicted samples by the motion compensated prediction unit (553) from the address in the reference picture memory (557) may be controlled by a motion vector, and the motion vector is provided to the motion compensated prediction unit (553) in the form of the symbols (521), for example, including X, Y and reference picture components. Motion compensation may also include interpolation of sample values ​​extracted from the reference picture memory (557) when using sub-sample accurate motion vectors, motion vector prediction mechanisms, and the like.

[0065] The output samples of the aggregator (555) may be employed by various loop filtering techniques in a loop filter unit (556). 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 (556) as symbols (521) from the parser (520). 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.

[0066] The output of the loop filter unit (556) may be a sample stream that may be output to a display device (512) and stored in a reference picture memory (557) for subsequent inter-picture prediction.

[0067] 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 (520)), the current picture buffer (558) may become part of the reference picture memory (557), and a new current picture buffer may be reallocated before starting to reconstruct a subsequent coded picture.

[0068] The video decoder (510) 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 the metadata of the HRD buffer management signaled in the encoded video sequence.

[0069] In an embodiment, the receiver (531) 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 (510) 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.

[0070] Figure 6 6 is a block diagram of a video encoder (603) according to an embodiment disclosed in the present application. The video encoder (603) is provided in an electronic device (620). The electronic device (620) includes a transmitter (640) (e.g., a transmission circuit). The video encoder (603) can be used to replace Figure 4 A video encoder (403) in an embodiment.

[0071] The video encoder (603) can be used to obtain the video source (601) (not Figure 6 In another embodiment, the video source (601) is a part of the electronic device (620) to receive video samples, and the video source can collect video images to be encoded by the video encoder (603). In another embodiment, the video source (601) is a part of the electronic device (620).

[0072] The video source (601) may provide a source video sequence in the form of a digital video sample stream to be encoded by the video encoder (603), 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 (601) may be a storage device storing previously prepared videos. In a video conferencing system, the video source (601) 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 samples.

[0073] According to an embodiment, the video encoder (603) may encode and compress pictures of a source video sequence into an encoded video sequence (643) in real time or under any other time constraints required by the application. Implementing an appropriate encoding speed is a function of the controller (650). In some embodiments, the controller (650) controls other functional units as described below and is functionally coupled to these units. For the sake of simplicity, coupling is not indicated in the figure. The parameters set by the controller (650) 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 (650) can be used to have other suitable functions that are related to the video encoder (603) optimized for a certain system design.

[0074] In some embodiments, the video encoder (603) operates in an encoding loop. As a simple description, in embodiments, the encoding loop may include a source encoder (630) (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 (633) embedded in the video encoder (603). The decoder (633) reconstructs the symbols to create sample data in a manner similar to how the (remote) decoder creates sample data (because in the video compression technology considered in this application, 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 (634). 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 (634) are also bit-accurate 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.

[0075] The operation of the "local" decoder (633) can be combined with the above Figure 4 The "remote" decoder described in detail for the video decoder (510) is identical. However, additional brief reference is made to Figure 5 , when symbols are available and the entropy encoder (645) and parser (520) are capable of losslessly encoding / decoding the symbols into an encoded video sequence, the entropy decoding portion of the video decoder (510), including the buffer memory (515) and the parser (520), may not be fully implemented in the local decoder (633).

[0076] At this point, it can be observed that any decoder technology other than the 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 present application focuses on decoder operation. The description of encoder technology can be simplified because encoder technology is mutually inverse to the decoder technology described comprehensively. A more detailed description is only needed in certain areas and is provided below.

[0077] During operation, in some embodiments, the source encoder (630) 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 (632) 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.

[0078] The local video decoder (633) may decode the encoded video data of the picture that may be designated as the reference picture based on the symbol created by the source encoder (630). The operation of the encoding engine (632) may be a lossy process. When the encoded video data is available at the video decoder ( Figure 6 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 (633) 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 (634). In this way, the video encoder (603) may store a copy of the reconstructed reference picture locally that has common content (absent transmission errors) with the reconstructed reference picture to be obtained by the remote video decoder.

[0079] The predictor (635) may perform a prediction search for the encoding engine (632). That is, for a new picture to be encoded, the predictor (635) may search the reference picture memory (634) for sample data (as candidate reference pixel blocks) or certain metadata, such as reference picture motion vectors, block shapes, etc., that may serve as appropriate prediction references for the new picture. The predictor (635) 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 (635), 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 (634).

[0080] The controller (650) may manage encoding operations of the source encoder (630), including, for example, setting parameters and subgroup parameters for encoding video data.

[0081] The outputs of all the above functional units may be entropy encoded in an entropy encoder (645). The entropy encoder (645) 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.

[0082] The transmitter (640) may buffer the encoded video sequence created by the entropy encoder (645) in preparation for transmission over a communication channel (660), which may be a hardware / software link to a storage device where the encoded video data will be stored. The transmitter (640) may combine the encoded video data from the video encoder (603) with other data to be transmitted, such as encoded audio data and / or ancillary data streams (source not shown).

[0083] The controller (650) may manage the operation of the video encoder (603). During encoding, the controller (650) 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:

[0084] 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.

[0085] 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.

[0086] 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.

[0087] 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.

[0088] The video encoder (603) 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 (603) 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.

[0089] In an embodiment, the transmitter (640) may transmit additional data when transmitting the encoded video. The source encoder (630) 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, SEI messages, VUI parameter set fragments, etc.

[0090] 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.

[0091] 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.

[0092] In addition, merge mode technology can be used in inter-picture prediction to improve coding efficiency.

[0093] According to some embodiments disclosed in the present application, 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 luminance prediction block (PB) and two chrominance PBs. In an embodiment, the prediction operation in encoding (encoding / decoding) is performed in units of prediction blocks. Taking the luminance prediction block as an example of a prediction block, the prediction block includes a matrix of pixel values ​​(e.g., luminance values), such as 8×8 pixels, 16×16 pixels, 8×16 pixels, 16×8 pixels, and the like.

[0094] Figure 7 is a diagram of a video encoder (703) according to another embodiment disclosed in the present application. The video encoder (703) is used to receive a processed block (e.g., a prediction block) of sample values ​​in a current video picture in a video picture sequence, and encode the processed block into an encoded picture that is part of an encoded video sequence. In this embodiment, the video encoder (703) is used to replace Figure 4A video encoder (403) in an embodiment.

[0095] In an HEVC embodiment, a video encoder (703) receives a matrix of sample values ​​for a processing block, such as a prediction block of 8×8 samples. The video encoder (703) uses, for example, rate-distortion (RD) 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 (703) 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 (703) 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 (703) includes other components, such as a mode decision module (not shown) for determining the processing block mode.

[0096] exist Figure 7 In an embodiment of the present invention, the video encoder (703) includes: Figure 7 Shown are an inter-frame encoder (730), an intra-frame encoder (722), a residual calculator (723), a switch (726), a residual encoder (724), a general controller (721), and an entropy encoder (725) coupled together.

[0097] The inter-frame encoder (730) 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.

[0098] The intra-frame encoder (722) 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 (722) 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.

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

[0100] The residual calculator (723) is used to calculate the difference (residual data) between the received block and the prediction result selected from the intra-frame encoder (722) or the inter-frame encoder (730). The residual encoder (724) 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 (724) is used to convert the residual data from the time 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 (703) also includes a residual decoder (728). The residual decoder (728) 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 (722) and the inter-frame encoder (730). For example, the inter-frame encoder (730) can generate a decoded block based on the decoded residual data and the inter-frame prediction information, and the intra-frame encoder (722) 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.

[0101] The entropy encoder (725) is used to format the code stream to produce an encoded block. The entropy encoder (725) generates various information according to a suitable standard such as the HEVC standard. In an embodiment, the entropy encoder (725) 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.

[0102] Figure 8FIG. 8 is a diagram of a video decoder (810) according to another embodiment disclosed in the present application. The video decoder (810) 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 (810) is used to replace Figure 4 A video decoder (410) of an embodiment.

[0103] exist Figure 8 In one embodiment, the video decoder (810) includes: Figure 8 An entropy decoder (871), an inter-frame decoder (880), a residual decoder (873), a reconstruction module (874) and an intra-frame decoder (872) coupled together are shown in FIG.

[0104] The entropy decoder (871) 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 (872) or the inter decoder (880), 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 (880); and when the prediction type is an intra prediction type, the intra prediction information is provided to the intra decoder (872). The residual information may be inverse quantized and provided to the residual decoder (873).

[0105] The inter-frame decoder (880) is used to receive the inter-frame prediction information and generate an inter-frame prediction result based on the inter-frame prediction information.

[0106] The intra-frame decoder (872) is used to receive intra-frame prediction information and generate a prediction result based on the intra-frame prediction information.

[0107] The residual decoder (873) 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 (873) may also require some control information (to obtain the quantizer parameter QP), and this information can be provided by the entropy decoder (871) (the data path is not indicated because this is only low-volume control information).

[0108] The reconstruction module (874) is used to combine the residual output by the residual decoder (873) 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.

[0109] It should be noted that the video encoder (403), video encoder (603) and video encoder (703) and video decoder (410), video decoder (510) and video decoder (810) may be implemented using any suitable technology. In an embodiment, the video encoder (403), video encoder (603) and video encoder (703) and video decoder (410), video decoder (510) and video decoder (810) may be implemented using one or more integrated circuits. In another embodiment, the video encoder (403), video encoder (603) and video encoder (703) and video decoder (410), video decoder (510) and video decoder (810) may be implemented using one or more processors that execute software instructions.

[0110] Aspects of the present disclosure provide techniques for controlling one or more encoding tools and functions with constraint flags in an encoded video stream.

[0111] According to one aspect of the present disclosure, the picture size in a code stream may remain the same or may change. In some related examples, a video encoder and decoder may operate on a given picture size that is defined and remains constant for a coded video sequence (CVS), a group of pictures (GOP), or a similar multi-picture time frame. In examples, such as in MPEG-2, known system designs depend on factors such as scene activity to change the horizontal resolution (and therefore the picture size), but are limited to I pictures, so the picture size is defined and generally remains constant for the GOP. Resampling of reference pictures with different resolutions within a CVS is known, for example from ITU-T Rec H.263 Annex P. However, the picture size in the CVS does not change, only the reference picture is resampled, potentially resulting in only using part of the picture canvas (e.g., in the case of downsampling), or only capturing part of the scene (e.g., in the case of upsampling). In some examples, such as in H.263 Annex Q, it is allowed to resample a single macroblock by half in each dimension (e.g., up or down). However, the picture size remains the same.When the size of a macroblock can be fixed, such as in H.263, there is no need to signal the size of the macroblock.

[0112] In some related examples, the picture size in the predicted picture can be changed. In examples such as VP9, ​​reference pictures are allowed to be resampled and the resolution of the entire picture is changed. In some examples (e.g., Hendry et al., "Adaptive resolution change (ARC) for VVC", January 9-19, 2019, Joint Video Team document JVET-M0135-vl, which is incorporated herein in its entirety), the entire reference picture is allowed to be resampled to a different resolution (e.g., a higher resolution or a lower resolution). Different candidate resolutions can be encoded in a sequence parameter set (SPS) and can be referenced by each picture syntax element in a picture parameter set (PPS).

[0113] According to one aspect of the present disclosure, a source video may be compressed by layered coding, which may encode a picture into a code stream including one or more layers with different qualities (such as different resolutions). The code stream may have a syntax element indicating which one or more layers (or a set of layers) may be output at the decoder end. The set of layers to be output may be defined as an output layer set. For example, in a video codec supporting multiple layers and scalability, one or more output layer sets may be signaled in a video parameter set (VPS). Syntax elements indicating the profile tier level (PTL) of the entire code stream or one or more output layer sets may be signaled in a VPS, a decoder parameter set (DPS) (which may be referred to as decoder capability information (DCI) in some examples), an SPS, a PPS, an SEI message, etc. In the PTL information, there may be general constraint information that may indicate constraints on coding tools or functions. It is desirable to effectively represent and signal constraint information for various coding tools and functions.

[0114] In some examples, the term "sub-picture" can be used to refer to a rectangular arrangement of, for example, samples, blocks, macroblocks, codec units, or similar entities that are semantically grouped and can be independently encoded and decoded at varying resolutions. One or more sub-pictures can form a picture. One or more encoded sub-pictures can form an encoded picture. One or more sub-pictures can be assembled into a picture, and one or more sub-pictures can be extracted from a picture. In some examples, one or more encoded sub-pictures can be collected in a compressed domain without converting their sample level codes into an encoded picture. In some examples, one or more encoded sub-pictures can be extracted from an encoded picture in a compressed domain.

[0115] In some examples, a mechanism that allows the resolution of a picture or sub-picture in a CVS to be changed, for example by resampling a reference picture, may be referred to as adaptive resolution change (ARC). The control information used to perform the adaptive resolution change may be referred to as ARC parameters. ARC parameters may include filter parameters, scaling factors, resolution of output and / or reference pictures, and / or various control flags, etc.

[0116] In some examples, ARC encoding / decoding is in units of pictures, so a control information set (ARC parameter) is used to encode / decode a single and semantically independent coded video picture. In some examples, ARC encoding / decoding is in units of sub-pictures, so independent ARC parameters can be used to encode / decode multiple sub-pictures in a picture. It should be noted that various techniques can be used to signal ARC parameters.

[0117] Fig. 9 Examples (e.g., options) of techniques for signaling ARC parameters according to some embodiments of the present disclosure are shown. Coding efficiency, complexity, and architecture may vary among the examples. A video coding standard or technique may select one or more of the examples or other variations to signal ARC parameters. These examples may not be mutually exclusive and may be interchangeable based on application needs, standard techniques, and / or encoder selection, etc.

[0118] According to one aspect of the present disclosure, ARC parameters may be provided as ARC parameters of various categories in various ways. In some examples, a category of ARC parameters includes upsampling factors and / or downsampling factors separated or combined in the X dimension and the Y dimension. In an example, one or more short syntax elements may be encoded, and the one or more short syntax elements may point to a table including upsampling factors and / or downsampling factors.

[0119] In some examples, a category of ARC parameters includes upsampling factors and / or downsampling factors, and adds a time dimension to indicate a constant speed enlargement and / or reduction of a given number of pictures. In an example, one or more short syntax elements can be encoded and decoded, and the one or more short syntax elements can point to a table including upsampling factors and / or downsampling factors, and the upsampling factors and / or downsampling factors have a time dimension added.

[0120] In some examples, a category of ARC parameters includes a combined or separate resolution of an input picture, an output picture, a reference picture, a coded picture in units of samples, blocks, macroblocks, CUs, or any other suitable granularity, in the X dimension or the Y dimension. In some examples, there are more than one resolution for video encoding (e.g., one resolution for an input picture, another resolution for a reference picture), and another set of values ​​(corresponding to another of the resolutions) can be inferred from one set of values ​​(corresponding to one of the resolutions). The determination of the values ​​can be gated, for example, based on the use of a flag. The use of a flag for gating will be described in detail in the further description.

[0121] In some examples, one category of ARC parameters includes warp coordinates similar to those used in H.263 Annex P, with appropriate granularity as described above. H.263 Annex P defines an efficient way to encode warp coordinates. Other efficient ways can be designed. For example, the variable reversible length, Huffman-style encoding of the warp coordinates of Annex P can be replaced by a binary encoding of an appropriate length, where the length of the binary codeword can be derived from the maximum picture size, which is multiplied by a factor and offset by a value to allow warping outside the boundaries of the maximum picture size.

[0122] In some examples, a category of ARC parameters includes up-sampling filter parameters and / or down-sampling filter parameters. In an example, there is only a single filter for up-sampling and / or down-sampling. In another example, multiple filters can be used. In some examples, filter parameters can be notified with a signal to allow more flexibility in filter design. Filter parameters can be selected by using an index in a possible filter design list. The filter can be fully specified (e.g., by specifying a list of filter coefficients, using appropriate entropy coding techniques), and the filter can be implicitly selected by an up-sampling ratio or a down-sampling ratio, which is signaled according to any one of the mechanisms described above and / or similar mechanisms.

[0123] In the following description, a finite set of upsampling factors or downsampling factors (using the same factors in both the X and Y dimensions) is used to illustrate that ARC parameters are signaled through codewords. In some examples, the codewords may be variable length coded, for example, using exponential Golomb codes of certain syntax elements in video coding specifications (e.g., H.264 and H.265).

[0124] Fig.10 An example of a table (1000) showing mapping of upsampling factors or downsampling factors, codewords, and Exponential Golomb codes is shown.

[0125] It should be noted that other similar mappings can be designed based on the application and capabilities of the up-scaling mechanism and the down-scaling mechanism available in the video compression technology or standard. In some examples, Table 1 can be appropriately extended to additional values. It should be noted that the value can be represented by an entropy coding mechanism other than the exponential Golomb code (e.g., by using binary encoding). In an example, when the resampling factor is of interest outside the video processing engine (e.g., encoder and decoder), for example, by a media-aware network element (MANE), an entropy coding mechanism other than the exponential Golomb code can have certain advantages. In some examples, when no resolution change is required (e.g., the original / target resolution in Table 1 is 1), a short exponential Golomb code (e.g., only a single bit is shown in Table 1) can be selected, for example, which can have a coding efficiency advantage compared to using a binary code in the most common case.

[0126] According to one aspect of the present disclosure, a mapping table, such as Table 1, may be configurable. For example, the number of entries in Table 1 and the corresponding semantics may be fully or partially configurable. In some examples, a basic overview of the mapping table is transmitted in a high-level parameter set such as an SPS or DPS. Alternatively or additionally, in some examples, one or more tables similar to Table 1 may be defined in a video coding technique or standard, and one of the tables may be selected, for example, by an SPS or DPS.

[0127] ARC information (e.g., upsampling factors or downsampling factors encoded as described above) can be included in the video coding technique or standard syntax. It should be noted that one or more codewords can be used to control other types of ARC information, such as upsampling filters or downsampling filters. In some examples, filters or other data structures require relatively large amounts of data.

[0128] refer to Fig. 9In example (910), such as in H.263 Annex P, the ARC information (912) may be in the form of four warp coordinates and included in a picture header (911), such as in an H.263 PLUSPTYPE (913) header extension. Example (910) may be applied when i) a picture header is available and ii) frequent changes to the ARC information are desired. However, when using H.263 type signaling such as shown in example (910), the overhead may be high and the scaling factor may not be applicable across picture boundaries because the picture header may have a transient nature.

[0129] refer to Fig. 9 In an example (920) such as JVCET-M135-v1, ARC reference information (925) (e.g., an index) may be placed in a PPS (924) and may point to a table (or target resolution table) (926) that includes target resolutions (e.g., resolutions 1-3). In the example, the table (926) is located inside an SPS (927). Placing the target resolution in the table (926) in the SPS (927) may be justified by using the SPS as an interoperability negotiation point during capability exchange. The resolution may be changed from one picture to another within a limited set of values ​​in the table (926) (e.g., resolutions 1-3) via a reference (e.g., ARC reference information (925)) in the appropriate PPS (924).

[0130] Fig. 9 Additional techniques that can be used to transmit ARC information in a video code stream are also shown, such as examples (930), (940), and (950). In the same video coding technology or standard, the techniques can be used alone or in appropriate combinations.

[0131] refer to Fig. 9 In the example (930), ARC information (939) such as a resampling factor (or scaling factor) may be present in a header such as a slice header, a GOB header, a tile header, or a tile group header. For example, Fig. 9 The tile group header (938) is illustrated in . The technique illustrated in example (930) may be used when the ARC information (939) can be encoded using a small number of bits, such as a single variable length ue(v) or a fixed length codeword of a few bits.

[0132] According to one aspect of the present disclosure, in a head (e.g., Fig. 9Having the ARC information (939) directly in the tile group header (938), slice header, or tile header in the example (930) may have the additional advantage that the ARC information (939) may be applied to a sub-picture represented by, for example, a corresponding tile group (or slice, tile) rather than an entire picture. Additionally, in the example, even if the video compression technique or standard only contemplates adaptive resolution change for the entire picture (as compared to, for example, adaptive resolution change based on tile groups), the example (930) may have certain advantages over the example (910) from an error resilience perspective.

[0133] refer to Fig. 9 In the example (940), the ARC information (942) may be present in a parameter set (941), such as a PPS, a header parameter set, a tile parameter set, or an adaptation parameter set (APS). The APS (941) may be present in, for example, Fig. 9 . In some examples, the scope of the parameter set (941) may not be larger than a picture, for example, it may be a picture, a tile group, etc. By activating the relevant parameter set (e.g., APS (941)), the use of ARC information (e.g., ARC information (942)) may be implicit. For example, when the video coding technology or standard only considers picture-based ARC, PPS or equivalent may be appropriate.

[0134] refer to Fig. 9 In the example (950), the ARC reference information (953) may be present in a tile group header (954) as described above or in a similar data structure (e.g., a picture header, a slice header, a tile header, or a GOP header). The tile group header (954) is an example in Fig. 9 ARC reference information (953) may refer to a subset of ARC information (955) available in a parameter set (956) having a scope beyond a single picture, such as an SPS or DPS, etc. SPS (956) is illustrated as an example in Fig. 9 Medium picture.

[0135] Fig.11 Some examples of ARC parameter signaling according to some embodiments of the present disclosure are shown. Fig.11 An example of a syntax diagram used in a video coding standard is shown. In the example, the notation of the syntax diagram generally follows C-type programming. Bold lines may indicate syntax elements present in a codestream, and non-bold lines may indicate settings that control one or more streams or variables.

[0136] refer to Fig.11, the tile group header (1101) includes a syntax structure of a header that is applicable to a portion of a picture (e.g., a rectangular portion). In an example, the tile group header (1101) may conditionally include a syntax element dec_pic_size_idx (1102) encoded with a variable length exponential Golomb code (depicted in boldface). The presence of a syntax element (e.g., dec_pic_size_idx (1102)) in the tile group header (1101) may be gated based on an adaptive resolution (e.g., indicated by a flag (e.g., adaptive_pic_resolution_change_flag) (1103)). The value of the flag (e.g., adaptive_pic_resolution_change_flag) (1103) is not depicted in boldface, and thus the flag is present at a point in the codestream where the flag appears in the syntax diagram. Whether adaptive resolution is used for a picture or a portion of the picture may be indicated in a high-level syntax structure (e.g., internal or external to the codestream). Fig.11 The SPS (1110) is used to notify by signal.

[0137] refer to Fig.11 , an excerpt of an SPS (1110) is shown. The SPS (1110) includes a first syntax element (1111) which is a flag (1111) (e.g., adaptive_pic_resolution_change_flag). When the flag (1111) is true, the flag (1111) may indicate the use of adaptive resolution which may require certain control information. In the example, certain control information is conditionally presented based on the value of the flag (1111) as shown in an if() statement (1112) in the SPS (1110) and the tile group header (1101).

[0138] When using adaptive resolution, such as Fig.11As shown in the example in , the output resolution (or the resolution of the output picture) (1113) in units of samples can be encoded. In the example, the output resolution (1113) is encoded based on the width resolution (e.g., output_pic_width_in_luma_samples) and the height resolution (e.g., output_pic_height_in_luma_samples). In the video coding technology or standard, certain restrictions on one or more values ​​of the output resolution (1113) can be defined. For example, the level definition can limit the number of total output samples (e.g., the product of output_pic_width_in_luma_samples and output_pic_height_in_luma_samples). In some examples, the video coding technology or standard, or an external technology or standard (e.g., a system standard) can limit the number range of the width resolution and / or the height resolution (e.g., the width resolution and / or the height resolution can be divided by a power of 2), the aspect ratio of the width resolution to the height resolution (e.g., the ratio of the width resolution to the height resolution is 4:3 or 16:9), etc. In an example, the above restrictions may be introduced to facilitate hardware implementation.

[0139] In some applications, the encoder can instruct the decoder to use a certain reference picture size, rather than implicitly assuming that the size is the output picture size. For example, a syntax element (e.g., reference_pic_size_present_flag) (1114) can gate the conditional presence of a reference picture size (1115). In an example, the reference picture size (1115) can include a width (e.g., reference_pic_width_in_luma_samples) and a height (e.g., reference_pic_height_in_luma_samples).

[0140] Also in Fig.11 , a table of applicable decoded picture widths and heights is illustrated. In an example, the number of entries in the table may be indicated by a table indication (e.g., a syntax element num_dec_pic_size_in_luma_samples_minus1) (1116). "Minus1" may refer to an interpretation of the value of the syntax element (1116). For example, if the encoded value is zero, there is one table entry. If the encoded value is five, there are six table entries. For each entry in the table, the decoded picture width and height are included as syntax elements (1117).

[0141] The syntax element dec_pic_size_idx (1102) in the tile group header (1101) may be used to index the table entry represented by the syntax element (1117), and thus allow different decoding sizes and scaling factors in each tile group.

[0142] According to one aspect of the present disclosure, certain video coding techniques or standards (e.g., VP9) may enable spatial scalability by implementing certain forms of reference picture resampling in conjunction with temporal scalability. In an embodiment, reference pictures are upsampled to a higher resolution using ARC-type techniques to form the basis of a spatial enhancement layer. The upsampled pictures may be modified using a normal prediction mechanism at a high resolution (e.g., motion compensated prediction for inter-frame prediction of reference pictures) to, for example, add detail.

[0143] In some examples, a value in a network abstraction layer (NAL) unit header (e.g., a time ID field) is used to indicate time layer information as well as spatial layer information. Using values ​​in the NAL unit header to indicate time layer information and spatial layer information can enable existing selected forwarding units (SFUs) to be used in a scalable environment without modification. For example, an existing SFU can be created and optimized for forwarding of time layer selection based on the NAL unit header time ID value. Then, in some examples, the existing SFU can be used for spatial scalability (e.g., selection of spatial layers) without modification. In some examples, a mapping can be provided between a coded picture size and a time layer, the time layer being indicated by the time ID field in the NAL unit header.

[0144] According to one aspect of the present disclosure, profile, tier, and level combination (PTL) information including profile, tier, level, and general constraint information may be used to specify some features of an encoded bitstream. In some examples, a profile defines a subset of features of a bitstream, such as color reproduction, resolution, additional video compression, and the like. A video codec may define various profiles, such as a baseline profile (e.g., a simple profile with a low compression ratio), a high profile (a complex profile with a high compression ratio), a main profile (e.g., a profile with a medium compression ratio between a baseline profile and a high profile, which may be a default profile setting), and the like.

[0145] Further, tiers and levels can be used to specify certain constraints that define the code stream in terms of maximum bit rate, maximum luminance sampling rate, maximum luminance picture size, minimum compression ratio, maximum number of allowed stripes, maximum number of allowed tiles, etc. Lower tiers are more restricted than higher tiers, and lower levels are more restricted than higher levels. In an example, the standard may define two tiers: a main tier and a high level. The main tier is a tier lower than the high level. These tiers are used to handle applications that differ in their maximum bit rate. In an example, the main tier is designed for most applications, while the high level is designed for very demanding applications. The standard may define multiple levels. A level is a set of constraints for a code stream. In an example, for levels below level 4, only the main tier is allowed. In some examples, a decoder that is required to comply with a given tier / level is able to decode all code streams that are encoded for that tier / level and for all lower tiers / levels.

[0146] General constraint information may include constraint information about video source types, coding tools, and functions. For example, a constraint flag may indicate whether inter-frame coding tools, intra-frame coding tools, DBF, entropy coding, transforms, partitions (e.g., tiles, slices), buffer management, random access (e.g., IDR), and / or parameter sets (e.g., SPS, PPS), etc., are present or used in the coded video bitstream. General constraint information may be signaled in a parameter set (e.g., SPS, VPS, or DCI). Constraint flags may be signaled in a high-level syntax structure (e.g., SPS, VPS, DCI).

[0147] According to some aspects of the present disclosure, PTL information may be associated with a range (e.g., a portion of the encoded video data in a bitstream). In some examples, the PTL information may be specified, for example, for the entire bitstream, the CVS of the bitstream, and each output layer set (OLS) of the bitstream, and may be signaled in a high-level syntax (HLS) structure such as a VPS, DPS, DCI, SPS, PPS, APS, GOP, sequence, header, or SEI message.

[0148] In some examples, a high-level syntax (HLS) is defined for the block level. Block-level coding tools can be used to decode pixels or samples within a picture to reconstruct the picture. Block-level coding tools may include any suitable coding tools used in the reconstruction of coding blocks, such as coding tools for inter-frame prediction (or inter-frame coding tools), one or more coding tools for intra-frame prediction (or intra-frame coding tools), adaptive loop filters (ALF, adaptive loop filter), deblocking filters (DBF, deblocking filter), entropy coding and transformation, etc.

[0149] High-level syntax (HLS) can specify information about functionality, system interfaces, picture-level control of tools, buffer control, etc. For example, HLS can specify partitioning (e.g., tiles, slices, sub-pictures), buffer management, random access (e.g., IDR, clean random access (CRA)), one or more parameter sets (e.g., VPS, SPS, PPS, APS), reference picture resampling (RPR), and / or scalability. High-level syntax can be higher than the block level.

[0150] The control information may have an appropriate level, such as SPS level tool control information, PPS level tool control information, sequence level control information, and / or stream level control information. In some examples, the PTL information is part of the control information and may be signaled as a constraint flag in the HLS structure and may indicate control or constraints of tools in a range corresponding to the HLS structure. For example, a constraint flag for the PTL information may be provided in one of the following: sequence level control information and stream level control information. In an example, if certain tools are disabled by a constraint flag in the HLS structure, and, for example, these tools are not used to encode blocks in a range corresponding to the HLS.

[0151] Fig.12 and Fig.13 An example of PTL information according to some embodiments of the present disclosure is shown. Fig.12 An example of a syntax structure of a set of PTL syntax elements (1200) is shown, and Fig.13 An example of the syntax structure of general constraint information is shown (1300).

[0152] exist Fig.12In, the PTL syntax element set may include general_profile_idc, general_tier_flag, general_level_idc, num_sub_profiles, general_sub_profile_idc, sublayer_level_present_flag, ptl_alignment_zero_bit, and sublayer_level_idc.

[0153] exist Fig.13 In the example, the general constraint information may include multiple constraint flags. In an example, a constraint flag equal to 1 (e.g., intra_only_constraint_flag) (1305) may indicate that the parameter sh_slice_type should be 1 (i.e., the slice is an intra slice). The parameter sh_slice_type is a parameter in a slice header, which may indicate the encoding type of the slice between I, P, and B types. A constraint flag equal to 0 (e.g., intra_only_constraint_flag) (1305) does not impose constraints (e.g., sh_slice_type should be 1) for all coded pictures within the scope of the PTL information, where other information (e.g., profile_idc) may allow non-intra slices. In another example, a constraint flag equal to 1 (e.g., no_alf_constraint_flag) (1306) may indicate that for all CVSs within the scope of the PTL information, sps_alf_enabled_flag is equal to 0, and therefore adaptive loop filtering is not used even if adaptive loop filtering is allowed based on, for example, profile_idc. A constraint flag equal to 0 (eg, no_alf_constraint_flag) (1306) does not enforce the above constraint.

[0154] In another example, the general constraint information may be signaled as follows: Fig.13 The constraint flag (e.g., no_lossless_coding_tool_constraint_flag) (1301) shown in FIG. 1 may indicate that one or more coding tools related to lossless coding cannot be used within the scope of the PTL information including the constraint flag (1301). The constraint flag (e.g., no_lossless_coding_tool_constraint_flag) (1301) equal to 0 does not impose the above constraint.

[0155] In another example, the general constraint information may be signaled as follows: Fig.13 The constraint flag (e.g., no_lossy_coding_tool_constraint_flag) (1302) shown in FIG. 1 may indicate that one or more coding tools related to lossy coding cannot be used within the scope of the PTL information including the constraint flag (1302). The constraint flag (e.g., no_lossy_coding_tool_constraint_flag) (1302) equal to 0 does not impose the above constraint.

[0156] In an embodiment, when the constraint flag (e.g., no_lossy_coding_tool_constraint_flag) (1302) is equal to 1, the constraint flag (e.g., no_lossy_coding_tool_constraint_flag) (1301) may not be equal to 1. Alternatively, when the constraint flag (e.g., no_lossy_coding_tool_constraint_flag) (1301) is equal to 1, the constraint flag (e.g., no_lossy_coding_tool_constraint_flag) (1302) may not be equal to 1.

[0157] Multiple constraint flags in the general constraint information can be sorted in a specific order. The order can be set based on the possibility of various mechanisms and / or tools that are not used within the scope of the PTL, for example. The order can be called a priority order. The order from high priority to low priority can be presented in the general constraint information syntax structure, wherein the high priority indicates that the possibility of not using the tool (or mechanism) is very high, and the low priority indicates that the possibility of not using the tool (or mechanism) is very low. Additional factors affecting the order may include tools that may only be used for specific use cases (e.g., tools for sub-pictures, scalability and / or interlaced support), the impact of tools for encoder / decoder / implementation complexity, etc.

[0158] FIG. 14A to FIG. 14BAn example of PTL information including a syntax structure example (1410) of a PTL syntax structure (also referred to as a PTL level bracket) and a syntax example (1420) of a general constraint information syntax structure (also referred to as a general constraint information level bracket) according to some embodiments of the present disclosure is shown. In some examples, a syntax element for indicating the number of constraint flags (e.g., num_available_constraint_flag) can be signaled. In an example, a syntax element indicating the number of constraint flags can be signaled in the PTL syntax structure, such as in Fig.14A , which may be outside the syntax example (1420) of the general constraint information level segment. Alternatively, a syntax element for indicating the number of constraint flags may be signaled at the beginning of the general constraint information level segment, such as the beginning of the syntax example (1420). When the syntax element (e.g., num_available_constraint_flags) is present and the value of the syntax element (e.g., num_available_constraint_flags) is equal to N, the first N constraint flags may be present in the general constraint information syntax structure. Further, other constraint flags may not be present and may be inferred to be equal to a specific value. N may be a non-negative integer.

[0159] In an embodiment, the value N (e.g., num_available_constraint_flags) is in the range of 0 to the maximum number of constraint flags (e.g., the value of the parameter MaxNumConstraintFlags). The maximum number of constraint flags may be any positive integer. The value of the maximum number of constraint flags (e.g., MaxNumConstraintFlags) may be predefined as 16, 32, 64, 128, etc. When the value N (e.g., num_available_constraint_flags) is equal to 0, no constraint flags are present in the general constraint information syntax structure. The encoding of the value N (e.g., num_available_constraint_flags) may be selected so that the value N and the corresponding entropy coded representation of the constraint flags may accumulate to a number divisible by 8 to ensure byte alignment.

[0160] In some examples, the constraint flags may be classified into one or more constraint information groups. Each constraint information group may include one or more constraint flags and may have a corresponding gate flag. The gate flag of the corresponding constraint information group may indicate whether one or more constraint flags in the corresponding constraint information group exist. In the example, the gate flag may be referred to as a constraint group existence flag. Typically, the gate flag is associated with the corresponding constraint information group and is associated with one or more constraint flags in the corresponding constraint information group. In an embodiment, the gate flag may gate whether one or more constraint flags in the corresponding constraint information group exist in the constraint information (or be signaled in the constraint information). For example, if the gate flag of the corresponding constraint information group is equal to 1, one or more constraint flags corresponding to the constraint information group may exist in, for example, general constraint information. If the gate flag of the corresponding constraint information group is equal to 0, one or more constraint flags corresponding to the constraint information group may not exist in, for example, general constraint information. In the example, if all gate flags are equal to 0, there is no constraint flag.

[0161] The constraint flag can have different copies. For example, the scope of the constraint flag in the DCI can be a coded video stream. The scope of the constraint flag in the VPS can be a CLVS with multiple layers. The scope of the constraint flag in the SPS can be a single CLVS.

[0162] FIG. 15A to FIG. 15B An example of a general constraint information syntax structure (1500) according to an embodiment of the present disclosure is shown. The general constraint information syntax structure (1500) includes flags representing general constraint information. Specifically, the general constraint information syntax structure (1500) includes one or more gate flags, such as Fig.15AThe gate flag (e.g., general_frame_structure_constraint_group_flag) (1501), the gate flag (e.g., high_level_functionality_constraint_group_flag) (1502), the gate flag (e.g., scalability_constraint_group_flag) (1503), the gate flag (e.g., partitioning_constraint_group_flag) (1504), the gate flag (e.g., intra_coding_tool_constraint_group_flag) (1505), the gate flag (e.g., inter_coding_tool_constraint_group_flag) (1506), the gate flag (e.g., transfom_contraint_group_flag) (1507), the gate flag (e.g., inloop_filtering_constraint_group_flag) (1508). One or more gate flags (e.g., gate flags (1501)-(1508)) may be present in the following example: Fig.15A At the beginning of the general constraint information syntax structure (1500) shown in .

[0163] The gate flag (e.g., general_frame_structure_constraint_group_flag) (1501) is associated with the constraint information group (1510) and is associated with the constraint flags (1511)-(1514) in the constraint information group (1510). The gate flag (e.g., general_frame_structure_constraint_group_flag) (1501) equal to 1 may indicate that the constraint flags (1511)-(1514) in the constraint information group (1510) may exist.

[0164] The constraint information group (1510) (or constraint flags (1511)-(1514)) may be associated with input sources and frame packing (eg, packed frames or projected frames). Fig.15A, the constraint flags (1511)-(1514) correspond to the general_non_packed_constraint_flag (1511), the general_frame_only_constraint_flag (1512), the general_non_projected_constraint_flag (1513), and the general_one_picture_only_constraint_flag (1514). Otherwise, a gate flag (e.g., general_frame_structure_constraint_group_flag) (1501) equal to 0 may indicate that the constraint flags (1511)-(1514) in the constraint information group (1510) may not be present in the general constraint information syntax structure (1500).

[0165] Further, in some examples, a gate flag (eg, high_level_functionality_constraint_group_flag) (1502) equal to 1 may indicate that a constraint flag associated with a high-level functionality (eg, reference picture resampling) in the constraint information group (1520) may be set as follows: Fig. 15B Otherwise, a gate flag (eg, high_level_functionality_constraint_group_flag) (1502) equal to 0 may indicate that the constraint flags in the constraint information group (1520) may not be present in the general constraint information syntax structure (1500).

[0166] Return to reference Fig.15A , a gate flag (e.g., scalability_constraint_group_flag) (1503) equal to 1 may indicate that one or more constraint flags related to scalability (e.g., inter-layer prediction) may be present. Otherwise, one or more constraint flags related to scalability may not be present in the general constraint information syntax structure (1500).

[0167] A gate flag (e.g., partitioning_constraint_group_flag) (1504) equal to 1 may indicate the presence of one or more constraint flags associated with a higher level partition (e.g., sub-picture or tile). Otherwise, the constraint flag associated with the higher level partition may not be present in the general constraint information syntax structure (1500).

[0168] A gate flag (e.g., intra_coding_tool_constraint_group_flag) (1505) equal to 1 may indicate the presence of one or more constraint flags related to intra-frame coding (e.g., intra-frame prediction). Otherwise, one or more constraint flags related to intra-frame coding may not be present in the general constraint information syntax structure (1500).

[0169] A gate flag (e.g., inter_coding_tool_constraint_group_flag) (1506) equal to 1 may indicate the presence of one or more constraint flags related to inter-coding (e.g., motion compensation for inter-prediction). Otherwise, constraint flags related to inter-coding may not be present in the general constraint information syntax structure (1500).

[0170] A gate flag (e.g., transform_contraint_group_flag) (1507) equal to 1 may indicate the presence of one or more constraint flags related to transform coding (e.g., multiple transform matrices). Otherwise, the constraint flags related to transform coding may not be present in the general constraint information syntax structure (1500).

[0171] In an embodiment, when all door flags (e.g., Fig.15A When the gate flags (1501)-(1508)) in are equal to 0, there is no constraint flag in the general constraint information syntax structure (for example, the general constraint information syntax structure (1500)).

[0172] According to various aspects of the present disclosure, the syntax can be designed so that control information can be byte-aligned, for example, the number of flags can be divisible by 8 to maintain byte alignment, and the control information includes gate flags (e.g., gate flags (1501)-(1508)), associated constraint flags (e.g., constraint flags (1511)-(1512) and constraint flags in constraint information group (1520)) and / or additional control information, etc. In an example, the number of gate flags and constraint flags in constraint information (e.g., general constraint information syntax structure (1500)) can be divisible by 8. A byte alignment mechanism can be used to achieve byte alignment of control information. Reference Fig. 15B , syntax (eg, a "while" type loop) (1530) may be used for byte alignment.

[0173] In some embodiments, offset information, such as an offset (using a syntax element constraint_info_offset[]) and length information, such as a length (using a syntax element constraint_info_length[]) are present in the constraint information (e.g., at the beginning of a general constraint information syntax structure) to facilitate presentation of one or more constraint flags in one or more corresponding constraint information groups, the one or more constraint information groups being associated with one or more gate flags in the constraint information. In an embodiment, one or more constraint information groups in at least one constraint information group are present in the coded video bitstream. For a constraint information group, an offset and a length may be present in the constraint information of the constraint information group. The offset may indicate an offset to a first constraint flag in the constraint information group, and the length may indicate the number of constraint flags in the constraint information group. In some examples, the number of constraint information groups may be explicitly indicated, for example, by a syntax element num_constraint_info_set. The value of num_constaint_info_set may be an integer greater than or equal to 0. When the value of num_constaint_info_set is 0, constraint_info_offset[], constraint_info_length[], and constraint flags are not present in the general constraint information syntax structure.

[0174] In an embodiment, a constraint information offset (e.g., a syntax element constraint_info_offset[i]) and a constraint information length (e.g., a syntax element constraint_info_length[i]) may help present constraint flags for constraint information group i (i is a positive integer) in constraint information (e.g., a general constraint information syntax structure). In an example, when the value of the constraint information offset (e.g., a syntax element constraint_info_offset[i]) is equal to 5 and the value of the constraint information length (e.g., a syntax element constraint_info_length[i]) is equal to 3, a fifth constraint flag, a sixth constraint flag, and a seventh constraint flag are associated with constraint information group i and are present in the constraint information (e.g., a general constraint information syntax structure).

[0175] In an example, run-length coding may be used to encode the constraint flags specified in a predetermined order (or a given order).

[0176] In an embodiment, run-length encoding may be used where the constraint flags are specified in a predetermined order (or given order). Instead of encoding the constraint flags directly, a list of appropriate encodings of "skip" values ​​may indicate a constraint flag equal to zero, with subsequent constraint flags implicitly considered equal to 1. The run-length encoding described above may be particularly effective if (i) the number of constraint flags is large and (ii) a small percentage of the constraint flags are equal to 1.

[0177] In an embodiment, one or more constraint information groups of at least one constraint information group are present in the encoded video bitstream. A plurality of constraint flags of one or more constraint information groups of at least one constraint information group are signaled according to a predetermined order. Accordingly, the plurality of constraint flags may be run-length encoded or decoded (e.g., run-length encoded or run-length decoded). Further, prediction information of a subset of the coding blocks may be determined based on the plurality of constraint flags.

[0178] In an embodiment, at least one constraint flag in the constraint information group of the gate flag includes a plurality of constraint flags signaled according to a predetermined order. Accordingly, the plurality of constraint flags may be run-length encoded or decoded (eg, run-length encoded or run-length decoded).

[0179] In an embodiment, a complete list of constraint flags may be specified in a video codec standard (e.g., VVC specification) or an external table, etc. In an example, for example, only one or more available constraint flags in the constraint flags are indicated by one or more of the following: the number of available constraint flags (e.g., num_available_constraint_flags), one or more gate flags (or one or more constraint group presence flags), constraint information offset information, or constraint information length information, etc., are present in the coded video stream.

[0180] In the example, a complete list of constraint flags is specified and available to the encoder and decoder. The complete list of constraint flags can be stored in the decoder. The complete list of constraint flags can include 100 constraint flags. 10 of the 100 constraint flags are present in the constraint information of the CLVS and are therefore available for a subset of the coded blocks in the CLVS. 10 of the 100 constraint flags are referred to as 10 available constraint flags. In the example, the number of available constraint flags (e.g., 10) is signaled. In the example, the 10 available constraint flags are in two constraint information groups and are gated by a first gate flag and a second gate flag. Therefore, the first gate flag and the second gate flag can be signaled to indicate the 10 available constraint flags.

[0181] In an example, a first constraint information offset (e.g., syntax element constraint_info_offset[0]) and a first constraint information length (e.g., syntax element constraint_info_length[0]) are signaled. A second constraint information offset (e.g., syntax element constraint_info_offset[1]) and a second constraint information length (e.g., syntax element constraint_info_length[1]) are signaled. For example, the syntax element constraint_info_offset[0] is 15, and the syntax element constraint_info_length[0] is 3, and the syntax element constraint_info_offset[1] is 82, and the syntax element constraint_info_length[1] is 7, thus indicating that the 15th to 17th constraint flags and the 82nd to 88th constraint flags in the complete list (e.g., 100 constraint flags) are available or present in the constraint information.

[0182] In an embodiment, any of the various techniques (or methods, embodiments, examples) for effective encoding of constraint flags may be combined using appropriate control information. The combination may be a suitable combination of two or more such techniques. Alternatively, one of the various techniques (or methods, embodiments, examples) may be used independently. The constraint flags may be grouped. In a particular group or groups, run-length encoding may be used, while other groups or groups may use direct binary encoding.

[0183] The value of the maximum number of constraint flags (eg, MaxNumConstraintFlags) may be predefined as 16, 32, 64, 128, etc.

[0184] The value of the maximum number of constraint flags (e.g., MaxNumConstraintFlags) may be determined by profile information (such as general_profile_idc or general_sub_profile_idc) or codec version information, so that the range of the number of constraint flags (e.g., num_available_constraint_flags(1401)) may be limited by the profile information or version information. For example, the value of the number of constraint flags (e.g., num_available_constraint_flags(1401)) in the main profile (e.g., where MaxNumConstraintFlags=64) may be in the range of 0 to 64, while the value of the number of constraint flags (e.g., num_available_constraint_flags(1401)) in the advanced profile (e.g., where MaxNumConstraintFlags=128) may be in the range of 0 to 128.

[0185] In an embodiment, the value of the number of constraint flags (eg, num_available_constraint_flags) may be inferred to be equal to a value predefined by profile information (such as general_profile_idc or general_sub_profile_idc or codec version information) so that the value of num_available_constraint_flags may be determined without explicit signaling.

[0186] In some embodiments, the reserved byte information may be present in the general constraint information syntax structure. Fig.13 As shown in , the flags gci_num_reserved_bytes (1303) and gci_reserved_bytes[] (1304) can be present in the general constraint information syntax structure to extend the general constraint information syntax structure. The flag gci_num_reserved_bytes can specify the number of reserved constraint bytes. In an example, the reserved constraint bytes can be used to signal additional flags (e.g., additional constraint flags). The flag gci_reserved_byte[] can have any suitable value.

[0187] In an embodiment, the value of gci_num_reserved_bytes may be limited or determined by profile information (e.g., general_profile_idc or general_sub_profile_idc) or codec version information. For a basic profile (or main profile), the value of the flag gci_num_reserved_bytes may be 0. For an extended profile (or advanced profile), the value of gci_num_reserved_bytes may be greater than 0.

[0188] In some embodiments, a field sequence flag may be signaled in the coded video bitstream. The field sequence flag may indicate whether a picture in the output layer is coded or not using field codec. In some examples, the field sequence flag may be signaled in the SPS using the syntax element sps_field_seq_flag. In an embodiment, the flag sps_field_seq_flag may be present in the SPS. The flag sps_field_seq_flag equal to 1 may indicate that the CLVS may transmit pictures representing fields. The flag sps_field_seq_flag equal to 0 may indicate that the CLVS may transmit pictures representing frames.

[0189] exist Fig.13 In the general constraint information syntax structure of , there may be a flag general_frame_only_constraint_flag. The flag general_frame_only_constraint_flag equal to 1 may indicate that the scope of the output layer set (e.g., OlsInScope) can transmit pictures representing frames. The flag general_frame_only_constraint_flag equal to 0 indicates that the scope of the output layer set (e.g., OlsInScope) can transmit pictures that may or may not represent frames. In an embodiment, the flag general_frame_only_constraint_flag indicates whether the pictures in the output layer set are encoded using field coding. The output layer set may include a subset of coding blocks. Based on the flag general_frame_only_constraint_flag (e.g., 1) indicating that the subset of pictures is not encoded using field coding, the flag sps_field_seq_flag may be false. The subset of pictures may be in one layer of the output layer set.

[0190] When the flag general_frame_only_constraint_flag is equal to 1, the value of the flag sps_field_seq_flag may be equal to 0.

[0191] In an embodiment, the flag pps_mixed_nalu_type_in_pic_flag may be present in the PPS. The flag pps_mixed_nalu_type_in_pic_flag equal to 1 may indicate that each picture of the referenced PPS has more than one VCL NAL unit, and the VCL NAL unit does not have the same value as nal_unit_type. The flag pps_mixed_nalu_types_in_pic_flag equal to 0 may indicate that each picture of the referenced PPS has one or more VCL NAL units, and the VCL NAL unit of each picture of the referenced PPS has the same value as nal_unit_type. Fig.13 In the general constraint information syntax structure of , the flag no_mixed_nalu_type_in_pic_constraint_flag may be present. The flag no_mixed_nalu_types_in_pic_constraint_flag equal to 1 may indicate that the value of pps_mixed_nalu_types_in_pic_flag should be equal to 0. The flag no_mixed_nalu_type_in_pic_constraint_flag equal to 0 does not impose such a constraint.

[0192] In an embodiment, the flag general_one_picture_only_constraint_flag may be present in a Fig.13 The general constraint information syntax structure shown in . general_one_picture_only_constraint_flag equal to 1 may indicate that there is only one coded picture in the codestream. The flag general_one_picture_only_constraint_flag equal to 0 does not impose such a constraint.

[0193] In an embodiment, the flag single_layer_constraint_flag may be present in a layer such as Fig.13The flag single_layer_constraint_flag equal to 1 may indicate that sps_video_parameter_set_id should be equal to 0. The flag single_layer_constraint_flag equal to 0 does not impose such a constraint. When the flag single_layer_constraint_flag is equal to 1, the value of the flag single_layer_constraint_flag may be equal to 1.

[0194] In an embodiment, the flag all_layers_independent_constraint_flag may be present in a Fig.13 The flag all_layers_independent_constraint_flag equal to 1 may indicate that the flag vps_all_independent_layers_flag may be equal to 1. The flag all_layers_independent_constraint_flag equal to 0 does not impose such a constraint. When the flag single_layer_constraint_flag is equal to 1, the value of the flag all_layer_independent_constraint_flag may be equal to 1.

[0195] In an embodiment, the flag no_res_change_in_clvs_constraint_flag may be present in a Fig.13 The flag no_res_change_in_clvs_constraint_flag equal to 1 may indicate that the flag sps_res_change_in_clvs_allowed_flag may be equal to 0. The flag no_res_change_in_clvs_constraint_flag equal to 0 does not impose such a constraint. When the flag no_ref_pic_resampling_constraint_flag is 1, the value of the flag no_res_change_in_clvs_constraint_flag may be equal to 1.

[0196] In an embodiment, the flag no_mixed_nalu_type_in_pic_constraint_flag may be present in Fig.13The flag no_mixed_nalu_type_in_pic_constraint_flag equal to 1 indicates that the value of the flag pps_mixed_nalu_type_in_pic_flag may be equal to 0. The flag no_mixed_nalu_type_in_pic_constraint_flag equal to 0 does not impose such a constraint. When the flag one_subpic_per_pic_constraint_flag is equal to 1, the value of the flag no_mixed_nalu_types_in_pic_constraint_flag may be equal to 1.

[0197] In an embodiment, the flag no_trail_constraint_flag may be present in Fig.13 The flag no_trail_constraint_flag equal to 1 may indicate that there may be no NAL units with nuh_unit_type equal to TRAIL_NUT in OlsInScope (OlsInScope is the set of output layers of all layers in the entire bitstream including the referenced DPS). The flag no_trail_constraint_flag equal to 0 does not impose such a constraint. The flag no_trail_constraint_flag may be equal to 1 when the flag general_one_picture_only_constraint_flag is equal to 1.

[0198] In an embodiment, the flag no_stsa_constraint_flag may be present in Fig.13 The flag no_stsa_constraint_flag equal to 1 may indicate that there may be no NAL units with nuh_unit_type equal to STSA_NUT in OlsInScope. The flag no_stsa_constraint_flag equal to 0 does not impose such a constraint. The flag no_stsa_constraint_flag may be equal to 1 when the flag general_one_picture_only_constraint_flag is equal to 1.

[0199] In an embodiment, the flag no_trail_constraint_flag may be present in Fig.13The flag no_trail_constraint_flag equal to 1 may indicate that there may be no NAL units with nuh_unit_type equal to TRAIL_NUT in OlsInScope. The flag no_trail_constraint_flag equal to 0 does not impose such a constraint. The flag no_trail_constraint_flag may be equal to 1 when the flag general_one_picture_only_constraint_flag is equal to 1.

[0200] In an embodiment, the flag no_stsa_constraint_flag may be present in Fig.13 The flag no_stsa_constraint_flag equal to 1 may indicate that there may be no NAL units with nuh_unit_type equal to STSA_NUT in OlsInScope. The flag no_stsa_constraint_flag equal to 0 does not impose such a constraint. The flag no_stsa_constraint_flag may be equal to 1 when the flag general_one_picture_only_constraint_flag is equal to 1.

[0201] In an embodiment, the flag no_idr_constraint_flag may be present in a Fig.13 The no_idr_constraint_flag equal to 1 may indicate that there may be no NAL units with nuh_unit_type equal to IDR_W_RADL or IDR_N_LP in OlsInScope. The no_idr_constraint_flag equal to 0 does not impose such a constraint.

[0202] In an embodiment, the flag no_cra_constraint_flag may be present in a Fig.13 The flag no_cra_constraint_flag equal to 1 may indicate that there may be no NAL units with nuh_unit_type equal to CRA_NUT in OlsInScope. The flag no_cra_constraint_flag equal to 0 does not impose such a constraint.

[0203] In an embodiment, the flag no_rasl_constraint_flag may be present in Fig.13 The flag no_rasl_constraint_flag equal to 1 may indicate that there may be no NAL units with nuh_unit_type equal to RASL_NUT in OlsInScope. The flag no_rasl_constraint_flag equal to 0 does not impose such a constraint. When the flag no_rasl_constraint_flag is equal to 1, the value of the flag no_rasl_constraint_flag may be equal to 1.

[0204] In an embodiment, the flag no_radl_constraint_flag may be present in a Fig.13 The flag no_radl_constraint_flag equal to 1 may indicate that there may be no NAL units with nuh_unit_type equal to RADL_NUT in OlsInScope. The flag no_radl_constraint_flag equal to 0 does not impose such a constraint. When the flag no_idr_constraint_flag is equal to 1 and the flag no_cra_constraint_flag is equal to 1, the value of the flag no_rasl_constraint_flag may be equal to 1.

[0205] Some aspects of the present disclosure provide techniques for constraint flag signaling for range extension, such as range extension for position coding of the last significant coefficient in residual coding.

[0206] According to one aspect of the present disclosure, some standards may be initially developed for certain applications with a specific chroma format and a specific bit depth (bits per sample). For example, HEVC initially targeted applications with a 4:2:0 chroma format with 8-10 bits per sample. In order to adapt the standard to formats and bit depths other than a specific chroma format and a specific bit depth, range extensions are developed to support applications using other chroma formats and / or higher bit depths.

[0207] In order to limit the feature set to what is required for a specific set of applications, the video coding standard defines a profile, which may include a defined decoder feature set to support the interoperability of encoders using these features. For example, a profile may define a set of coding tools or algorithms that can be used to generate a consistent code stream. In addition to the profile, some standards (e.g., VVC, HEVC, etc.) also define levels and tiers. Levels impose restrictions on code streams related to spatial resolution, pixel rate, bit rate values, and changes that can correspond to decoder processing load and memory capabilities. Level restrictions can be expressed in terms of maximum sampling rate, maximum picture size, maximum bit rate, minimum compression ratio, capacity of encoded picture buffer, etc. Higher level values ​​can correspond to higher complexity limits. The tier modifies the bit rate value and change limit of each level. For example, the main tier is intended for most applications, while the high tier is designed to handle more demanding video contribution applications, such as having much higher bit rate values ​​than video distribution applications. Each of the profiles, tiers, and levels affects the implementation and decoding complexity, and the combination of these three specifies the interoperability point for code streams and decoders.

[0208] In some examples, decoders conforming to a particular tier and level are required to be able to decode all codestreams conforming to the same tier or lower tiers of that level or any level below it, and decoders conforming to a particular profile may support all features in that profile. In some examples, encoders are not required to utilize any particular set of features supported in a profile, but are instead required to produce conforming codestreams, i.e., codestreams that obey specified constraints that enable them to be decoded by conforming decoders.

[0209] In addition to the PTL information, the PTL syntax structure may also include a general constraints information (GCI) syntax structure, which includes a list of constraint flags and non-flag syntax elements indicating specific constraint characteristics of the codestream.

[0210] In the example, HEVC originally includes three profiles called Main Profile, Main 10 Profile and Main Still Picture Profile. These three profiles have some limitations, such as supporting only 4:2:0 chroma sampling. In Main Profile and Main Still Picture Profile, only 8 bits of video accuracy per sample are supported, while Main 10 Profile supports up to 10 bits per sample. In Main Still Picture Profile, the entire code stream includes only one coded picture.

[0211] In some examples, HEVC with range extension may support additional profiles. In an example, the following profiles are collectively referred to as range extension profiles: monochrome profile, monochrome 10 profile, monochrome 12 profile, monochrome 16 profile, main 12 profile, main 4:2:2 10 profile, main 4:2:2 12 profile, main 4:4:4 profile, main 4:4:4 10 profile, main 4:4:4 12 profile, main intra profile, main 10 intra profile, main 12 intra profile, main 4:2:2 10 intra profile, main 4:2:2 12 intra profile, main 4:4:4 intra profile, main 4:4:4 10 intra profile, main 4:4:4 12 intra profile, main 4:4:4 intra profile, main 4:4:4 16 intra profile, main 4:4:4 still picture profile, and main 4:4:4 16 still picture profile.

[0212] Some of the range extension profiles may support higher bit depths and may be referred to as profiles for operating range extension with high bit depth. In some examples, the profiles for operating range extension with high bit depth include profiles supporting more than 10 bits per sample, such as Main 12 profile, Main 12 4:4:4 profile, Main 16 4:4:4 profile, Main 12 Intra profile, Main 12 4:4:4 Intra profile, Main 16 4:4:4 Intra profile, Main 12 still picture profile, Main 12 4:4:4 still picture profile, Main 16 4:4:4 still picture profile, etc.

[0213] Specifically, the Main 12 profile allows bit depths of 8 to 12 bits per sample, supports 4:0:0 and 4:2:0 chroma sampling, and both intra-prediction mode and inter-prediction mode. In some examples, a decoder conforming to the Main 12 profile is capable of decoding bitstreams with the following profiles: monochrome, monochrome 12, main, main 10, and main 12.

[0214] The Main 12 4:4:4 profile allows bit depths from 8 bits to 12 bits per sample, supports 4:0:0, 4:2:0, 4:2:2, and 4:4:4 chroma sampling, and both intra-prediction mode and inter-prediction mode. In some examples, a decoder conforming to the Main 12 4:4:4 profile is capable of decoding bitstreams with the following profiles: Monochrome, Main, Main 10, Main 12, Main 10 4:2:2, Main 12 4:2:2, Main 4:4:4, Main 10 4:4:4, Main 12 4:4:4, and Monochrome 12.

[0215] The Main 16 4:4:4 profile allows bit depths from 8 bits to 16 bits per sample, supports 4:0:0, 4:2:0, 4:2:2, and 4:4:4 chroma sampling, and both intra- and inter-prediction modes.

[0216] The Main 12-Intra profile allows bit depths from 8 bits to 12 bits per sample, supports 4:0:0 and 4:2:0 chroma sampling and intra prediction modes.

[0217] The Main 12 4:4:4 Intra profile allows bit depths from 8 to 12 bits per sample, supports 4:0:0, 4:2:0, 4:2:2, and 4:4:4 chroma sampling, and intra prediction modes.

[0218] The Main 16 4:4:4 Intra profile allows bit depths from 8 bits to 16 bits per sample and supports 4:0:0, 4:2:0, 4:2:2, and 4:4:4 chroma sampling and intra prediction modes.

[0219] The Main 12 still picture profile allows bit depths from 8 bits to 12 bits per sample and supports 4:0:0 and 4:2:0 chroma sampling. In the Main 12 still picture profile, the entire codestream includes only one coded picture.

[0220] The Main 12 4:4:4 still picture profile allows bit depths from 8 to 12 bits per sample, supporting 4:0:0, 4:2:0, 4:2:2, and 4:4:4 chroma sampling. In the Main 12 4:4:4 still picture profile, the entire codestream includes only one coded picture.

[0221] The Main 16 4:4:4 still picture profile allows bit depths from 8 bits to 16 bits per sample, supporting 4:0:0, 4:2:0, 4:2:2 and 4:4:4 chroma sampling. In the Main 16 4:4:4 still picture profile, the entire codestream includes only one coded picture.

[0222] According to some aspects of the present disclosure, coding tool control may be performed at various scopes (e.g., a portion of coded video data encoded with persistence of an instance of a syntax element for coding tool control), such as a scope of a codestream, a scope of a coded layer video sequence (CLVS), a picture, a slice of a picture, etc. In some examples, coding tool control may be provided in a general constraint information (GCI) syntax structure that typically includes constraint information for a codestream. In some examples, coding tool control may be provided in a sequence parameter set (SPS) associated with a CLVS, which typically includes information for a CLVS. In some examples, coding tool control may be provided in a slice header of a slice, which typically includes information for a slice.

[0223] According to one aspect of the present disclosure, control information for coding tools in range extension may be provided at various ranges. In some examples, using a wider range of syntax elements may improve coding efficiency. For example, a GCI syntax element value greater than 0 indicates that a code stream is constrained in a particular manner, typically indicating that a particular coding tool is not used in the code stream. Further, a GCI syntax element value equal to a value of 0 signals that the associated constraint may not be applied, allowing (but not requiring) the use of the associated coding tool in the code stream (if its use is supported in the indicated profile).

[0224] According to another aspect of the present disclosure, when coding tools are not used in the encoding of video data in a codestream (for example, it is indicated in the PTL information and / or the general constraint information that coding tools are not used), a video decoder that does not support the coding tools can determine that the video decoder is capable of decoding the codestream based on the signaling in the PTL information and / or the general constraint information, and the functionality of the video decoder can be expanded.

[0225] In some embodiments, an encoder may generate a codestream that complies with a video standard with range extension, but does not utilize one or more features supported in the range extension. In some examples, a decoder that complies with the video standard but does not support one or more features in the range extension, knowing that one or more features in the range extension are not used, may determine that the decoder is able to decode the codestream and may accept the codestream for decoding rather than rejecting the codestream.

[0226] Fig.16 The syntax structure (1600) of general constraint information according to some embodiments of the present disclosure is shown. In some examples, the syntax structure (1600) includes constraints to be applied to a code stream (such as a code stream including a set of output layers to a decoder). Fig.16 In the example of , the syntax element denoted by gci_num_additional_bits in the syntax structure (1600) is used to specify the number of additional general constraint information (GCI) bits in the general constraint information syntax structure (1600) in addition to the aligned zero bit syntax element (when present). In some standards, the value of gci_num_additional_bits is required to be equal to 0 or 1. In some standards, the decoder may allow a value of gci_num_additional_bits greater than 1 to appear in the syntax structure.

[0227] exist Fig.16In the example of , the syntax structure (1600) includes 5 additional GCI bits (syntax elements) (1601)-(1605) represented by general_no_extended_precision_constraint_flag, general_no_ts_residual_coding_rice_present_in_sh_constraint_flag, general_no_rrc_rice_extension_constraint_flag, general_no_persistent_rice_adaptation_constraint_flag and general_no_reverse_last_sig_coeff_constraint_flag. In some examples, the 5 additional GCI bits (1601)-(1605) provide coding control information of the coding tool in the range of the code stream of the output layer set respectively.

[0228] Fig.17 An example of a syntax structure (1700) for sequence parameter set (SPS) range extension according to some embodiments of the present disclosure is shown. The syntax structure (1700) can be added in the SPS of the CLVS to provide control of the coding tools for the range extension of the CLVS. The syntax structure (1700) includes five syntax elements (1701)-(1705) represented by sps_extended_precision_flag, sps_ts_residual_coding_rice_present_in_sh_flag, sps_rrc_rice_extension_flag, sps_persistent_rice_adaptation_enabled_flag, and sps_reverse_last_sig_coeff_enabled_flag. In some examples, the five syntax elements (1701)-(1705) provide coding control information for the coding tools within the scope of the CLVS.

[0229] Specifically, in an embodiment, the GCI bits (1601) and syntax elements (1701) are used to provide control over the use of extended precision in different ranges, such as control over coding tools that extend the dynamic range for transform coefficients in scaling and transform processes and for binarization of some syntax elements such as abs_remainder[] and dec_abs_level[].

[0230] The syntax element (1701) equal to 1 indicates that the extended dynamic range is used for transform coefficients in the scaling and transform processes and for binarization of some syntax elements such as abs_remainder[] and dec_abs_level[]. The syntax element abs_remainder[scan position n] is the remaining absolute value of the level of the transform coefficient encoded with a Golomb-Rice code at scan position n. When abs_remainder[] is not present, it is inferred to be equal to 0. The syntax element dec_abs_level[scan position n] may correspond to an intermediate value that is encoded with a Golomb-Rice code at scan position n and is used to determine the level of the transform coefficient at scan position n. The syntax element (1701) equal to 0 indicates that the extended dynamic range is not used in the scaling and transform processes and is not used for binarization such as the syntax elements abs_remainder[] and dec_abs_level[]. When not present, the value of the syntax element (1701) is inferred to be equal to 0.

[0231] In an example, a variable represented by Log2TransformRange is used to determine a dynamic range for transform coefficients in scaling and transform processes and for binarization of certain syntax elements. For example, the variable Log2TransformRange may be the number of bits used to represent transform coefficients in scaling and transform processes and the number of bits used for binarization of certain syntax elements. The dynamic range may be the difference between the maximum number and the minimum number represented using the number of bits. In an example, the variable Log2TransformRange is derived from the syntax element (1701) sps_extended_precision_flag, for example using the following equation (1): Log2TransformRange=sps_extended_precision_flag? Max(15,Min(20,BitDepth+6)):15 Equation (1)

[0232] The dynamic range of the transform coefficients and binarization for certain syntax elements in the scaling and transform process can be determined based on the variable Log2TransformRange. In some examples, when the value of the flag sps_extended_precision_flag is 0, the extended dynamic range feature (e.g., the coding tool for the extended dynamic range) is not used, and the dynamic range of the transform coefficients is based on a fixed number of bits, such as 15 bits. When the flag sps_extended_precision_flag has a value of 1, the extended dynamic range feature is enabled, and the number of bits used to represent the transform coefficients in the scaling and transform process can be one of 15 bits, 16 bits, 17 bits, 18 bits, 19 bits, and 20 bits based on the bit depth BitDepth in the example of equation (1). The dynamic range of the transform coefficient can be determined based on the number of bits.

[0233] According to an aspect of the present disclosure, a syntax element (e.g., represented by sps_bitdepth_minus8) may be used to signal the bit depth of samples of the luma and chroma arrays (e.g., represented by BitDepth) and the values ​​of the luma and chroma quantization parameter range offsets (e.g., represented by QpBdOffset). In an example, the bit depth BitDepth may be calculated according to equation (2), and the QP range offset QpBdOffset may be calculated according to equation (3). BitDepth = 8 + sps_bitdepth_minus8 Equation (2) QpBdOffset = 6 × sps_bitdepth_minus8 Equation (3)

[0234] In some examples, a GCI bit (1601) equal to 1 indicates that the syntax elements (1701) of all pictures in the scope of the output layer set (OlsInScope) may be equal to 0. A GCI bit (1601) equal to 0 does not impose such a constraint. Thus, a GCI bit (1601) equal to 1 may indicate that the extended dynamic range coding tool is not used in the encoding of the codestream.

[0235] In some embodiments, the GCI bits (1602) and syntax elements (1702) are used to provide control of coding tools for slice-based Rice coding of residual coding in transform skip mode in different ranges, such as slice-based Rice parameter selection of residual coding in transform skip mode.

[0236] According to one aspect of the present disclosure, slice-based Rice parameter selection for transform skip residual coding can be included in a range extension of a video standard. In some examples, when transform skip mode is enabled (e.g., syntax element sps_tranform_skip_enabled_flag is true), a control flag (e.g., represented by sps_ts_residual_coding_rice_present_in_sh_flag syntax element (1702)) is signaled in a sequence parameter set (SPS) to indicate that signaling of Rice parameters for transform skip slices is enabled or disabled, such as Fig.17 as shown in .

[0237] When the signaling control flag is enabled (e.g., equal to "1"), a syntax element (e.g., represented by sh_ts_residual_coding_rice_idx_minus1) is further signaled for each transform skipped slice (e.g., in a slice header) to indicate the selection of Rice parameters for the transform skipped slice. When the signaling control flag is disabled (e.g., equal to "0"), no additional syntax elements are signaled at the slice level (e.g., slice header) to indicate the Rice parameter selection for the transform skipped slice, and the default Rice parameters can be used for all transform skipped slices in the encoded video data that references the SPS in the example.

[0238] For example, the syntax element (1702) in the SPS being equal to 1 indicates that the slice header flag represented by sh_ts_residual_coding_rice_idx_minus1 may be present in the slice header (e.g., slice_header()) syntax structure of the slice referencing the SPS. The syntax element (1702) in the SPS being equal to 0 indicates that the slice header flag sh_ts_residual_coding_rice_idx_minus1 is not present in the slice_header() syntax structure of the slice referencing the SPS. In some examples, when not present, the value of sps_ts_residual_coding_rice_present_in_sh_flag is inferred to be equal to 0.

[0239] In some examples, a syntax element may be included in the general constraint information to control the use of a coding tool for slice-based Rice coding for residual coding in transform skip mode in the scope of an output layer set. For example, a syntax element (1602) equal to 1 indicates that a syntax element (1702) for all pictures in the scope of the output layer set (OlsInScope) may be equal to 0. A syntax element (1602) equal to 0 does not impose such a constraint. Thus, in some examples, a GCI bit (1602) equal to 1 in a codestream may indicate that the codestream is not encoded using slice-based Rice parameter selection for transform skip residual coding.

[0240] In some embodiments, the GCI bit (1603) and the syntax element (1703) are used to provide control of one or more coding tools for Rice parameter derivation in different ranges, which is used for binarization of some syntax elements such as abs_remainder[] and dec_abs_level[] in regular residual coding (RRC). In some examples, regular residual coding (RRC) refers to some techniques for encoding blocks obtained by transform and quantization. In some examples, RRC can be modified for blocks obtained only by quantization. In some examples, transform skip residual coding (TSRC) refers to some techniques dedicated to encoding blocks obtained by bypassing transform (also known as transform skip).

[0241] In some examples, a video coding standard may include one or more coding tools for deriving binarized Rice parameters for some syntax elements (e.g., abs_remainder[] and dec_abs_level[]), and a range extension of the video coding standard may include one or more alternative coding tools for deriving binarized Rice parameters for some syntax elements (e.g., abs_remainder[] and dec_abs_level[]).

[0242] In some examples, the video standard uses a local template-based technique for Rice parameter derivation. For example, a template comprising one or more (e.g., 5 in the example) adjacent coefficient levels is used for Rice parameter derivation. For example, the sum of the absolute coefficient values ​​inside the template can be calculated, and then the Rice parameters are determined based on the sum. In an example, a lookup table can be used to determine the Rice parameters based on the sum.

[0243] It should be noted that Rice parameters can be determined by other suitable coding tools. In an example, an equation can be used to determine Rice parameters based on a sum. In another example, context modeling can be used to determine Rice parameters based on statistics of adjacent coefficient levels. In some examples, the range extension of the video standard can specify one or more alternative coding tools for Rice parameter derivation.

[0244] In some examples, the range extension of the video standard may include modifications to the RRC for use in other scenarios. In an example, the range extension may include different context modeling tools and residual signal rotation tools for residual coding in transform skip mode.

[0245] In some examples, the syntax element (1703) in the SPS is equal to 1 to indicate that an alternative Rice parameter derivation for binarization of abs_remainder[] and dec_abs_level[] (e.g., an alternative coding tool for Rice parameter derivation in range extension) is used to encode the CLVS that references the SPS. The syntax element (1703) is equal to 0 to indicate that an alternative Rice parameter derivation for binarization of abs_remainder[] and dec_abs_level[] is not used to encode the CLVS that references the SPS. When not present, the value of the syntax element (1703) is inferred to be equal to 0.

[0246] In some examples, the syntax element (1603) equal to 1 indicates that the syntax element (1703) of all pictures in the scope of the output layer set (OlsInScope) can be equal to 0. The syntax element (1603) equal to 0 does not impose such a constraint. Thus, in some examples, the GCI bit (1603) equal to 1 can indicate that the codestream is not encoded using an alternative Rice parameter derivation for binarization of abs_remainder[] and dec_abs_level[] (e.g., an alternative coding tool for Rice parameter derivation specified in a specified scope extension).

[0247] In some embodiments, the GCI bits (1604) and syntax elements (1704) are used to provide control of statistically based Rice parameter derivation for binarization of abs_remainder[] and dec_abs_level[] in different ranges.

[0248] According to one aspect of the present disclosure, the Rice parameter derivation for binarization of abs_remainder[] and dec_abs_level[] can be initialized at the beginning of each transform unit (TU) using statistics accumulated from the previous TU. In some examples, the statistics-based Rice parameter derivation can be included in the range extension of the video standard.

[0249] In some examples, a control flag represented by sps_persistent_rice_adaptation_enabled_flag in the SPS is used (e.g., syntax element (1704)) to control statistics-based Rice parameter derivation. For example, syntax element (1704) equal to 1 in the SPS indicates that the binarized Rice parameter derivation for abs_remainder[] and dec_abs_level[] is initialized at the beginning of each TU using statistics accumulated from the previous TU. Syntax element (1704) equal to 0 indicates that the previous TU state is not used in the Rice parameter derivation of the current TU. When not present, the value of syntax (1704) is inferred to be equal to 0.

[0250] Further, in an embodiment, the syntax element (1604) equal to 1 indicates that the syntax element (1704) of all pictures in the scope of the output layer set (OlsInScope) may be equal to 0. The syntax element (1604) equal to 0 does not impose such a constraint. Thus, in some examples, the GCI bit (1604) equal to 1 may indicate that the codestream is not encoded using statistics-based Rice parameter derivation.

[0251] In some embodiments, the GCI bits (1605) and syntax elements (1705) are used to provide control of a coding tool at different ranges for encoding the position of the last significant coefficient during entropy coding of the transform coefficients. In an example, the position of the last significant coefficient may be encoded by different coding tools. For example, a video standard may specify a first coding tool that may determine the position of the last significant coefficient by encoding two coordinates of the position represented by the LastSignificantCoeffX and LastSignificantCoeffY variables (e.g., encoding relative to (0, 0) for each transform block); and a range extension of the video standard may indicate an alternative coding tool, such as a second coding tool, which, in an example, may determine the position of the last significant coefficient by encoding the relative coordinates of the last significant coefficient with reference to the lower right corner of the transform block.

[0252] In some examples, the syntax element (1705) equal to 1 in the SPS indicates that the slice header flag (slice range) represented by sh_reverse_last_sig_coeff_flag is present in the slice header syntax structure (e.g., slice_header() in some examples) that references the SPS. The syntax element (1705) equal to 0 in the SPS indicates that the slice header flag sh_reverse_last_sig_coeff_flag is not present in the slice header syntax structure that references the SPS, and the slice header flag sh_reverse_last_sig_coeff_flag can be inferred to be zero. When not present, the value of the syntax element (1705) is inferred to be equal to 0.

[0253] In some examples, the value of the slice header flag sh_reverse_last_sig_coeff_flag of the slice is used to determine the position derivation of the last significant coefficient in the transform coefficients in the scaling and transform process in the encoding of the slice. In an example, when sh_reverse_last_sig_coeff_flag is equal to 1 for the slice, in the slice, the last significant coefficient position can be encoded by an alternative coding tool in the range extension of the video standard, such as the second coding tool, in the example, the second coding tool can determine the position of the last significant coefficient by encoding the relative coordinates of the last significant coefficient with reference to the lower right corner of the transform block. Otherwise (e.g., for the slice, sh_reverse_last_sig_coeff_flag is equal to 0), in the slice, the current coordinates of the last significant coefficient position (e.g., encoded relative to (0, 0) for each transform block) are encoded by the first coding tool.

[0254] In some examples, the GCI bit (1605) equal to 1 indicates that the syntax element (1705) of all pictures in the scope of the output layer set (OlsInScope) can be equal to 0. The GCI bit (1605) equal to 0 does not impose such a constraint. Therefore, the GCI bit (1605) equal to 1 can indicate that the second coding tool is not used in the derivation of the position of the last significant coefficient of the codestream scope.

[0255] Fig.18A flow chart outlining a process (1800) according to an embodiment of the present disclosure is shown. The process (1800) may be used for a video decoder. In various embodiments, the process (1800) is performed by a processing circuit, such as a processing circuit in a terminal device (310), (320), (330), and (340), a processing circuit that performs the functions of a video decoder (410), a processing circuit that performs the functions of a video decoder (510), and the like. In some embodiments, the process (1800) is implemented in software instructions, so when the processing circuit executes the software instructions, the processing circuit performs the process (1800). The process starts at (S1801) and proceeds to (S1810).

[0256] At (S1810), a value of a first syntax element (e.g., general_no_reverse_last_sig_coeff_constraint_flag) for coding control in a first range of coded video data (e.g., an output layer set) in a codestream is determined. The first syntax element is associated with a coding tool for encoding the position of the last significant coefficient during entropy coding of the transform coefficient, such as an alternative tool in range extension (e.g., a second coding tool that can determine the position of the last significant coefficient by encoding the relative coordinates of the last significant coefficient with reference to the lower right corner of the transform block in an example).

[0257] In an example, in response to a syntax element (eg, gci_num_additional_bits) in the syntax structure indicating additional bits for general constraint information in the syntax structure, a first syntax element is decoded from the syntax structure for general constraint information.

[0258] At (S1820), when the value of the first syntax element is a first value, the process proceeds to (1830); otherwise, the process proceeds to (S1840). The first value indicates a disabling of the encoding tool in encoding of a first range of encoded video data in the codestream, the first range of encoded video data including one or more second ranges of encoded video data (e.g., one or more CLVS in the output layer set).

[0259] In some examples, the first syntax element is in general constraint information for controlling encoding of pictures in an output layer set output at a decoder. In an example, a first value of the first syntax element indicates disabling of coding tools in each coded layer video sequence (CLVS) in the output layer set.

[0260] At (S1830), in response to the first syntax element being a first value, a first range of encoded video data in the codestream is decoded without invoking an encoding tool.

[0261] In some examples, a second syntax element (e.g., sps_reverse_last_sig_coeff_enabled_flag) for coding control of a coded layer video sequence (CLVS) in a codestream is constrained to have a value indicating that a coding tool for decoding the CLVS is not invoked. In an example, the value of the second syntax element indicates that a slice header flag associated with the coding tool is not present in a slice header of a slice in a picture of the CLVS.

[0262] At (S1840), in response to the first syntax element being a second value, a value of a second syntax element (e.g., sps_reverse_last_sig_coeff_enabled_flag) for encoding control of a second range of coded video data in a codestream (such as a coded layer video sequence (CLVS)) is determined to decode the coded video data in the second range. The second syntax element indicates enablement / disablement of a coding tool in the CLVS. In an example, the second syntax element is not present in a sequence parameter set (SPS) of the CLVS, and the value of the second syntax element for indicating the disablement of the coding tool in the CLVS is inferred.

[0263] In some examples, in response to the value of the second syntax element indicating the enablement of the coding tool in the CLVS, a slice header flag (e.g., sh_reverse_last_sig_coeff_flag) in the slice header of the slice is determined, e.g., decoded from the slice header of the slice. The slice header flag indicates the use / non-use of the coding tool for encoding the slice.

[0264] The process (1800) may be modified as appropriate. One or more steps in the process (1800) may be modified and / or omitted. One or more additional steps may be added. Any suitable order of implementation may be used.

[0265] Fig.19A flow chart outlining a process (1900) according to an embodiment of the present disclosure is shown. The process (1900) may be used for a video encoder. In various embodiments, the process (1900) is performed by a processing circuit, such as a processing circuit in a terminal device (310), (320), (330), and (340), a processing circuit that performs the functions of a video encoder (403), a processing circuit that performs the functions of a video encoder (603), a processing circuit that performs the functions of a video encoder (703), and the like. In some embodiments, the process (1900) is implemented in software instructions, so when the processing circuit executes the software instructions, the processing circuit performs the process (1900). The process starts at (S1901) and proceeds to (S1910).

[0266] At (S1910), the processing circuit determines whether to use a coding tool during encoding of a first range of encoded video data in a code stream (e.g., an output layer set). The coding tool is associated with encoding the position of the last significant coefficient during entropy encoding of the transform coefficient. For example, the coding tool is an alternative coding tool in range extension, such as a second coding tool, which can derive the position of the last significant coefficient in the transform block by encoding the relative coordinates of the last significant coefficient with reference to the lower right corner of the transform block. The first range of encoded video data includes one or more second ranges of encoded video data (e.g., CLVS).

[0267] In some examples, the processing circuit may determine whether to use the coding tool based on the second syntax element (e.g., sps_reverse_last_sig_coeff_enabled_flag) to control the coding of the coded layer video sequence (CLVS) in the codestream. In some examples, the processing circuit may determine whether to use the coding tool based on a slice header flag (e.g., sh_reverse_last_sig_coeff_flag) in a slice header of the coded slice. The slice header flag (e.g., sh_reverse_last_sig_coeff_flag) of the slice indicates whether to use / not use the coding tool for encoding the slice.

[0268] At (S1920), when no encoding tool is used in encoding the first range of the encoded video data, the process proceeds to (S1930); otherwise, the process proceeds to (S1940).

[0269] At (S1930), a first syntax element (e.g., general_no_reverse_last_sig_coeff_constraint_flag) having a first value is encoded in the codestream. The first syntax element is used for a coding tool to perform coding control in a first range of coded video data (e.g., an output layer set) in the codestream. The first syntax element is associated with a coding tool that is used to encode the position of the last significant coefficient during entropy coding of transform coefficients. The first value indicates that the coding tool is not used in encoding the first range of coded video data.

[0270] In an example, the first syntax element is encoded in a syntax structure for general constraint information, and a syntax element (eg, gci_num_additional_bits) in the syntax structure is adjusted to indicate additional bits of general constraint information in the syntax structure.

[0271] At (S1940), the first syntax element having the second value is encoded in the codestream. In some examples, for example, where the second value is a default value for the first syntax element, the first syntax element is not encoded in the codestream and then (S1940) may be skipped.

[0272] The process (1900) may be modified as appropriate. One or more steps in the process (1900) may be modified and / or omitted. One or more additional steps may be added. Any suitable order of implementation may be used.

[0273] The above techniques (e.g., techniques for signaling constraint flags, adaptive resolution parameters) can be implemented as computer software through computer-readable instructions and physically stored in one or more computer-readable media. Fig. 20 A computer device (2000) is shown that is suitable for implementing certain embodiments of the disclosed subject matter.

[0274] 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.

[0275] 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.

[0276] Fig. 20The components shown for the computer device (2000) are exemplary in nature and are not intended to limit the scope of use or functionality of the computer software implementing the embodiments of the present application. The configuration of the components should not be interpreted as having any dependency or requirement on any component or combination of components shown in the exemplary embodiment of the computer device (2000).

[0277] The computer device (2000) 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 device may also be used to capture certain media that are not necessarily directly related to human conscious input, such as audio (e.g., voice, 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).

[0278] The human-computer interface input device may include one or more of the following (only one of which is drawn): keyboard (2001), mouse (2002), touch pad (2003), touch screen (2010), data gloves (not shown), joystick (2005), microphone (2006), scanner (2007), camera (2008).

[0279] The computer device (2000) may also include certain human-computer interface output devices. Such human-computer interface output devices may stimulate one or more human user senses 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 (2010), a data glove (not shown), or a joystick (2005), but there may also be tactile feedback devices that are not used as input devices), audio output devices (e.g., speakers (2009), headphones (not shown)), visual output devices (e.g., screens (2010) 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 may output two-dimensional visual output or output of more than three dimensions through means such as stereoscopic picture output; virtual reality glasses (not shown), holographic displays, and smoke boxes (not shown)) and printers (not shown).

[0280] The computer device (2000) 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) (2020) with CD / DVD or similar media (2021), thumb drives (2022), removable hard disk drives or solid state drives (2023), 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.

[0281] 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.

[0282] The computer device (2000) may also include an interface (2055) to one or more communication networks (2054). 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. Examples of networks may include 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 port or peripheral bus (2049) (e.g., a USB port of the computer device (2000)); other systems are typically integrated into the core of the computer device (2000) by connecting to a 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 device (2000) 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.

[0283] The above-mentioned human-machine interface device, human-accessible storage device and network interface can be connected to the core (2040) of the computer device (2000).

[0284] The core (2040) may include one or more central processing units (CPUs) (2041), graphics processing units (GPUs) (2042), dedicated programmable processing units in the form of field programmable gate arrays (FPGAs) (2043), hardware accelerators for specific tasks (2044), etc. These devices, as well as read-only memory (ROM) (2045), random access memory (2046), internal large-capacity storage (e.g., internal non-user accessible hard disk drives, solid-state drives, etc.) (2047), etc., may be connected via a system bus (2048). In some computer systems, the system bus (2048) may be accessed in the form of one or more physical plugs so that it may be expanded by additional central processing units, graphics processing units, etc. Peripheral devices may be directly attached to the core's system bus (2048) or connected via a peripheral bus (2049). The architecture of the peripheral bus includes PCI, USB, etc. In one example, the screen (2010) may be connected to a graphics adapter (2050). The architecture of the peripheral bus includes PCI, USB, etc.

[0285] The CPU (2041), GPU (2042), FPGA (2043) and accelerator (2044) can execute certain instructions, which can be combined to form the above-mentioned computer code. The computer code can be stored in ROM (2045) or RAM (2046). Transition data can also be stored in RAM (2046), while permanent data can be stored in, for example, internal mass storage (2047). 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 (2041), GPUs (2042), mass storage (2047), ROM (2045), RAM (2046), etc.

[0286] 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 purpose of this application, or may be medium and code well known and available to those skilled in the art of computer software.

[0287] As an example and not a limitation, a computer system having an architecture (2000), in particular a core (2040), can be provided as a processor (including a CPU, a GPU, an FPGA, an accelerator, etc.) to execute software contained in one or more tangible computer-readable media. Such a computer-readable medium can be a medium associated with the above-mentioned user-accessible mass storage, and a specific memory of the core (2040) having non-volatility, such as a core internal mass storage (2047) or a ROM (2045). Software implementing various embodiments of the present application can be stored in such a device and executed by the core (2040). Depending on specific needs, the computer-readable medium may include one or more storage devices or chips. The software can enable the core (2040), 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 (2046) 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 (2044)) that may operate in place of or in conjunction with software to perform a particular process or a particular portion of a particular process described herein. Where appropriate, references to software may include logic and vice versa. Where appropriate, references to computer-readable media may include circuitry (e.g., an integrated circuit (IC)) storing execution software, circuitry containing execution logic, or both. The present application includes any suitable combination of hardware and software. Appendix: Acronyms JEM: Joint Development Model VVC: Next Generation Video Coding BMS: Benchmark Collection MV: Motion Vector HEVC: High Efficiency Video Coding SEI: Supplemental Enhancement Information VUI: Video Availability Information GOPs: Group of Pictures TUs: Transformation Units PUs: prediction units CTUs: Coding Tree Units CTBs: Coding Tree Blocks PBs: prediction blocks HRD: Hypothesized Reference Decoder SNR: Signal to Noise Ratio CPUs: Central Processing Units GPUs: Graphics Processing Units CRT: cathode ray tube LCD: Liquid Crystal Display OLED: Organic Light Emitting Diode CD: Compact Disc DVD: Digital Video Disc ROM: Read Only Memory RAM: Random Access Memory ASIC: Application-Specific Integrated Circuit PLD: Programmable Logic Device LAN: Local Area Network GSM: Global System for Mobile Communications LTE: Long Term Evolution CANBus: Controller Area Network Bus USB: Universal Serial Bus PCI: Peripheral Component Interconnect FPGA: Field Programmable Gate Array SSD: Field Programmable Gate Array IC: Integrated Circuit CU: Coding Unit

[0288] Although the present application has described a number of exemplary embodiments, various changes, arrangements and various equivalent substitutions of the embodiments are within the scope of the present application. Therefore, it should be understood that those skilled in the art can design a variety of systems and methods, which, although not explicitly shown or described herein, embody the principles of the present application and are therefore within the spirit and scope of the present application.

Claims

1. A video encoding method for generating a bit stream, It is characterized in that The method comprises: determining whether to use an encoding tool during encoding of a first range of encoded video data in a bitstream; In response to not using the encoding tool during encoding of the first range of encoded video data, setting a value of a first syntax element for encoding control of the encoded video data within a first range in the codestream to a first value, and encoding the first syntax element having the first value; the first syntax element is associated with the encoding tool, the first value indicates that the encoding tool is not used during encoding of the first range of encoded video data, the encoding tool being used to encode a position of a last significant coefficient during entropy encoding of a transform coefficient; and In response to using the encoding tool during encoding of the first range of encoded video data, the first syntax element having a second value is encoded in the codestream.

2. The method according to claim 1, It is characterized in that The video data includes an output layer set, the first syntax element is represented by general_no_reverse_last_sig_coeff_constraint_flag in the general constraint information, the general constraint information is used to control the encoding of the pictures in the output layer set, and the encoding tool encodes the position of the last significant coefficient in the transform block relative to the lower right corner of the transform block.

3. The method according to claim 2, It is characterized in that The first value of the first syntax element is used to indicate that the coding tool is disabled in each coded layer video sequence CLVS in the output layer set.

4. The method according to claim 2, It is characterized in that Further including: A second syntax element is constrained to have a value indicating that the encoding tool for decoding the coded layer video sequence CLVS is not called, and the second syntax element is used to control encoding of the coded layer video sequence CLVS in the codestream.

5. The method according to claim 4, It is characterized in that The value of the second syntax element indicates that a slice header flag associated with the coding tool is not present in a slice header of a slice in a picture of the CLVS.

6. The method according to claim 2, It is characterized in that Further including: In response to the first syntax element being the second value, a second syntax element for encoding control of the coded layer video sequence CLVS in the code stream is signaled, and the value of the second syntax element is set, wherein the second syntax element indicates the enabling / disabling of the encoding tool in the coded layer video sequence CLVS.

7. The method according to claim 6, It is characterized in that Further including: In response to the value of the second syntax element indicating enabling of the coding tool in the coded layer video sequence CLVS, a slice header flag in a slice header of a slice is decoded, the slice header flag indicating use / non-use of the coding tool for encoding the slice.

8. The method according to claim 6, It is characterized in that The setting of the value of the second syntax element further comprises: In response to the second syntax element not being present in a sequence parameter set SPS of the coded layer video sequence CLVS, the value of the second syntax element for indicating disabling of the coding tool in the coded layer video sequence CLVS is set.

9. The method according to claim 1, It is characterized in that The encoding of the first syntax element having the first value comprises: The first syntax element is encoded in a syntax structure of general constraint information; and the syntax elements in the syntax structure are adjusted to indicate additional bits of general constraint information in the syntax structure.

10. A video decoding method, It is characterized in that The method comprises: Determining a first syntax element for coding control in a first range of coded video data in a bitstream, the first syntax element being associated with a coding tool for encoding a position of a last significant coefficient during entropy coding of transform coefficients; and In response to the first syntax element being a first value indicating that the encoding tool is disabled in the first range, decoding the first range of encoded video data in the codestream without calling the encoding tool, the first range of encoded video data including one or more second ranges of encoded video data.

11. A video encoding device, It is characterized in that The apparatus comprises a processing circuit configured to: determining whether to use an encoding tool during encoding of a first range of encoded video data in a bitstream; In response to not using the encoding tool during encoding of the first range of encoded video data, setting a value of a first syntax element for encoding control of the encoded video data within a first range in the codestream to a first value, and encoding the first syntax element having the first value; the first syntax element is associated with the encoding tool, the first value indicates that the encoding tool is not used during encoding of the first range of encoded video data, and the encoding tool is used to encode the position of the last significant coefficient during entropy encoding of transform coefficients; as well as In response to using the encoding tool during encoding of the first range of encoded video data, the first syntax element having a second value is encoded in the codestream.

12. The device according to claim 11, It is characterized in that The video data includes an output layer set, the first syntax element is represented by general_no_reverse_last_sig_coeff_constraint_flag in the general constraint information, the general constraint information is used to control the encoding of the pictures in the output layer set, and the encoding tool encodes the position of the last significant coefficient in the transform block relative to the lower right corner of the transform block.

13. The device according to claim 12, It is characterized in that The first value of the first syntax element is used to indicate that the coding tool is disabled in each coded layer video sequence CLVS in the output layer set.

14. The device according to claim 12, It is characterized in that The processing circuit is configured to: A second syntax element is constrained to have a value indicating that the encoding tool for decoding the coded layer video sequence CLVS is not called, and the second syntax element is used to control encoding of the coded layer video sequence CLVS in the codestream.

15. The device according to claim 14, It is characterized in that The value of the second syntax element indicates that a slice header flag associated with the coding tool is not present in a slice header of a slice in a picture of the CLVS.

16. The device according to claim 12, It is characterized in that The processing circuit is configured to: In response to the first syntax element being the second value, determining the value of a second syntax element for encoding control of a coded layer video sequence CLVS in the code stream, wherein the second syntax element indicates enabling / disabling of the encoding tool in the coded layer video sequence CLVS.

17. A device for video decoding, It is characterized in that The apparatus comprises a processing circuit configured to: Determining a first syntax element for encoding control in a first range of encoded video data in a bitstream, the first syntax element being associated with an encoding tool for encoding a position of a last significant coefficient during entropy encoding of transform coefficients; as well as In response to the first syntax element being a first value indicating that the encoding tool is not used in the first range, the encoded video data of the first range in the codestream is decoded without calling the encoding tool, and the encoded video data of the first range includes one or more encoded video data of the second range.

18. A method for storing a code stream, It is 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 encoding method according to any one of claims 1 to 9, or is decoded based on the decoding method according to claim 10.

19. A non-volatile computer-readable storage medium storing instructions, It is characterized in that When the instructions are executed by at least one processor, the at least one processor performs the method of any one of claims 1-10.

20. A computer device, It is characterized in that The method comprises a processor and a memory; the memory stores a computer program, and when the computer program is executed by the processor, the processor executes the method according to any one of claims 1 to 10.