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
地域：
Yokohama
摘要
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.
說(shuō)明書
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
The present invention relates to picture coding and decoding techniques in which a picture is split into blocks and prediction is performed.
In coding and decoding of a picture, a target picture is split into blocks, each of which being a group of a predetermined number of samples, and processing is performed in units of blocks. Splitting a picture into appropriate blocks with appropriate settings of intra prediction and inter prediction enables improvement of coding efficiency.
Coding/decoding of a moving picture uses inter prediction that performs prediction from a coded/decoded picture, thereby improving coding efficiency. Patent Literature 1 describes a technique of applying an affine transform at the time of inter prediction. Moving pictures often involve object deformation such as enlargement/reduction or rotation, and thus, application of the technique in Patent Document 1 enables efficient coding.
[Patent Document 1] JP 9-172644 A.
Unfortunately, however, the technique of Patent Document 1 involves picture transform, leading to a problem of heavy processing load. The present invention has been made in view of the above problem, and provides a low load and efficient coding technique.
權(quán)利要求
What is claimed is: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 uni-prediction, wherein the first triangle merging candidate is used in a triangle partition 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 uni-prediction, wherein the second triangle merging candidate is used in a triangle partition below the diagonal line, wherein 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 the second triangle merging candidate is stored in a coding information storage memory so that the uni-prediction motion information 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. 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 uni-prediction, wherein the first triangle merging candidate is used in a triangle partition 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 uni-prediction, wherein the second triangle merging candidate is used in a triangle partition below the diagonal line, wherein 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 the second triangle merging candidate is stored in a coding information storage memory so that the uni-prediction motion information 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. 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 uni-prediction, wherein the first triangle merging candidate is used in a triangle partition 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 uni-prediction, wherein the second triangle merging candidate is used in a triangle partition below the diagonal line, wherein 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 the second triangle merging candidate is stored in a coding information storage memory so that the uni-prediction motion information 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. 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 uni-prediction, wherein the first triangle merging candidate is used in a triangle partition above 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 uni-prediction, wherein the second triangle merging candidate is used in a triangle partition below the diagonal line, wherein 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 the second triangle merging candidate is stored in a coding information storage memory so that the uni-prediction motion information 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. 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 uni-prediction, wherein the first triangle merging candidate is used in a triangle partition 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 uni-prediction, wherein the second triangle merging candidate is used in a triangle partition below the diagonal line, wherein 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 the second triangle merging candidate is stored in a coding information storage memory so that the uni-prediction motion information 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. 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 uni-prediction, wherein the first triangle merging candidate is used in a triangle partition 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 uni-prediction, wherein the second triangle merging candidate is used in a triangle partition below the diagonal line, wherein 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 the second triangle merging candidate is stored in a coding information storage memory so that the uni-prediction motion information 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.
意見反饋
使用該功能遇到問(wèn)題
該功能需要專業(yè)版企業(yè)版VIP權(quán)限，您可以：
您也可以聯(lián)系官方QQ: 2157717237 電話: 13264338900