IP Library Granted Patent US 9,591,320
Granted Patent B2
US 9,591,320 · App. 13/184,226 · Granted Mar 7, 2017

Context and bypass encoding video

Inventors: Madhukar Budagavi (Plano, TX); Mehmet Umut Demircin (Dallas, TX); Vivienne Sze (Dallas, TX)
Assignee: TEXAS INSTRUMENTS INCORPORATED
H04N19/436H04N19/91
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,591,320
App. No.
13/184,226
Granted
Mar 7, 2017
Kind
B2
Abstract

A method and apparatus for encoding and decoding video data. Including context encoding or decoding at least two bins of each significant transform coefficient in an array of transform coefficients and bypass encoding or decoding a sign indicator for each significant transform coefficient in an array related to a block of an image.

Claims (55)

1. A method of encoding video information comprising:

receiving a series of syntax elements comprising an array of transform coefficients related to a block of an image;

determining a context for at least a first bin and a second bin of each significant transform coefficient in the array;

context encoding the at least a first bin and a second bin of each significant transform coefficient in the array;

bypass encoding a Golomb-Rice representation of an additional portion of at least one transform coefficient in the array;

bypass encoding a sign indicator for each significant transform coefficient in the array;

constructing a bit stream comprising:

the context encoded first bins of each significant transform coefficient in the block;

the context encoded second bins of each significant transform coefficient in the block immediately following the context encoded first bins of each significant transform coefficient in the block;

the bypass encoded sign indicators for each significant transform coefficient in the array grouped together in the bit stream and after the first bin and second bin; and

the bypass encoded Golomb-Rice representations of the at least a most significant portion of at least one transform coefficient in the array, all Golomb-Rice representations for the array grouped together in the bit stream and after the first bin and second bin; and

transmitting the bit stream.

2. The method of claim 1 , comprising:

encoding header information into the bit steam before the context encoded first bin in the bit steam.

3. The method of claim 1 , comprising:

encoding a significance map into a header portion of the bit stream located before the context encoded first bin in the bit steam.

4. The method of claim 1 , comprising:

encoding motion vector information into a header portion of the bit stream located before the context encoded first bin in the bit steam.

5. The method of claim 1 , comprising:

encoding prediction information into a header portion of the bit stream located before the context encoded first bin in the bit steam.

6. The method of claim 1 , bypass encoding a Golomb-Rice representation of an additional portion of at least one transform coefficient in the array only performed for transform coefficients that are not completely magnitude encoded by context encoding.

7. The method of claim 1 , the bypass encoded sign indicators for each significant transform coefficient in the array grouped together in the bit stream after all of the bypass encoded Golomb-Rice representations of transform coefficients in the array.

8. An encoder comprising:

a binarizer operable to binarize syntax elements;

a context modeler operable to determine a context for a portion of the binarized syntax elements, including at least a first bin and a second bin of each significant transform coefficient in an array of transform coefficients related to a block of an image;

a binary arithmetic coder comprising:

a context coding engine operable to context encode the at least a first bin and a second bin of each significant transform coefficient in the array; and

a bypass coding engine operable to:

bypass encode a Golomb-Rice representation of an additional portion of at least one transform coefficient in the array; and

bypass encode a sign indicator for each significant transform coefficient in the array;

the binary arithmetic coder operable to group coded elements to form a bit stream having:

a group of context encoded first bins of each significant transform coefficient in the block;

a group of context encoded second bins of each significant transform coefficient in the block immediately following the group of context encoded first bins of each significant transform coefficient in the block;

a group of bypass encoded sign indicators for each significant transform coefficient in the array in the bit stream and after the group of context encoded first bins and the group of context encoded second bins; and

a group of bypass encoded Golomb-Rice representations of the at least a most significant portion of at least one transform coefficient in the array in the bit stream and after the group of context encoded first bins and the group of context encoded second bins.

9. The encoded of claim 8 , the binary arithmetic coder further operable to encode header information into the bit steam before the context encoded first bin in the bit steam.

10. The encoded of claim 8 the binary arithmetic coder further operable to encode a significance map into a header portion of the bit stream located before the context encoded first bin in the bit steam.

11. The encoded of claim 8 the binary arithmetic coder further operable to encode a significance map into a header portion of the bit stream only when at least one transform coefficient in the array is non-zero.

12. The encoded of claim 8 the binary arithmetic coder further operable to encode motion vector information into a header portion of the bit stream located before the context encoded first bin in the bit steam.

13. The encoded of claim 8 the binary arithmetic coder further operable to encode prediction information into a header portion of the bit stream located before the context encoded first bin in the bit steam.

14. The encoded of claim 8 the bypass coding engine operable to bypass encode a Golomb-Rice representation of an additional portion of at least one transform coefficient in the array only for transform coefficients that are not completely magnitude encoded by context encoding.

15. The encoded of claim 8 the binary arithmetic coder operable to group encoded sign indicators for each significant transform coefficient in the array together in the bit stream after all of the bypass encoded Golomb-Rice representations of transform coefficients in the array.

16. A method of encoding video information comprising:

receiving a series of syntax elements comprising an array of transform coefficients related to a block of an image;

determining a context for at least a first bin and a second bin of each significant transform coefficient in the array;

context encoding the at least a first bin and a second bin of each significant transform coefficient in the array;

bypass encoding a Golomb-Rice representation of an additional portion of any transform coefficients that are not completely magnitude encoded by the context encoding;

bypass encoding a sign indicator for each significant transform coefficient in the array;

constructing a bit stream comprising:

a header portion comprising a significance map, motion vector information, and prediction information

the context encoded first bins of each significant transform coefficient in the block following the header portion;

the context encoded second bins of each significant transform coefficient in the block immediately following the context encoded first bins of each significant transform coefficient in the block;

the bypass encoded sign indicators for each significant transform coefficient in the array grouped together in the bit stream and after the first bin and second bin; and

the bypass encoded Golomb-Rice representations of the at least a most significant portion of at least one transform coefficient in the array, all Golomb-Rice representations for the array grouped together in the bit stream and after the first bin and second bin; and

transmitting the bit stream.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 18, 2011
From: BUDAGAVI, MADHUKAR; DEMIRCIN, MEHMET UMUT; SZE, VIVIENNE
To: TEXAS INSTRUMENTS INCORPORATED
Reel/Frame 027079/0204 →
Continuity (3)
Provisional Application 61364593 · Jul 15, 2010
Provisional Application 61499852 · Jun 22, 2011
Related Publication 20120014454A1 · Jan 19, 2012