Prosecution Insights
Last updated: July 17, 2026
Application No. 18/817,822

3D DATA DECODING APPARATUS AND 3D DATA ENCODING APPARATUS

Non-Final OA §103
Filed
Aug 28, 2024
Priority
Oct 06, 2023 — JP 2023-173949
Examiner
CHIO, TAT CHI
Art Unit
2486
Tech Center
2400 — Computer Networks
Assignee
Sharp Corporation
OA Round
3 (Non-Final)
73%
Grant Probability
Favorable
3-4
OA Rounds
1y 4m
Est. Remaining
90%
With Interview

Examiner Intelligence

Grants 73% — above average
73%
Career Allowance Rate
623 granted / 855 resolved
+14.9% vs TC avg
Strong +18% interview lift
Without
With
+17.5%
Interview Lift
resolved cases with interview
Typical timeline
3y 3m
Avg Prosecution
30 currently pending
Career history
894
Total Applications
across all art units

Statute-Specific Performance

§101
2.0%
-38.0% vs TC avg
§103
82.2%
+42.2% vs TC avg
§102
9.4%
-30.6% vs TC avg
§112
1.3%
-38.7% vs TC avg
Black line = Tech Center average estimate • Based on career data from 855 resolved cases

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 . Continued Examination Under 37 CFR 1.114 A request for continued examination under 37 CFR 1.114, including the fee set forth in 37 CFR 1.17(e), was filed in this application after final rejection. Since this application is eligible for continued examination under 37 CFR 1.114, and the fee set forth in 37 CFR 1.17(e) has been timely paid, the finality of the previous Office action has been withdrawn pursuant to 37 CFR 1.114. Applicant's submission filed on 3/31/2026 has been entered. Response to Arguments Applicant’s arguments with respect to claim(s) 1-4 have been considered but are moot because the new ground of rejection does not rely on any reference applied in the prior rejection of record for any teaching or matter specifically challenged in the argument. 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. 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(s) 1-4 is/are rejected under 35 U.S.C. 103 as being unpatentable over Tian et al. (US 2024/0430471 A1) in view of Filippov et al. (US 2026/0006260 A1). Consider claim 1, Tian teaches a 3D data decoding apparatus for decoding encoded data, the 3D data decoding apparatus comprising: a mesh prediction unit configured to derive a prediction position of a base mesh vertex position from the encoded data ([0134] – [0139]); and an arithmetic decoder configured to arithmetically decode a prediction residual ([0134] – [0139]), adds a value of the prediction residual to the prediction position to derive the base mesh vertex position ([0134] – [0147]). However, Tian does not explicitly teach the arithmetic decoder decodes a part of suffix bins of a syntax element related to the prediction residual by using one of a context and a bypass according to a value of a suffix bin index. Filippov teaches the arithmetic decoder decodes a part of suffix bins of a syntax element related to the prediction residual by using one of a context and a bypass according to a value of a suffix bin index ([0230] – [0238], [0251] – [0266]). Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to incorporate the known technique of decoding a part of suffix bins of a syntax element by using one of a context and a bypass according to a value of a suffix bin index because such incorporation would help control computational costs. [0232]. Consider claim 3, Tian teaches a 3D data encoding apparatus for encoding 3D data, the 3D data encoding apparatus comprising: a mesh prediction unit configured to derive a prediction position of a base mesh vertex position ([0150] – [0160]); and an arithmetic encoder configured to arithmetically encode a prediction residual ([0150] – [0160]); and a base mesh encoder configured to encode the base mesh vertex position ([0150] – [0160]). However, Tian does not explicitly teach the arithmetic decoder decodes a part of suffix bins of a syntax element related to the prediction residual by using one of a context and a bypass according to a value of a suffix bin index. Filippov teaches the arithmetic decoder decodes a part of suffix bins of a syntax element related to the prediction residual by using one of a context and a bypass according to a value of a suffix bin index ([0230] – [0238], [0251] – [0266]). Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to incorporate the known technique of decoding a part of suffix bins of a syntax element by using one of a context and a bypass according to a value of a suffix bin index because such incorporation would help control computational costs. [0232]. Consider claim 2, the combination of Tian and Nishimura teaches all the limitations in claim 1 but does not explicitly teach the arithmetic decoder counts a number of the suffix bins decoded using the context for each prescribed number of vertices, and switches from decoding the prefix bins using the context to decoding the suffix bins without using the context in a case that the number of the suffix bins is equal to or greater than a prescribed value Filippov teaches the arithmetic decoder counts a number of the suffix bins decoded using the context for each prescribed number of vertices, and switches from decoding the prefix bins using the context to decoding the suffix bins without using the context in a case that the number of the suffix bins is equal to or greater than a prescribed value ([0230] – [0238], [0251] – [0266]). Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to incorporate the known technique of decoding a part of suffix bins of a syntax element by using one of a context and a bypass according to a value of a suffix bin index because such incorporation would help control computational costs. [0232]. Consider claim 4, Budagavi teaches the arithmetic encoder counts a number of the suffix bins encoded using the context for each prescribed number of vertices, and switches from decoding the suffix bins using the context to encoding the prefix bins without using the context in a case that the number of the suffix bins is equal to or greater than a prescribed value. ([0230] – [0238], [0251] – [0266]). Therefore, it would have been obvious to one of ordinary skill in the art before the effective filing date of the claimed invention to incorporate the known technique of decoding a part of suffix bins of a syntax element by using one of a context and a bypass according to a value of a suffix bin index because such incorporation would help control computational costs. [0232]. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to TAT CHI CHIO whose telephone number is (571)272-9563. The examiner can normally be reached Monday-Thursday 10am-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, JAMIE J ATALA can be reached at 571-272-7384. 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. /TAT C CHIO/Primary Examiner, Art Unit 2486
Read full office action

Prosecution Timeline

Aug 28, 2024
Application Filed
Jul 29, 2025
Non-Final Rejection mailed — §103
Oct 24, 2025
Response Filed
Jan 12, 2026
Final Rejection mailed — §103
Mar 10, 2026
Response after Non-Final Action
Mar 31, 2026
Request for Continued Examination
Apr 02, 2026
Response after Non-Final Action
Jun 11, 2026
Non-Final Rejection mailed — §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12684199
USER CONTROL FOR DISPLAYING TAGS ASSOCIATED WITH ITEMS IN A VIDEO PLAYBACK
3y 0m to grant Granted Jul 14, 2026
Patent 12677048
DEVICE FOR DETECTING AND TRACKING OBJECTS IN A ZONE OF INTEREST
2y 3m to grant Granted Jul 07, 2026
Patent 12666064
INDEPENDENT SUBPICTURE FILM GRAIN
2y 6m to grant Granted Jun 23, 2026
Patent 12659488
ENCODING AND DECODING METHODS AND APPARATUSES, AND DEVICES THEREFOR
1y 9m to grant Granted Jun 16, 2026
Patent 12647612
FAST COMPUTATION OF LOCAL COORDINATE SYSTEM FOR DISPLACEMENT VECTORS IN MESH CODING
2y 8m to grant Granted Jun 02, 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

3-4
Expected OA Rounds
73%
Grant Probability
90%
With Interview (+17.5%)
3y 3m (~1y 4m remaining)
Median Time to Grant
High
PTA Risk
Based on 855 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