Prosecution Insights
Last updated: September 24, 2026
Application No. 19/025,558

MOVING PICTURE CODING DEVICE, MOVING PICTURE CODING METHOD, MOVING PICTURE CODING PROGRAM, MOVING PICTURE DECODING DEVICE, MOVING PICTURE DECODING METHOD, AND MOVING PICTURE DECODING PROGRAM

Final Rejection §DP
Filed
Jan 16, 2025
Priority
Mar 08, 2019 — JP 2019-042577 +3 more
Examiner
PHILIPPE, GIMS S
Art Unit
2424
Tech Center
2400 — Computer Networks
Assignee
JVCKENWOOD Corporation
OA Round
2 (Final)
86%
Grant Probability
Favorable
3-4
OA Rounds
1y 1m
Est. Remaining
87%
With Interview

Examiner Intelligence

Grants 86% — above average
86%
Career Allowance Rate
911 granted / 1064 resolved
+27.6% vs TC avg
Minimal +2% lift
Without
With
+1.5%
Interview Lift
resolved cases with interview
Typical timeline
2y 9m
Avg Prosecution
23 currently pending
Career history
1090
Total Applications
across all art units

Statute-Specific Performance

§101
8.0%
-32.0% vs TC avg
§103
42.4%
+2.4% vs TC avg
§102
27.5%
-12.5% vs TC avg
§112
4.4%
-35.6% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1064 resolved cases

Office Action

