197 results about "Coding tree unit" patented technology

An encoder includes circuitry and memory coupled to the circuitry. In operation, the circuitry encodes subpicture information in which a horizontal position and a vertical position of a region of a subpicture are represented in a unit of a coding tree unit (CTU). The subpicture is a rectangular region in a picture. The horizontal position is represented by a first position of a first CTU in the subpicture, the first position being relative to a left end of the picture. The vertical position is represented by a second position of a second CTU in the subpicture, the second position being relative to a top end of the picture.

The invention relates to a target detection enhanced video code rate control method, and belongs to the technical field of video compression. The method comprises the following steps: preprocessing each frame of image of an input video, dividing a plurality of coding tree units in each frame of image, and calculating gradient features of the image and the coding tree units; the video is coded through different quantization parameters, and the code rate of the coded video and the distortion degree of the video are calculated; fitting a cubic logarithmic model to establish a relationship between the distortion degree and the code rate of the video by combining the gradient characteristics of each frame and the distortion degree and the code rate of the video; marking the ROI region of each image frame of the input video through a target detection network, and dividing the compensation level of the coding tree unit in combination with the ROI region and the gradient feature of the coding tree unit; and in combination with the compensation level of each coding tree unit, through a code rate allocation mechanism, allocating a coding code rate to each coding tree unit in each image frame of the input video. According to the invention, the video compression process can be optimized, and the overall performance of the compressed video is improved.

A zero-delay panoramic video bit rate control method that considers distortion temporal propagation aims to optimize target bit allocation and achieve global rate-distortion optimization in coding. It encompasses coding tree unit (CTU)-level bit rate control and temporal global rate-distortion optimization. CTU-level bit rate control involves optimizing target bit allocation and updating bit rate control parameters. Temporal global rate-distortion optimization utilizes the reconstruction error and motion compensation prediction error information of the previous coded frame to estimate the temporal dependence between CTUs in the current coding frame and those in the previous coded frame to adjust the coding parameters of the current CTU. The coding parameters are further fine-tuned according to the area stretching ratio encountered during the projection of the panoramic video from a 3D spherical surface to a 2D plane, taking into consideration the detrimental impact of interpolated redundant pixels on the coding process.

A video coding method, an encoder, and a decoder are disclosed. The method is applied to a decoder and comprises retrieving a bitstream corresponding to a current frame and parsing the bitstream to obtain a current coding tree unit (CTU) of the current frame; determining an availability of at least one neighbouring CTU of the current CTU in the current frame according to a wavefront delay, wherein the wavefront delay is a delay in units of CTUs in a row direction between the current CTU at a current CTU row and the neighbouring CTU at a previous CTU row which are decoded in parallel; determining a prediction block in the at least one neighbouring CTU for a current coding unit (CU) in the current CTU; and decoding the current CU using the prediction block.

A method, apparatus, and computer program product provide for management of luma mapping with chroma scaling (LMCS) processes for Gradual Decoding Refresh (GDR) pictures. In the context of a method, the method accesses a picture to be decoded and determines whether the picture is within a GDR period. The method can also prevent a LMCS decoding process from being applied to the picture within the GDR period. Another method can determine whether a virtual boundary is within a current coding tree unit of a picture with a GDR period and if so, prevent a chroma residual scaling decoding process associated with LMCS from being applied to one or more coding units within a clean area. Another method can pad a neighboring pixel area from one or more reconstructed pixels in a clean area for a chroma residual scaling decoding process associated with LMCS.

The invention relates to the technical field of video image compression, in particular to a video image compression algorithm based on an H.266 / VVC standard, which comprises the steps of generating a visual attention thermodynamic diagram through time-space domain saliency detection, adjusting a coding tree unit QP value in a partitioned manner to realize adaptive quantization, and designing an asymmetric quantization matrix to optimize a transformation quantization effect. And the generative adversarial network is used to enhance the quality of the reconstructed frame. According to the method, the blocking effect of a complex texture region can be effectively inhibited, the quantization distortion of a human eye sensitive region is reduced, the edge preserving capability is improved, the subjective visual quality and compression efficiency of the video are remarkably improved, and the high-definition video transmission requirement is met.

Methods are described for template matching (TM) in video coding. The proposed methods include: the use of constrained top and left neighbors in template matching, enabling TM only in coding tree unit boundaries, using approximated reconstructed samples, a new processing pipeline for deriving decoder side intra mode derivation (DIMD) combined with template based intra mode derivation (TIMD), and using filtered pixels from the neighbors, instead of using the reconstructed pixels. Furthermore, methods are described on how template matching may be applied in combination with Intra, sub-partitioning mode, interpolation filtering in intra prediction, block partitioning, bi-prediction with coding unit-level weights, and adaptive motion vector resolution.

