Prosecution Insights
Last updated: October 02, 2026
Application No. 19/276,823

TRANSFORM-BASED VIDEO CODING METHOD, AND DEVICE THEREFOR

Non-Final OA §DP
Filed
Jul 22, 2025
Priority
Sep 21, 2019 — provisional 62/903,824 +4 more
Examiner
CARTER, RICHARD BRUCE
Art Unit
Tech Center
Assignee
LG Electronics Inc.
OA Round
1 (Non-Final)
65%
Grant Probability
Favorable
1-2
OA Rounds
2y 2m
Est. Remaining
84%
With Interview

Examiner Intelligence

Grants 65% — above average
65%
Career Allowance Rate
305 granted / 468 resolved
+5.2% vs TC avg
Strong +19% interview lift
Without
With
+19.2%
Interview Lift
resolved cases with interview
Typical timeline
3y 4m
Avg Prosecution
15 currently pending
Career history
474
Total Applications
across all art units

Statute-Specific Performance

§101
4.3%
-35.7% vs TC avg
§103
64.8%
+24.8% vs TC avg
§102
8.8%
-31.2% vs TC avg
§112
8.9%
-31.1% vs TC avg
Black line = Tech Center average estimate • Based on career data from 468 resolved cases

Office Action

§DP
DETAILED ACTION This action is in response to application 19/276,823 filed on 07/22/2025. 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 . Double Patenting 3. 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 obviousness-type 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); and 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 a nonstatutory double patenting ground provided the conflicting application or patent either is shown to be commonly owned with this application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. Effective January 1, 1994, a registered attorney or agent of record may sign a terminal disclaimer. A terminal disclaimer signed by the assignee must fully comply with 37 CFR 3.73(b). 4. Claims 1-3 are rejected on the ground of nonstatutory obviousness-type double patenting as being unpatentable over claims 1-3 of U.S. Patent No. 12,389,038 B2 in view of Zhao et al. (US Pub. No.: 2020/0389666 A1). Furthermore, although the conflicting claims at issue are not identical, they are not patentably distinct from each other because U.S. Patent No.: 12,389,038 B2 claims: Instant Application: 19/276,823 Note: bold and underlined fonts means same features between instant application and conflicting appl. Conflicting Application: 18/648,306 → now US Patent No.: 12,389,038 B2 Claim [1]: An image decoding method performed by a decoding apparatus, the method comprising: receiving information on quantized transform coefficients and prediction-related information from a bitstream; deriving quantized transform coefficients for a current block based on the information on the quantized transform coefficients; deriving transform coefficients for the current block by performing a dequantization on the quantized transform coefficients; deriving modified transform coefficients by applying a low-frequency non-separable transform (LFNST) to the transform coefficients based on an LFNST matrix related to an LFNST index; deriving residual samples for the current block by applying an inverse primary transform on the modified transform coefficients; deriving prediction samples for the current block based on the prediction-related information; and generating a reconstructed picture based on the residual samples and the prediction samples, wherein in a case a tree-type of the current block is a dual-tree chroma, based on a height and a width of a chroma component block for the current block being equal to 4 or more, the LFNST index is parsed, and wherein the height and the width of the chroma component block for the current block is determined based on a color format of the current block. Claim [1]: An image decoding method performed by a decoding apparatus, the method comprising: receiving information on quantized transform coefficients from a bitstream; deriving quantized transform coefficients for a current block based on the information on the quantized transform coefficients; deriving transform coefficients for the current block by performing a dequantization on the quantized transform coefficients; deriving modified transform coefficients by applying a low-frequency non-separable transform (LFNST) to the transform coefficients based on an LFNST matrix related to an LFNST index; deriving residual samples for the current block by applying an inverse primary transform on the modified transform coefficients; and generating a reconstructed picture based on the residual samples, wherein in a case a tree-type of the current block is a dual-tree chroma, based on a height and a width of a chroma component block for the current block being equal to 4 or more, the LFNST index is parsed, and wherein the height and the width of the chroma component block for the current block is determined based on a color format of the current block. Claim [2]: An image encoding method performed by an encoding apparatus, the method comprising: deriving prediction samples for a current block; generating prediction-related information based on the prediction samples; deriving residual samples for the current block based on the prediction samples; deriving transform coefficients for the current block based on a primary transform for the residual samples; deriving modified transform coefficients from the transform coefficients based on a low-frequency non-separable transform (LFNST) matrix for an LFNST; deriving quantized transform coefficients for the current block by performing a quantization on the modified transform coefficients; and encoding information on the quantized transform coefficients, an LFNST index related to the LFNST matrix and the prediction-related information, wherein in a case a tree-type of the current block is a dual-tree chroma, based on a height and a width of a chroma component block for the current block being equal to 4 or more, the LFNST index is encoded, and wherein the height and the width of the chroma component block for the current block is determined based on a color format of the current block. Claim [2]: An image encoding method performed by an encoding apparatus, the method comprising: deriving prediction samples for a current block; deriving residual samples for the current block based on the prediction samples; deriving transform coefficients for the current block based on a primary transform for the residual samples; deriving modified transform coefficients from the transform coefficients based on a low-frequency non-separable transform (LFNST) matrix for an LFNST; deriving quantized transform coefficients for the current block by performing a quantization on the modified transform coefficients; and encoding information on the quantized transform coefficients and an LFNST index related to the LFNST matrix, wherein in a case a tree-type of the current block is a dual-tree chroma, based on a height and a width of a chroma component block for the current block being equal to 4 or more, the LFNST index is encoded, and wherein the height and the width of the chroma component block for the current block is determined based on a color format of the current block. Claim [3]: A transmission method of data for an image, the method comprising: obtaining a bitstream for the image, wherein the bitstream is generated based on deriving prediction samples for a current block, generating prediction-related information based on the prediction samples, deriving residual samples for the current block based on the prediction samples, deriving transform coefficients for the current block based on a primary transform for the residual samples, deriving modified transform coefficients from the transform coefficients based on a low-frequency non-separable transform (LFNST) matrix for an LFNST, deriving quantized transform coefficients for the current block by performing a quantization on the modified transform coefficients, and encoding information on the quantized transform coefficients, an LFNST index related to the LFNST matrix and the prediction-related information; and transmitting the data comprising the bitstream, wherein in a case a tree-type of the current block is a dual-tree chroma, based on a height and a width of a chroma component block for the current block being equal to 4 or more, the LFNST index is encoded, and wherein the height and the width of the chroma component block for the current block is determined based on a color format of the current block. Claim [3]: A transmission method of data for an image, the method comprising: obtaining a bitstream for the image, wherein the bitstream is generated based on deriving prediction samples for a current block, deriving residual samples for the current block based on the prediction samples, deriving transform coefficients for the current block based on a primary transform for the residual samples, deriving modified transform coefficients from the transform coefficients based on a low-frequency non-separable transform (LFNST) matrix for an LFNST, deriving quantized transform coefficients for the current block by performing a quantization on the modified transform coefficients, and encoding information on the quantized transform coefficients and an LFNST index related to the LFNST matrix; and transmitting the data comprising the bitstream, wherein in a case a tree-type of the current block is a dual-tree chroma, based on a height and a width of a chroma component block for the current block being equal to 4 or more, the LFNST index is encoded, and wherein the height and the width of the chroma component block for the current block is determined based on a color format of the current block. However, examiner notes that Zhao et al. (US Pub. No.: 2020/0389666 A1) teaches the unique limitations in the instant application regarding Zhao discloses an image decoding and encoding method (see abstract, fig. 16), performed by a decoding (see fig. 7) and encoding apparatus (see fig. 6) and a transmission method of data for an image (see fig. 2 and/or fig. 5) comprising: receiving information (see fig. 6 unit 623 or unit 628, paragraph [0109], e.g., “residue information”) from a bitstream (see paragraph [0109], e.g., “bitstream”); deriving residual samples (see paragraphs [0072] and [0208]) for the current block (see fig. 1C unit 111); deriving transform coefficients (see paragraph [0197]) for a current block (see fig. 1C unit 111); deriving modified transform coefficients (see paragraph [0170], e.g., “modified coefficient coding scheme”) by applying a low-frequency non-separable transform LFNST to the transform coefficients (see paragraph [0167]) based on an LFNST matrix (see paragraphs [0225-0226]) related to an LFNST index (see paragraph [0154]); deriving residual samples (see paragraphs [0072] and [0208]) for the current block (see fig. 1C unit 111) by applying an inverse primary transform (see fig. 9, e.g. “inverse primary transform”) on the modified transform coefficients (see paragraph [0170], e.g. “modified coefficient coding scheme”). Therefore, it 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 could recognize the advantage of providing a transform-based video coding method and device by modifying Koo’s teachings in the present US Patent No.: 12,389,038 B2 for the purpose of wherein in a case a tree-type of the current block is a dual-tree chroma, based on a height and a width of a chroma component block for the current block being equal to 4 or more, the LFNST index is parsed, thereby improving video compression efficiency. Allowable Subject Matter 5. The following is a statement of reasons for the indication of allowable subject matter: Claims 1-3 of the instant application would be allowable provided obviousness type double patenting rejection above is overcome. Conclusion 6. The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Zhao et al. (US Pub. No.: 2022/0053214 A1) discloses method and apparatus for video coding. Egilmez et al. (US Pub. No.: 2021/0099702 A1) discloses low-frequency non-separable transform (LFNST) simplifications. 7. Any inquiry concerning this communication or earlier communications from the examiner should be directed to Richard Carter whose telephone number is (571)270-1220. The examiner can normally be reached on M-F 8:30 am - 5:00 pm. 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 on 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 an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /R.B.C/Examiner, Art Unit 2485 /JAYANTI K PATEL/Supervisory Patent Examiner, Art Unit 2485 September 16, 2026
Read full office action

