DETAILED ACTION
Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Status of the Claims
Currently, claims 1-20 are pending in the application. No Claims are amended, cancelled or are added.
Information Disclosure Statement
The information disclosure statements (IDS) were submitted on 3/3126, 6/7/26 & 7/12/26. The submission are in compliance with the provisions of 37 CFR § 1.97. Accordingly, the information disclosure statement is being considered by the examiner.
Response to Arguments / Amendments
Applicant’s arguments have been fully considered, but they are not persuasive, see discussion below.
Rejections under 35 U.S.C. § 103:
The applicant argued that Karczewicz does not disclose “generating a vector of pre-quantization transform coefficients, or performing the trellis coded quantization offset scheme on the vector of pre-quantization transform coefficients to generate the one-dimensional vector of quantized transform coefficients”, as required by the limitations of claim 1.
As to the above argument, Karczewicz discloses generating a vector of transform coefficients of prediction residues performing a transform (discrete cosine transform (DCT)) on the residual values to generate coefficient values ([0022]) and computing a block step size scaling value associated with the transform coefficients in states 0 and 1 use the Q0 (even integer multiples of step size) quantizer and in states 2 and 3 use Q1 (odd integer multiples of step size) quantizer ([0076], FIG. 7).
Karczewicz further discloses computing a first quantizer step size based on the block step size scaling value by computing a second quantizer step size based on the block step size scaling value using two scalar quantizers in quantization level mapping 600: first quantizer Q0 maps the transform coefficient levels, also called quantization levels, to even integer multiples of the quantization step size Δ and second quantizer Q1 maps the transform coefficient levels to odd integer multiples of quantization step size Δ or to zero (([0074] FIG. 6, ) and Coefficients in states 0 and 1 use the Q0 (even integer multiples of step size) quantizer. Coefficients in states 2 and 3 use Q1 (odd integer multiples of step size) quantizer [0076], FIG. 7; [0088] FIG. 8)
PNG
media_image1.png
388
428
media_image1.png
Greyscale
Karczewicz also discloses performing one or more trellis coded quantization operations on the vector of transform coefficients using the first quantizer step size and the second quantizer step size to generate a vector of quantization indices ([0072] and using separate quantization offsets or inverse-quantization offsets (e.g., offset values) for state driven two quantizers used in TCQ instead of using one common one for both quantizers ([0089]).
In addition to Karczewicz, Coban teaches computing the block step size scaling value based on contextual metadata with Trellis Coded Quantization (TCQ) using a significance map (or greater than 1 or 2 flags) using a parity of a partial set of syntax elements, deriving the state machine based on a parity of the number of nonzero coefficients in a neighborhood of coefficient that is being coded ([0115]; [0120).
It should be further noted that Applicant has not presented any specific arguments with regards to the rejections of the dependent claims.
Accordingly, Examiner maintains the rejection with regards to above arguments.
Claim Rejections - 35 USC § 103
The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action:
A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102 of this title, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made.
Claims 1-3, 5, 8-15 & 17-20 are rejected under 35 U.S.C. 103 as being unpatentable over Karczewicz et al. (US 20240414339, hereinafter Karczewicz) in view of Coban et al. (US 20190387259, hereinafter Coban).
Regarding Claim 1, Karczewicz discloses a computer-implemented method for encoding video data, the method comprising:
generating a vector of transform coefficients of prediction residues that are associated with a block of source video data ([0022], a video encoder performs a transform (e.g., discrete cosine transform (DCT)) on the residual values to generate coefficient values);
computing a block step size scaling value ([0076], FIG. 7, Coefficients in states 0 and 1 use the Q0 (even integer multiples of step size) quantizer. Coefficients in states 2 and 3 use Q1 (odd integer multiples of step size) quantizer. That is, video encoder 200 and video decoder 300 may quantize or inverse-quantize, as appliable, coefficients using quantizer Q0 (e.g., even integer multiples of step size Δ) if the state of state machine 700 is 0 or 1. Video encoder 200 and video decoder 300 may quantize or inverse-quantize, as appliable, coefficients using quantizer Q1 (e.g., odd integer multiples of step size Δ) if the state of state machine 700 is 2 or 3);
computing a first quantizer step size based on the block step size scaling value; computing a second quantizer step size based on the block step size scaling value ([0074] FIG. 6, using two scalar quantizers in quantization level mapping 600: first quantizer Q0 maps the transform coefficient levels, also called quantization levels, to even integer multiples of the quantization step size Δ. The second quantizer Q1 maps the transform coefficient levels to odd integer multiples of quantization step size Δ or to zero; [0076], FIG. 7, Coefficients in states 0 and 1 use the Q0 (even integer multiples of step size) quantizer. Coefficients in states 2 and 3 use Q1 (odd integer multiples of step size) quantizer; [0088] FIG. 8, two scalar quantizers the first quantizer Q0′ and the second quantizer Q1′);
PNG
media_image1.png
388
428
media_image1.png
Greyscale
performing one or more trellis coded quantization operations on the vector of transform coefficients using the first quantizer step size and the second quantizer step size to generate a vector of quantization indices ([0072] using quantization offset scheme for dependent quantization, such as Trellis Coded Quantization (TCQ) to determine quantization offsets; [0089] use separate quantization offsets or inverse-quantization offsets (e.g., offset values) for state driven two quantizers used in TCQ instead of using one common one for both quantizers. Additionally, in some examples, luma and chroma components may use separate offsets for respective quantization); and
performing one or more entropy coding operations on the vector of quantization indices to generate an encoded version of the block of source video data ([0065], video encoder scans the transform coefficients, producing a one-dimensional vector from the two-dimensional matrix including the quantized transform coefficients and encodes the one-dimensional vector, e.g., according to context-adaptive binary arithmetic coding (CABAC)).
Karczewicz does not explicitly disclose computing the block step size scaling value based on contextual metadata.
Coban teaches computing the block step size scaling value based on contextual metadata ([0115] Trellis Coded Quantization (TCQ) using a significance map (or greater than 1 or 2 flags) using a parity of a partial set of syntax elements, deriving the state machine based on a parity of the number of nonzero coefficients in a neighborhood of coefficient that is being coded; [0120] TCQ using a significance map to determine contexts for context encoding values of syntax elements, such as significant coefficient flags, greater than 1 flags, greater than 2 flags, or the like).
Therefore, it would have been obvious to one ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of step size scaling value based on contextual metadata as taught by Coban ([0120]) into the encoding & decoding system of Karczewicz in order to enable achieving switching between context sets by changing the parity of the level of the previous coefficients so as to minimize residual differential (RD) cost and improve a computation efficiency of a video encoder and/or a video decoder (Coban, [0173]).
Regarding Claim 2, Karczewicz in view of Coban discloses the computer-implemented method of claim 1, Karczewicz discloses wherein a reconstruction value for a first quantization index included in the vector of quantization indices comprises an integer multiple of either the first quantizer step size or the second quantizer step size ([0074] FIG. 6, using two scalar quantizers in quantization level mapping 600: first quantizer Q0 maps the transform coefficient levels, also called quantization levels, to even integer multiples of the quantization step size Δ. The second quantizer Q1 maps the transform coefficient levels to odd integer multiples of quantization step size Δ or to zero; [0088] FIG. 8, two scalar quantizers used: the first quantizer Q0′ and the second quantizer Q1′).
Regarding Claim 3, Karczewicz in view of Coban discloses the computer-implemented method of claim 1, Karczewicz discloses wherein the first quantizer step size is further computed based on a first scalar quantization step size ([0076], FIG. 7, Coefficients in states 0 and 1 use the Q0 (even integer multiples of step size) quantizer. Coefficients in states 2 and 3 use Q1 (odd integer multiples of step size) quantizer. That is, video encoder 200 and video decoder 300 may quantize or inverse-quantize, as appliable, coefficients using quantizer Q0 (e.g., even integer multiples of step size Δ) if the state of state machine 700 is 0 or 1. Video encoder 200 and video decoder 300 may quantize or inverse-quantize, as appliable, coefficients using quantizer Q1 (e.g., odd integer multiples of step size Δ) if the state of state machine 700 is 2 or 3).
Regarding Claim 5, Karczewicz in view of Coban discloses the computer-implemented method of claim 1, Karczewicz discloses wherein the second quantizer step size is further computed based on a second scalar quantization step size ([0076], FIG. 7, Coefficients in states 0 and 1 use the Q0 (even integer multiples of step size) quantizer. Coefficients in states 2 and 3 use Q1 (odd integer multiples of step size) quantizer. That is, video encoder 200 and video decoder 300 may quantize or inverse-quantize, as appliable, coefficients using quantizer Q0 (e.g., even integer multiples of step size Δ) if the state of state machine 700 is 0 or 1. Video encoder 200 and video decoder 300 may quantize or inverse-quantize, as appliable, coefficients using quantizer Q1 (e.g., odd integer multiples of step size Δ) if the state of state machine 700 is 2 or 3).
Regarding Claim 8, Karczewicz in view of Coban discloses the computer-implemented method of claim 1, Coban discloses further comprising selecting a default step size scaling value included in the contextual metadata based on a step size scaling granularity ([0115] Trellis Coded Quantization (TCQ) using a significance map (or greater than 1 or 2 flags) using a parity of a partial set of syntax elements, deriving the state machine based on a parity of the number of nonzero coefficients in a neighborhood of coefficient that is being coded; [0120] TCQ using a significance map to determine contexts for context encoding values of syntax elements, such as significant coefficient flags, greater than 1 flags, greater than 2 flags, or the like). The same reason or rational of obviousness motivation applied as used above in claim 1.
Regarding Claim 9, Karczewicz in view of Coban discloses the computer-implemented method of claim 8, Karczewicz discloses wherein the block step size scaling value is further computed based on the default step size scaling value ([0076], FIG. 7, Coefficients in states 0 and 1 use the Q0 (even integer multiples of step size) quantizer. Coefficients in states 2 and 3 use Q1 (odd integer multiples of step size) quantizer. That is, video encoder 200 and video decoder 300 may quantize or inverse-quantize, as appliable, coefficients using quantizer Q0 (e.g., even integer multiples of step size Δ) if the state of state machine 700 is 0 or 1. Video encoder 200 and video decoder 300 may quantize or inverse-quantize, as appliable, coefficients using quantizer Q1 (e.g., odd integer multiples of step size Δ) if the state of state machine 700 is 2 or 3).
Regarding Claim 10, Karczewicz in view of Coban discloses the computer-implemented method of claim 8, Coban discloses wherein the contextual metadata includes at least one of a coding plane type, a frame type, a slice type, a position within a prediction structure, a block type, a size type, one or more transform coefficient energy levels, a scalar quantization step size, or a transform coefficient position within a transform block ([0115] Trellis Coded Quantization (TCQ) using a significance map (or greater than 1 or 2 flags) using a parity of a partial set of syntax elements, deriving the state machine based on a parity of the number of nonzero coefficients in a neighborhood of coefficient that is being coded; [0120] TCQ using a significance map to determine contexts for context encoding values of syntax elements, such as significant coefficient flags, greater than 1 flags, greater than 2 flags, or the like). The same reason or rational of obviousness motivation applied as used above in claim 1.
Regarding Claims 11-15 & 17-19, computer-readable media claims 11-15 & 17-19 of using the corresponding method claimed in claims1-3, 5, and 8-10, and the rejections of which are incorporated herein for the same reasons as used above.
Regarding Claim 20, computer system claim 20 of using the corresponding method claimed in claim 1, and the rejections of which are incorporated herein for the same reasons as used above.
Claims 4, 6-7 & 16 are rejected under 35 U.S.C. 103 as being unpatentable over Karczewicz et al. (US 20240414339, hereinafter Karczewicz) in view of Coban et al. (US 20190387259, hereinafter Coban) and Chen et al. (US 20210400276, hereinafter Chen)
Regarding Claim 4, Karczewicz in view of Coban discloses the computer-implemented method of claim 3, but does not explicitly disclose wherein the first scalar quantization step size comprises a scalar quantization AC quantizer step size.
Chen teaches wherein the first scalar quantization step size comprises a scalar quantization AC quantizer step size ([0071] At least one embodiment can include deactivating dependent scalar quantization for transform coefficients located in the high frequency regions, wherein the value of QStateTransTable might be set based on the position of the sub-block, which can also be called “coefficient group (CG)”. Then, one can apply a variant such as the following: [0072] only activate dependent scalar quantization for the first sub-block, which contains the DC level; or [0073] only activate dependent scalar quantization for the first sub-block and one or more additional sub-blocks located in the top-left of the coding block, which contain the DC level and low frequency coefficients. The number of sub-blocks in which dependent scalar quantization is applied (e.g., referred to hereinafter as a parameter or value named “DSQSwitchPoint”) can be one predefined value, or a value DSQSwitchPoint, which depends on a factor such as the size of the coding block (width and height)).
Therefore, it would have been obvious to one ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of quantizer step size comprises a trellis coded quantization AC as taught by Chen ([0072]) into the encoding & decoding system of Karczewicz & Coban in order to save encoding complexity, in particular with computation of an approximated distortion based on the prediction or the prediction residual signal (Chen, [0067]).
Regarding Claim 6, Karczewicz in view of Coban discloses the computer-implemented method of claim 5, but does not explicitly disclose wherein the second scalar quantization step size comprises a scalar quantization DC quantizer step size.
Chen teaches wherein the second scalar quantization step size comprises a scalar quantization DC quantizer step size ([0071] At least one embodiment can include deactivating dependent scalar quantization for transform coefficients located in the high frequency regions, wherein the value of QStateTransTable might be set based on the position of the sub-block, which can also be called “coefficient group (CG)”. Then, one can apply a variant such as the following: [0072] only activate dependent scalar quantization for the first sub-block, which contains the DC level; or [0073] only activate dependent scalar quantization for the first sub-block and one or more additional sub-blocks located in the top-left of the coding block, which contain the DC level and low frequency coefficients. The number of sub-blocks in which dependent scalar quantization is applied (e.g., referred to hereinafter as a parameter or value named “DSQSwitchPoint”) can be one predefined value, or a value DSQSwitchPoint, which depends on a factor such as the size of the coding block (width and height)).
Therefore, it would have been obvious to one ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of quantizer step size comprises a trellis coded quantization AC as taught by Chen ([0072]) into the encoding & decoding system of Karczewicz & Coban in order to save encoding complexity, in particular with computation of an approximated distortion based on the prediction or the prediction residual signal (Chen, [0067]).
Regarding Claim 7, Karczewicz in view of Coban discloses the computer-implemented method of claim 1, but does not explicitly disclose wherein the first quantizer step size comprises a trellis coded quantization AC quantizer step size, and the second quantizer step size comprises a trellis coded quantization DC quantizer step size.
Chen teaches wherein the first quantizer step size comprises a trellis coded quantization AC quantizer step size, and the second quantizer step size comprises a trellis coded quantization DC quantizer step size ([0071] At least one embodiment can include deactivating dependent scalar quantization for transform coefficients located in the high frequency regions, wherein the value of QStateTransTable might be set based on the position of the sub-block, which can also be called “coefficient group (CG)”. Then, one can apply a variant such as the following: [0072] only activate dependent scalar quantization for the first sub-block, which contains the DC level; or [0073] only activate dependent scalar quantization for the first sub-block and one or more additional sub-blocks located in the top-left of the coding block, which contain the DC level and low frequency coefficients. The number of sub-blocks in which dependent scalar quantization is applied (e.g., referred to hereinafter as a parameter or value named “DSQSwitchPoint”) can be one predefined value, or a value DSQSwitchPoint, which depends on a factor such as the size of the coding block (width and height)).
Therefore, it would have been obvious to one ordinary skill in the art before the effective filing date of the claimed invention to modify the teachings of quantizer step size comprises a trellis coded quantization AC as taught by Chen ([0072]) into the encoding & decoding system of Karczewicz & Coban in order to save encoding complexity, in particular with computation of an approximated distortion based on the prediction or the prediction residual signal (Chen, [0067]).
Regarding Claim 16, computer-readable media claim 16 of using the corresponding method claimed in claim 7, and the rejections of which are incorporated herein for the same reasons as used above.
Conclusion
THIS ACTION IS MADE FINAL. Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a).
A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action.
Any inquiry concerning this communication or earlier communications from the examiner should be directed to Samuel D Fereja whose telephone number is (469)295-9243. The examiner can normally be reached 8AM-5PM.
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, DAVID CZEKAJ can be reached at (571) 272-7327. 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.
/SAMUEL D FEREJA/Primary Examiner, Art Unit 2487
Prosecution Insights