Patent classifications
H04N19/513
Low complexity affine merge mode for versatile video coding
In some aspects, the disclosure is directed to methods and systems for reducing memory utilization and increasing efficiency during affine merge mode for versatile video coding by utilizing motion vectors stored in a motion data line buffer for a prediction unit of a second coding tree unit neighboring a first coding tree unit to derive control point motion vectors for the first coding tree unit.
Method and apparatus for encoding motion information and method and apparatus for decoding same
Provided are methods and apparatus for encoding and decoding motion information. The method of encoding motion information includes: obtaining a motion information candidate by using motion information of prediction units that are temporally or spatially related to a current prediction unit; adding, when the number of motion information included in the motion information candidate is smaller than a predetermined number n, alternative motion information to the motion information candidate so that the number of motion information included in the motion information candidate reaches the predetermined number n; determining motion information with respect to the current prediction unit from among the n motion information candidates; and encoding index information indicating the determined motion information as motion information of the current prediction unit.
Method and apparatus for encoding motion information and method and apparatus for decoding same
Provided are methods and apparatus for encoding and decoding motion information. The method of encoding motion information includes: obtaining a motion information candidate by using motion information of prediction units that are temporally or spatially related to a current prediction unit; adding, when the number of motion information included in the motion information candidate is smaller than a predetermined number n, alternative motion information to the motion information candidate so that the number of motion information included in the motion information candidate reaches the predetermined number n; determining motion information with respect to the current prediction unit from among the n motion information candidates; and encoding index information indicating the determined motion information as motion information of the current prediction unit.
Method and apparatus for processing video signals using affine prediction
Disclosed are a method for processing video signals and an apparatus therefor. Specifically, the method for processing video signals on the basis of inter prediction comprises the steps of: inducing a motion vector predictor using motion data of a neighboring block of the current block; parsing layer data indicating the current layer to which a motion vector difference used in inter prediction of the current block belongs, in a previously defined layer structure in which the combination of one or more horizontal and vertical components of motion vector differences are divided into multiple layers; parsing index data indicating a particular combination within the current layer; inducing a motion vector difference of the current block using the layer data and index data; and inducing the motion vector for the current block by adding the motion vector difference to the motion vector predictor.
Picture decoding device, picture decoding method, and picture decoding program with history-based candidate selection
Technology for improving coding efficiency by performing a block split suitable for picture coding and decoding is provided. A picture decoding device includes a spatial candidate derivation unit configured to derive a spatial candidate from inter prediction information of a block neighboring a decoding target block and register the derived spatial candidate as a candidate in a first candidate list, a history-based candidate derivation unit configured to generate a second candidate list by adding a history-based candidate included in a history-based candidate list as a candidate to the first candidate list, a candidate selection unit configured to select a selection candidate from candidates included in the second candidate list; and an inter prediction unit configured to perform inter prediction using the selection candidate. The history-based candidate derivation unit switches between whether or not a history-based candidate overlapping a candidate included in the first candidate list is added in accordance with a prediction mode.
Picture decoding device, picture decoding method, and picture decoding program with history-based candidate selection
Technology for improving coding efficiency by performing a block split suitable for picture coding and decoding is provided. A picture decoding device includes a spatial candidate derivation unit configured to derive a spatial candidate from inter prediction information of a block neighboring a decoding target block and register the derived spatial candidate as a candidate in a first candidate list, a history-based candidate derivation unit configured to generate a second candidate list by adding a history-based candidate included in a history-based candidate list as a candidate to the first candidate list, a candidate selection unit configured to select a selection candidate from candidates included in the second candidate list; and an inter prediction unit configured to perform inter prediction using the selection candidate. The history-based candidate derivation unit switches between whether or not a history-based candidate overlapping a candidate included in the first candidate list is added in accordance with a prediction mode.
MOTION VECTOR CODING METHOD AND MOTION VECTOR DECODING METHOD
A motion vector coding unit executes processing including a neighboring block specification step of specifying a neighboring block which is located in the neighborhood of a current block; a judgment step of judging whether or not the neighboring block has been coded using a motion vector of another block; a prediction step of deriving a predictive motion vector of the current block using a motion vector calculated from the motion vector of the other block as a motion vector of the neighboring block; and a coding step of coding the motion vector of the current block using the predictive motion vector.
MOTION VECTOR CODING METHOD AND MOTION VECTOR DECODING METHOD
A motion vector coding unit executes processing including a neighboring block specification step of specifying a neighboring block which is located in the neighborhood of a current block; a judgment step of judging whether or not the neighboring block has been coded using a motion vector of another block; a prediction step of deriving a predictive motion vector of the current block using a motion vector calculated from the motion vector of the other block as a motion vector of the neighboring block; and a coding step of coding the motion vector of the current block using the predictive motion vector.
INHERITANCE IN SAMPLE ARRAY MULTITREE SUBDIVISION
A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.
INHERITANCE IN SAMPLE ARRAY MULTITREE SUBDIVISION
A better compromise between encoding complexity and achievable rate distortion ratio, and/or to achieve a better rate distortion ratio is achieved by using multitree sub-divisioning not only in order to subdivide a continuous area, namely the sample array, into leaf regions, but using the intermediate regions also to share coding parameters among the corresponding collocated leaf blocks. By this measure, coding procedures performed in tiles—leaf regions—locally, may be associated with coding parameters individually without having to, however, explicitly transmit the whole coding parameters for each leaf region separately. Rather, similarities may effectively exploited by using the multitree subdivision.