| CPC H04N 19/139 (2014.11) [H04N 19/105 (2014.11); H04N 19/11 (2014.11); H04N 19/13 (2014.11); H04N 19/147 (2014.11); H04N 19/172 (2014.11); H04N 19/174 (2014.11); H04N 19/196 (2014.11); H04N 19/46 (2014.11); H04N 19/463 (2014.11); H04N 19/521 (2014.11); H04N 19/593 (2014.11)] | 4 Claims |

|
1. A decoder that receives a bitstream indicating how a coding tree unit was partitioned into coding units according to a partitioning structure that allows nodes to be split into coding units according to a partitioning structure that includes a rectangular coding unit, the decoder comprising:
(a) at least one processor that decodes the coding tree units based upon said partitioning structure into coding units including said rectangular coding unit, where said bitstream includes a slice;
(b) a first sample that corresponds one of a set of side neighboring samples to a respective one of the coding units that is on a first line between a predicted sample of said respective one of the coding units and said first sample;
(c) a second sample that corresponds one of a set of top neighboring samples to said respective one of the coding units that is on a second line between said predicted sample of said respective one of the coding units and said second sample;
(d) wherein said first sample, said second sample, and said predicted sample are arranged to form a plane;
(e) wherein said first line is different than said second line;
(f) wherein said first line is free from being based upon any of the said set of side neighboring samples nor any samples along said first line, and said second line is free from being based upon any of said set of top neighboring samples nor any samples along said second line;
(g) wherein said predicted sample is based upon said first sample and said second sample.
|