IP Library Granted Patent US 12,732,615
Granted Patent B2
US 12,732,615 · App. 19/010,695 · Granted Sep 8, 2026

Sub-picture based raster scanning coding order

Inventor: Minhua Zhou (San Diego, CA)
Assignee: TEXAS INSTRUMENTS INCORPORATED
H04N19/129H04N19/119H04N19/174H04N19/433H04N19/436
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,732,615
App. No.
19/010,695
Granted
Sep 8, 2026
Kind
B2
Abstract

A method and apparatus for sub-picture based raster scanning coding order. The method includes dividing an image into even sub-pictures, and encoding parallel sub-pictures on multi-cores in raster scanning order within sub-pictures, wherein from core to core, coding of the sub-picture is independent around sub-picture boundaries, and wherein within a core, coding of a sub-picture is at least one of dependent or independent around sub-picture boundaries.

Claims (63)

1 . A system comprising:

a receiver configured to receive a bit stream including a coded representation of a picture,

wherein the picture includes a first sub-picture including a first set of non-overlapping regions,

wherein the picture includes a second sub-picture including a second set of non-overlapping regions,

wherein the first sub-picture is a left adjacent neighbor of the second sub-picture, and

wherein data for the first set of non-overlapping regions in the bit stream immediately precedes data for the second set of non-overlapping regions in the bit stream; and

one or more processors coupled to the receiver and configured to:

decode the data for the first set of non-overlapping regions from the bit stream; and

decode the data for the second set of non-overlapping regions from the bit stream.

2 . The system of claim 1 ,

wherein the first sub-picture is rectangular, and

wherein the second sub-picture is rectangular.

3 . The system of claim 1 , wherein the one or more processors are configured to decode the data for the second set of non-overlapping regions from the bit stream after decoding data for all non-overlapping regions in the first set of the non-overlapping regions.

4 . The system of claim 1 , wherein the one or more processors include:

a first processing core configured to decode the data for the first set of non-overlapping regions; and

a second processing core configured to decode the data for the second set of non-overlapping regions.

5 . The system of claim 1 ,

wherein the first sub-picture comprises a first tile in the picture, and

wherein the second sub-picture comprises a second tile in the picture.

6 . The system of claim 1 , wherein the first sub-picture and the second sub-picture are signaled sequentially in the bit stream.

7 . The system of claim 1 , wherein coding of the first sub-picture and coding of the second sub-picture are independent around sub-picture boundaries.

8 . The system of claim 1 ,

wherein the data for the first set of non-overlapping regions is present in the bit stream in a sub-picture-based raster scan order, and

wherein the data for the second set of non-overlapping regions is present in the bit stream in a sub-picture-based raster scan order.

9 . The system of claim 1 ,

wherein the picture includes a third sub-picture including a third set of non-overlapping regions,

wherein the second sub-picture is a left adjacent neighbor of the third sub-picture, and

wherein data for the second set of non-overlapping regions in the bit stream immediately precedes data for the third set of non-overlapping regions in the bit stream.

10 . The system of claim 9 , wherein the one or more processors are configured to decode the data for the third set of non-overlapping regions from the bit stream after decoding data for all non-overlapping regions in the second set of the non-overlapping regions.

11 . The system of claim 9 , wherein the first sub-picture, the second sub-picture, and the third sub-picture are signaled sequentially in the bit stream.

12 . A system comprising:

a memory configured to store uncompressed data for a picture,

wherein the picture includes a first sub-picture including a first set of non-overlapping regions,

wherein the picture includes a second sub-picture including a second set of non-overlapping regions, and

wherein the first sub-picture is a left adjacent neighbor of the second sub-picture; and

one or more processors coupled to the memory and configured to:

encode data for the first set of non-overlapping regions in a bit stream; and

encode data for the second set of non-overlapping regions in the bit stream,

wherein the data for the first set of non-overlapping regions in the bit stream immediately precedes the data for the second set of non-overlapping regions in the bit stream.

13 . The system of claim 12 , wherein the one or more processors include:

a first processing core configured to encode the data for the first set of non-overlapping regions into the bit stream; and

a second processing core configured to encode the data for the second set of non-overlapping regions into the bit stream.

14 . The system of claim 12 ,

wherein the picture includes a third sub-picture including a third set of non-overlapping regions,

wherein the second sub-picture is a left adjacent neighbor of the third sub-picture,

wherein the one or more processors are configured to encode data for the third set of non-overlapping regions in the bit stream, and

wherein the data for the second set of non-overlapping regions in the bit stream immediately precedes the data for the third set of non-overlapping regions in the bit stream.

15 . The system of claim 14 , wherein the one or more processors are configured to signal the first sub-picture, the second sub-picture, and the third sub-picture sequentially in the bit stream.

16 . A method comprising:

receiving a bit stream including a coded representation of a picture,

