IP Library › Granted Patent US 12,713,061
Granted Patent B2
US 12,713,061 · App. 18/953,585 · Granted Aug 18, 2026

Method of coding and decoding images, coding and decoding device and computer programs corresponding thereto

Inventors: Felix Henry (Saint Gregoire, FR); Stephane Pateux (Rennes, FR)
Assignee: Dolby International AB
H04N19/593H04N19/13H04N19/174H04N19/184H04N19/25H04N19/436H04N19/50H04N19/51H04N19/61H04N19/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 12,713,061
App. No.
18/953,585
Granted
Aug 18, 2026
Kind
B2
Abstract

A method of coding at least one image comprising the steps of splitting the image into a plurality of blocks, of grouping said blocks into a predetermined number of subsets of blocks, of coding each of said subsets of blocks in parallel, the blocks of a subset considered being coded according to a predetermined sequential order of traversal. The coding step comprises, for a current block of a subset considered, the sub-step of predictive coding of said current block with respect to at least one previously coded and decoded block, and the sub-step of entropy coding of said current block on the basis of at least one probability of appearance of a symbol.

Claims (46)

1 . An apparatus for decoding an image, the apparatus comprising:

one or more processors that, upon execution of instructions stored in computer-readable media, are configured to perform operations comprising:

receiving a stream representative of at least one coded image;

identifying, from the stream, a plurality of groups of blocks;

processing a first block in a particular group of blocks of the plurality of groups of blocks, wherein processing the first block comprises:

determining that the first block is first in an order of blocks in the particular group of blocks;

in response to determining that the first block is first in the order of blocks in the particular group of blocks, retrieving a first set of probabilities of occurrence of symbols associated with a block that is second in the order of blocks belonging to another group of blocks that is different from the particular group of blocks in the plurality of groups of blocks;

entropy decoding the first block based on the first set of probabilities to obtain a quantized residual block;

generating a prediction of the first block based on at least one previously decoded block;

dequantizing the quantized residual block to obtain a dequantized block;

inverse transforming the dequantized block to obtain a decoded residual block; and

adding the decoded residual block to the prediction of the first block to obtain a decoded block; and

processing a second block in the particular group of blocks, wherein processing the second block comprises:

determining that the second block is not first in the order of blocks in the particular group of blocks;

in response to determining that the second block is not first in the order of blocks in the particular group of blocks, retrieving a second set of probabilities of occurrence of symbols associated with at least one other already decoded block belonging to the particular group of blocks in the plurality of groups of blocks, wherein the second set of probabilities of occurrence of symbols are not associated with blocks that do not belong to the particular group of blocks, and

entropy decoding the second block based on the second set of probabilities to obtain a quantized residual block;

generating a prediction of the second block based on at least one previously decoded block;

dequantizing the quantized residual block to obtain a dequantized block;

inverse transforming the dequantized block to obtain a decoded residual block; and

adding the decoded residual block to the prediction of the second block to obtain a decoded block.

2 . An apparatus for coding at least one image, the apparatus comprising:

one or more processors that, upon execution of instructions stored in computer-readable media, are configured to perform operations comprising:

generating a prediction of a block of an image;

subtracting the prediction from the block of the image to obtain a residual block;

transforming the residual block to obtain a transformed block;

quantizing the transformed block to obtain a block of quantized coefficients; and

entropy coding the block of quantized coefficients, wherein entropy coding the block of quantized coefficients comprises:

determining whether the block of quantized coefficients is first in an order of blocks in a particular group of blocks;

conditioned on determining that the block of quantized coefficients is first in the order of blocks in the particular group of blocks, retrieving a first set of probabilities of occurrence of symbols associated with a second block that is second in the order of blocks belonging to another group of blocks that is different from the particular group of blocks in a plurality of groups of blocks;

entropy coding the block of quantized coefficients based on the first set of probabilities; and