Prosecution Timeline

Jul 22, 2025
Application Filed
Sep 18, 2026
Non-Final Rejection mailed — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12750485
IMAGE CODING METHOD AND APPARATUS THEREFOR
2y 9m to grant Granted Sep 29, 2026
Patent 12750487
IMAGE ENCODING/DECODING METHOD AND DEVICE, AND RECORDING MEDIUM HAVING BITSTREAM STORED THEREON
2y 3m to grant Granted Sep 29, 2026
Patent 12750479
ENCODER, DECODER AND METHODS FOR CODING A PICTURE USING A SOFT CLASSIFICATION
2y 1m to grant Granted Sep 29, 2026
Patent 12744932
IMAGE ENCODING/DECODING METHOD AND DEVICE FOR ADAPTIVELY CHANGING RESOLUTION, AND METHOD FOR TRANSMITTING BITSTREAM
2y 5m to grant Granted Sep 22, 2026
Patent 12739383
IMAGE ENCODING AND DECODING, VIDEO ENCODING AND DECODING: METHODS, SYSTEMS AND TRAINING METHODS
2y 10m to grant Granted Sep 15, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
65%
Grant Probability
84%
With Interview (+19.2%)
3y 4m (~2y 2m remaining)
Median Time to Grant
Low
PTA Risk
Based on 468 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month