wherein the picture includes a first sub-picture including a first set of non-overlapping regions,

wherein the picture includes a second sub-picture including a second set of non-overlapping regions,

wherein the first sub-picture is a left adjacent neighbor of the second sub-picture, and

wherein data for the first set of non-overlapping regions in the bit stream immediately precedes data for the second set of non-overlapping regions in the bit stream;

decoding the data for the first set of non-overlapping regions from the bit stream; and

decoding the data for the second set of non-overlapping regions from the bit stream.

17 . The method of claim 16 , wherein decoding the data for the second set of non-overlapping regions from the bit stream occurs after decoding data for all non-overlapping regions in the first set of the non-overlapping regions.

18 . The method of claim 16 , wherein the first sub-picture and the second sub-picture are signaled sequentially in the bit stream.

19 . The method of claim 16 ,

wherein the picture includes a third sub-picture including a third set of non-overlapping regions,

wherein the second sub-picture is a left adjacent neighbor of the third sub-picture, and

wherein data for the second set of non-overlapping regions in the bit stream immediately precedes data for the third set of non-overlapping regions in the bit stream.

20 . The method of claim 19 , wherein the first sub-picture, the second sub-picture, and the third sub-picture are signaled sequentially in the bit stream.

Continuity (9)
Continuation 18382132 · Oct 20, 2023
Continuation 17713631 · Apr 5, 2022
Continuation 16799115 · Feb 24, 2020
Continuation 16167134 · Oct 22, 2018
Continuation 14664992 · Mar 23, 2015
Continuation 13179174 · Jul 8, 2011
Provisional Application 61485200 · May 12, 2011
Provisional Application 61362468 · Jul 8, 2010
Related Publication 20250142072A1 · May 1, 2025
References Cited (43)
US 7719540B2 · Piazza et al. · 2010 [cited by applicant]
US 7822119B2 · Boon · 2010 [cited by examiner]
US 7830959B2 · Park · 2010 [cited by examiner]
US 8014451B2 · Suh · 2011 [cited by examiner]
US 8988531B2 · Zhou · 2015 [cited by examiner]
US 10110901B2 · Zhou · 2018 [cited by applicant]
US 10574992B2 · Zhou · 2020 [cited by applicant]
US 10623741B2 · Zhou · 2020 [cited by applicant]
US 10939113B2 · Zhou · 2021 [cited by applicant]
US 20030123557A1 · De With · 2003 [cited by examiner]
US 20030159139A1 · Candelore · 2003 [cited by examiner]
US 20040003178A1 · Magoshi · 2004 [cited by examiner]
US 20040010614A1 · Mukherjee · 2004 [cited by examiner]
US 20040022543A1 · Hosking · 2004 [cited by examiner]
US 20040028141A1 · Hsiun · 2004 [cited by examiner]
US 20040196905A1 · Yamane · 2004 [cited by examiner]
US 20040240556A1 · Winger · 2004 [cited by examiner]
US 20050219253A1 · Piazza · 2005 [cited by examiner]
US 20070230586A1 · Shen · 2007 [cited by examiner]
US 20080031329A1 · Iwata · 2008 [cited by examiner]
US 20080094419A1 · Leigh · 2008 [cited by examiner]
US 20080123750A1 · Bronstein · 2008 [cited by examiner]
US 20090094658A1 · Kobayashi · 2009 [cited by examiner]
US 20090110077A1 · Amano · 2009 [cited by examiner]
US 20090146853A1 · Lu · 2009 [cited by examiner]
US 20090245664A1 · Matsumoto · 2009 [cited by examiner]
US 20100091836A1 · Jia · 2010 [cited by examiner]
US 20100091880A1 · Jia · 2010 [cited by examiner]
US 20100097250A1 · Demircin et al. · 2010 [cited by applicant]
US 20100098155A1 · Demircin · 2010 [cited by examiner]
US 20100118945A1 · Wada · 2010 [cited by examiner]
US 20100128797A1 · Dey · 2010 [cited by examiner]
US 20100195922A1 · Amano · 2010 [cited by examiner]
US 20100246683A1 · Webb · 2010 [cited by examiner]
US 20100260263A1 · Kotaka · 2010 [cited by examiner]
US 20100296744A1 · Boon et al. · 2010 [cited by applicant]
US 20100321428A1 · Saito · 2010 [cited by examiner]
US 20100322317A1 · Yoshimatsu · 2010 [cited by examiner]
US 20110145549A1 · Suk · 2011 [cited by examiner]
US 20110156934A1 · Bae · 2011 [cited by examiner]
US 20110182523A1 · Kim · 2011 [cited by examiner]
US 20110235699A1 · Huang · 2011 [cited by examiner]
“Group, v.” OED Online. Oxford University Press, Sep. 2016. Web. Dec. 5, 2016. [cited by applicant]