Prosecution Insights
Last updated: April 19, 2026
Application No. 19/061,229

METHOD FOR USING ADAPTIVE LOOP FILTER AND SYSTEM THEREOF

Non-Final OA §102§103
Filed
Feb 24, 2025
Examiner
OWENS, TSION B
Art Unit
2487
Tech Center
2400 — Computer Networks
Assignee
Alibaba Group Holding Limited
OA Round
1 (Non-Final)
88%
Grant Probability
Favorable
1-2
OA Rounds
2y 3m
To Grant
96%
With Interview

Examiner Intelligence

Grants 88% — above average
88%
Career Allow Rate
580 granted / 660 resolved
+29.9% vs TC avg
Moderate +9% lift
Without
With
+8.6%
Interview Lift
resolved cases with interview
Typical timeline
2y 3m
Avg Prosecution
22 currently pending
Career history
682
Total Applications
across all art units

Statute-Specific Performance

§101
7.8%
-32.2% vs TC avg
§103
42.9%
+2.9% vs TC avg
§102
22.8%
-17.2% vs TC avg
§112
5.0%
-35.0% vs TC avg
Black line = Tech Center average estimate • Based on career data from 660 resolved cases

Office Action

§102 §103
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 . 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. (a)(2) the claimed invention was described in a patent issued under section 151, or in an application for patent published or deemed published under section 122(b), in which the patent or applications the case maybe, names another inventor and was effectively filed before the effective filing date of the claimed invention. Claims 1, 7 and 13 are rejected under 35 U.S.C. 102(a)(1) as being anticipated by Auyeung et al. (US 2021/0385445) (Cheung Auyeung) Regarding Claim 1, Auyeunga discloses method of encoding a video sequence into a bitstream, the method comprising: receiving a video sequence [See abstract and Paragraphs 4 and 36]; encoding one or more pictures of the video sequence [See Paragraphs 4 and 36], wherein the encoding comprises: partitioning a picture to a partition pattern having a number of regions no less than 16, a picture width being not a multiple of a region column number and a picture height being not a multiple of a region row number [See Paragraph 19-36 and Fig. 4], and encoding an index indicating the partition pattern; and generating a bitstream based on the encoding [See Paragraphs 31-36 and Fig. 4]. Regarding Claim 7, the limitations claimed are substantially similar to claim 1 above, therefore the ground for rejecting claim l also applies here. Regarding Claim 13, the limitations claimed are substantially similar to claim 1 above, therefore the ground for rejecting claim l also applies here. 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, 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 2-6,8-12 and 14-18 are rejected under 35 U.S.C. 103 as being unpatentable over Auyeung et al. (US 2021/0385445) (Cheung Auyeung) in view of Chen et al. (US 2012/0082244) (Ching-Yeh Chen). Regarding Claims 2, 8 and 14, Auyeunga doesn’t explicitly disclose wherein partitioning the picture to a partition pattern further comprises: determining a first column width based on the picture width and a Largest Coding Unit (LCU) width; and determining a first row height based on the picture height and a LCU height; wherein a column width of the first column in the number of regions has a second column width different from the first column width, or a row height of the first row in the number of regions has a second row height different from the first row height However, Chen discloses wherein partitioning the picture to a partition pattern further comprises: determining a first column width based on the picture width and a Largest Coding Unit (LCU) width; and determining a first row height based on the picture height and a LCU height; wherein a column width of the first column in the number of regions has a second column width different from the first column width, or a row height of the first row in the number of regions has a second row height different from the first row height [See abstract and Paragraphs 23- 31 and Fig. 2-3]. It would have been obvious to the person of ordinary skill in the art at time of invention to modify the system disclosed by Auyeunga to add the teachings in Chen as above, to provide a method that provide coding efficiency improved by region merging. The neighboring regions can have similar characteristics and can share a same filter to reduce information required for indicating the ALF filter [See Chen Abstract]. Regarding Claims 3, 9 and 15, Auyeunga doesn’t explicitly disclose wherein determining the first column width based on the picture width and the LCU width further comprises: calculating a number of LCUs within the picture in width by up rounding with one LCU; obtaining a column width in the unit of LCU width by dividing the number of LCUs within the picture with the region column number; and obtaining the first column width in pixel by multiplying the column width in the unit of LCU width by the LCU width; and determining the first row height based on the picture height and the LCU height further comprises: calculating a number of LCUs within the picture in height by up rounding with one LCU; obtaining a row height in the unit of LCU height by dividing the number of LCUs within the picture with the region row number; and obtaining the first row height in pixel by multiplying the row height in the unit of LCU width by the LCU height However, Chen discloses wherein determining the first column width based on the picture width and the LCU width further comprises: calculating a number of LCUs within the picture in width by up rounding with one LCU; obtaining a column width in the unit of LCU width by dividing the number of LCUs within the picture with the region column number; and obtaining the first column width in pixel by multiplying the column width in the unit of LCU width by the LCU width; and determining the first row height based on the picture height and the LCU height further comprises: calculating a number of LCUs within the picture in height by up rounding with one LCU; obtaining a row height in the unit of LCU height by dividing the number of LCUs within the picture with the region row number; and obtaining the first row height in pixel by multiplying the row height in the unit of LCU width by the LCU height [See abstract and Paragraphs 23- 31 and Fig. 2-3]. It would have been obvious to the person of ordinary skill in the art at time of invention to modify the system disclosed by Auyeunga to add the teachings in Chen as above, to provide a method that provide coding efficiency improved by region merging. The neighboring regions can have similar characteristics and can share a same filter to reduce information required for indicating the ALF filter [See Chen Abstract]. Regarding Claims 4, 10 and 16, Auyeunga discloses determining the second column width based on the first column width, the picture width and the LCU width; and determining the second-row height based on the first-row height, the picture height and the LCU height [See Paragraphs 29-33 and Fig. 2]. Regarding Claims 5,11 and 17, Auyeunga doesn’t explicitly disclose wherein determining the second column width based on the first column width, the picture width and the LCU width further comprises: calculating a first column number based on the picture width and the first column width; clipping the first column number to the region column number; calculating the second column width based on the picture width, the first column width and the first column number; and aligning the second column width with the LCU width; and determining the second row height based on the first row height, the picture height and the LCU height further comprises: calculating a first row number based on the picture height and the first row height; clipping the first row number to the region row number; calculating the second row height based on the picture height, the first row height and the first row number; and aligning the second row height with the LCU height However, Chen discloses wherein determining the second column width based on the first column width, the picture width and the LCU width further comprises: calculating a first column number based on the picture width and the first column width; clipping the first column number to the region column number; calculating the second column width based on the picture width, the first column width and the first column number; and aligning the second column width with the LCU width; and determining the second row height based on the first row height, the picture height and the LCU height further comprises: calculating a first row number based on the picture height and the first row height; clipping the first row number to the region row number; calculating the second row height based on the picture height, the first row height and the first row number; and aligning the second row height with the LCU height [See abstract and Paragraphs 23- 31 and Fig. 2-3]. It would have been obvious to the person of ordinary skill in the art at time of invention to modify the system disclosed by Auyeunga to add the teachings in Chen as above, to provide a method that provide coding efficiency improved by region merging. The neighboring regions can have similar characteristics and can share a same filter to reduce information required for indicating the ALF filter [See Chen Abstract]. Regarding Claims 6, 12 and 18, Auyeunga discloses wherein the first column has the second column width and the first row has the second row height; the first column has the second column width and the last row has the second row height; or the last column has the second column width and the first row has the second row height [See Paragraphs 29-33 and Fig. 2]. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to TSION B OWENS whose telephone number is (571)272-3934. The examiner can normally be reached Monday-Friday 8:00-4:00. 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. /TSION B OWENS/Primary Examiner, Art Unit 2487
Read full office action

Prosecution Timeline

Feb 24, 2025
Application Filed
Mar 06, 2026
Non-Final Rejection — §102, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12603996
USING TEMPLATE MATCHING FOR REFINING CANDIDATE SELECTION
2y 5m to grant Granted Apr 14, 2026
Patent 12593041
ENCODER, DECODER, ENCODING METHOD, AND DECODING METHOD
2y 5m to grant Granted Mar 31, 2026
Patent 12593042
ENCODER, DECODER, ENCODING METHOD, AND DECODING METHOD
2y 5m to grant Granted Mar 31, 2026
Patent 12587648
POSITION DEPENDENT COEFFICIENT REORDERING IN CODED VIDEO
2y 5m to grant Granted Mar 24, 2026
Patent 12574508
INTRA PREDICTION METHODS, ENCODER AND DECODER
2y 5m to grant Granted Mar 10, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
88%
Grant Probability
96%
With Interview (+8.6%)
2y 3m
Median Time to Grant
Low
PTA Risk
Based on 660 resolved cases by this examiner. Grant probability derived from career allow 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