System and method for video coding
US-2024314310-A1 · Sep 19, 2024 · US
US9762914B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9762914-B2 |
| Application number | US-201715430874-A |
| Country | US |
| Kind code | B2 |
| Filing date | Feb 13, 2017 |
| Priority date | Jul 19, 2013 |
| Publication date | Sep 12, 2017 |
| Grant date | Sep 12, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
There is disclosed a method, device and computer-readable storage medium for decoding video data. The method includes: obtaining a reference sample array of a video block; obtaining a sum of the reference sample array; calculating a threshold by performing arithmetic right shift to the sum, a shift value of the arithmetic right shift being determined according to size information of the video block; and determining the binary partition pattern by comparing the reference sample array with the threshold.
Opening claim text (preview).
What is claimed is: 1. A method of derivation for a binary partition pattern used for coding video data, comprising: obtaining a reference sample array of a video block with a size information; obtaining a sum of the reference sample array; calculating a threshold by performing arithmetic right shift to the sum, a shift value of the arithmetic right shift being determined according to the size information of the video block; and determining the binary partition pattern by comparing the reference sample array with the threshold. 2. The method of claim 1 , wherein the video block is either a block of a texture component of the video data or a block of a depth component of the video data. 3. The method of claim 1 , wherein the size information of the video block is represented by any of the following: a block size, a number of bits representing the block size, logarithmic representation of the block size, and a coding tree depth value of the video block corresponding to the block size. 4. The method of claim 1 , wherein the binary partition pattern is a contour partition pattern used for depth coding. 5. The method of claim 1 , wherein the binary partition pattern is a wedgelet partition pattern used for depth coding. 6. The method of claim 1 , wherein the binary partition pattern is a contour partition pattern used in inter-component prediction for depth coding. 7. The method of claim 1 , wherein the reference sample array relates to a transform block of the video block. 8. The method of claim 1 , wherein the video block is of any of the following sizes: a 4×4 pixel block, an 8×8 pixel block, a 16×16 pixel block, a 32×32 pixel block, and a 64×64 pixel block. 9. The method of claim 1 , wherein a ratio number is applied to a base value to determine the shift value. 10. The method of claim 9 , wherein the ratio number is 2. 11. The method of claim 9 , wherein the base value utilizes the size information of the video block. 12. The method of claim 1 , wherein the shift value is determined by considering a representation of the size information of the video block as an input parameter. 13. The method of claim 1 , wherein the shift value is determined by considering a factor to a function using the size information of the video block as an input parameter. 14. The method of claim 1 , wherein the shift value is determined in accordance with following expression: Shift value=(MaxBlockSizeInBit−ctDepth)*ratio, where MaxBlockSizeInBit is a bit representation of a maximum block size, ctDepth is a coding tree depth of the video block, ctDepth corresponds to a block size of the video block, and ratio is an integer. 15. The method of claim 1 , wherein the shift value is determined in accordance with following expression: shift value=BlockSizeInBit*ratio, where BlockSizeInBit is a bit representation of a block size of the video block, and ratio is an integer. 16. The method of claim 1 , wherein the reference sample array is a square array and the threshold is determined in accordance with following expression: threshold=sumBlockVals>>(6−ctDepth)*2, where sumBlockVals is the sum of the reference sample array, >> represents the arithmetic right shift operation, ctDepth is a coding tree depth of the video block, and ctDepth corresponds to a block size of the video block. 17. The method of claim 2 , wherein the coding tree depth value of the video block is corresponding to the block size, and the correspondence of the coding tree depth value and the block size of the video block is derived as specified in the following, Block size 8 × 8 16 × 16 32 × 32 Coding tree depth (ctDepth) 3 2 1. 18. A device for decoding video data, the device comprising a video decoder configured to: obtain a reference sample array of a video block with a size information; obtain a sum of the reference sample array; calculate a threshold by performing arithmetic right shift to the sum, a shift value of the arithmetic right shift being determined by using size information of the video block; and determine the binary partition pattern by comparing the reference sample array with the threshold. 19. The device of claim 17 , wherein the size information of the video block is represented by any of the following: a block size, a number of bits representing the block size, logarithmic representation of the block size, and a coding tree depth value of the video block corresponding to the block size. 20. The device of claim 17 , wherein the shift value is determined by considering a representation of the size information of the video block as an input parameter. 21. The device of claim 17 , wherein the shift value is determined in accordance with following expression: shift value=BlockSizeInBit*ratio, where BlockSizeInBit is a bit representation of a block size of the video block, and ratio is an integer. 22. The device of claim 17 , wherein the shift value is determined in accordance with following expression: Shift value=(MaxBlockSizeInBit−ctDepth)*ratio where MaxBlockSizeInBit is a bit representation of maximum block size, ctDepth is a coding tree depth of the video block, ctDepth corresponds to a block size of the video block, and ratio is an integer. 23. The device of claim 17 , wherein the reference sample array is a square array and the threshold is determined in accordance with following expression: threshold=sumBlockVals>>(6−ctDepth)*2, where sumBlockVals is the sum of the reference sample array, >> represents the arithmetic right shift operation, ctDepth is a coding tree depth of the video block, and ctDepth corresponds to a block size of the video block. 24. The device of claim 19 , wherein the coding tree depth value of the video block is corresponding to the block size, and the correspondence of the coding tree depth value and the block size of the video block is derived as specified in the following, Block size 8 × 8 16 × 16 32 × 32 Coding tree depth (ctDepth) 3 2 1.
the region being a block, e.g. a macroblock · CPC title
using video object coding · CPC title
specially adapted for multi-view video sequence encoding · CPC title
Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction · CPC title
Tree coding, e.g. quad-tree coding · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.