§DP
DETAILED ACTION 1. Applicant’s amendment filed on July 6th 2026 in which claims 1-8 were amended has been fully considered and entered, but the amendments are not deemed to be persuasive. 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 . REMARKS 2. The Applicant argues, on page 16, that without commenting on the substantive merits of the provisional non-statutory double patenting rejection, but instead to expedite prosecution of the present Application, Applicant is submitting herewith a Terminal Disclaimer in compliance with 37 C.F.R. §§ 1.321(c) or 1.321(d), and signed in compliance with 37 C.F.R. § 1.321 (b) to obviate the above-noted provisional non-statutory double patenting rejection. However, the Examiner did not receive the Terminal Disclaimer that would obviate the Obvious-type Double Patenting rejection. Therefore, A new double Patenting rejection is being submitted in order to give the Applicant time to submit the Terminal Disclaimer that the Applicant is referring to. Double Patenting 3. The non-statutory 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 non-statutory 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); 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 non-statutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP §§ 706.02(l)(1) - 706.02(l)(3) for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/process/file/efs/guidance/eTD-info-I.jsp. 4. Claims 1-8 are rejected on the ground of non-statutory double patenting as being unpatentable over claims 1-7 of U.S. Patent Application no. 12,549,758 to Fukushima et al. Although the claims at issue are not identical, they are not patentably distinct from each other because claims 1-8 of the instant application and claims 1-8 of Patent no. 12,549,758 are drawn to the same invention. A close look at the instant application will show that independent claim 1, taken as the representative claim of the instant application, calls for a moving picture coding device using a merge mode, comprising: a spatial merging candidate derivation unit structured to derive a spatial merging candidate from motion information of a block neighboring a coding target block in a space domain and add it to a merging candidate list; a normal merging candidate selector structured to select a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; a triangle merging candidate selector structured to select, from the merging candidate list, a first triangle merging candidate that is uni-prediction and a second triangle merging candidate that is uni-prediction; and a coding unit structured to code a first index that specifies the first triangle merging candidate and a second index that specifies the second triangle merging candidate, wherein the triangle merging candidate selector derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 1 of Patent no. 12,549,758 calls for a moving picture coding device using a merge mode, comprising: a merging candidate list constructor structured to construct a merging candidate list including spatial merging candidates; a normal merging candidate selector structured to select a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; a triangle merging candidate selector structured to select, from the merging candidate list, a first triangle merging candidate that is uni-prediction and a second triangle merging candidate that is uni-prediction; and a coding unit structured to code a first index that specifies the first triangle merging candidate and a second index that specifies the second triangle merging candidate, wherein the triangle merging candidate selector derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate, wherein the merging candidate list constructor adds two or more merging candidates to the merging candidate list. Claim 2 of the instant application calls for a moving picture coding method using a merge mode, comprising: a spatial merging candidate derivation step of deriving a spatial merging candidate from motion information of a block neighboring a coding target block in a space domain and adding it to a merging candidate list; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; a triangle merging candidate selecting step of selecting, from the merging candidate list, a first triangle merging candidate that is uni-prediction and a second triangle merging candidate that is uni-prediction; and a coding step of coding a first index that specifies the first triangle merging candidate and a second index that specifies the second triangle merging candidate, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 2 of Patent no. 12,549,758 calls for a moving picture coding method using a merge mode, comprising: a merging candidate list construction step of constructing a merging candidate list including spatial merging candidates; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; a triangle merging candidate selecting step of selecting, from the merging candidate list, a first triangle merging candidate that is uni-prediction and a second triangle merging candidate that is uni-prediction; and a coding step of coding a first index that specifies the first triangle merging candidate and a second index that specifies the second triangle merging candidate, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate, wherein the merging candidate list construction step adds two or more merging candidates to the merging candidate list. Claim 3 of the instant application calls for a non-transitory computer-readable medium storing an executable moving picture coding program using merge mode instructions that, in response to execution, cause a computer to perform operations comprising: a spatial merging candidate derivation step of deriving a spatial merging candidate from motion information of a block neighboring a coding target block in a space domain and adding it to a merging candidate list; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; a triangle merging candidate selecting step of selecting, from the merging candidate list, a first triangle merging candidate that is uni-prediction and a second triangle merging candidate that is uni-prediction; and a coding step of coding a first index that specifies the first triangle merging candidate and a second index that specifies the second triangle merging candidate, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selecting step determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 3 of Patent no. 12,549,758 calls for a non-transitory computer-readable medium storing an executable moving picture coding program using merge mode instructions that, in response to execution, cause a computer to perform operations comprising: a merging candidate list construction step of constructing a merging candidate list including spatial merging candidates; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; a triangle merging candidate selecting step of selecting, from the merging candidate list, a first triangle merging candidate that is uni-prediction and a second triangle merging candidate that is uni-prediction; and a coding step of coding a first index that specifies the first triangle merging candidate and a second index that specifies the second triangle merging candidate, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate, wherein the merging candidate list construction step adds two or more merging candidates to the merging candidate list. Claim 4 of the instant application calls for a moving picture decoding device using a merge mode, comprising: a decoding unit structured to decode a first index that specifies a first triangle merging candidate and a second index that specifies a second triangle merging candidate; a spatial merging candidate derivation unit structured to derive a spatial merging candidate from motion information of a block neighboring a decoding target block in a spatial domain and add it to a merging candidate list; a normal merging candidate selector structured to select a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; and a triangle merging candidate selector structured to select, from the merging candidate list, the first triangle merging candidate that is uni-prediction and the second triangle merging candidate that is uni-prediction, wherein the triangle merging candidate selector derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 4 of Patent no 12,549,758 calls for a moving picture decoding device using a merge mode, comprising: a decoding unit structured to decode a first index that specifies a first triangle merging candidate and a second index that specifies a second triangle merging candidate; a merging candidate list constructor structured to construct a merging candidate list including spatial merging candidates; a normal merging candidate selector structured to select a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; and a triangle merging candidate selector structured to select, from the merging candidate list, the first triangle merging candidate that is uni-prediction and the second triangle merging candidate that is uni-prediction, wherein the triangle merging candidate selector derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate, wherein the merging candidate list constructor adds two or more merging candidates to the merging candidate list. Claim 5 of the instant application calls for a moving picture decoding method using a merge mode, comprising: a decoding step of decoding a first index that specifies a first triangle merging candidate and a second index that specifies a second triangle merging candidate; a spatial merging candidate derivation step of deriving a spatial merging candidate from motion information of a block neighboring a decoding target block in a spatial domain and adding it to a merging candidate list; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; and a triangle merging candidate selecting step of selecting, from the merging candidate list, the first triangle merging candidate that is uni-prediction and the second triangle merging candidate that is uni-prediction, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 5 of Patent no. 12,549,758 calls for a moving picture decoding method using a merge mode, comprising: a decoding step of decoding a first index that specifies a first triangle merging candidate and a second index that specifies a second triangle merging candidate; a merging candidate list construction step of constructing a merging candidate list including spatial merging candidates; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; and a triangle merging candidate selecting step of selecting, from the merging candidate list, the first triangle merging candidate that is uni-prediction and the second triangle merging candidate that is uni-prediction, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate, wherein the merging candidate list construction step adds two or more merging candidates to the merging candidate list. Claim 6 of the instant application calls for a non-transitory computer-readable medium storing executable instructions of a moving picture decoding program using a merge mode that, in response to execution, cause a computer to perform operations comprising: a decoding step of decoding a first index that specifies a first triangle merging candidate and a second index that specifies a second triangle merging candidate; a spatial merging candidate derivation step of deriving a spatial merging candidate from motion information of a block neighboring a decoding target block in a spatial domain and adding it to a merging candidate list; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; and a triangle merging candidate selecting step of selecting, from the merging candidate list, the first triangle merging candidate that is uni-prediction and the second triangle merging candidate that is uni-prediction, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selecting step determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 6 of Patent no. 12,549,758 calls for a non-transitory computer-readable medium storing executable instructions of a moving picture decoding program using a merge mode that, in response to execution, cause a computer to perform operations comprising: a decoding step of decoding a first index that specifies a first triangle merging candidate and a second index that specifies a second triangle merging candidate; a merging candidate list construction step of constructing a merging candidate list including spatial merging candidates; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; and a triangle merging candidate selecting step of selecting, from the merging candidate list, the first triangle merging candidate that is uni-prediction and the second triangle merging candidate that is uni-prediction, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate, wherein the merging candidate list construction step adds two or more merging candidates to the merging candidate list. Claim 7 of the instant application calls for a storing method comprising: a coding step of generating a bitstream in accordance with moving-picture coding method of claim 2; and a storing step of storing the bitstream in a recording medium. Claim 7 of Patent no. 12,549,758 calls for a transmission method adapted to transmit a bitstream coded in accordance with the moving picture coding method of claim 2. Claim 8 of the instant application calls for a coding step of generating a bitstream in accordance with the moving picture coding method of claim 2; and a transmitting step of transmitting the bitstream. While Patent no. 12,549,758 does not have claim 8, however, the limitations of claim 7 is somewhat similar to the limitation of claim 8 of the instant application. The difference between the instant examined claim and the conflicting patented claim is that the conflicting patented claims is narrower in scope and falls within the scope of the examined claims. Therefore, a patent to the examined claim genus would improperly extend the right to exclude granted by a patent to the species or sub-genus should the genus issue as a patent after the species or sub-genus. See MPEP §804(II)(B)(1). 5. Claims 1-8 are rejected on the ground of non-statutory double patenting as being unpatentable over claims 1-8 of U.S. Patent Application no. 12,022,104 to Fukushima et al. Although the claims at issue are not identical, they are not patentably distinct from each other because claims 1-8 of the instant application and claims 1-8 of Patent no. 12,022,104 are drawn to the same invention. A close look at the instant application will show that independent claim 1, taken as the representative claim of the instant application, calls for a moving picture coding device using a merge mode, comprising: a spatial merging candidate derivation unit structured to derive a spatial merging candidate from motion information of a block neighboring a coding target block in a spatial domain and add it to a merging candidate list; a normal merging candidate selector structured to select a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; a triangle merging candidate selector structured to select, from the merging candidate list, a first triangle merging candidate that is uni-prediction and a second triangle merging candidate that is uni-prediction; and a coding unit structured to code a first index that specifies the first triangle merging candidate and a second index that specifies the second triangle merging candidate, wherein the triangle merging candidate selector derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 1 of Patent no. 12,022,104 calls for similar limitations. In fact, independent claim 1 of the cited Patent calls for a moving picture coding device using a merge mode, comprising: a merging candidate list constructor structured to construct a merging candidate list including spatial merging candidates; a normal merging candidate selector structured to select a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; a triangle merging candidate selector structured to select, from the merging candidate list, a first triangle merging candidate that is uni-prediction and a second triangle merging candidate that is uni-prediction; and a coding unit structured to code a first index that specifies the first triangle merging candidate and a second index that specifies the second triangle merging candidate, wherein the triangle merging candidate selector derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 2 of the instant application calls for a moving picture coding method using a merge mode, comprising: a spatial merging candidate derivation step of deriving a spatial merging candidate from motion information of a block neighboring a coding target block in a spatial domain and adding it to a merging candidate list; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; a triangle merging candidate selecting step of selecting, from the merging candidate list, a first triangle merging candidate that is uni-prediction and a second triangle merging candidate that is uni-prediction; and a coding step of coding a first index that specifies the first triangle merging candidate and a second index that specifies the second triangle merging candidate, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selecting step determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 2 of Patent no. 12,022,104 calls for moving picture coding method using a merge mode, comprising: a merging candidate list construction step of constructing a merging candidate list including spatial merging candidates; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; a triangle merging candidate selecting step of selecting, from the merging candidate list, a first triangle merging candidate that is uni-prediction and a second triangle merging candidate that is uni-prediction; and a coding step of coding a first index that specifies the first triangle merging candidate and a second index that specifies the second triangle merging candidate, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 3 of the instant application calls for a non-transitory computer-readable medium storing an executable moving picture coding program using merge mode instructions that, in response to execution, cause a computer to perform operations comprising: a spatial merging candidate derivation step of deriving a spatial merging candidate from motion information of a block neighboring a coding target block in a spatial domain and adding it to a merging candidate list; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; a triangle merging candidate selecting step of selecting, from the merging candidate list, a first triangle merging candidate that is uni-prediction and a second triangle merging candidate that is uni-prediction; and a coding step of coding a first index that specifies the first triangle merging candidate and a second index that specifies the second triangle merging candidate, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selecting step determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 3 of Patent no. 12,022,104 calls for a non-transitory computer-readable medium storing an executable moving picture coding program using merge mode instructions that, in response to execution, cause a computer to perform operations comprising: a merging candidate list construction step of constructing a merging candidate list including spatial merging candidates; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; a triangle merging candidate selecting step of selecting, from the merging candidate list, a first triangle merging candidate that is uni-prediction and a second triangle merging candidate that is uni-prediction; and a coding step of coding a first index that specifies the first triangle merging candidate and a second index that specifies the second triangle merging candidate, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 4 of the instant application calls for a moving picture decoding device using a merge mode, comprising: a decoding unit structured to decode a first index that specifies a first triangle merging candidate and a second index that specifies a second triangle merging candidate; a spatial merging candidate derivation unit structured to derive a spatial merging candidate from motion information of a block neighboring a decoding target block in a spatial domain and add it to a merging candidate list; a normal merging candidate selector structured to select a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; and a triangle merging candidate selector structured to select, from the merging candidate list, the first triangle merging candidate that is uni-prediction and the second triangle merging candidate that is uni-prediction, wherein the triangle merging candidate selector derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 4 of Patent no. 12,022,104 calls for a moving picture decoding device using a merge mode, comprising: a decoding unit structured to decode a first index that specifies a first triangle merging candidate and a second index that specifies a second triangle merging candidate; a merging candidate list constructor structured to construct a merging candidate list including spatial merging candidates; a normal merging candidate selector structured to select a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; and a triangle merging candidate selector structured to select, from the merging candidate list, the first triangle merging candidate that is uni-prediction and the second triangle merging candidate that is uni-prediction, wherein the triangle merging candidate selector derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 5 of the instant application calls for a moving picture decoding method using a merge mode, comprising: a decoding step of decoding a first index that specifies a first triangle merging candidate and a second index that specifies a second triangle merging candidate; a spatial merging candidate derivation step of deriving a spatial merging candidate from motion information of a block neighboring a decoding target block in a spatial domain and adding it to a merging candidate list; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; and a triangle merging candidate selecting step of selecting, from the merging candidate list, the first triangle merging candidate that is uni-prediction and the second triangle merging candidate that is uni-prediction, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selecting step determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 5 of Patent no. 12,022,104 calls for a moving picture decoding method using a merge mode, comprising: a decoding step of decoding a first index that specifies a first triangle merging candidate and a second index that specifies a second triangle merging candidate; a merging candidate list construction step of constructing a merging candidate list including spatial merging candidates; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; and a triangle merging candidate selecting step of selecting, from the merging candidate list, the first triangle merging candidate that is uni-prediction and the second triangle merging candidate that is uni-prediction, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 6 of the instant application calls for a non-transitory computer-readable medium storing executable instructions of a moving picture decoding program using a merge mode that, in response to execution, cause a computer to perform operations comprising: a decoding step of decoding a first index that specifies a first triangle merging candidate and a second index that specifies a second triangle merging candidate; a spatial merging candidate derivation step of deriving a spatial merging candidate from motion information of a block neighboring a decoding target block in a spatial domain and adding it to a merging candidate list; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; and a triangle merging candidate selecting step of selecting, from the merging candidate list, the first triangle merging candidate that is uni-prediction and the second triangle merging candidate that is uni-prediction, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selecting step determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 6 of Patent no. 12,022,104 calls for non-transitory computer-readable medium storing executable instructions of a moving picture decoding program using a merge mode that, in response to execution, cause a computer to perform operations comprising: a decoding step of decoding a first index that specifies a first triangle merging candidate and a second index that specifies a second triangle merging candidate; a merging candidate list construction step of constructing a merging candidate list including spatial merging candidates; a normal merging candidate selecting step of selecting a normal merging candidate that is uni-prediction or bi-prediction from the merging candidate list; and a triangle merging candidate selecting step of selecting, from the merging candidate list, the first triangle merging candidate that is uni-prediction and the second triangle merging candidate that is uni-prediction, wherein the triangle merging candidate selecting step derives the first triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the first index that specifies the first triangle merging candidate that is uni-prediction, and derives the second triangle merging candidate from the merging candidate list that includes a merging candidate that is bi-prediction using the second index that specifies the second triangle merging candidate that is uni-prediction, and wherein the triangle merging candidate selector determines whether a candidate in the merging candidate list has L0 motion information and sets the L0 motion information as a triangle merging candidate in a case where the candidate in the merging candidate list has the L0 motion information, and subsequently determines whether the candidate in the merging candidate list has L1 motion information and sets the L1 motion information as another triangle merging candidate in a case where the candidate in the merging candidate list has the L1 motion information to select the first triangle merging candidate and the second triangle merging candidate. Claim 7 of the instant application calls for a storing method comprising: a coding step of generating a bitstream in accordance with the moving picture coding method of claim 2; and a storing step of storing the bitstream in a recording medium. Claim 7 of Patent no. 12,022,104 calls for a storing method adapted to store in a recording medium a bitstream coded in accordance with the moving picture coding method of claim 2. Claim 8 of the instant application calls for a coding step of generating a bitstream in accordance with the moving picture coding method of claim 2; and a transmitting step of transmitting the bitstream. Claim 8 the Patent no. 12,022,104 calls for a transmission method adapted to transmit a bitstream coded in accordance with the moving picture coding method of claim 2. The difference between the instant examined claim and the conflicting patented claim is that the conflicting patented claims is narrower in scope and falls within the scope of the examined claims. Therefore, a patent to the examined claim genus would improperly extend the right to exclude granted by a patent to the species or sub-genus should the genus issue as a patent after the species or sub-genus. See MPEP §804(II)(B)(1). 6. THIS ACTION IS MADE FINAL. Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to GIMS S PHILIPPE whose telephone number is (571)272-7336. The examiner can normally be reached Maxi Flex. 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, Benjamin Bruckart can be reached at 571-272-3982. 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. /GIMS S PHILIPPE/Primary Examiner, Art Unit 2424
Read full office action

Prosecution Timeline

Jan 16, 2025
Application Filed
Apr 08, 2026
Non-Final Rejection mailed — §DP
Jul 06, 2026
Response Filed
Aug 25, 2026
Final Rejection mailed — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12739395
MOTION-COMPENSATED ATTRIBUTE CODING USING GEOMETRY AND ATTRIBUTE INFORMATION IN GEOMETRY-BASED DYNAMIC POINT CLOUD CODING
2y 2m to grant Granted Sep 15, 2026
Patent 12732603
METHOD AND APPARATUS FOR IMAGE ENCODING/DECODING
2y 0m to grant Granted Sep 08, 2026
Patent 12732629
EMBEDDING FRAME MASKS IN A VIDEO STREAM
1y 12m to grant Granted Sep 08, 2026
Patent 12716724
INFORMATION PROCESSING DEVICE, CONTROL METHOD, PROGRAM, AND STORAGE MEDIUM
2y 12m to grant Granted Aug 25, 2026
Patent 12720087
SIGNALING OF NUMBER OF MERGE CANDIDATES
2y 0m to grant Granted Aug 25, 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
86%
Grant Probability
87%
With Interview (+1.5%)
2y 9m (~1y 1m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 1064 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