Prosecution Insights
Last updated: November 12, 2026
Application No. 19/127,245

METHOD FOR RESILIENT DECODING OF IMAGE SEQUENCES

Non-Final OA §103
Filed
May 05, 2025
Priority
Nov 18, 2022 — AU 2022903486 +1 more
Examiner
GADOMSKI, STEFAN J
Art Unit
2485
Tech Center
2400 — Computer Networks
Assignee
Kakadu R & D Pty Ltd.
OA Round
1 (Non-Final)
77%
Grant Probability
Favorable
1-2
OA Rounds
84%
With Interview

Examiner Intelligence

Grants 77% — above average
77%
Career Allowance Rate
338 granted / 438 resolved
+19.2% vs TC avg
Moderate +7% lift
Without
With
+6.9%
Interview Lift
resolved cases with interview
Typical timeline
Avg Prosecution
16 currently pending
Career history
468
Total Applications
across all art units

Office Action

§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 . Election/Restrictions Applicant’s election without traverse of Species I in the reply filed on 07/27/2026 is acknowledged. Priority Receipt is acknowledged of certified copies of papers required by 37 CFR 1.55. Information Disclosure Statement The information disclosure statement (IDS) submitted on 05/05/2025 was considered by the examiner. Drawings The drawings were received on 05/05/2025. These drawings are acceptable. Claim Rejections - 35 USC § 103 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 (i.e., changing from AIA to pre-AIA ) 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. 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. The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. Claim 1 is rejected under 35 U.S.C. 103 as being unpatentable over Hannuksela US 2006/0188025 A1, hereafter Hannuksela in view of Shohei et al. JP 2011082725 A (machine translation provided by Espace.net), hereafter Shohei. Regarding claim 1, Hannuksela discloses a method for resilient decoding of a sequence of video frames (error concealment in decoding of inter-coded information; series of video frames) [abstract; 0032], each having been transformed to produce a plurality of sample blocks, that have been independently encoded (encoder processes an input picture block by block) [0107], the encoded sample blocks being identified herein as code-blocks (coding block) [0009], the method involving a reference buffer that is capable of selectively storing previously received code-blocks from the encoded video sequence (reference image buffer 19’; contains the decoded pictures that can be used as references in the motion estimation process) [FIG. 4; 0097], where a code-block within a given frame (, identified here as the current code-block of the current frame, is processed using the following steps: a) decoding the current code-block to produce a current block of sample values (the coding parameters 13 are fed into two parallel blocks, texture decoding block 14, and motion compensation block 15…the motion compensation block 15 computes new placements for various image segments as is known from the art of motion compensated video decoding) [0014]; b) obtaining a corresponding reference block of decoded reference block sample values for a previous frame in the video sequence by accessing the reference buffer and performing any required decoding operations to obtain said reference block samples values (the motion compensated block 15 uses previously reconstructed images from the reference image buffer 19) [0015]; c) partitioning each of the current and reference blocks of decoded sample values into one or more cells, each cell of the current block being in one to one correspondence with a cell of the reference block (elementary elements in an error-track picture depend on the error tracking algorithm and mat be for example: a sample (i.e. a pixel), a sub-block (e.g. a 4x4 rectangle of pixels), or a block (corresponding to the unit of motion compensation) [0097]; d) comparing corresponding cells of the current and reference block to produce an initial classification label for each cell pair, the label having at least three possible values that identify the cell as inconsistent, ambiguous or consistent (for each elementary unit in an error-track picture, an error concealment state is stored. Valid states include but are not limited to the following: “correctly decoded”, “unknown” (that is, possible correctly decoded or error-concealed), “normatively error-concealed”, and “uncontrollably error-concealed”) [0097]. Hannuksela fails to explicitly disclose e) resolving cell pairs initially labelled as ambiguous to consistent or inconsistent by a label adjustment step that uses the labels assigned to other cells. Shohei, in an analogous environment, discloses e) resolving cell pairs initially labelled as ambiguous to consistent or inconsistent by a label adjustment step that uses the labels assigned to other cell (an example of region integration is shown…when the block type (area number) of a certain block is “2” and the block types of surrounding blocks are “1”, the block of interest is isolated…region integration is performed by changing the block type of the target block to “1” and the region classification is corrected) [page 5]. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to use the classification correction, as disclosed by Shoehei, with the invention disclosed by Hannuksela, the motivation being improving coding efficiency [page 1]. Claims 6 and 17 are rejected under 35 U.S.C. 103 as being unpatentable over Hannuksela and Shoehei further in view of Borer EP 1806931 A1, hereafter Borer. Regarding claim 6, Hannuksela and Shoehei addresses all of the features with respect to claim 1 as outlined above. However, the combination fails to explicitly disclose the code-blocks are independently coded blocks of samples from sub-bands produced by discrete wavelet transformation of the frame sample values. Borer, in an analogous environment, discloses the code-blocks are independently coded blocks of samples from sub-bands produced by discrete wavelet transformation of the frame sample values (a separate weighting factor is generating for each subband or each part of a subband that has a distinct quantisation factor) [0327]. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to use the wavelet transforms, as disclosed by Borer, with the invention disclosed by Hannuksela and Shoehei, the motivation being a more effective approach [0019]. Regarding claim 17, Hannuksela and Shoehei addresses all of the features with respect to claim 1 as outlined above. However, the combination fails to explicitly disclose the reference buffer is updated based on contextual hints that allow determining whether a code-block of the current video frame should be used as a reference code-block for future frames, such contextual hints including protocol information and designated marker codes that accompany the encoded video content received by the decoder. Borer, in an analogous environment, discloses the reference buffer is updated based on contextual hints that allow determining whether a code-block of the current video frame should be used as a reference code-block for future frames, such contextual hints including protocol information and designated marker codes that accompany the encoded video content received by the decoder (each frame is encoded with a header that specifies the frame number in display order, the frame numbers of any references, and how long the frame must stay in the buffer…goes through the buffer eliminating frames which have expired) [0134]. Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to use the buffer updating, as disclosed by Borer, with the invention disclosed by Hannuksela and Shoehei, the motivation being a more effective approach [0019]. Allowable Subject Matter Claims 2-5, 18 and 19 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: Takeguchi et al. US 4,953,214 discloses image compression using quantization interval comparison and lookup table. Nassor et al. US 2011/0188766 A1 discloses image decoding error concealment. Any inquiry concerning this communication or earlier communications from the examiner should be directed to STEFAN GADOMSKI whose telephone number is (571)270-5701. The examiner can normally be reached Monday - Friday, 12-8PM EST. 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. STEFAN GADOMSKI Primary Examiner Art Unit 2485 /STEFAN GADOMSKI/ Primary Examiner, Art Unit 2485
Read full office action

Prosecution Timeline

May 05, 2025
Application Filed
Oct 16, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12795158
POINT CLOUD DATA PROCESSING DEVICE AND PROCESSING METHOD
4y 0m to grant Granted Nov 10, 2026
Patent 12793300
ELECTRONIC DEVICE OR METHOD OF THE SAME FOR PROVIDING EMOTICON GENERATING
1y 9m to grant Granted Nov 10, 2026
Patent 12771844
NEURAL NETWORK-BASED VIDEO COMPRESSION METHOD USING MOTION VECTOR FIELD COMPRESSION
1y 11m to grant Granted Oct 20, 2026
Patent 12771873
DECODER SIDE DEPTH AND COLOR ALIGNMENT WITH THE ASSISTANCE OF METADATA FOR THE TRANSCODING OF VOLUMETRIC VIDEO
1y 11m to grant Granted Oct 20, 2026
Patent 12764326
Block Vector Difference Signaling based on Validity Determination
1y 9m to grant Granted Oct 13, 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
77%
Grant Probability
84%
With Interview (+6.9%)
Low
PTA Risk
Based on 438 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