Prosecution Insights
Last updated: July 17, 2026
Application No. 19/009,891

METHODS AND APPARATUS ON CHROMA MOTION COMPENSATION USING ADAPTIVE CROSS-COMPONENT FILTERING

Non-Final OA §102§112
Filed
Jan 03, 2025
Priority
Jul 05, 2022 — provisional 63/358,524 +1 more
Examiner
HASAN, MAINUL
Art Unit
2485
Tech Center
2400 — Computer Networks
Assignee
Beijing Dajia Internet Information Technology Co., Ltd.
OA Round
1 (Non-Final)
76%
Grant Probability
Favorable
1-2
OA Rounds
10m
Est. Remaining
99%
With Interview

Examiner Intelligence

Grants 76% — above average
76%
Career Allowance Rate
349 granted / 462 resolved
+17.5% vs TC avg
Strong +24% interview lift
Without
With
+23.7%
Interview Lift
resolved cases with interview
Typical timeline
2y 5m
Avg Prosecution
10 currently pending
Career history
476
Total Applications
across all art units

Statute-Specific Performance

§101
2.0%
-38.0% vs TC avg
§103
74.4%
+34.4% vs TC avg
§102
13.5%
-26.5% vs TC avg
§112
4.2%
-35.8% vs TC avg
Black line = Tech Center average estimate • Based on career data from 462 resolved cases

Office Action