A method of partitioning in video coding for JVET, comprising representing a JVET coding tree unit as a root node in a quadtree plus binary tree (QTBT structure that can have quadtree or binary partitioning of the root node and quadtree or binary trees branching from each of the leaf nodes. The partitioning at any depth can use asymmetric binary partitioning to split a child node represented by a leaf node into two child coding units of unequal size, representing the two child coding units as leaf nodes in a binary tree branching from the parent leaf node and coding the child coding units represented by final leaf nodes of the binary tree with JVET. Disclosed is a generalized method of partitioning a block, either square or rectangular, which leads to more flexible block sizes with possible higher coding efficiency.

A method, apparatus, and computer program product provide for management of luma mapping with chroma scaling (LMCS) processes for Gradual Decoding Refresh (GDR) pictures. In the context of a method, the method accesses a picture to be decoded and determines whether the picture is a GDR picture. The method can also prevent a LMCS decoding process from being applied to the GDR picture. Another method can determine whether a virtual boundary is within a current coding tree unit of the gradual decoding refresh picture and if so, prevent a chroma residual scaling decoding process associated with LMCS from being applied to one or more coding units within a clean area. Another method can pad a neighboring pixel area from one or more reconstructed pixels in a clean area for a chroma residual scaling decoding process associated with LMCS.

The present application relates to the technical field of video coding, and especially relates to a coding unit division fast decision method and system based on multi-functional video coding, comprising constructing a quadtree division prediction network, using the network to judge whether a coding tree unit needs to perform quadtree division, and obtaining a coding unit after performing the quadtree division; constructing a mixed tree division prediction network, using the network to judge whether the coding unit needs to be divided, stopping division if the coding unit does not need to be divided, otherwise judging whether the coding unit adopts binary tree division or ternary tree division, and taking a smaller coding unit division prediction value in parallel branches as a final prediction result. The present application improves coding efficiency, and can balance the relationship between visual quality and coding efficiency by selecting different threshold values according to specific scene needs.

The invention provides a video coding method, which comprises the following steps of: inputting a coding tree unit to be coded, and extracting texture features of a coding block, the texture features comprising local binary pattern similarity of all pixel points in the coding block and direction dispersion of each pixel point; inputting the texture features into the trained multi-type division prediction architecture, and sequentially judging whether to execute quadtree division, horizontal or vertical division, horizontal binary tree or ternary tree division and vertical binary tree or ternary tree division or not through a binary classification problem method; and calculating the rate distortion cost under each division mode to obtain an optimal division mode and a suboptimal division mode of the coding block, and outputting an optimal mode or a combination of the optimal mode and the suboptimal mode. According to the invention, the accuracy of the prediction mode in coding is improved.

The invention provides an image processing apparatus, an image processing method, and a bitstream transmission apparatus. An image processing device for processing a picture including a sub-picture including one or more CTUs (Code Tree Units), the image processing device comprising: a memory; and a circuit connected to the memory, the circuit performing a process of determining whether (i) a third value, which is a product of a CTU size and a sum of a first value indicating a left end of the sub-picture and a second value indicating a width of the sub-picture, and (ii) the width of the picture is smaller, and if the third value is smaller than the width of the picture, determining whether the width of the picture is smaller or not, and if the third value is smaller than the width of the picture, the width of the sub-picture is smaller than the width of the sub-picture, the width of the sub-picture is smaller than the width of the sub-picture. When the width of the picture is smaller than the third value, the product of the second value and the CTU size is derived as the width of the sub-picture, and when the width of the picture is smaller than the third value, the difference between the width of the picture and the product of the first value and the CTU size is derived as the width of the sub-picture.

A decoding method includes: decoding a bitstream to determine a related syntax element of a current coding tree unit; determining a geometric transformation type of the current coding tree unit according to the related syntax element; determining reference sample information of the current coding tree unit; performing geometric transformation on the reference sample information of the current coding tree unit according to the geometric transformation type, to obtain geometric transformed reference sample information; inputting the geometric transformed reference sample information of the current coding tree unit to a neural network based in-loop filter model for filtering, to output filtered reconstructed sample information; and performing inverse geometric transformation on the filtered reconstructed sample information according to the geometric transformation type, to obtain final reconstructed sample information of the current coding tree unit.

A video decoder can be configured to decode a first syntax element indicating a size of a coding tree unit (CTU); decode, after decoding the first syntax element indicating the size of the CTU, a second syntax element indicating a width of an element of a subpicture identifier grid; decode, after decoding the first syntax element indicating the size of the CTU, a third syntax element indicating a height of the element of the subpicture identifier grid; and determine a location of a subpicture within a picture based on the first syntax element, the second syntax element, and the third syntax element.

Systems, methods, and tools may perform CTU grid shifting. In an example, a device may include a processor. The apparatus may be configured to obtain a picture including a plurality of coding tree units (CTUs). The device may select a CTU grid shift value based on the associated feature value. The CTU grid shift value may be selected from a plurality of CTU grid shift values. In an example, each CTU grid shift value from a plurality of CTU grid shift values may be associated with a respective feature value. The device may encode the picture based on the selected CTU grid shift value. In an example, the associated feature value may indicate at least one of an activity value, a block boundary activity of a block, one or more spatial gradients, or a number of blocks associated with Intra Block Copy (IBC).

The invention relates to a video coding method and device based on heterogeneous cooperative work and electronic equipment. The method comprises the following steps: acquiring video data to be processed, inputting a video segment to which a previous frame in the video data belongs to a complexity detection model, and predicting the complexity of a next frame in the video data; the central processing unit extracts a next frame and a reference frame from the video data and sends the next frame and the reference frame to the graphics processor; wherein each of the next frame and the reference frame comprises a plurality of coding tree units; each coding tree unit comprises a plurality of subunits; the graphics processor performs matching search on each subunit contained in the next frame in parallel in the reference frame based on the CUDA core to obtain a motion vector corresponding to each subunit; and according to the complexity and the motion vector, resource scheduling is carried out on a central processor and a graphics processor based on a load balancing principle, and a compressed bit stream is generated. In this way, the graphics processor utilizes the CUDA core to execute matching search on the multiple subunits in parallel, and the coding efficiency is improved.

The invention discloses a coding and decoding method and device, coding equipment, decoding equipment and a storage medium, and the decoding method comprises the steps: decoding a code stream, and determining related syntax elements of a current coding tree unit; according to the related syntax elements, determining a target loop filtering model of the current coding tree unit from candidate loop filtering models based on a neural network; determining reference sample information of the current coding tree unit; and inputting the reference sample information of the current coding tree unit into the target loop filtering model for filtering, and outputting reconstructed sample information after filtering. A coding end uses a candidate loop filtering module to filter a coding tree unit, calculates a distortion cost value, determines a target loop filtering model corresponding to the minimum distortion cost value and writes related syntax elements into a code stream, and a decoding end only needs to analyze the code stream and selects an optimal target loop filtering model for the current coding tree unit according to the related syntax elements. Therefore, the filtering performance of the reconstructed sample of the current coding tree unit is improved.

The present disclosure provides a video coding method, device, electronic equipment, storage medium, program product and method for generating a bitstream, the video coding method comprising: obtaining coding information of a current video frame after mode decision, wherein the current video frame is divided into a plurality of coding tree units, each coding tree unit comprising a plurality of coding units, and the coding information comprising information of preset coding variables of each coding unit; for each coding tree unit, performing the following processing: performing statistical processing on the information of the preset coding variables of each coding unit in the current coding tree unit to obtain a coding information statistical value; determining a quantization parameter increment according to the coding information statistical value and a mapping relationship function, wherein the mapping relationship function is used to specify a mapping relationship between the coding information statistical value and the quantization parameter increment; and encoding the current coding tree unit based on the determined quantization parameter increment. The method can simplify the calculation of the quantization parameter increment and optimize the coding efficiency.

A method for visual media processing comprises: converting between a video picture contained in visual media data and a bitstream of the visual media data using sub-pictures, determining that a rule related to one or more sub-pictures is satisfied by the conversion; and performing the conversion according to the rule constrained by the rule, wherein the rule specifies that the size of the sub-picture in the video picture is an integer multiple of the size of a coding tree unit associated with the video picture.

A method for decoding the video bit stream includes receiving the video bit stream associated with a coding tree unit (CTU) including a coding unit (CU) at a k-th depth node, identifying a first syntax element from the video bit stream, identifying a second syntax element from the video bit stream, and configuring the video decoder based on these two syntax elements, and decoding the CTU to generate the video data. The CU includes a plurality of coding blocks (CBs). The first syntax element indicates if a CU at a (k+1) th depth node is to be further split by using a dual-tree partitioning method. The second syntax element indicates that a first CB of the CU at the (k+1) th depth node is to be further split and a second CB of the CU at the (k+1) th depth node is not to be further split.

A method of video decoding is provided. In the method, a coded video bitstream of a current picture is received. The current picture is divided into a plurality of rows of coding tree units (CTUs). Coding blocks in a first CTU row of the plurality of rows of CTUs are decoded based on motion vector information stored in a history-based motion vector prediction (HMVP) buffer. The motion vector information stored in the HMVP buffer is updated as the coding blocks in the first CTU row are decoded. The HMVP buffer is updated to include the motion vector information of the coding blocks in a first CTU of the first CTU row after the coding block at an end of the first CTU row is decoded.

The invention relates to a method for encoding a frame into a bitstream, said frame being spatially divided into frame portions, said method comprising: encoding a frame portion in said frame into said bitstream; representing in said bitstream an identifier of each of said frame portions in said frame; and representing spatial information related to the position of a frame portion within said frame, wherein said identifier and said spatial information are represented in a parameter set in said bitstream, and wherein the number of bits used to represent said identifier is further represented in said bitstream, wherein the number of bits used to represent said identifier is variable, and wherein said spatial information comprises the position of said frame portion given by a coding tree unit address.

Decoding an image frame from a bitstream, the image frame being divided into a plurality of coding tree units. The method comprises decoding a maximum transform block size constraint and or a maximum coding tree unit (CTU) size constraint from the bitstream; and decoding a maximum enabled transform block size and / or a maximum enabled CTU size from the bitstream. The decoded maximum enabled transform block size is less than or equal to the decoded maximum transform block size constraint. The decoded maximum enabled CTU size is less than or equal to the decoded maximum CTU size constraint. Determining each of the one or more transform blocks for each of the plurality of coding tree units according to the decoded maximum enabled transform block size, maximum enabled CTU and split flags decoded from the bitstream; and decode each of the determined one or more transform blocks from the bitstream.

A method for decoding a video from a video bitstream is provided and includes: accessing a binary string representing a partition of the video, the partition comprising a plurality of coding tree units (CTUs) forming one or more CTU rows; for each CTU of the plurality of CTUs in the partition, determining whether the CTU is the first CTU in a slice or a tile; in response to determining that the CTU is not the first CTU in a slice or a tile, determining whether parallel decoding is enabled and the CTU is the first CTU in a CTU row of a tile; in response to determining that the parallel decoding is enabled and the CTU is the first CTU in a CTU row of a tile, determining an available flag for a top neighboring block of the CTU.

The invention provides a video decoding / encoding method and a bitstream transmission method. A method and an apparatus for acquiring information on subunits split from a screen are disclosed. According to an embodiment of the present invention, a method for acquiring information on subunits split from a screen is provided. The method comprises the steps of: decoding, from a bitstream, CTU size information indicating a size of a coding tree unit (CTU) within a picture; decoding, from a bitstream, sub-picture splitting information indicating sub-pictures within the picture in units of the CTU size; decoding splitting information of one or more tiles within the picture from a bitstream; and decoding splitting information of one or more slices within the picture from a bitstream.

This disclosure generally describes embodiments relating to video coding. [Solution] The neighboring blocks of the current block include a first block adjacent to one of the top edge, upper left corner, and upper right corner of the current block, and a second block adjacent to one of the left edge and lower left corner of the current block. It is determined whether one or more of the first blocks and the current block are in the same coding tree unit (CTU). Based on whether one or more of the first blocks and the current block are in the same CTU, each intra-mode associated with one or more of the first blocks is added to the most likely mode (MPM) list of the current block based on the sequence of conditions. Each intra-mode associated with each of the second blocks is added to the MPM list based on the sequence of conditions.

Systems and methods for adaptive prediction cost estimation in video encoding are provided. The techniques improve early cost estimation and reduce the number of candidates for the later decision stages and final RDO stage. In particular, an adaptive sum of absolute transformed differences (SATD) is determined for each candidate, and, based on the adaptive SATD values, a subset of candidates is selected for mode decision search to determine block partitioning, motion vectors, and encoding modes, The adaptive SATD combines a weighted DC component of the SATD and the AC component of the SATD. The weighting factor is selected from a DC adjustment ratio table based on the spatial variation and the QP for a respective coding tree unit. The techniques improve cost estimation accuracy, reduce encoding complexity, and are hardware-friendly for integration into video codecs such as HEVC, AV1, VVC, and AV2.

The encoding device (100) includes a circuit and a memory connected to the circuit. When the circuit is in operation, it encodes sub-picture information. The sub-picture information uses CTU (Coding Tree Unit) to represent the width and height of the sub-picture as a rectangular area in the picture.

This invention provides an image encoding method, an image decoding method, and a computer-readable medium. The image encoding method involves obtaining a block from an encoding tree unit; dividing the block into four sub-blocks when the predetermined number of sub-blocks is set to four; wherein, if the block size meets a block size condition, the block is divided into four sub-blocks along a single direction, this division includes: if the block width is greater than its height and its size is 32×8, dividing the block into four 8×8 sub-blocks along a vertical direction; and if the block height is greater than its width and its size is 8×32, dividing the block into four 8×8 sub-blocks along a horizontal direction; and if the block size does not meet a block size condition, dividing the block into four sub-blocks along both a vertical and horizontal direction, this division includes: if the block width is equal to its height and its size is 32×32, dividing the block into four 16×16 sub-blocks along both a vertical and horizontal direction; and encoding the sub-blocks.