Image data encoding/decoding method and apparatus
US-2024276101-A1 · Aug 15, 2024 · US
US9414063B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9414063-B2 |
| Application number | US-201113809375-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 8, 2011 |
| Priority date | Jul 9, 2010 |
| Publication date | Aug 9, 2016 |
| Grant date | Aug 9, 2016 |
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.
A method and apparatus for entropy coding and decoding a transformation block are provided. The method of entropy coding a transformation block includes: determining, according to a certain scan order, a location of a last significant transformation coefficient having a non-zero value from among transformation coefficients included in a transformation block having a certain size; and coding information about the determined location of the last significant transformation coefficient by using a horizontal axis direction location of the last significant transformation coefficient and a vertical axis direction location in the transformation block of the last significant transformation coefficient.
Opening claim text (preview).
The invention claimed is: 1. A method of video decoding, performed by at least one processor, the method comprising: obtaining, from a bitstream, an x index indicating an x coordinate of a last significant coefficient, from among transformation coefficients of a transformation block, and a y index indicating a y coordinate of the last significant coefficient; determining a scan index of the last significant coefficient based on the x index and the y index; obtaining, from the bitstream, level information of the last significant coefficient; reconstructing the last significant coefficient using the level information of the last significant coefficient; obtaining, from the bitstream, a significant coefficient flag and level information of a first transformation coefficient which has a smaller scan index than the scan index of the last significant coefficient among the transformation coefficients; reconstructing the first transformation coefficient by using the significant coefficient flag and the level information of the first transformation coefficient; and performing inverse transformation on the transformation block using transformation coefficients including the last significant coefficient and the first transformation coefficient, wherein the significant coefficient flag indicates whether a level of the first transformation coefficient is zero or non-zero, and wherein the level information of the first transformation coefficient indicates the level of the first transformation coefficient is greater than 1, when the significant coefficient flag indicates the level of the first transformation coefficient is non-zero. 2. The method of claim 1 , wherein the x index indicates an x-th location in a horizontal axis direction from a location of an upper-leftmost coefficient of the transformation block, wherein the y index indicates a y-th location in a vertical axis direction, from the upper-leftmost coefficient of the transformation block, and wherein the x-th location and the y-th location are integers equal to or greater than 0. 3. The method of claim 1 , wherein a significant coefficient is a non-zero coefficient among the coefficients of the transformation block, the last significant coefficient is a significant coefficient scanned last in a scanning order, from among the significant coefficients of the transformation block, and an origin of the x coordinate and the y coordinate of the last significant coefficient is an upper-leftmost point of the transformation block.
Scanning of coding units, e.g. zig-zag scan of transform coefficients or flexible macroblock ordering [FMO] · CPC title
using transform coding · CPC title
Entropy coding, e.g. variable length coding [VLC] or arithmetic coding · CPC title
in combination with predictive coding · CPC title
Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC] · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.