# US 12,192,447 B2 · 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 > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,192,447 B2 - Document ID: US12192447B2 - Status: Granted - Kind: B2 - Application number: 18/470,093 - Filed: 2023-09-19 - Published: 2024-01-11 - Granted: 2025-01-07 - Earliest claimed: 2019-03-08 - Assignees: JVCKENWOOD Corporation - Applicants: JVCKENWOOD Corporation - Inventors: Shigeru Fukushima; Toru Kumakura; Hideki Takehara; Hiroya Nakamura; Satoru Sakazume; Hiroyuki Kurashige - Web page: https://patentgrep.com/patent/US12192447B2 ## CPC - H04N 19/105: Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction - H04N 19/52: by predictive encoding - H04N 19/119: Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks - H04N 19/139: Analysis of motion vectors, e.g. their magnitude, direction, variance or reliability - H04N 19/159: Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction - H04N 19/172: the region being a picture, frame or field - H04N 19/176: the region being a block, e.g. a macroblock - H04N 19/51: Motion estimation or motion compensation - H04N 19/583: Motion compensation with overlapping blocks - H04N 19/70: characterised by syntax aspects related to video coding, e.g. related to compression standards - H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION ## Abstract There is provided a technique that includes a triangle merging candidate list constructor structured to construct a triangle merging candidate list including spatial merging candidates, a first triangle merging candidate selector structured to select, from the triangle merging candidate list, a first triangle merging candidate that is uni-prediction, and a second triangle merging candidate selector structured to select, from the triangle merging candidate list, a second triangle merging candidate that is uni-prediction, in which in a region where motion compensation by weighted averaging by the first triangle merging candidate and the second triangle merging candidate is performed, uni-prediction motion information of one of the first triangle merging candidate or the second triangle merging candidate is saved. ## Claims ### Claim 1 A moving picture coding device using a triangle merge mode, the moving picture coding device comprising: a triangle merging candidate list constructor structured to a construct a triangle merging candidate list including spatial merging candidates; a first triangle merging candidate selector structured to select, from the triangle merging candidate list, a first triangle merging candidate that is used for uni-prediction partition 0 which consists of subblocks above a diagonal line of the triangle partition splitting a coding block; and a second triangle merging candidate selector structured to select, from the triangle merging candidate list, a second triangle merging candidate that is used for uni-prediction partition 1 which consists of subblocks below the diagonal line, wherein in uni-prediction partition 0, uni-prediction motion information of the first triangle merging candidate is stored and in uni-prediction partition 1, uni-prediction motion information of the second triangle merging candidate is stored and in bi-prediction partition 2 which consists of subblocks on the diagonal line where motion compensation by weighted averaging by the first triangle merging candidate and the second triangle merging candidate is performed, uni-prediction motion information of the second triangle merging candidate is stored in a coding information storage memory so that the uni-prediction motion information of the second triangle merging candidate can be referred to as inter prediction information neighboring the coding block without storing bi-prediction motion information which is converted from motion information of list L0 and motion information of List L1. ### Claim 2 A moving picture coding method using a triangle merge mode, the moving picture coding method comprising: a triangle merging candidate list constructing step for constructing a triangle merging candidate list including spatial merging candidates; a first triangle merging candidate selecting step for selecting, from the triangle merging candidate list, a first triangle merging candidate that is used for uni-prediction partition 0 which consists of subblocks above a diagonal line of the triangle partition splitting a coding block; and a second triangle merging candidate selecting step for selecting, from the triangle merging candidate list, a second triangle merging candidate that is used for uni-prediction partition 1 which consists of subblocks below the diagonal line, wherein in uni-prediction partition 0, uni-prediction motion information of the first triangle merging candidate is stored and in uni-prediction partition 1, uni-prediction motion information of the second triangle merging candidate is stored and in bi-prediction partition 2 which consists of subblocks on the diagonal line where motion compensation by weighted averaging by the first triangle merging candidate and the second triangle merging candidate is performed, uni-prediction motion information of the second triangle merging candidate is stored in a coding information storage memory so that the uni-prediction motion information of the second triangle merging candidate can be referred to as inter prediction information neighboring the coding block without storing bi-prediction motion information which is converted from motion information of list L0 and motion information of List L1. ### Claim 3 A non-transitory computer-readable medium storing a moving picture coding program using a triangle merge mode, that in response to execution, causes a computer to perform operations comprising: a triangle merging candidate list constructing step for constructing a triangle merging candidate list including spatial merging candidates; a first triangle merging candidate selecting step for selecting, from the triangle merging candidate list, a first triangle merging candidate that is used for uni-prediction partition 0 which consists of subblocks above a diagonal line of the triangle partition splitting a coding block; and a second triangle merging candidate selecting step for selecting, from the triangle merging candidate list, a second triangle merging candidate that is used for uni-prediction partition 1 which consists of subblocks below the diagonal line, wherein in uni-prediction partition 0, uni-prediction motion information of the first triangle merging candidate is stored and in uni-prediction partition 1, uni-prediction motion information of the second triangle merging candidate is stored and in bi-prediction partition 2 which consists of subblocks on the diagonal line where motion compensation by weighted averaging by the first triangle merging candidate and the second triangle merging candidate is performed, uni-prediction motion information of the second triangle merging candidate is stored in a coding information storage memory so that the uni-prediction motion information of the second triangle merging candidate can be referred to as inter prediction information neighboring the coding block without storing bi-prediction motion information which is converted from motion information of list L0 and motion information of List L1. ### Claim 4 A moving picture decoding device using a triangle merge mode, the moving picture decoding device comprising: a triangle merging candidate list constructor structured to construct a triangle merging candidate list including spatial merging candidates; a first triangle merging candidate selector structured to select, from the triangle merging candidate list, a first triangle merging candidate that is used for uni-prediction partition 0 which consists of subblocks above a diagonal line of the triangle partition splitting a coding block; and a second triangle merging candidate selector structured to select, from the triangle merging candidate list, a second triangle merging candidate that is used for uni-prediction partition 1 which consists of subblocks below the diagonal line, wherein in uni-prediction partition 0, uni-prediction motion information of the first triangle merging candidate is stored and in uni-prediction partition 1, uni-prediction motion information of the second triangle merging candidate is stored and in bi-prediction partition 2 which consists of subblocks on the diagonal line where motion compensation by weighted averaging by the first triangle merging candidate and the second triangle merging candidate is performed, uni-prediction motion information of the second triangle merging candidate is stored in a coding information storage memory so that the uni-prediction motion information of the second triangle merging candidate can be referred to as inter prediction information neighboring the coding block without storing bi-prediction motion information which is converted from motion information of list L0 and motion information of List L1. ### Claim 5 A moving picture decoding method using a triangle merge mode, the moving picture decoding method comprising: a triangle merging candidate list constructing step for constructing a triangle merging candidate list including spatial merging candidates; a first triangle merging candidate selecting step for selecting, from the triangle merging candidate list, a first triangle merging candidate that is used for uni-prediction partition 0 which consists of subblocks above a diagonal line of the triangle partition splitting a coding block; and a second triangle merging candidate selecting step for selecting, from the triangle merging candidate list, a second triangle merging candidate that is used for uni-prediction partition 1 which consists of subblocks below the diagonal line, wherein in uni-prediction partition 0, uni-prediction motion information of the first triangle merging candidate is stored and in uni-prediction partition 1, uni-prediction motion information of the second triangle merging candidate is stored and in bi-prediction partition 2 which consists of subblocks on the diagonal line where motion compensation by weighted averaging by the first triangle merging candidate and the second triangle merging candidate is performed, uni-prediction motion information of the second triangle merging candidate is stored in a coding information storage memory so that the uni-prediction motion information of the second triangle merging candidate can be referred to as inter prediction information neighboring the coding block without storing bi-prediction motion information which is converted from motion information of list L0 and motion information of List L1. ### Claim 6 A non-transitory computer-readable medium storing a moving picture decoding program using a triangle merge mode, that in response to execution, causes a computer to perform operations comprising: a triangle merging candidate list constructing step for constructing a triangle merging candidate list including spatial merging candidates; a first triangle merging candidate selecting step for selecting, from the triangle merging candidate list, a first triangle merging candidate that is used for uni-prediction partition 0 which consists of subblocks above a diagonal line of the triangle partition splitting a coding block; and a second triangle merging candidate selecting step for selecting, from the triangle merging candidate list, a second triangle merging candidate that is used for uni-prediction partition 1 which consists of subblocks below the diagonal line, wherein in uni-prediction partition 0, uni-prediction motion information of the first triangle merging candidate is stored and in uni-prediction partition 1, uni-prediction motion information of the second triangle merging candidate is stored and in bi-prediction partition 2 which consists of subblocks on the diagonal line where motion compensation by weighted averaging by the first triangle merging candidate and the second triangle merging candidate is performed, uni-prediction motion information of the second triangle merging candidate is stored in a coding information storage memory so that the uni-prediction motion information of the second triangle merging candidate can be referred to as inter prediction information neighboring the coding block without storing bi-prediction motion information which is converted from motion information of list L0 and motion information of List L1. ### Claim 7 A method for storing a bitstream generated by a moving picture coding method using a triangle merge mode in a non-transitory computer-readable medium, the moving picture coding method comprising, a coding unit structured to code a first triangle merging index and a second triangle merging index; a triangle merging candidate list constructor structured to a construct a triangle merging candidate list including spatial merging candidates; a first triangle merging candidate selector structured to select, from the triangle merging candidate list, a first triangle merging candidate that is used for uni-prediction partition 0 which consists of subblocks above a diagonal line of the triangle partition splitting a coding block; and a second triangle merging candidate selector structured to select, from the triangle merging candidate list, a second triangle merging candidate that is used for uni-prediction partition 1 which consists of subblocks below the diagonal line, wherein in uni-prediction partition 0, uni-prediction motion information of the first triangle merging candidate is stored and in uni-prediction partition 1, uni-prediction motion information of the second triangle merging candidate is stored and in bi-prediction partition 2 which consists of subblocks on the diagonal line where motion compensation by weighted averaging by the first triangle merging candidate and the second triangle merging candidate is performed, uni-prediction motion information of the second triangle merging candidate is stored in a coding information storage memory so that the uni-prediction motion information of the second triangle merging candidate can be referred to as inter prediction information neighboring the coding block without storing bi-prediction motion information which is converted from motion information of list L0 and motion information of List L1. ### Claim 8 A method for transmitting a bitstream generated by a moving picture coding method using a triangle merge mode, the moving picture coding method comprising, a coding unit structured to code a first triangle merging index and a second triangle merging index; a triangle merging candidate list constructor structured to a construct a triangle merging candidate list including spatial merging candidates; a first triangle merging candidate selector structured to select, from the triangle merging candidate list, a first triangle merging candidate that is used for uni-prediction partition 0 which consists of subblocks above a diagonal line of the triangle partition splitting a coding block; and a second triangle merging candidate selector structured to select, from the triangle merging candidate list, a second triangle merging candidate that is used for uni-prediction partition 1 which consists of subblocks below the diagonal line, wherein in uni-prediction partition 0, uni-prediction motion information of the first triangle merging candidate is stored and in uni-prediction partition 1, uni-prediction motion information of the second triangle merging candidate is stored and in bi-prediction partition 2 which consists of subblocks on the diagonal line where motion compensation by weighted averaging by the first triangle merging candidate and the second triangle merging candidate is performed, uni-prediction motion information of the second triangle merging candidate is stored in a coding information storage memory so that the uni-prediction motion information of the second triangle merging candidate can be referred to as inter prediction information neighboring the coding block without storing bi-prediction motion information which is converted from motion information of list L0 and motion information of List L1.