§102 §112
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 . In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. Response to Preliminary Amendment The Examiner acknowledges the preliminary amendments to the claim and specification dated 02/07/2025 and enters for consideration. No new claims have been added nor any claims cancelled. Claims 1-20 remain pending in the current application. Specification Applicant is reminded of the proper language and format for an abstract of the disclosure. The abstract should be in narrative form and generally limited to a single paragraph on a separate sheet within the range of 50 to 150 words in length. The abstract should describe the disclosure sufficiently to assist readers in deciding whether there is a need for consulting the full patent text for details. The language should be clear and concise and should not repeat information given in the title. It should avoid using phrases which can be implied, such as, “The disclosure concerns,” “The disclosure defined by this invention,” “The disclosure describes,” etc. In addition, the form and legal phraseology often used in patent claims, such as “means” and “said,” should be avoided. There are two abstracts both dated 01/03/2025, one of which has a random line portion of a claim and the other has both the abstract as well as random portions of the claims. This needs to be corrected as per the instructions above. There are also multiple copies of specifications dated 01/03/2025 (2 copies) and 02/07/2025 (2 copies). It is not clear which one is the correct one. This needs to be corrected as per the instructions above. Claim Rejections - 35 USC § 112 The following is a quotation of 35 U.S.C. 112(b): (B) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention. The following is a quotation of 35 U.S.C. 112, second paragraph: The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention. Claims 8 and 19 are rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor (or for applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention. Claim 8 recites “the method of claim 7, wherein the same channel is a luma channel, or a chroma channel”. But claim 8 is dependent on claim 7 where it recites “wherein the first channel is a chroma channel, and the second channel is a luma channel, or the first channel and the second channel are a same channel.” Because of the “or” term, with BRI, if “the first channel is a chroma channel, and the second channel is a luma channel” according to claim 7, then claim 8 becomes indefinite. Claim 19 recites “A computer-readable storage medium, storing a bitstream to be decoded by the method for video decoding of an inter coding block according to claim 1”. Claim 19 is directed to a non-transitory storage medium storing a bitstream of a video wherein clauses that appear to describe how the bitstream is generated. These elements or steps are not performed by an intended computer, and the bitstream is not a form of programming that causes functions to be performed by an intended computer. This shows that the computer-readable medium merely serves as support for storing the bitstream and provides no functional relationship between the steps/elements that describe the generation of the bitstream and intended computer system. Therefore, those claim elements are not given patentable weight. Patentable weight is given to data stored on a computer-readable medium when there exists a functional relationship between the data and its associated substrate. See MPEP 2111.05 III. For example, if a claim is drawn to a computer-readable medium containing programming, a functional relationship exists if the programming “performs some function with respect to the computer with which it is associated.” However, if the claim recites that the computer-readable medium merely serves as a storage for information or data that is not meant for being executed, no functional relationship exists and the information or data is not given patentable weight. The Examiner suggests that the claim be amended so that it is directed to a functional relationship. For example, in this particular case, the claim should instead be recited as “A method of storing a bitstream into a non-transitory computer-readable storage medium, wherein the bitstream is to be decoded by a method, comprising:”, followed by functional steps of decoding the bitstream and a step to store the decoded bitstream into a non-transitory computer-readable storage medium. Claim Rejections - 35 USC § 102 The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale or otherwise available to the public before the effective filing date of the claimed invention. Claims 1-4, 7-14, 17-20 are rejected under AIA 35 U.S.C. 102(a)(1) as being anticipated by Du et al. (US PGPub 2021/0250597 A1). Regarding claim 1 (Original), Du et al. teach a method for video decoding of an inter coding block (Fig. 5, reference numeral 553), comprising: obtaining, by a decoder, a plurality of first motion compensated samples of a first channel ([0066]; Fig. 5 shows that the coded video sequence may be received by the decoder from a channel (501), where the channel could be two chroma channels (first channel) as described in [0157], where the chroma motion compensated samples are shown to be the outputs 1512 and 1514 in Fig. 15. The first channel information is fed into the MCP (Motion Compensation Predictor) 553. It is to be noted that Fig. 15 is the detailed view of reference numeral 556 of Fig. 5) and a plurality of second motion compensated samples of a second channel for a current inter coding block ([0066]; Fig. 5 shows that the coded video sequence may be received by the decoder from a channel (501), where the channel could be a luma channel (second channel) as described in [0157], where the luma motion compensated samples are shown to be the outputs of 1541 in Fig. 15. The second channel information is fed into the MCP (Motion Compensation Predictor) 553); obtaining, by the decoder, a non-linear filter ([0137]-[0138]; it teaches a non-liner ALF filtering process where a multiple sets of clipping values can be provided as shown in Table 3 for luma and chroma components); and obtaining, by the decoder, a plurality of filtered motion compensated samples of the first channel (Fig. 15 reference numerals 1552, 1553 are the filtered motion compensated samples of the first channel (chroma)) based on the non-linear filter (Fig. 15 shows the non-linear filters in 1518), the plurality of first motion compensated samples of the first channel (Fig. 15, two chroma inputs to the reference numeral 1518), and the plurality of second motion compensated samples of the second channel (Fig. 15, two luma inputs to the reference numerals 1521, 1531). Regarding claim 2 (Original), Du et al. teach the method of claim 1, wherein obtaining the plurality of filtered motion compensated samples of the first channel comprises: obtaining, by the decoder, a plurality of refinements of the first channel by applying the non-linear filter to the plurality of second motion compensated samples of the second channel (Fig. 15, reference numerals 1521, 1531 represent the non-linear filter applied to the luma (second channel) motion compensated samples 1541 to obtain two refinements of the luma channel 1542, 1543); and obtaining, by the decoder, the plurality of filtered motion compensated samples of the first channel based on the plurality of refinements and the plurality of first motion compensated samples of the first channel (Fig. 15, reference numerals 1562, 1563 are the filtered motion compensated samples of the chroma (first channel) obtained from the above two refinements 1542, 1543 and chroma (first channel) motion compensated samples 1552, 1553). Regarding claim 3 (Original), Du et al. teach the method of claim 1, wherein coefficients of the non-linear filter comprise any one or any combination of a linear coefficient, an offset ([0219]), or a non-linear coefficient ([0137]; Eq. 13 shows filter coefficients f(k,l) in the non-linear ALF filtering process). Regarding claim 4 (Original), Du et al. teach the method of claim 1, wherein obtaining the non-linear filter comprises: deriving coefficients of the non-linear filter based on motion information of the current inter coding block, first neighboring reconstructed samples of the first channel and second neighboring reconstructed samples of the second channel (In [0199], it teaches that for each block of the current frame, a corresponding block in the temporal source frame can be identified based on the motion information and then the reconstructed samples of the corresponding block can be used as the source of CCF for the block, whereas in [0032], it teaches that the processing circuitry determines filter coefficients based on at least the reconstructed samples of the temporal source frame, wherein a weighted sum of luma (second channel) and chroma (first channel) components of the I-frame with lower QP value than the current frame can be used as the temporal source frame as described in [0196], L16-19). Regarding claim 7 (Original), Du et al. teach the method of claim 1, wherein the first channel is a chroma channel ([0066]; Fig. 5 shows that the coded video sequence may be received by the decoder from a channel (501), where the channel could be two chroma channels (first channel) as described in [0157]), and the second channel is a luma channel ([0066]; Fig. 5 shows that the coded video sequence may be received by the decoder from a channel (501), where the channel could be a luma channel (second channel) as described in [0157]), or the first channel and the second channel are a same channel. Regarding claim 8 (Original), Du et al. teach the method of claim 7, wherein the same channel is a luma channel, or a chroma channel ([0066]; Fig. 5 shows that the coded video sequence may be received by the decoder from a channel (501), where the channel could be two chroma channels (first channel) as described in [0157]). Regarding claim 9 (Original), Du et al. teach the method of claim 1, further comprising: receiving, by the decoder, one or more filter coefficients of the non-linear filter signaled by an encoder ([0032]; It teaches that the processing circuitry determines filter coefficients based on at least the reconstructed samples of the temporal source frame, and encodes information of the filter coefficients in a coded video bitstream), wherein the one or more filter coefficients are signaled at a specific level ([0133]; it teaches that the filtering process can be controlled at one or more suitable levels). Regarding claim 10 (Original), Du et al. teach the method of claim 9, wherein the specific level comprises one of following levels: a sequence level, a picture level, or a block level ([0133]; it teaches that the filtering process can be controlled at one or more suitable levels, such as a picture level, a slice level, a CTB level, and/or the like). Regarding claim 11 (Original), Du et al. teach an apparatus, comprising: one or more processors (Fig. 22, reference numeral 2241); and a memory coupled to the one or more processors (Fig. 22, reference numerals 2245, 2246) and configured to store instructions executable by the one or more processors ([0194], L10-13), wherein the one or more processors, upon execution of the instructions ([0194], L10-13), are configured to perform a method comprising: obtaining a plurality of first motion compensated samples of a first channel ([0066]; Fig. 5 shows that the coded video sequence may be received by the decoder from a channel (501), where the channel could be two chroma channels (first channel) as described in [0157], where the chroma motion compensated samples are shown to be the outputs 1512 and 1514 in Fig. 15. The first channel information is fed into the MCP (Motion Compensation Predictor) 553. It is to be noted that Fig. 15 is the detailed view of reference numeral 556 of Fig. 5) and a plurality of second motion compensated samples of a second channel for a current inter coding block ([0066]; Fig. 5 shows that the coded video sequence may be received by the decoder from a channel (501), where the channel could be a luma channel (second channel) as described in [0157], where the luma motion compensated samples are shown to be the outputs of 1541 in Fig. 15. The second channel information is fed into the MCP (Motion Compensation Predictor) 553); obtaining a non-linear filter ([0137]-[0138]; it teaches a non-liner ALF filtering process where a multiple sets of clipping values can be provided as shown in Table 3 for luma and chroma components); and obtaining a plurality of filtered motion compensated samples of the first channel (Fig. 15 reference numerals 1552, 1553 are the filtered motion compensated samples of the first channel (chroma)) based on the non-linear filter (Fig. 15 shows the non-linear filters in 1518), the plurality of first motion compensated samples of the first channel (Fig. 15, two chroma inputs to the reference numeral 1518), and the plurality of second motion compensated samples of the second channel (Fig. 15, two luma inputs to the reference numerals 1521, 1531). Regarding claim 12 (Original), Du et al. teach the apparatus of claim 11, wherein obtaining the plurality of filtered motion compensated samples of the first channel comprises: obtaining a plurality of refinements of the first channel by applying the non-linear filter to the plurality of second motion compensated samples of the second channel (Fig. 15, reference numerals 1521, 1531 represent the non-linear filter applied to the luma (second channel) motion compensated samples 1541 to obtain two refinements of the luma channel 1542, 1543); and obtaining the plurality of filtered motion compensated samples of the first channel based on the plurality of refinements and the plurality of first motion compensated samples of the first channel (Fig. 15, reference numerals 1562, 1563 are the filtered motion compensated samples of the chroma (first channel) obtained from the above two refinements 1542, 1543 and chroma (first channel) motion compensated samples 1552, 1553). Regarding claim 13 (Original), Du et al. teach the apparatus of claim 11, wherein coefficients of the non-linear filter comprise any one or any combination of a linear coefficient, an offset ([0219]), or a non-linear coefficient ([0137]; Eq. 13 shows filter coefficients f(k,l) in the non-linear ALF filtering process). Regarding claim 14 (Original), Du et al. teach the apparatus of claim 11, wherein obtaining the non-linear filter comprises: deriving coefficients of the non-linear filter based on motion information of the current inter coding block, first neighboring reconstructed samples of the first channel and second neighboring reconstructed samples of the second channel (In [0199], it teaches that for each block of the current frame, a corresponding block in the temporal source frame can be identified based on the motion information and then the reconstructed samples of the corresponding block can be used as the source of CCF for the block, whereas in [0032], it teaches that the processing circuitry determines filter coefficients based on at least the reconstructed samples of the temporal source frame, wherein a weighted sum of luma (second channel) and chroma (first channel) components of the I-frame with lower QP value than the current frame can be used as the temporal source frame as described in [0196], L16-19). Regarding claim 17 (Original), Du et al. teach the apparatus of claim 11, wherein the first channel is a chroma channel ([0066]; Fig. 5 shows that the coded video sequence may be received by the decoder from a channel (501), where the channel could be two chroma channels (first channel) as described in [0157]), and the second channel is a luma channel ([0066]; Fig. 5 shows that the coded video sequence may be received by the decoder from a channel (501), where the channel could be a luma channel (second channel) as described in [0157]), or the first channel and the second channel are a same channel, wherein the same channel is a luma channel, or a chroma channel. Regarding claim 18 (Original), Du et al. teach the apparatus of claim 11, wherein the method further comprises: receiving one or more filter coefficients of the non-linear filter signaled by an encoder ([0032]; It teaches that the processing circuitry determines filter coefficients based on at least the reconstructed samples of the temporal source frame, and encodes information of the filter coefficients in a coded video bitstream), wherein the one or more filter coefficients are signaled at a specific level ([0133]; it teaches that the filtering process can be controlled at one or more suitable levels, such as a picture level, a slice level, a CTB level, and/or the like). Regarding claim 19 (Original), Du et al. teach a computer-readable storage medium, storing a bitstream (Fig. 22, reference numerals 2245, 2246, 2247) to be decoded by the method for video decoding of an inter coding block according to claim 1 (See rejection citations for claim 1 above). Regarding claim 20 (Original), Du et al. teach a method for storing a bitstream, comprising: performing an encoding method to generate a bitstream (Fig. 6); and storing the bitstream on a computer readable storage medium (Fig. 22, reference numeral 2245, 2246, 2247), wherein the encoding method comprises: obtaining a plurality of first motion compensated samples of a first channel ([0066]; Fig. 5 shows that the coded video sequence may be received by the decoder from a channel (501), where the channel could be two chroma channels (first channel) as described in [0157], where the chroma motion compensated samples are shown to be the outputs 1512 and 1514 in Fig. 15. The first channel information is fed into the MCP (Motion Compensation Predictor) 553. It is to be noted that Fig. 15 is the detailed view of reference numeral 556 of Fig. 5) and a plurality of second motion compensated samples of a second channel for a current inter coding block ([0066]; Fig. 5 shows that the coded video sequence may be received by the decoder from a channel (501), where the channel could be a luma channel (second channel) as described in [0157], where the luma motion compensated samples are shown to be the outputs of 1541 in Fig. 15. The second channel information is fed into the MCP (Motion Compensation Predictor) 553); obtaining a non-linear filter ([0137]-[0138]; it teaches a non-liner ALF filtering process where a multiple sets of clipping values can be provided as shown in Table 3 for luma and chroma components); and obtaining a plurality of filtered motion compensated samples of the first channel (Fig. 15 reference numerals 1552, 1553 are the filtered motion compensated samples of the first channel (chroma)) based on the non-linear filter (Fig. 15 shows the non-linear filters in 1518), the plurality of first motion compensated samples of the first channel (Fig. 15, two chroma inputs to the reference numeral 1518), and the plurality of second motion compensated samples of the second channel (Fig. 15, two luma inputs to the reference numerals 1521, 1531). Claim 19 is rejected under AIA 35 U.S.C. 102(a)(1) as being anticipated by Zhang et al. (US PGPub 2016/0277762 A1). Claim 19’s recitation of “A computer-readable storage medium, storing a bitstream to be decoded by the method for video decoding of an inter coding block according to claim 1” is a product by process claim limitation where the product is the bit stream and the process is the method steps to generate the bitstream. MPEP §2113 recites “Product-by-Process claims are not limited to the manipulations of the recited steps, only the structure implied by the steps”. Thus, the scope of the claim is the storage medium storing the bitstream (with the structure implied by the method steps). The structure includes the information and samples manipulated by the steps. “To be given patentable weight, the printed matter and associated product must be in a functional relationship. A functional relationship can be found where the printed matter performs some function with respect to the product to which it is associated”. MPEP §2111.05(1)(A). When a claimed “computer-readable medium merely serves as a support for information or data, no functional relationship exists. MPEP §2111.05(III). The storage medium storing the claimed bitstream in claim 15 merely services as a support for the storage of the bitstream and provides no functional relationship between the stored bitstream and storage medium. Therefore, the structure bitstream, whose scope is implied by the method steps, is non-functional descriptive material and given no patentable weight. MPEP §2111.05(III). Thus, the claim scope is just a storage medium storing data and is anticipated by Zhang et al. which recites a storage medium storing a bitstream ([0151]). Allowable Subject Matter Claims 5-6, 15-16 are objected to as being dependent upon a rejected base claim, but would be allowable if rewritten in independent form including all of the limitations of the base claim and any intervening claims. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. “FILTER SHAPE FOR SAMPLE OFFSET” – Du et al., US PGPub 2025/0337896 A1. “METHODS AND APPARATUSES FOR ENCODING/DECODING A VIDEO” – Bordes et al., US PGPub 2024/0323367 A1. “SIGNALING OF CROSS-COMPONENT ADAPTIVE LOOP FILTER” – Zhang et al., US PGPub 2022/0264106 A1. “CROSS COMPONENT ADAPTIVE LOOP FILTER FOR VIDEO CODING” – Wang et al., WO 2021/127534 A1. Any inquiry concerning this communication or earlier communications from the examiner should be directed to MAINUL HASAN whose telephone number is (571)272-0422. The examiner can normally be reached on MON-FRI: 10AM-6PM, Alternate FRIDAYS, EST. 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. /Mainul Hasan/ Primary Examiner, Art Unit 2485
Read full office action

Prosecution Timeline

Jan 03, 2025
Application Filed
Jun 03, 2026
Non-Final Rejection mailed — §102, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12684130
AFFINE PREDICTION USING AN EPIPOLAR-BASED CONSTRAINT FOR PICTURES OF DIFFERING RESOLUTIONS
2y 4m to grant Granted Jul 14, 2026
Patent 12684165
METHOD AND APPARATUS FOR PROCESSIING IMAGE SERVICE
1y 10m to grant Granted Jul 14, 2026
Patent 12684132
OPERATION RANGE EXTENSION FOR VERSATILE VIDEO CODING
1y 8m to grant Granted Jul 14, 2026
Patent 12671840
VIDEO ENCODING METHOD AND DEVICE, AND VIDEO DECODING METHOD AND DEVICE
1y 5m to grant Granted Jun 30, 2026
Patent 12666048
MATRIX-BASED INTRA PREDICTION DEVICE AND METHOD
1y 9m to grant Granted Jun 23, 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
76%
Grant Probability
99%
With Interview (+23.7%)
2y 5m (~10m remaining)
Median Time to Grant
Low
PTA Risk
Based on 462 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