US 12,073,591 B2
Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device
Toshiyasu Sugio, Osaka (JP); and Noritaka Iguchi, Osaka (JP)
Assigned to PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA, Torrance, CA (US)
Filed by Panasonic Intellectual Property Corporation of America, Torrance, CA (US)
Filed on Aug. 16, 2021, as Appl. No. 17/403,113.
Application 17/403,113 is a continuation of application No. PCT/JP2020/008540, filed on Feb. 28, 2020.
Claims priority of provisional application 62/811,806, filed on Feb. 28, 2019.
Prior Publication US 2021/0375004 A1, Dec. 2, 2021
Int. Cl. G06T 9/00 (2006.01); H04N 19/33 (2014.01); H04N 19/593 (2014.01)
CPC G06T 9/00 (2013.01) [H04N 19/33 (2014.11); H04N 19/593 (2014.11)] 13 Claims
OG exemplary drawing
 
1. A three-dimensional data encoding method, comprising:
selecting, as one or more candidates for calculating a predicted value of attribute information of a first three-dimensional point, one or more three-dimensional points from a plurality of three-dimensional points based on one or more distances from the first three-dimensional point;
calculating a predicted value using pieces of attribute information of the one or more three-dimensional points selected as the one or more candidates;
calculating a prediction residual that is a difference between (i) the attribute information of the first three-dimensional point and (ii) the predicted value calculated; and
generating a bitstream, based on the prediction residual,
wherein in the selecting, when the plurality of three-dimensional points include three-dimensional points equidistant from the first three-dimensional point, the one or more candidates are selected based on a first Morton code of the first three-dimensional point,
the plurality of three-dimensional points are one-dimensionally arranged in order of Morton codes, belong to a first layer higher than a layer to which the first three-dimensional point belongs, and comprise a first group and a second group,
the first group includes one or more third three-dimensional points having Morton codes closer to the first Morton code than other three-dimensional points included in the plurality of three-dimensional points,
the second group neighbors the first group, and the second group includes one or more fourth three-dimensional points having Morton codes greater than the first Morton code, the one or more fourth three-dimensional points belonging to the first layer,
the second group is searched for the one or more candidates after the first group, and
when the third three-dimensional points included in the first group are selected as the one or more candidates, and a distance between the first three-dimensional point and one of the one or more third three-dimensional points is equal to a distance between the first three-dimensional point and one of the one or more fourth three-dimensional points, the one or more third three-dimensional points are maintained as the one or more candidates.