conditioned on determining that the block of quantized coefficients is not first in the order of blocks in the particular group of blocks, retrieving a second set of probabilities of occurrence of symbols associated with at least one other already coded block belonging to the particular group of blocks in the plurality of groups of blocks,

wherein the second set of probabilities of occurrence of symbols are not associated with blocks that do not belong to the particular group of blocks, and

wherein entropy coding the second block is based on the second set of probabilities.

3 . A method of transmitting a bitstream which is encoded by an encoding method, the encoding method comprising:

generating a prediction of a block of an image;

subtracting the prediction from the block of the image to obtain a residual block;

transforming the residual block to obtain a transformed block;

quantizing the transformed block to obtain a block of quantized coefficients; and

entropy coding the block of quantized coefficients, wherein entropy coding the block of quantized coefficients comprises:

determining whether the block of quantized coefficients is first in an order of blocks in a particular group of blocks;

conditioned on determining that the block of quantized coefficients is first in the order of blocks in the particular group of blocks, retrieving a first set of probabilities of occurrence of symbols associated with a second block that is second in the order of blocks belonging to another group of blocks that is different from the particular group of blocks in a plurality of groups of blocks;

entropy coding the block of quantized coefficients based on the first set of probabilities;

conditioned on determining that the block of quantized coefficients is not first in the order of blocks in the particular group of blocks, retrieving a second set of probabilities of occurrence of symbols associated with at least one other already coded block belonging to the particular group of blocks in the plurality of groups of blocks,

wherein the second set of probabilities of occurrence of symbols are not associated with blocks that do not belong to the particular group of blocks, and

wherein entropy coding the second block is based on the second set of probabilities; and

