Notice of Pre-AIA or AIA Status
The present application is being examined under the pre-AIA first to invent provisions.
Claim Rejections - 35 USC § 112
The following is a quotation of 35 U.S.C. 112(f):
(f) Element in Claim for a Combination. – An element in a claim for a combination may be expressed as a means or step for performing a specified function without the recital of structure, material, or acts in support thereof, and such claim shall be construed to cover the corresponding structure, material, or acts described in the specification and equivalents thereof.
The following is a quotation of pre-AIA 35 U.S.C. 112, sixth paragraph:
An element in a claim for a combination may be expressed as a means or step for performing a specified function without the recital of structure, material, or acts in support thereof, and such claim shall be construed to cover the corresponding structure, material, or acts described in the specification and equivalents thereof.
The claims in this application are given their broadest reasonable interpretation using the plain meaning of the claim language in light of the specification as it would be understood by one of ordinary skill in the art. The broadest reasonable interpretation of a claim element (also commonly referred to as a claim limitation) is limited by the description in the specification when 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, is invoked.
As explained in MPEP § 2181, subsection I, claim limitations that meet the following three-prong test will be interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph:
(A) the claim limitation uses the term “means” or “step” or a term used as a substitute for “means” that is a generic placeholder (also called a nonce term or a non-structural term having no specific structural meaning) for performing the claimed function;
(B) the term “means” or “step” or the generic placeholder is modified by functional language, typically, but not always linked by the transition word “for” (e.g., “means for”) or another linking word or phrase, such as “configured to” or “so that”; and
(C) the term “means” or “step” or the generic placeholder is not modified by sufficient structure, material, or acts for performing the claimed function.
Use of the word “means” (or “step”) in a claim with functional language creates a rebuttable presumption that the claim limitation is to be treated in accordance with 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph. The presumption that the claim limitation is interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, is rebutted when the claim limitation recites sufficient structure, material, or acts to entirely perform the recited function.
Absence of the word “means” (or “step”) in a claim creates a rebuttable presumption that the claim limitation is not to be treated in accordance with 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph. The presumption that the claim limitation is not interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, is rebutted when the claim limitation recites function without reciting sufficient structure, material or acts to entirely perform the recited function.
Claim limitations in this application that use the word “means” (or “step”) are being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, except as otherwise indicated in an Office action. Conversely, claim limitations in this application that do not use the word “means” (or “step”) are not being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, except as otherwise indicated in an Office action.
This application includes one or more claim limitations that use the word “means” or “step” but are nonetheless not being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph because the claim limitation(s) recite(s) sufficient structure, materials, or acts to entirely perform the recited function. Such claim limitation(s) is/are: processing unit, accessing unit and decoding unit in claims 2-21, because the claim has cited sufficient structure for these units.
Because this/these claim limitation(s) is/are not being interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, it/they is/are not being interpreted to cover only the corresponding structure, material, or acts described in the specification as performing the claimed function, and equivalents thereof.
If applicant intends to have this/these limitation(s) interpreted under 35 U.S.C. 112(f) or pre-AIA 35 U.S.C. 112, sixth paragraph, applicant may: (1) amend the claim limitation(s) to remove the structure, materials, or acts that performs the claimed function; or (2) present a sufficient showing that the claim limitation(s) does/do not recite sufficient structure, materials, or acts to perform the claimed function.
Claim 13 citing a storage device, which is a product itself, therefore the claim is not interpreted as product by process.
Double Patenting
The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b).
The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/process/file/efs/guidance/eTD-info-I.jsp.
Claims 2-21 are provisionally rejected on the ground of nonstatutory double patenting as being unpatentable over claims of copending US. Application No. 18/775,708 (allowed), 19/026,979, 19/027,058, 19/026,937, Although the claims at issue are not identical, they are not patentably distinct from each other because the similarity in the claimed subject matter such as encoding and decoding methodology and the signaling the flag association with SEI, see the example comparison below. This is a provisional nonstatutory double patenting rejection.
Instant Application
US. Application No. 18/775,708
2. A computer system comprising one or more processing units and memory, wherein the computer system implements a video decoder configured to perform operations comprising: receiving a concatenation flag and a coded picture buffer removal delay ("CPBRD") delta value signaled as part of a supplemental enhancement information message associated with a given access unit,
the concatenation flag having a given value; receiving encoded data in a bitstream for a given decoding unit of the given access unit, the given access unit corresponding to a current picture among pictures of a video sequence, wherein the given decoding unit is a subset of the current picture; determining a nominal coded picture buffer ("CPB") removal time of a preceding access unit based on a nominal CPB removal time of a last decoding unit of the preceding access unit, the preceding access unit corresponding to a preceding picture among the pictures of the video sequence, wherein the last decoding unit is a subset of the preceding picture; determining a value of a constraint that ensures that delay is at least as long as delay would be if decoding started at the given access unit; and determining a nominal CPB removal time based at least in part on a sum of (a) the nominal CPB removal time of the preceding access unit and (b) a product of a clock tick value and a factor, wherein the factor depends on the higher of the CPBRD delta value and the value of the constraint.
3. The computer system of claim 2, wherein the given decoding unit of the given access unit is a slice of the current picture.
4. The computer system of claim 2, wherein the current picture is a random access picture.
5. The computer system of claim 2, wherein the last decoding unit of the preceding access unit is a slice of the preceding picture.
6. The computer system of claim 2, wherein the CPBRD delta value is signaled as a syntax element representing the CPBRD delta value minus 1.
7. The computer system of claim 2, wherein the determining the value of the constraint includes combining an initial coded picture buffer removal delay value, divided by 90000, with a final arrival time of the preceding access unit and the nominal CPB removal time of the preceding access unit.
8. The computer system of claim 7, wherein the determining the value of the constraint further includes dividing a result of the combining by the clock tick value.
9. The computer system of claim 2, wherein the value of the constraint is determined as Ceil((InitiCpbRemovalDelay[SchedSelIdx] + 90000 +taf(nb) - tr,n(nb)) +tc), wherein Ceil( is a ceiling function, wherein InitiCpbRemovalDelay[SchedSelIdx] represents an initial coded picture buffer removal delay value, wherein tar(nb) represents a final arrival time of the preceding access unit, wherein tr,n(nb) represents the nominal CPB removal time of the preceding access unit, and wherein te represents the clock tick value.
10. The computer system of claim 2, wherein: the current picture is part of a temporal layer, and the preceding picture immediately precedes the current picture in decoding order in the temporal layer of the current picture or a lower temporal layer.
11. The computer system of claim 2, wherein: the preceding picture, among pictures having a temporal identifier of zero, immediately precedes the current picture in decoding order.
12. The computer system of claim 2, wherein the concatenation flag and the CPBRD delta value are for the given access unit.
13. A storage device having stored thereon encoded data in a bitstream for a given decoding unit of a given access unit, the given access unit corresponding to a current Page 3 of 7 picture among pictures of a video sequence, wherein the given decoding unit is a subset of the current picture, the bitstream further including a concatenation flag and a coded picture buffer removal delay ("CPBRD") delta value signaled as part of a supplemental enhancement information message associated with the given access unit, the concatenation flag having a given value, the bitstream being organized to facilitate decoding with operations comprising:determining a nominal coded picture buffer ("CPB") removal time of a preceding access unit based on a nominal CPB removal time of a last decoding unit of the preceding access unit, the preceding access unit corresponding to a preceding picture among the pictures of the video sequence, wherein the last decoding unit is a subset of the preceding picture;determining a value of a constraint that ensures that delay is at least as long as delay would be if decoding started at the given access unit; anddetermining a nominal CPB removal time based at least in part on a sum of (a) the nominal CPB removal time of the preceding access unit and (b) a product of a clock tick value and a factor, wherein the factor depends on the higher of the CPBRD delta value and the value of the constraint.
14. The storage device of claim 13, wherein: the given decoding unit of the given access unit is a slice of the current picture; the current picture is a random access picture; and the last decoding unit of the preceding access unit is a slice of the preceding picture.
15. The storage device of claim 13, wherein the CPBRD delta value is signaled as a syntax element representing the CPBRD delta value minus 1.
16. The storage device of claim 13, wherein the determining the value of the constraint includes: combining an initial coded picture buffer removal delay value, divided by 90000, with a final arrival time of the preceding access unit and the nominal CPB removal time of the preceding access unit; and dividing a result of the combining by the clock tick value.
17. The storage device of claim 13, wherein:the current picture is part of a temporal layer, and the preceding picture immediately precedes the current picture in decoding order in the temporal layer of the current picture or a lower temporal layer; or the preceding picture, among pictures having a temporal identifier of zero, immediately precedes the current picture in decoding order.
18. The storage device of claim 13, wherein the concatenation flag and the CPBRD delta value are for the given access unit.
19. One or more non-transitory computer-readable media having stored thereon computer-executable instructions for causing one or more processing units, when programmed thereby, to perform encoding operations comprising: setting a concatenation flag and a coded picture buffer removal delay ("CPBRD") delta value, the concatenation flag having a given value; encoding a given decoding unit of a given access unit, the given access unit corresponding to a current picture among pictures of a video sequence, wherein the given decoding unit is a subset of the current picture, thereby producing encoded data for the given decoding unit of the given access unit; and outputting the encoded data in a bitstream, the bitstream further including the concatenation flag and the CPBRD delta value signaled as part of a supplemental enhancement information message associated with the given access unit, thereby enabling a video decoder to perform decoding operations comprising:determining a nominal coded picture buffer ("CPB") removal time of a preceding access unit based on a nominal CPB removal time of a last decoding unit of the preceding access unit, the preceding access unit corresponding to a preceding picture among the pictures of the video sequence, wherein the last decoding unit is a subset of the preceding picture;determining a value of a constraint that ensures that delay is at least as long as delay would be if decoding started at the given access unit; anddetermining a nominal CPB removal time based at least in part on a sum of (a) the nominal CPB removal time of the preceding access unit and (b) a product of a clock tick value and a factor, wherein the factor depends on the higher of the CPBRD delta value and the value of the constraint.
20. The one or more non-transitory computer-readable media of claim 19, wherein: the given decoding unit of the given access unit is a slice of the current picture; the current picture is a random access picture; and the last decoding unit of the preceding access unit is a slice of the preceding picture.
21. The one or more non-transitory computer-readable media of claim 19, wherein the concatenation flag and the CPBRD delta value are for the given access unit.
1. In a computer system that implements a video decoder, a method comprising:
receiving a concatenation flag and a coded picture buffer removal delay ("CPBRD") delta value,
the concatenation flag having a given value; receiving encoded data in a bitstream for a given decoding unit of a given access unit, the given access unit corresponding to a current picture among pictures of a video sequence, wherein the given decoding unit is a subset of the current picture; determining a nominal coded picture buffer ("CPB") removal time of a preceding access unit based on a nominal CPB removal time of a last decoding unit of the preceding access unit, the preceding access unit corresponding to a preceding picture among the pictures of the video sequence, wherein the last decoding unit is a subset of the preceding picture; determining a value of a constraint that ensures that delay is at least as long as delay would be if decoding started at the given access unit; and determining a nominal CPB removal time based at least in part on a sum of (a) the nominal CPB removal time of the preceding access unit and (b) a product of a clock tick value and a factor, wherein the factor depends on the CPBRD delta value, constrained by the value of the constraint.
2. The method of claim 1, wherein the given decoding unit of the given access unit is a slice of the current picture.
3. The method of claim 1, wherein the current picture is a random access picture.
4. The method of claim 1, wherein the last decoding unit of the preceding access unit is a slice of the preceding picture.
5. The method of claim 1, wherein the factor depends on the higher of the CPBRD delta value and the value of the constraint.
6. The method of claim 5, wherein the CPBRD delta value is signaled as a syntax element representing the CPBRD delta value minus 1.
7. The method of claim 1, wherein the determining the value of the constraint includes combining an initial coded picture buffer removal delay value, divided by 90000, with a final arrival time of the preceding access unit and the nominal CPB removal time of the preceding access unit.
8. The method of claim 7, wherein the determining the value of the constraint further includes dividing a result of the combining by the clock tick value.
9. The method of claim 1, wherein the value of the constraint is determined as Ceil((InitiCpbRemovalDelay[SchedSelIdx] + 90000 + taf(nb) - tr,n(nb)) +tc), wherein Ceil() is a ceiling function, wherein InitiCpbRemovalDelay[SchedSelIdx] represents an initial coded picture buffer removal delay value, wherein taf(nb) represents a final arrival time of the preceding access unit, wherein tr,n(nb) represents the nominal CPB removal time of the preceding access unit, and wherein tc represents the clock tick value.
10. The method of claim 1, wherein: the current picture is part of a temporal layer, and the preceding picture immediately precedes the current picture in decoding order in the temporal layer of the current picture or a lower temporal layer; or the preceding picture, among pictures having a temporal identifier of zero, immediately precedes the current picture in decoding order.
11. The method of claim 1, wherein the concatenation flag and the CPBRD delta value are for the given access unit, and wherein the concatenation flag and the CPBRD delta value are signaled as part of a buffering period supplemental enhancement information message associated with the given access unit.
21. A computer system comprising one or more processing units and memory, wherein the computer system implements a video decoder configured to perform operations comprising: receiving encoded data in a bitstream for a current decoding unit of a first access unit, the first access unit corresponding to a first picture among pictures of a video sequence, wherein the current decoding unit is a current slice of the first picture; and decoding the current decoding unit using the encoded data and a coded picture buffer removal delay ("CPBRD") value for the current decoding unit, including calculating a nominal coded picture buffer ("CPB") removal time for the current decoding unit relative to a nominal CPB removal time for a last decoding unit of a second access unit,
the second access unit corresponding to a second picture among the pictures of the video sequence, wherein the last decoding unit is a last slice of the second picture, and wherein the calculating the nominal CPB removal time for the current decoding unit includes:
calculating the nominal CPB removal time for the last decoding unit of the second access unit, wherein the nominal CPB removal time for the last decoding unit of the second access unit depends on a nominal CPB removal time for the second access unit, the nominal CPB removal time for the second access unit having been previously calculated based at least in part on a sum of (a) a nominal CPB removal time of a third access unit and (b) a first product of a first clock tick value and a first factor, wherein, if a concatenation flag for the second access unit is signaled and has a given value, the first factor depends on a CPBRD delta value constrained by a constraint value to ensure that delay is at least as long as delay would be if decoding started at the second access unit;calculating a second product of a second clock tick value and a second factor, the second factor depending on the CPBRD value for the current decoding unit; andadjusting the nominal CPB removal time for the last decoding unit of the second access unit by the second product.
22. The computer system of claim 21, wherein the third access unit corresponds to a third picture among the pictures of the video sequence, wherein the third picture precedes the second picture in the video sequence, and wherein the first picture follows the second picture in the video sequence.
23. The computer system of claim 22, wherein: the second picture is part of a temporal layer, and the third picture immediately precedes the second picture in decoding order in the temporal layer of the second picture or a lower temporal layer; or the third picture, among pictures having a temporal identifier of zero, immediately precedes the second picture in decoding order.
24. The computer system of claim 21, wherein the third access unit corresponds to a third picture among the pictures of the video sequence, wherein the third picture precedes the second picture in the video sequence, and wherein the first picture is the second picture.
25. The computer system of claim 22, wherein: the second picture is part of a temporal layer, and the third picture immediately precedes the second picture in decoding order in the temporal layer of the second picture or a lower temporal layer; or the third picture, among pictures having a temporal identifier of zero, immediately precedes the second picture in decoding order.
26. The computer system of claim 21, wherein the CPBRD value for the current decoding unit is signaled as part of a picture timing supplemental enhancement information message for the first access unit.
27. One or more non-transitory computer-readable media having stored thereon encoded data in a bitstream for a current decoding unit of a first access unit, the first access unit corresponding to a first picture among pictures of a video sequence, wherein the current decoding unit is a current slice of the first picture, the encoded data being organized to facilitate decoding of the current decoding unit using the encoded data and a coded picture buffer removal delay ("CPBRD") value for the current decoding unit with operations comprising calculating a nominal coded picture buffer ("CPB") removal time for the current decoding unit relative to a nominal CPB removal time for a last decoding unit of a second access unit, the second access unit corresponding to a second picture among the pictures of the video sequence, wherein the lastdecoding unit is a last slice of the second picture, and wherein the calculating the nominal CPB removal time for the current decoding unit includes:calculating the nominal CPB removal time for the last decoding unit of the second access unit, wherein the nominal CPB removal time for the last decoding unit of the second access unit depends on a nominal CPB removal time for the second access unit, the nominal CPB removal time for the second access unit having been previously calculated based at least in part on a sum of (a) a nominal CPB removal time of a third access unit and (b) a first product of a first clock tick value and a first factor, wherein, if a concatenation flag for the second access unit is signaled and has a given value, the first factor depends on a CPBRD delta value constrained by a constraint value to ensure that delay is at least as long as delay would be if decoding started at the second access unit; calculating a second product of a second clock tick value and a second factor, the second factor depending on the CPBRD value for the current decoding unit; and adjusting the nominal CPB removal time for the last decoding unit of the second access unit by the second product.
28. The one or more non-transitory computer-readable media of claim 27, wherein the third access unit corresponds to a third picture among the pictures of the video sequence, wherein the third picture precedes the second picture in the video sequence, and wherein the first picture follows the second picture in the video sequence.
29. The one or more non-transitory computer-readable media of The one or more non-transitory computer-readable media of wherein the CPBRD value for the current decoding unit is signaled as part of a picture timing supplemental enhancement information message for the first access unit.
US Pub. No.: 19/027,105
US Pub. No.: 19/026,979
2. A computer system comprising one or more processing units and memory, wherein the computer system implements a video decoder configured to perform operations comprising: receiving a concatenation flag and a coded picture buffer removal delay ("CPBRD") delta value signaled as part of a supplemental enhancement information message associated with a given access unit, the concatenation flag having a given value; receiving encoded data in a bitstream for a given decoding unit of the given access unit, the given access unit corresponding to a current picture among pictures of a video sequence, wherein the given decoding unit is a subset of the current picture; determining a nominal coded picture buffer ("CPB") removal time of a preceding access unit based on a nominal CPB removal time of a last decoding unit of the preceding access unit, the preceding access unit corresponding to a preceding picture among the pictures of the video sequence, wherein the last decoding unit is a subset of the preceding picture; determining a value of a constraint that ensures that delay is at least as long as delay would be if decoding started at the given access unit; and determining a nominal CPB removal time based at least in part on a sum of (a) the nominal CPB removal time of the preceding access unit and (b) a product of a clock tick value and a factor, wherein the factor depends on the higher of the CPBRD delta value and the value of the constraint.
3. The computer system of claim 2, wherein the given decoding unit of the given access unit is a slice of the current picture.
4. The computer system of claim 2, wherein the current picture is a random access picture.
5. The computer system of claim 2, wherein the last decoding unit of the preceding access unit is a slice of the preceding picture.
6. The computer system of claim 2, wherein the CPBRD delta value is signaled as a syntax element representing the CPBRD delta value minus 1.
7. The computer system of claim 2, wherein the determining the value of the constraint includes combining an initial coded picture buffer removal delay value, divided by 90000, with a final arrival time of the preceding access unit and the nominal CPB removal time of the preceding access unit.
8. The computer system of claim 7, wherein the determining the value of the constraint further includes dividing a result of the combining by the clock tick value.
9. The computer system of claim 2, wherein the value of the constraint is determined as Ceil((InitiCpbRemovalDelay[SchedSelIdx] + 90000 +taf(nb) - tr,n(nb)) +tc), wherein Ceil( is a ceiling function, wherein InitiCpbRemovalDelay[SchedSelIdx] represents an initial coded picture buffer removal delay value, wherein tar(nb) represents a final arrival time of the preceding access unit, wherein tr,n(nb) represents the nominal CPB removal time of the preceding access unit, and wherein te represents the clock tick value.
10. The computer system of claim 2, wherein: the current picture is part of a temporal layer, and the preceding picture immediately precedes the current picture in decoding order in the temporal layer of the current picture or a lower temporal layer.
11. The computer system of claim 2, wherein: the preceding picture, among pictures having a temporal identifier of zero, immediately precedes the current picture in decoding order.
12. The computer system of claim 2, wherein the concatenation flag and the CPBRD delta value are for the given access unit.
13. A storage device having stored thereon encoded data in a bitstream for a given decoding unit of a given access unit, the given access unit corresponding to a current Page 3 of 7 picture among pictures of a video sequence, wherein the given decoding unit is a subset of the current picture, the bitstream further including a concatenation flag and a coded picture buffer removal delay ("CPBRD") delta value signaled as part of a supplemental enhancement information message associated with the given access unit, the concatenation flag having a given value, the bitstream being organized to facilitate decoding with operations comprising:determining a nominal coded picture buffer ("CPB") removal time of a preceding access unit based on a nominal CPB removal time of a last decoding unit of the preceding access unit, the preceding access unit corresponding to a preceding picture among the pictures of the video sequence, wherein the last decoding unit is a subset of the preceding picture;determining a value of a constraint that ensures that delay is at least as long as delay would be if decoding started at the given access unit; anddetermining a nominal CPB removal time based at least in part on a sum of (a) the nominal CPB removal time of the preceding access unit and (b) a product of a clock tick value and a factor, wherein the factor depends on the higher of the CPBRD delta value and the value of the constraint.
14. The storage device of claim 13, wherein: the given decoding unit of the given access unit is a slice of the current picture; the current picture is a random access picture; and the last decoding unit of the preceding access unit is a slice of the preceding picture.
15. The storage device of claim 13, wherein the CPBRD delta value is signaled as a syntax element representing the CPBRD delta value minus 1.
16. The storage device of claim 13, wherein the determining the value of the constraint includes: combining an initial coded picture buffer removal delay value, divided by 90000, with a final arrival time of the preceding access unit and the nominal CPB removal time of the preceding access unit; and dividing a result of the combining by the clock tick value.
17. The storage device of claim 13, wherein:the current picture is part of a temporal layer, and the preceding picture immediately precedes the current picture in decoding order in the temporal layer of the current picture or a lower temporal layer; or the preceding picture, among pictures having a temporal identifier of zero, immediately precedes the current picture in decoding order.
18. The storage device of claim 13, wherein the concatenation flag and the CPBRD delta value are for the given access unit.
19. One or more non-transitory computer-readable media having stored thereon computer-executable instructions for causing one or more processing units, when programmed thereby, to perform encoding operations comprising: setting a concatenation flag and a coded picture buffer removal delay ("CPBRD") delta value, the concatenation flag having a given value; encoding a given decoding unit of a given access unit, the given access unit corresponding to a current picture among pictures of a video sequence, wherein the given decoding unit is a subset of the current picture, thereby producing encoded data for the given decoding unit of the given access unit; and outputting the encoded data in a bitstream, the bitstream further including the concatenation flag and the CPBRD delta value signaled as part of a supplemental enhancement information message associated with the given access unit, thereby enabling a video decoder to perform decoding operations comprising:determining a nominal coded picture buffer ("CPB") removal time of a preceding access unit based on a nominal CPB removal time of a last decoding unit of the preceding access unit, the preceding access unit corresponding to a preceding picture among the pictures of the video sequence, wherein the last decoding unit is a subset of the preceding picture;determining a value of a constraint that ensures that delay is at least as long as delay would be if decoding started at the given access unit; anddetermining a nominal CPB removal time based at least in part on a sum of (a) the nominal CPB removal time of the preceding access unit and (b) a product of a clock tick value and a factor, wherein the factor depends on the higher of the CPBRD delta value and the value of the constraint.
20. The one or more non-transitory computer-readable media of claim 19, wherein: the given decoding unit of the given access unit is a slice of the current picture; the current picture is a random access picture; and the last decoding unit of the preceding access unit is a slice of the preceding picture.
21. The one or more non-transitory computer-readable media of claim 19, wherein the concatenation flag and the CPBRD delta value are for the given access unit.
2. One or more non-transitory computer-readable media having stored thereon computer-executable instructions for causing one or more processing units, when programmed thereby, to perform operations comprising: receiving a concatenation flag and a coded picture buffer removal delay ("CPBRD") delta value, the concatenation flag having a given value; receiving encoded data in a bitstream for a given decoding unit of a given access unit, the given access unit corresponding to a current picture among pictures of a video sequence, wherein the given decoding unit is a subset of the current picture; determining a nominal coded picture buffer ("CPB") removal time of a preceding access unit based on a nominal CPB removal time of a last decoding unit of the preceding access unit, the preceding access unit corresponding to a preceding picture among the pictures of the video sequence, wherein the last decoding unit is a subset of the preceding picture; determining a value of a constraint that ensures that delay is at least as long as delay would be if decoding started at the given access unit; and determining a nominal CPB removal time based at least in part on a sum of (a) the nominal CPB removal time of the preceding access unit and (b) a product of a clock tick value and a factor, wherein the factor depends on the CPBRD delta value, constrained by the value of the constraint.
3. The one or more non-transitory computer-readable media of claim 2, wherein the given decoding unit of the given access unit is a slice of the current picture.
4. The one or more non-transitory computer-readable media of claim 2, wherein the current picture is a random access picture.
5. The one or more non-transitory computer-readable media of claim 2, wherein the last decoding unit of the preceding access unit is a slice of the preceding picture.
6. The one or more non-transitory computer-readable media of claim 2, wherein the factor depends on the higher of the CPBRD delta value and the value of the constraint.
7. The one or more non-transitory computer-readable media of claim 6, wherein the CPBRD delta value is signaled as a syntax element representing the CPBRD delta value minus 1.
8. The one or more non-transitory computer-readable media of claim 2, wherein the determining the value of the constraint includes combining an initial coded picture buffer removal delay value, divided by 90000, with a final arrival time of the preceding access unit and the nominal CPB removal time of the preceding access unit.
9. The one or more non-transitory computer-readable media of claim 8, wherein the determining the value of the constraint further includes dividing a result of the combining by the clock tick value.
10. The one or more non-transitory computer-readable media of claim 2, wherein the value of the constraint is determined as Ceil((InitiCpbRemovalDelay[SchedSelldx] + 90000 + taf(nb) - tr,n(nb)) +tc), wherein Ceil() is a ceiling function, wherein InitiCpbRemovalDelay[SchedSelldx] represents an initial coded picture buffer removal delay value, wherein taf(nb) represents a final arrival time of the preceding access unit, wherein tr,n(nb) represents the nominal CPB removal time of the preceding access unit, and wherein tc represents the clock tick value.
11. The one or more non-transitory computer-readable media of claim 2, wherein: the current picture is part of a temporal layer, and the preceding picture immediately precedes the current picture in decoding order in the temporal layer of the current picture or a lower temporal layer; or the preceding picture, among pictures having a temporal identifier of zero, immediately precedes the current picture in decoding order.
12. The one or more non-transitory computer-readable media of claim 2, wherein the concatenation flag and the CPBRD delta value are for the given access unit, and wherein the concatenation flag and the CPBRD delta value are signaled as part of a buffering period supplemental enhancement information message associated with the given access unit.
13. In a computer system, a method comprising: receiving encoded data in a bitstream for a given decoding unit of a given access unit, the given access unit corresponding to a current picture among pictures of a video sequence, wherein the given decoding unit is a subset of the current picture, the bitstream further including a concatenation flag and a coded picture buffer removal delay ("CPBRD") delta value, the concatenation flag having a given value; and storing the bitstream, wherein the bitstream is organized to facilitate decoding with operations comprising:determining a nominal coded picture buffer ("CPB") removal time of a preceding access unit based on a nominal CPB removal time of a last decoding unit of the preceding access unit, the preceding access unit corresponding to a preceding picture among the pictures of the video sequence, wherein the last decoding unit is a subset of the preceding picture;determining a value of a constraint that ensures that delay is at least as long as delay would be if decoding started at the given access unit; anddetermining a nominal CPB removal time based at least in part on a sum of (a) the nominal CPB removal time of the preceding access unit and (b) a product of a clock tick value and a factor, wherein the factor depends on the CPBRD delta value, constrained by the value of the constraint.
14. The method of claim 13, wherein: the given decoding unit of the given access unit is a slice of the current picture; the current picture is a random access picture; and the last decoding unit of the preceding access unit is a slice of the preceding picture.
15. The method of claim 13, wherein the factor depends on the higher of the CPBRD delta value and the value of the constraint, and wherein the CPBRD delta value is signaled as a syntax element representing the CPBRD delta value minus 1.
16. The method of claim 13, wherein the determining the value of the constraint includes: combining an initial coded picture buffer removal delay value, divided by 90000, with a final arrival time of the preceding access unit and the nominal CPB removal time of the preceding access unit; and dividing a result of the combining by the clock tick value.
17. The method of claim 13, wherein: the current picture is part of a temporal layer, and the preceding picture immediately precedes the current picture in decoding order in the temporal layer of the current picture or a lower temporal layer; or the preceding picture, among pictures having a temporal identifier of zero, immediately precedes the current picture in decoding order.
18. The method of claim 13, wherein the concatenation flag and the CPBRD delta value are for the given access unit, and wherein the concatenation flag and the CPBRD delta value are signaled as part of a buffering period supplemental enhancement information message associated with the given access unit.
19. In a computer system, a method comprising: setting a concatenation flag and a coded picture buffer removal delay ("CPBRD") delta value, the concatenation flag having a given value; encoding a given decoding unit of a given access unit, the given access unit corresponding to a current picture among pictures of a video sequence, wherein the given decoding unit is a subset of the current picture, thereby producing encoded data for the given decoding unit of the given access unit; and outputting the encoded data in a bitstream, the bitstream further including the concatenation flag and the CPBRD delta value, thereby enabling a video decoder to perform decoding operations comprising:determining a nominal coded picture buffer ("CPB") removal time of a preceding access unit based on a nominal CPB removal time of a last decoding unit of the preceding accessunit, the preceding access unit corresponding to a preceding picture among the pictures of the video sequence, wherein the last decoding unit is a subset of the preceding picture;determining a value of a constraint that ensures that delay is at least as long as delay would be if decoding started at the given access unit; anddetermining a nominal CPB removal time based at least in part on a sum of (a) the nominal CPB removal time of the preceding access unit and (b) a product of a clock tick value and a factor, wherein the factor depends on the CPBRD delta value, constrained by the value of the constraint.
20. The method of claim 19, wherein: the given decoding unit of the given access unit is a slice of the current picture; the current picture is a random access picture; and the last decoding unit of the preceding access unit is a slice of the preceding picture.
21. The method of claim 19, wherein the concatenation flag and the CPBRD delta value are for the given access unit, and wherein the concatenation flag and the CPBRD delta value are signaled as part of a buffering period supplemental enhancement information message associated with the given access unit.
US. App. No.: 19/027,058
2. In a computer system that implements a video decoder, a method comprising: receiving a concatenation flag and a coded picture buffer removal delay ("CPBRD") delta value signaled as part of a supplemental enhancement information message associated with a given access unit, the concatenation flag having a given value; receiving encoded data in a bitstream for a given decoding unit of the given access unit, the given access unit corresponding to a current picture among pictures of a video sequence, wherein the given decoding unit is a subset of the current picture; determining a nominal coded picture buffer ("CPB") removal time of a preceding access unit based on a nominal CPB removal time of a last decoding unit of the preceding access unit, the preceding access unit corresponding to a preceding picture among the pictures of the video sequence, wherein the last decoding unit is a subset of the preceding picture; determining a value of a constraint that ensures that delay is at least as long as delay would be if decoding started at the given access unit; and determining a nominal CPB removal time based at least in part on a sum of (a) the nominal CPB removal time of the preceding access unit and (b) a product of a clock tick value and a factor, wherein the factor depends on the higher of the CPBRD delta value and the value of the constraint.
3. The method of claim 2, wherein the given decoding unit of the given access unit is a slice of the current picture.
4. The method of claim 2, wherein the current picture is a random access picture.
5. The method of claim 2, wherein the last decoding unit of the preceding access unit is a slice of the preceding picture.
6. The method of claim 2, wherein the CPBRD delta value is signaled as a syntax element representing the CPBRD delta value minus 1.
7. The method of claim 2, wherein the determining the value of the constraint includes combining an initial coded picture buffer removal delay value, divided by 90000, with a final arrival time of the preceding access unit and the nominal CPB removal time of the preceding access unit.
8. The method of claim 7, wherein the determining the value of the constraint further includes dividing a result of the combining by the clock tick value.
9. The method of claim 2, wherein the value of the constraint is determined as Ceil((InitiCpbRemovalDelay[SchedSelIdx] + 90000 + taf(nb) - tr,n(nb)) +tc), wherein Ceil( is a ceiling function, wherein InitiCpbRemovalDelay[SchedSelIdx] represents an initial coded picture buffer removal delay value, wherein taf(nb) represents a final arrival time of the preceding access unit, wherein tr,n(nb) represents the nominal CPB removal time of the preceding access unit, and wherein te represents the clock tick value.
10. The method of claim 2, wherein: the current picture is part of a temporal layer, and the preceding picture immediately precedes the current picture in decoding order in the temporal layer of the current picture or a lower temporal layer.
11. The method of claim 2, wherein: the preceding picture, among pictures having a temporal identifier of zero, immediately precedes the current picture in decoding order.
12. The method of claim 2, wherein the concatenation flag and the CPBRD delta value are for the given access unit.
13. One or more non-transitory computer-readable media having stored thereon encoded data in a bitstream for a given decoding unit of a given access unit, the given access unit corresponding to a current picture among pictures of a video sequence, wherein the given decoding unit is a subset of the current picture, the bitstream further including a concatenation flag and a coded picture buffer removal delay ("CPBRD") delta value signaled as part of a Page 3 of 7 supplemental enhancement information message associated with the given access unit, the concatenation flag having a given value, the bitstream being organized to facilitate decoding with operations comprising:determining a nominal coded picture buffer ("CPB") removal time of a preceding access unit based on a nominal CPB removal time of a last decoding unit of the preceding access unit, the preceding access unit corresponding to a preceding picture among the pictures of the video sequence, wherein the last decoding unit is a subset of the preceding picture;determining a value of a constraint that ensures that delay is at least as long as delay would be if decoding started at the given access unit; anddetermining a nominal CPB removal time based at least in part on a sum of (a) the nominal CPB removal time of the preceding access unit and (b) a product of a clock tick value and a factor, wherein the factor depends on the higher of the CPBRD delta value and the value of the constraint.
14. The one or more non-transitory computer-readable media of claim 13, wherein: the given decoding unit of the given access unit is a slice of the current picture; the current picture is a random access picture; and the last decoding unit of the preceding access unit is a slice of the preceding picture.
15. The one or more non-transitory computer-readable media of The one or more non-transitory computer-readable media of wherein the CPBRD delta value is signaled as a syntax element representing the CPBRD delta value minus 1.
16. The one or more non-transitory computer-readable media of claim 13, wherein the determining the value of the constraint includes: combining an initial coded picture buffer removal delay value, divided by 90000, with a final arrival time of the preceding access unit and the nominal CPB removal time of the preceding access unit; and dividing a result of the combining by the clock tick value.
17. The one or more non-transitory computer-readable media of claim 13, wherein: the current picture is part of a temporal layer, and the preceding picture immediately precedes the current picture in decoding order in the temporal layer of the current picture or a lower temporal layer; or the preceding picture, among pictures having a temporal identifier of zero, immediately precedes the current picture in decoding order.
18. The one or more non-transitory computer-readable media of claim 13, wherein the concatenation flag and the CPBRD delta value are for the given access unit.
19. A computer system comprising one or more processing units and memory, wherein the computer system implements a video encoder configured to perform encoding operations comprising: setting a concatenation flag and a coded picture buffer removal delay ("CPBRD") delta value, the concatenation flag having a given value; encoding a given decoding unit of a given access unit, the given access unit corresponding to a current picture among pictures of a video sequence, wherein the given decoding unit is a subset of the current picture, thereby producing encoded data for the given decoding unit of the given access unit; and outputting the encoded data in a bitstream, the bitstream further including the concatenation flag and the CPBRD delta value signaled as part of a supplemental enhancement information message associated with the given access unit, thereby enabling a video decoder to perform decoding operations comprising:determining a nominal coded picture buffer ("CPB") removal time of a preceding access unit based on a nominal CPB removal time of a last decoding unit of the preceding access unit, the preceding access unit corresponding to a preceding picture among the pictures of the video sequence, wherein the last decoding unit is a subset of the preceding picture;determining a value of a constraint that ensures that delay is at least as long as delay would be if decoding started at the given access unit; anddetermining a nominal CPB removal time based at least in part on a sum of (a) the nominal CPB removal time of the preceding access unit and (b) a product of a clock tick valueand a factor, wherein the factor depends on the higher of the CPBRD delta value and the value of the constraint.
20. The computer system of claim 19, wherein: the given decoding unit of the given access unit is a slice of the current picture; the current picture is a random access picture; and the last decoding unit of the preceding access unit is a slice of the preceding picture.
21. The computer system of claim 19, wherein the concatenation flag and the CPBRD delta value are for the given access unit.
Allowable Subject Matter
The following is an examiner’s statement of reasons for allowance:
US Pub. No.: 20100074340 see, Luo: Fig. 13, 1325 and 1330, as cited above, The function
block 1325 reads cpb_removal_delay( n ) from the bitstream, and passes control to a function block 1330. The function block 1330 sets , and passes control to the end block 1399. i.e. In the current hypothetical reference decoder requirements, cpb_removal_delay specifies how many clock ticks to wait after removal from the coded picture buffer of the access unit associated with the most recent buffering period supplemental enhancement information message before removing from the buffer the access unit data associated with the picture timing supplemental enhancement information message.
US 9319703 B2 discloses Hypothetical reference decoder parameter syntax Structure video encoder signals, in an encoded video bitstream, a video parameter set (VPS) that includes a plurality of Hypothetical Reference Decoder (HRD) parameter syntax structures that each include HRD parameters. For each respective HRD parameter syntax structure in the plurality of HRD parameter syntax structures, the VPS further includes a syntax element indicating whether the HRD parameters of the respective HRD parameter syntax structure include a common set of HRD parameters in addition to a set of sub-layer-specific HRD parameter information specific to a particular sub-layer of the encoded video bitstream. The common set of HRD parameters is common to all sub-layers of the encoded video bitstream. A video decoder or other device decodes, from the encoded video bitstream, the VPS and performs an operation using the HRD parameters of at least one of the HRD parameter syntax structures.
None of the cited prior art discloses “receiving a concatenation flag and a coded picture buffer removal delay ("CPBRD") delta value signaled as part of a supplemental enhancement information message associated with a given access unit, the concatenation flag having a given value; receiving encoded data in a bitstream for a given decoding unit of the given access unit, the given access unit corresponding to a current picture among pictures of a video sequence, wherein the given decoding unit is a subset of the current picture; determining a nominal coded picture buffer ("CPB") removal time of a preceding access unit based on a nominal CPB removal time of a last decoding unit of the preceding access unit, the preceding access unit corresponding to a preceding picture among the pictures of the video sequence, wherein the last decoding unit is a subset of the preceding picture; determining a value of a constraint that ensures that delay is at least as long as delay would be if decoding started at the given access unit; and determining a nominal CPB removal time based at least in part on a sum of (a) the nominal CPB removal time of the preceding access unit and (b) a product of a clock tick value and a factor, wherein the factor depends on the higher of the CPBRD delta value and the value of the constraint.”
Any comments considered necessary by applicant must be submitted no later than the payment of the issue fee and, to avoid processing delays, should preferably accompany the issue fee. Such submissions should be clearly labeled “Comments on Statement of Reasons for Allowance.”
Conclusion
The prior art made of record and not relied upon is considered pertinent to applicant's disclosure:
US 20100167689 A1 discloses determining whether a cellular telephone chip is dormant. Determinations are drawn from testing telephone numbers associated with chips and data collected is used to generate statistics. Methods are provided for determining the percentage of a wireless service provider's subscriber-base that consists of abandoned, or non-revenue-generating, customers.
US 20100074340 A1 discloses a spliced video stream generator for creating a spliced video stream using hypothetical reference decoder parameters. Another apparatus includes a spliced video stream generator for creating a spliced video stream that prevents decoder buffer overflow and underflow conditions relating to the spliced video stream by modifying standard values of at least one hypothetical reference decoder related high level syntax element.
US 20100130136 A1 discloses signaling in a telecommunication system and interpreting the meaning of the changed signal. Methods for detecting a change in a signal in a telecommunication system can include collecting signal information from a sample of telephone numbers, analyzing the signal information to determine whether numbers within the sample are assigned or unassigned, developing rules defining assigned and numbers, and updating the rules. Systems operable to achieve the methods may include call generators, signaling monitors, software employing a signal interpretation algorithm, and a server wherein the call generator is operable to connect to a telephone exchange, and wherein the system is operable to place calls and record signals and optionally audio messages for each call.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to FRANK F HUANG whose telephone number is (571)272-0701. The examiner can normally be reached Monday-Friday, 8:30 am - 6:00 pm (Eastern Time), Federal Alternative First Friday Off.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Jay Patel can be reached at (571)272-2988.. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/FRANK F HUANG/ Primary Examiner, Art Unit 2485