Coded-block-flag coding and derivation

US9749645B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9749645-B2
Application numberUS-201213530849-A
CountryUS
Kind codeB2
Filing dateJun 22, 2012
Priority dateJun 22, 2012
Publication dateAug 29, 2017
Grant dateAug 29, 2017

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Techniques for coding and deriving (e.g., determining) one or more coded-block-flags associated with video content are described herein. A coded-block-flag of a last node may be determined when coded-block-flags of preceding nodes are determined to be a particular value and when a predetermined condition is satisfied. In some instances, the predetermined condition may be satisfied when log 2 (size of current transform unit) is less than log 2 (size of maximum transform unit) or log 2 (size of current coding unit) is less than or equal to log 2 (size of maximum transform unit)+1. The preceding nodes may be nodes that precede the last node on a particular level in a residual tree.

First claim

Opening claim text (preview).

What is claimed is: 1. A method comprising: dividing, by an encoder implemented by a computing device, a video frame into multiple coding units, the encoder being configured with a requirement to split transform units that are larger than a predetermined maximum transform unit size; dividing, by the encoder, a coding unit of the multiple coding units into multiple transform units, each of the multiple transform units being associated with a coded-block-flag indicating whether or not the transform unit includes residual information, the multiple transform units including preceding transform units and a last transform unit; determining, by the encoder, that each of the preceding transform units is associated with a coded-block-flag indicating that the preceding transform unit does not include residual information; determining, by the encoder, that a size of a transform unit of the multiple transform units is less than or equal to the predetermined maximum transform unit size; and based at least in part on the determining that each of the preceding transform units is associated with a coded-block-flag indicating that the preceding transform units does not include residual information and the determining that the size of the transform unit is less than or equal to the predetermined maximum transform unit size, determining that the last transform unit is associated with a coded-block-flag indicating that the last transform unit includes residual information. 2. The method of claim 1 , wherein the determining that the size of the transform unit is less than or equal to the predetermined maximum transform unit size includes determining that log 2 (a size of a current transform unit)<log 2 (the predetermined maximum transform unit size) or that log 2 (a size of a current coding unit)≦log 2 (the predetermined maximum transform unit size)+1, where the current transform unit is the last transform unit and the current coding unit is the coding unit that is divided into the multiple transform units. 3. The method of claim 1 , wherein the predetermined maximum transform unit size is a pixel size that is set by at least one of an encoder, decoder, individual, or application. 4. The method of claim 1 , further comprising: performing one or more prediction operations on the coding unit that is divided into the multiple transform units, the one or more prediction operations generating the residual information for at least the last transform unit, the coded-block-flag for the last transform unit being based at least in part on the generated residual information. 5. The method of claim 1 , wherein the preceding transform units and the last transform unit are transform units on a same level in a tree structure. 6. A system comprising: one or more processors; and memory, communicatively coupled to the one or more processors, storing computer readable instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising: representing video content with a plurality of nodes that are each associated with a coded-block-flag indicating whether or not the node includes residual information, the plurality of nodes including at least one preceding node and a last node; determining that the at least one preceding node is associated with a coded-block-flag indicating that the at least one preceding node does not include residual information; determining that a predetermined condition is satisfied, the predetermined condition relating to a predetermined maximum size of a node, the determining including determining that at least one of a size of the last node is less than the predetermined maximum size of a node, or that the size of a root node of the plurality of nodes is less than or equal to one plus a logarithm of the predetermined maximum size of a node; upon the determining that the at least one preceding node is associated with a coded-block-flag indicating that the at least one preceding node does not include residual information and the determining that the predetermined condition is satisfied, determining that the last node is associated with a coded-block-flag indicating that the last node includes residual information; and upon the determining that the last node is associated with a coded-block-flag indicating that the last node includes residual information, refraining from sending the coded-block-flag of the last node to a decoder. 7. The system of claim 6 , wherein each of the nodes of the plurality of nodes corresponds to a transform unit and the root transform unit of the plurality of nodes corresponds to a coding unit. 8. The system of claim 6 , wherein the predetermined maximum size of a node is set by at least one of an encoder, decoder, individual, or application. 9. The system of claim 6 , wherein the acts further comprise: performing one or more prediction operations to generate residual information for at least one of the plurality of nodes, the coded-block-flag for the at least one of the plurality of nodes being based at least in part on the generated residual information. 10. The system of claim 6 , wherein the acts are performed by a decoder. 11. The system of claim 6 , wherein the video content is represented with a residual quadtree structure in which a node of the plurality of nodes is divided into four sub-nodes. 12. The system of claim 6 , wherein the acts are performed by an encoder and at least some nodes of the plurality of nodes are non-leaf nodes that are associated with a chroma component, and the acts further comprise: sending the coded-block-flags associated with the non-leaf nodes. 13. The system of claim 6 , wherein the acts are performed by an encoder and at least some nodes of the plurality of nodes are non-leaf nodes that are associated with a luma component, and the acts further comprise: sending the coded-block-flags associated with the non-leaf nodes. 14. The system of claim 6 , wherein at least some of the nodes of the plurality of nodes comprise leaf nodes that are not split into sub-nodes. 15. A method comprising: representing, by a computing device, video content with a plurality of nodes that are each associated with a coded-block-flag indicating whether or not the node includes residual information, the plurality of nodes including at least one preceding node and a last node; determining, by the computing device, that the at least one preceding node is associated with a coded-block-flag indicating that the at least one preceding node does not include residual information; determining, by the computing device, that a size of a node of the plurality of nodes is less than or equal to a predetermined maximum size of a node, the predetermined maximum size being associated with a forced split; and based at least in part on the determining that the at least one preceding node is associated with a coded-block-flag indicating that the at least one preceding node does not include residual information and the determining that the size of the node is less than or equal to the predetermined maximum size of a node, automatically determining that the last node is associated with a coded-block-flag indicating that the last node includes residual information. 16. The method of claim 15 , wherein each of the nodes of the plurality of nodes corresponds to a transform unit and a root transform unit of the plurality of nodes corresponds to a coding unit, the transform unit and the coding unit being defined by the High Efficiency Video Coding (HEVC) standard. 17. The method of claim 16 , wherein the determin

Assignees

Inventors

Classifications

  • H04N19/18Primary

    the unit being a set of transform coefficients · CPC title

  • Tree coding, e.g. quad-tree coding · CPC title

  • Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking · CPC title

  • by compressing encoding parameters before transmission · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9749645B2 cover?
Techniques for coding and deriving (e.g., determining) one or more coded-block-flags associated with video content are described herein. A coded-block-flag of a last node may be determined when coded-block-flags of preceding nodes are determined to be a particular value and when a predetermined condition is satisfied. In some instances, the predetermined condition may be satisfied when log 2 (s…
Who is the assignee on this patent?
Li Bin, Xu Jizheng, Microsoft Technology Licensing Llc
What technology area does this patent fall under?
Primary CPC classification H04N19/18. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Aug 29 2017 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).