transmitting the bitstream generated based at least in part on the entropy coded block of quantized coefficients.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 19, 2025
From: HENRY, FELIX; PATEUX, STEPHANE
To: DOLBY INTERNATIONAL AB
Reel/Frame 071159/0460 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 21, 2025
From: HENRY, FELIX; PATEUX, STEPHANE
To: ORANGE
Reel/Frame 070298/0110 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 21, 2025
From: ORANGE SA
To: DOLBY INTERNATIONAL AB
Reel/Frame 070298/0134 →
Priority Claims (1)
FR 1151849 · Mar 7, 2011 · national
Continuity (9)
Continuation 18219036 · Jul 6, 2023
Continuation 17750735 · May 23, 2022
Continuation 16895192 · Jun 8, 2020
Continuation 16418343 · May 21, 2019
Continuation 15419870 · Jan 30, 2017
Continuation 15003148 · Jan 21, 2016
Continuation 14492546 · Sep 22, 2014
Continuation 14003014 · Feb 23, 2012
Related Publication 20250150620A1 · May 8, 2025
References Cited (240)
US 6480537B1 · Agarwal et al. · 2002 [cited by applicant]
US 6900748B2 · Marpe et al. · 2005 [cited by applicant]
US 7221483B2 · Yagishita et al. · 2007 [cited by applicant]
US 7463781B2 · Pearson et al. · 2008 [cited by applicant]
US 8319672B2 · Kim et al. · 2012 [cited by applicant]
US 8520740B2 · Flachs et al. · 2013 [cited by applicant]
US 8824813B2 · Sasaki · 2014 [cited by applicant]
US 8953692B2 · Tanaka et al. · 2015 [cited by applicant]
US 9042457B2 · Hayashi · 2015 [cited by applicant]
US 9271012B2 · Henry et al. · 2016 [cited by applicant]
US 9319692B2 · Henry et al. · 2016 [cited by applicant]
US 9319693B2 · Henry et al. · 2016 [cited by applicant]
US 9319694B2 · Henry et al. · 2016 [cited by applicant]
US 9338469B2 · Amon · 2016 [cited by applicant]
US 9380308B2 · Henry et al. · 2016 [cited by applicant]
US 9560380B2 · Henry et al. · 2017 [cited by applicant]
US 9628818B2 · Henry et al. · 2017 [cited by applicant]
US 9648325B2 · Baeza · 2017 [cited by applicant]
US 9654783B2 · Henry et al. · 2017 [cited by applicant]
US 9661335B2 · Henry et al. · 2017 [cited by applicant]
US 9848196B2 · Henry et al. · 2017 [cited by applicant]
US 10033999B2 · Henry et al. · 2018 [cited by applicant]
US 10362311B2 · Henry et al. · 2019 [cited by applicant]
US 10382784B2 · Henry et al. · 2019 [cited by applicant]
US 10659776B2 · Marpe et al. · 2020 [cited by applicant]
US 10681376B2 · Henry et al. · 2020 [cited by applicant]
US 10694186B2 · Henry et al. · 2020 [cited by applicant]
US 11343535B2 · Henry et al. · 2022 [cited by applicant]
US 11736723B2 · Henry et al. · 2023 [cited by applicant]
US 20020021234A1 · Yanagiya et al. · 2002 [cited by applicant]
US 20030081850A1 · Karczewicz · 2003 [cited by examiner]
US 20040066852A1 · MacInnis · 2004 [cited by applicant]
US 20040179601A1 · Kobayashi et al. · 2004 [cited by applicant]
US 20050008079A1 · Boon et al. · 2005 [cited by applicant]
US 20050012648A1 · Marpe et al. · 2005 [cited by applicant]
US 20050038837A1 · Marpe et al. · 2005 [cited by applicant]
US 20050123207A1 · Marpe · 2005 [cited by applicant]
US 20050232505A1 · Pearson et al. · 2005 [cited by applicant]
US 20060008079A1 · Daemen et al. · 2006 [cited by applicant]
US 20060092271A1 · Banno et al. · 2006 [cited by applicant]
US 20060233239A1 · Sethi et al. · 2006 [cited by applicant]
US 20070201559A1 · He · 2007 [cited by applicant]
US 20070280345A1 · Tu et al. · 2007 [cited by applicant]
US 20080056347A1 · Chiu et al. · 2008 [cited by applicant]
US 20080219349A1 · Huang et al. · 2008 [cited by applicant]
US 20080240242A1 · Lainema et al. · 2008 [cited by applicant]
US 20080246637A1 · Chen et al. · 2008 [cited by applicant]
US 20080279182A1 · Hafeez et al. · 2008 [cited by applicant]
US 20080310504A1 · Ye et al. · 2008 [cited by applicant]
US 20090135886A1 · Robertson et al. · 2009 [cited by applicant]
US 20090168868A1 · Jahanghir · 2009 [cited by applicant]
US 20090175331A1 · Kobayashi et al. · 2009 [cited by applicant]
US 20090180536A1 · Shimofure · 2009 [cited by applicant]
US 20090201949A1 · Sunahara · 2009 [cited by applicant]
US 20090225234A1 · Ward et al. · 2009 [cited by applicant]
US 20090245349A1 · Zhao · 2009 [cited by examiner]
US 20090245392A1 · Leung et al. · 2009 [cited by applicant]
US 20090279613A1 · Suzymura · 2009 [cited by applicant]
US 20100052956A1 · Choo et al. · 2010 [cited by applicant]
US 20100098155A1 · Demircin et al. · 2010 [cited by applicant]
US 20100135416A1 · Huang · 2010 [cited by examiner]
US 20100215030A1 · Agrawal et al. · 2010 [cited by applicant]
US 20100238998A1 · Nanbu et al. · 2010 [cited by applicant]
US 20100322317A1 · Yoshimatsu et al. · 2010 [cited by applicant]
US 20100328503A1 · Shintani et al. · 2010 [cited by applicant]
US 20110069899A1 · Reese · 2011 [cited by applicant]
US 20110243226A1 · Choi et al. · 2011 [cited by applicant]
US 20110317769A1 · Tanaka et al. · 2011 [cited by applicant]
US 20120014429A1 · Zhao et al. · 2012 [cited by applicant]
US 20120014433A1 · Karczewicz et al. · 2012 [cited by applicant]
US 20120039393A1 · Borg et al. · 2012 [cited by applicant]
US 20120081241A1 · Misra et al. · 2012 [cited by applicant]
US 20120082215A1 · Sze et al. · 2012 [cited by applicant]
US 20120086587A1 · Sze et al. · 2012 [cited by applicant]
US 20120163448A1 · Zheng et al. · 2012 [cited by applicant]
US 20120163452A1 · Horowitz et al. · 2012 [cited by applicant]
US 20120183074A1 · Fuldseth · 2012 [cited by applicant]
US 20120207213A1 · Amon · 2012 [cited by applicant]
US 20120219066A1 · Amonou et al. · 2012 [cited by applicant]
US 20120263232A1 · Pateux et al. · 2012 [cited by applicant]
US 20120293343A1 · Lee et al. · 2012 [cited by applicant]
US 20120314944A1 · Ninan et al. · 2012 [cited by applicant]
US 20130016771A1 · Misra · 2013 [cited by applicant]
US 20130021350A1 · Schmit et al. · 2013 [cited by applicant]
US 20130114000A1 · Atkins · 2013 [cited by applicant]
US 20130187798A1 · Marpe et al. · 2013 [cited by applicant]
US 20130279606A1 · Vanam et al. · 2013 [cited by applicant]
US 20140010312A1 · Song · 2014 [cited by applicant]
US 20140016700A1 · Henry et al. · 2014 [cited by applicant]
US 20140105293A1 · George et al. · 2014 [cited by applicant]
US 20140254665A1 · Henry et al. · 2014 [cited by applicant]
US 20140334557A1 · Schierl et al. · 2014 [cited by applicant]
US 20140355690A1 · Choi et al. · 2014 [cited by applicant]
US 20150010088A1 · Henry et al. · 2015 [cited by applicant]
US 20150016524A1 · Henry et al. · 2015 [cited by applicant]
US 20150195537A1 · Henry et al. · 2015 [cited by applicant]
US 20150195538A1 · Henry et al. · 2015 [cited by applicant]
US 20160142720A1 · Henry et al. · 2016 [cited by applicant]
US 20160142733A1 · Henry et al. · 2016 [cited by applicant]
US 20160150250A1 · Henry et al. · 2016 [cited by applicant]
US 20160234512A1 · Henry et al. · 2016 [cited by applicant]
US 20170142441A1 · Henry et al. · 2017 [cited by applicant]
US 20170223353A1 · Henry et al. · 2017 [cited by applicant]
US 20180302632A1 · Henry et al. · 2018 [cited by applicant]
US 20190273947A1 · Henry et al. · 2019 [cited by applicant]
US 20190297323A1 · Henry et al. · 2019 [cited by applicant]
US 20200322609A1 · Henry et al. · 2020 [cited by applicant]
US 20210021867A1 · Henry et al. · 2021 [cited by applicant]
US 20220360817A1 · Henry et al. · 2022 [cited by applicant]
US 20230353740A1 · Henry et al. · 2023 [cited by applicant]
US 20230353781A1 · Henry et al. · 2023 [cited by applicant]
CN 1299560A · 2001 [cited by applicant]
CN 1489391 · 2004 [cited by applicant]
CN 1527610 · 2004 [cited by applicant]
CN 1547854 · 2004 [cited by applicant]
CN 1703089 · 2005 [cited by applicant]
CN 1717050 · 2006 [cited by applicant]
CN 1926769 · 2007 [cited by applicant]
CN 101068359 · 2007 [cited by applicant]
CN 101198051 · 2008 [cited by applicant]
CN 101411197 · 2009 [cited by applicant]
CN 101490968 · 2009 [cited by applicant]
CN 101491097 · 2009 [cited by applicant]
CN 101543071 · 2009 [cited by applicant]
CN 101653003 · 2010 [cited by applicant]
CN 101682771 · 2010 [cited by applicant]
CN 101836454 · 2010 [cited by applicant]
CN 101841700 · 2010 [cited by applicant]
CN 101977327 · 2011 [cited by applicant]
CN 101981934 · 2011 [cited by applicant]
JP H0723397 · 1995 [cited by applicant]
JP H08116534 · 1996 [cited by applicant]
JP 2005033336 · 2005 [cited by applicant]
JP 2005223533 · 2005 [cited by applicant]
JP 2006101406 · 2006 [cited by applicant]
JP 2006141037 · 2006 [cited by applicant]
JP 2006279574 · 2006 [cited by applicant]
JP 2007020002 · 2007 [cited by applicant]
JP 2007504757 · 2007 [cited by applicant]
JP 2007142637 · 2007 [cited by applicant]
JP 2007166192 · 2007 [cited by applicant]
JP 2007520912 · 2007 [cited by applicant]
JP 2007300455 · 2007 [cited by applicant]
JP 2008011204 · 2008 [cited by applicant]
JP 2008067026 · 2008 [cited by applicant]
JP 2008537373 · 2008 [cited by applicant]
JP 2009111605 · 2009 [cited by applicant]
JP 2010050911 · 2010 [cited by applicant]
JP 2010278519 · 2010 [cited by applicant]
JP 2011066677 · 2011 [cited by applicant]
JP 2014525187 · 2014 [cited by applicant]
JP 2015516747 · 2015 [cited by applicant]
JP 2016197823 · 2016 [cited by applicant]
KR 1020140131926 · 2014 [cited by applicant]
KR 101705940 · 2017 [cited by applicant]
KR 102027741 · 2019 [cited by applicant]
KR 102081922 · 2020 [cited by applicant]
KR 102240333 · 2021 [cited by applicant]
RU 2330325 · 2008 [cited by applicant]
RU 2371881 · 2009 [cited by applicant]
TW 200822760 · 2008 [cited by applicant]
WO WO2008036237 · 2008 [cited by applicant]
WO WO2009119888 · 2009 [cited by applicant]
WO WO2010063184 · 2010 [cited by applicant]
WO WO2010146782 · 2010 [cited by applicant]
WO WO2011042645 · 2011 [cited by applicant]
WO WO2011045339 · 2011 [cited by applicant]
WO WO2011046339 · 2011 [cited by applicant]
WO WO2011052142 · 2011 [cited by applicant]
WO WO2011004577 · 2012 [cited by applicant]
WO WO2012175870 · 2012 [cited by applicant]
WO WO2013153226 · 2013 [cited by applicant]
WO WO2013010997 · 2016 [cited by applicant]
Huang et al. “Ordered Entropy Slices for Parallel CODEC”, Jul. 5, 2009 (Jul. 5, 2009), Video Coding Experts Group of ITU-T SG.16, 38th VCEG Meeting; Jul. 2009. [cited by examiner]
Bossen, “Common Test Conditions and Software Reference Configurations,” 5th JCT-VC Meeting, Geneva, Mar. 2011 (JCTVC-E700), 11 pages. [cited by applicant]
Clare et al., “Wavefront and Cabac Flush: Different Degrees of Parallelism Without Transcoding,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 6th Meeting: Torino, IT, Ju… [cited by applicant]
Clare et al., “Wavefront Parallel Processing for HEVC Encoding and Decoding,” JCT-VC Meeting, 97, MPEG Meeting, Jul. 14, 2011-Jul. 22, 2011; Torino; (Joint Collaborative Team on Video Coding of ISO/IEC JTC1/SC29/WG11 an… [cited by applicant]
EP Extended European Search Report in European Application No. 20155879.8, dated Jul. 28, 2020, 13 pages. [cited by applicant]
EP Extended European Search Report in European Application No. 20175631.9, dated Jul. 10, 2020, 20 pages (with Machine Translation). [cited by applicant]
Fuldseth et al., “Tiles,” 5th JCT-VC Meeting, Geneva, Mar. 2011 (JCTVC-E408), 14 pages. [cited by applicant]
Henry and Pateux, “Wavefront Parallel Processing,” 5th JCT-VC Meeting, Geneva, Mar. 2011 (JCTVC-E196), 9 pages. [cited by applicant]
Hirashima et al., “The Effect of FMO for a QoE-based Video Output Scheme on QoE in Audio-Video IP Transmission,” EICE Tech. Rep., Jul. 2009, vol. 109, No. 121, pp. 7-12 (English Abstract only). [cited by applicant]
Huang et al., “Ordered Entropy Slices for Parallel CODEC,” 38. VCEG Meeting; 89. MPEG Meeting; Jul. 1-8, 2009; London, UK & Geneva, CH; (Video Coding Experts Group of ITU-T SG. 16), No. VCEG-AL25, Jul. 5, 2009 (Jul. 5, … [cited by applicant]
Huang et al., “Ordered Entropy Slices for Parallel Codec,” ITU-T SG 16 Q.6 Video Coding Experts Group 38th Meeting. VCEG-AL25 rev. 1, Jul. 5, 2009, pp. 1-10. [cited by applicant]
International Preliminary Report on Patentability issued in PCT/FR2012/051391, on Dec. 23, 2013, 7 pages (in French). [cited by applicant]
International Preliminary Report on Patentability issued in PCT/FR2012/050380 on Sep. 13, 2013, 6 pages (in French). [cited by applicant]
International Search Report and Written Opinion dated Aug. 1, 2012 for corresponding International Application No. PCT/FR2012/051391, filed Jun. 20, 2012. [cited by applicant]
International Search Report issued in PCT/FR2012/050380 on May 8, 2012, with English translation, 7 pages. [cited by applicant]
International Search Report issued in PCT/FR2012/051391, on Aug. 9, 2012, with English translation, 7 pages. [cited by applicant]
International Search Report issued in PCT/JP2009/056778, 4 pages. [cited by applicant]
ISO/IEC JTC1/SC29 WG1, JPEG 2000, “Coding of Still Pictures: JPEG 2000 Part 1 020719 (Final Publication Draft),” Project 1.29.15444 (JPEG 2000), ITU-T Rec. T.800 (2002), N2678, Jul. 19, 2002, 245 pages. [cited by applicant]
JP Decision on Opposition in JP Appln. No. 2018-145539, dated Jul. 1, 2022, 139 pages (with Machine Translation). [cited by applicant]
JP Opposition in JP Appln. No. 2018-145539, dated Nov. 19, 2021, 160 pages (with Machine Translation). [cited by applicant]
Kato et al., “VLSI Architecture of Multi-Symbol CABAC Decoder for H.264/AVC High Profile,” IEICE technical report, vol. 107, No. 289, The Institute of Electronics, Information and Communication Engineers, Oct. 18, 2007,… [cited by applicant]
Lee, et al., “High-Efficiency Video Compression Framework Based on Flexible Unit Representation,” Proceedings of the second APSIPA Annual Summit and Conference, Dec. 17, 2010, pp. 6523-6631. [cited by applicant]
Li, “Image Compression—The Mechanics of the JPEG 2000,” retrieved from URL<http://research.microsoft.com/en-us/um/people/jinl/papers_2002/ms . . . , >, 20 pages. [cited by applicant]
Marpe et al., “Context-Based Adaptive Binary Arithmetic Coding in the H.264/AVC Video Compression Standard,” IEEE Transactions on Circuits and Systems for Video Technology, IEEE Service Center, Piscataway, NJ, USA, vol.… [cited by applicant]
Marpe et al., “Improved CABAC,” 15. VCEG Meeting; 58; MPEG Meeting; Dec. 4-6, 2011; Pattaya, Th; (Video Coding Experts Group of ITU-T SG.16), No., VCEG-018, Nov. 28, 2001, pp. 1-6, XP030003351. [cited by applicant]
Marpe et al., “Context-based Adaptive Binary Arithmetic Coding in the H.264/AVC Video Compression Standard,” IEEE Trans. on CSVT, Jul. 2003, vol. 13, No. 7, pp. 620-636. [cited by applicant]
Misra and Segall, “Periodic Initialization for Wavefront Coding Functionality,” 4th JCT-VC Meeting, Daegu, Jan. 2011 (JCTVC-D073), 7 pages. [cited by applicant]
Misra et al., “Entropy Slices for Parallel Entropy Coding,” JCTVC-C256, Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, 3rd Meeting: Guangzhou, CN, Oct. 7-15, 2010, 6 page… [cited by applicant]
Misra et al., “Lightweight slicing for entropy coding,” 4th JCT-VC Meeting, Daegu, Jan. 2011 (JCTVC-D070), 7 pages. [cited by applicant]
Moccagatta, “Arbitrary Slice Order and Flexible Macroblock Order Impact of AVC Compliance and Implementation Complexity,” Joint Video Team (JVT) of ISO/IEC MPEG & ITU-T VCEG (ISO/IEC JTC1/SC29/WG11 and ITU-T SG16 Q.6) 4… [cited by applicant]
NTT DOCOMO, Inc. et al., “Annex a CDCM Video Codec: Decoder Specification,” Joint Collaborative Team on Video Coding (JCT-VG) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11, 1st Meeting: Dresden, DE, Apr. 15-23, 2010, pp.… [cited by applicant]
Okubo et al., “Impress Standard Textbook Series Revised Third Edition H.264, AVC Subject,” Book, 1st Edition, Jan. 1, 2009, Impress R & D Co., Ltd., pp. 153-162, 342-345 (English Abstract only). [cited by applicant]
Okubo, “Impress Standard Textbook Series-3rd Revision of H.264/AVC Textbook,” 1st Edition, Jan. 1, 2009, Impress R&D, Japan, pp. 86-87, (8 pages with Machine Translation). [cited by applicant]
Rissanen et al.“Universal Modeling and Coding”, IEEE Transactions on Information Theory, vol. IT-27, No. 1, Jan. 1981, pp. 12-23. [cited by applicant]
Saito et al., “HD-SDI H.264 Super-Low Delay Encoder/Decoder ‘EHH-1000E/D’ and its application,” Eizo Joho Industrial, No. Feb. 2009 (vol. 41, No. 2), Sangyo Kaihatsukiko Inc., Feb. 1, 2009, pp. 15 to 20, ISSN: 1346-1362. [cited by applicant]
Schwarz et al., “CABAC and Slices” 4. JVT Meeting; Jul. 22-26, 2002; Klagenfurt, Austria; (Joint Video Team of ISO/IEC MPEG & ITO/T VCEG—ISO/IEC JTC1/SC29/WG11 and ITU-T SG. 16 0.6), No. JVT-D020rl Jul. 22, 2002 (Jul. 2… [cited by applicant]
Segall et al., “Video coding technology proposal by Sharp,” JCT-VC Meeting; Apr. 15, 2010-Apr. 23, 2010, Dresden; (Joint Collaborative Team on Video Coding of ISO/IEC JTC1/SC29/WG11 and ITU-TSG.16) No. JCTVC-A105, Apr. … [cited by applicant]
Sekiguchi , “Next Generation Video Coding (HEVC) Standardization Trends,” Journal of the Institute of Image Information and Television Engineers, Mar. 1, 2011, 65th vol. No. 3, 302-308, (with Machine Translation). [cited by applicant]
Sharp, “Entropy slices for parallel entropy decoding,” ITU-T SG16 Meeting, Apr. 22, 2008-Feb. 5, 2008, Geneva, pp. 1-9 (Apr. 14, 2008). [cited by applicant]
Sze and Budagavi, “Analysis of entropy slice approaches,” 4th JCT-VC Meeting, Daegu, Jan. 2011, (JCTVC-D243), 6 pages. [cited by applicant]
Sze et al., “Massively Parallel CABAC,” 38th VCEG Meeting, 89 MPEG Meeting, Jan. 7, 2009-Aug. 7, 2009, London, Geneva (Video Coding Experts Group of ITU-T SG. 16), pp. 1-10 (Jul. 3, 2009). [cited by applicant]
Wiegand et al., “Overview of the H.264/AVC Video Coding Standard,” IEEE Transactions on Circuits and Systems for Video Technology, Jul. 2003, 13(7):560-576. [cited by applicant]
Wikipedia.com [online], “Lempel-Ziv-Welch,” available on or before Aug. 10, 2009, via Internet Archive: Wayback Machine URL<https://web.archive.org/web/20090810074931/https://en.wikipedia.org/wiki/Lempel%E2%80%93Ziv%E2%… [cited by applicant]
Written Opinion issued in PCT/FR2012/051391, on Aug. 9, 2012, with English Translation, 14 pages. [cited by applicant]
Written Opinion of the International Searching Authority issued in PCT/FR2012/050380 on May 8, 2012, with English translation, 11 pages. [cited by applicant]
Zhao et al., “New Results using Entropy Slices for Parallel Decoding”, [online], Jul. 18, 2008, ITU—Telecommunications Standardization Sector Study Group 16 Question 6 Video Coding Experts Group (VCEG), Document: VCEG-A… [cited by applicant]
Zhao et al., “Parallel entropy decoding for high-resolution video coding,” Proc. SPIE 7257, Visual Communications and Image Processing, Jan. 18, 2009, 11 pages. [cited by applicant]
U.S. Appl. No. 14/003,014, filed Sep. 4, 2013, Henry et al. [cited by applicant]
U.S. Appl. No. 14/492,546, filed Sep. 22, 2014, Henry et al. [cited by applicant]
U.S. Appl. No. 15/003,148, filed Jan. 21, 2016, Henry et al. [cited by applicant]
U.S. Appl. No. 15/419,870, filed Jan. 30, 2017, Henry et al. [cited by applicant]
U.S. Appl. No. 16/418,343, filed May 21, 2019, Henry et al. [cited by applicant]
U.S. Appl. No. 16/895,192, filed Jun. 8, 2020, Henry et al. [cited by applicant]
U.S. Appl. No. 17/750,735, filed May 23, 2022, Henry et al. [cited by applicant]
U.S. Appl. No. 18/219,036, filed Jul. 6, 2023, Henry et al. [cited by applicant]
U.S. Appl. No. 14/128,949, filed Apr. 21, 2014, Henry et al. [cited by applicant]
U.S. Appl. No. 14/492,750, filed Sep. 22, 2014, Henry et al. [cited by applicant]
U.S. Appl. No. 14/662,395, filed Mar. 19, 2015, Henry et al. [cited by applicant]
U.S. Appl. No. 14/662,463, filed Mar. 19, 2015, Henry et al. [cited by applicant]
U.S. Appl. No. 15/008,785, filed Jan. 28, 2016, Henry et al. [cited by applicant]
U.S. Appl. No. 15/008,614, filed Jan. 28, 2016, Henry et al. [cited by applicant]
U.S. Appl. No. 15/132,062, filed Apr. 19, 2016, Henry et al. [cited by applicant]
U.S. Appl. No. 15/486,660, filed Apr. 13, 2017, Henry et al. [cited by applicant]
U.S. Appl. No. 16/012,658, filed Jun. 19, 2018, Henry et al. [cited by applicant]
U.S. Appl. No. 16/435,317, filed Jul. 7, 2019, Henry et al. [cited by applicant]
U.S. Appl. No. 16/907,561, filed Jun. 22, 2020, Henry et al. [cited by applicant]
U.S. Appl. No. 18/218,521, filed Jul. 5, 2023, Henry et al. [cited by applicant]