Selective motion vector prediction candidates in frames with global motion
The decoder improves motion vector prediction by using a global motion model to enhance the motion vector candidate list, addressing inefficiencies in existing video encoding technologies and enhancing compression and decoding performance.
Patent Information
- Application Number
- HK42026123850
- Authority / Receiving Office
- HK · HK
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2019-04-25
- Filing Date
- 2026-05-22
- Publication Date
- 2026-07-31
AI Technical Summary
Existing video encoding technologies face inefficiencies in predicting motion vectors across frames with global motion, leading to suboptimal compression and decoding performance.
A decoder is configured to enhance motion vector prediction by incorporating a single global motion vector candidate based on a global motion model for each block, improving the motion vector candidate list construction and pixel data reconstruction.
Enhances motion vector prediction accuracy, thereby improving video encoding efficiency and decoding performance.
Smart Images

Figure 00000000_0000_ABST
Abstract
Description
Abstract Abdominal ultrasound examination method, system and device SELECTIVE MOTION VECTOR PREDICTION CANDIDATES IN FRAMES WITH GLOBAL MOTION Abstract A decoder includes circuitry configured to receive a bitstream; construct, for a current block, a motion vector candidate list including adding a single global motion vector candidate to the motion vector candidate list, the single global motion vector candidate selected based on a global motion model utilized by the current block; and reconstruct pixel data of the current block and using the motion vector candidate list. Related apparatus, systems, techniques and articles are also described.
Claims
1. A video encoder configured to encode a bitstream, the bitstream to be decoded by a compatible decoder: The encoder generates an encoded bitstream, which includes a sequence parameter set and an encoded image. The encoded image includes a first continuous region, a second continuous region, and encoded blocks predicted intra-frame. The first continuous region includes a first plurality of encoded blocks, and the second continuous region includes a second plurality of encoded blocks. The decoder is configured to: Receive the encoded bit stream; The first continuous region of the encoded image is decoded in the following manner: A motion model is used for each of the first plurality of coding blocks in the first continuous region. The motion model is the same for all coding blocks in the first plurality of coding blocks in the first continuous region. The motion model is one of four-parameter affine motion or six-parameter affine motion. The sequence parameter set contains information about the motion model. When the motion model is a four-parameter affine motion, for each of the first plurality of coded blocks in the first continuous region, a motion vector candidate list is constructed. The motion vector candidate list includes a four-parameter candidate, which includes two control point motion vectors. Each of the two control point motion vectors is the motion vector of the nearest neighboring block in the coded image. The four-parameter candidate is used to decode each of the first plurality of coded blocks in the first continuous region for four-parameter affine motion compensation. When the motion model is a six-parameter affine motion, for each of the first plurality of coded blocks in the first continuous region, a motion vector candidate list is constructed, the motion vector candidate list includes a six-parameter candidate, the six-parameter candidate includes three control point motion vectors, wherein each of the three control point motion vectors is the motion vector of the nearest neighboring block in the coded image, and the six-parameter candidate is used to decode each of the first plurality of coded blocks in the first continuous region for six-parameter affine motion compensation; The second consecutive region of the encoded image is decoded by using individual motion information contained in the bitstream for each of the second plurality of encoded blocks. The intra-predicted block is decoded using intra-frame prediction from within the image; as well as The decoded image is stored in the decoded image buffer.
2. The encoder according to claim 1, wherein, Each of the blocks is part of a coding tree unit.
3. The encoder according to claim 1, wherein, At least one block is a symmetric block.
4. The encoder according to claim 3, wherein, Each of the blocks is NxN, where N is one of 32, 64 or 128.
5. A video decoder, the video decoder comprising circuitry configured to: Receive an encoded bitstream, the encoded bitstream including a sequence parameter set and an encoded image, the encoded image including a first continuous region, a second continuous region and an intra-frame predicted encoded block, the first continuous region including a first plurality of encoded blocks, the second continuous region including a second plurality of encoded blocks; The first continuous region of the encoded image is decoded in the following manner: A motion model is used for each of the first plurality of coding blocks in the first continuous region. The motion model is the same for all coding blocks in the first plurality of coding blocks in the first continuous region. The motion model is one of four-parameter affine motion or six-parameter affine motion. The sequence parameter set contains information about the motion model. When the motion model is a four-parameter affine motion, for each of the first plurality of coded blocks in the first continuous region, a motion vector candidate list is constructed. The motion vector candidate list includes a four-parameter candidate, which includes two control point motion vectors. Each of the two control point motion vectors is the motion vector of the nearest neighboring block in the coded image. The four-parameter candidate is used to decode each of the first plurality of coded blocks in the first continuous region for four-parameter affine motion compensation. When the motion model is a six-parameter affine motion, for each of the first plurality of coded blocks in the first continuous region, a motion vector candidate list is constructed, the motion vector candidate list includes a six-parameter candidate, the six-parameter candidate includes three control point motion vectors, wherein each of the three control point motion vectors is the motion vector of the nearest neighboring block in the coded image, and the six-parameter candidate is used to decode each of the first plurality of coded blocks in the first continuous region for six-parameter affine motion compensation; The second consecutive region of the encoded image is decoded by using individual motion information contained in the bitstream for each of the second plurality of encoded blocks. The intra-predicted block is decoded using intra-frame prediction from within the image; as well as The decoded image is stored in the decoded image buffer.
6. The decoder according to claim 5, wherein, Each of the blocks is part of a coding tree unit.
7. The decoder according to claim 5, wherein, At least one block is a symmetric block.
8. The decoder according to claim 7, wherein, Each of the blocks is NxN, where N is one of 32, 64 or 128.
9. A method for transmitting coded video signals, the method comprising: Receive video signals; An encoded bitstream is generated, which will be decoded by a compatible decoder. The encoded bitstream includes a sequence parameter set and an encoded image. The encoded image includes a first continuous region, a second continuous region, and blocks predicted by intra-frame. The first continuous region includes a first plurality of encoded blocks, and the second continuous region includes a second plurality of encoded blocks. The encoded bitstream is transmitted to a decoder, which is configured to: Receive the encoded bit stream; The first continuous region of the encoded image is decoded in the following manner: A motion model is used for each of the first plurality of coding blocks in the first continuous region. The motion model is the same for all coding blocks in the first plurality of coding blocks in the first continuous region. The motion model is one of four-parameter affine motion or six-parameter affine motion. The sequence parameter set contains information about the motion model. When the motion model is a four-parameter affine motion, for each of the first plurality of coded blocks in the first continuous region, a motion vector candidate list is constructed. The motion vector candidate list includes a four-parameter candidate, which includes two control point motion vectors. Each of the two control point motion vectors is the motion vector of the nearest neighboring block in the coded image. The four-parameter candidate is used to decode each of the first plurality of coded blocks in the first continuous region for four-parameter affine motion compensation. When the motion model is a six-parameter affine motion, for each of the first plurality of coded blocks in the first continuous region, a motion vector candidate list is constructed, the motion vector candidate list includes a six-parameter candidate, the six-parameter candidate includes three control point motion vectors, wherein each of the three control point motion vectors is the motion vector of the nearest neighboring block in the coded image, and the six-parameter candidate is used to decode each of the first plurality of coded blocks in the first continuous region for six-parameter affine motion compensation; The second consecutive region of the encoded image is decoded by using individual motion information contained in the bitstream for each of the second plurality of encoded blocks. The intra-predicted block is decoded using intra-frame prediction from within the image; as well as The decoded image is stored in the decoded image buffer.
10. The method according to claim 9, wherein, Each of the blocks is part of a coding tree unit.
11. The method according to claim 9, wherein, At least one block is a symmetric block.
12. The method of claim 11, wherein, Each of the blocks is NxN, where N is one of 32, 64 or 128.