Boundary block partitioning in video coding
A border and right border technology, applied in the field of video decoding, can solve the problem of video size becoming a problem
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0154] Embodiment 1: a kind of segmentation method, comprises:
[0155] Determine whether the current block of the image is a boundary block;
[0156] If the current block is a boundary block, determine whether the size of the current block is greater than the minimum allowed quadtree leaf node size;
[0157] If the size of the current block is not larger than the allowed minimum quadtree leaf node size, apply a forced binary tree (binary tree, BT) split to the current block.
Embodiment 2
[0158] Embodiment 2: According to the segmentation method described in Embodiment 1, the forced binary tree segmentation is recursive horizontal forced binary tree segmentation when the current block is located on the lower boundary of the image, or when the current block is located on the lower boundary of the image On the right boundary of , it is a recursive vertical forced boundary split.
Embodiment 3
[0159] Embodiment 3: According to the segmentation method described in Embodiment 1 or 2, the forced binary tree segmentation includes: recursively segmenting the current block by horizontal forced boundary segmentation until the sub-partitions of the current block are directly located at the The lower boundary; recursively split the sub-partitions by vertically enforced boundary segmentation until a leaf node is completely directly on the right boundary of the image, and vice versa.
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


