# US 12,120,324 B2 · Picture coding method, picture coding apparatus, picture decoding method, and picture decoding apparatus > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,120,324 B2 - Document ID: US12120324B2 - Status: Granted - Kind: B2 - Application number: 18/124,769 - Filed: 2023-03-22 - Published: 2023-07-13 - Granted: 2024-10-15 - Earliest claimed: 2011-10-19 - Assignees: Sun Patent Trust - Applicants: Sun Patent Trust - Inventors: Toshiyasu Sugio; Takahiro Nishi; Youji Shibahara; Kyoko Tanikawa; Hisao Sasai; Toru Matsunobu; Kengo Terada - Web page: https://patentgrep.com/patent/US12120324B2 ## CPC - H04N 19/192: the adaptation method, adaptation tool or adaptation type being iterative or recursive - 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/139: Analysis of motion vectors, e.g. their magnitude, direction, variance or reliability - H04N 19/149: by estimating the code amount by means of a model, e.g. mathematical model or statistical model - 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/52: by predictive encoding - H04N 19/573: Motion compensation with multiple frame prediction using two or more reference frames in a given prediction direction - H04N 19/46: Embedding additional information in the video signal during the compression process (H04N19/517, H04N19/68, H04N19/70 take precedence) - H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION ## Abstract A picture coding method includes: performing a first derivation process for deriving a first merging candidate which includes a candidate set of a prediction direction, a motion vector, and a reference picture index for use in coding of a current block; performing a second derivation process for deriving a second merging candidate; selecting a merging candidate to be used in the coding of the current block from among the first and second merging candidates; and attaching an index for identifying the selected merging candidate to the bitstream; wherein the first derivation process is performed so that a total number of the first merging candidates does not exceed a predetermined number, and the second derivation process is performed when the total number of the first merging candidates is less than a predetermined maximum number of merging candidates. ## Claims ### Claim 1 A picture coding method for coding a picture, on a block-by-block basis, to generate bitstream, the method comprising: performing a third derivation process for deriving third candidates, each of the third candidates including a third motion vector corresponding to a third direction number, for use in coding of a current block, the third motion vector used for coding another block, the other block being decoded before the current block is coded, and the other block being different from the current block; performing a first derivation process for deriving a first candidate which includes a candidate set of a first prediction direction number which indicates bi-prediction, a first motion vector, and a fourth motion vector for use in the coding of the current block, the first motion vector being included in one of the third candidates, the fourth motion vector being included in another one of the third candidates; performing a second derivation process for deriving a second candidate which includes a second motion vector corresponding to a second prediction direction for use in the coding of the current block, the second motion vector being a zero motion vector; selecting a candidate to be used in the coding of the current block from among the first candidate, the second candidate, and the third candidates; and attaching information for identifying the selected candidate to the bitstream, wherein in the performing of a first derivation process, the first derivation process is performed so that a total number of the first candidates does not exceed a first predetermined number, the second derivation process is performed until a total number of the first to third candidates equals to a second predetermined number, the second predetermined number being a maximum number of the candidates, and the second predetermined number is greater than the first predetermined number wherein the second derivation process is performed regardless the first derivation process. ### Claim 2 (depends on 1) The picture coding method according to claim 1, wherein the first predetermined number depends on a maximum number of the first candidates to be derived using the first derivation process. ### Claim 3 (depends on 1) The picture coding method according to claim 1, further comprising: switching a coding process between a first coding process conforming to a first standard and a second coding process conforming to a second standard, according to identification information attached to the bitstream and indicating either the first standard or the second standard; and attaching, to the bitstream, identification information indicating either the first standard or the second standard to which the coding process after the switching conforms, wherein when the coding process after the switching is the first coding process, the first coding process is performed by performing the first derivation process, the second derivation process, the selecting, and attaching. ### Claim 4 (depends on 1) The picture coding method according to claim 1, wherein the other block is adjacent to the current block in the picture. ### Claim 5 A picture coding apparatus which codes a picture, on a block-by-block basis, to generate a bitstream, the apparatus comprising: a processor; and a non-transitory memory having stored thereon executable instructions, which when executed by the processor, cause the processor to perform: performing a third derivation process for deriving third candidates, each of the third candidates including a third motion vector corresponding to a third direction number, for use in coding of a current block, the third motion vector used for coding another block, the other block being coded before the current block is coded, and the other block being different from the current block; performing a first derivation process for deriving a first candidate which includes a candidate set of a first prediction direction number which indicates bi-prediction, a first motion vector, and a fourth motion vector for use in the coding of the current block, the first motion vector being included in one of the third candidates, the fourth motion vector being included in another one of the third candidates; performing a second derivation process for deriving a second candidate which includes a second motion vector corresponding to a second prediction direction for use in the coding of the current block, the second motion vector being a zero motion vector; selecting a candidate to be used in the coding of the current block from among the first candidate, the second candidate, and the third candidates; and attaching information for identifying the selected candidate to the bitstream, wherein the first derivation process is performed so that a total number of the first candidates does not exceed a first predetermined number, the second derivation process is performed until a total number of the first to third candidates equals to a second predetermined number, the second predetermined number being a maximum number of the candidates, and the second predetermined number is greater than the first predetermined number wherein the second derivation process is performed regardless the first derivation process.