US 12,301,870 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)
Assigned to PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA, Torrance, CA (US)
Filed by Panasonic Intellectual Property Corporation of America, Torrance, CA (US)
Filed on Nov. 15, 2021, as Appl. No. 17/526,640.
Application 17/526,640 is a continuation of application No. 17/126,848, filed on Dec. 18, 2020, granted, now 11,206,426.
Application 17/126,848 is a continuation of application No. PCT/JP2019/025376, filed on Jun. 26, 2019.
Claims priority of provisional application 62/690,581, filed on Jun. 27, 2018.
Prior Publication US 2022/0078487 A1, Mar. 10, 2022
This patent is subject to a terminal disclaimer.
Int. Cl. H04N 19/597 (2014.01); H04N 19/105 (2014.01); H04N 19/169 (2014.01); H04N 19/46 (2014.01); H04N 19/96 (2014.01)
CPC H04N 19/597 (2014.11) [H04N 19/105 (2014.11); H04N 19/1883 (2014.11); H04N 19/46 (2014.11); H04N 19/96 (2014.11)] 12 Claims
OG exemplary drawing
 
1. A method for encoding three-dimensional data, comprising:
generating an occupied neighborhood pattern based on available neighboring nodes neighboring a node included in an N-ary tree structure of three-dimensional points included in three-dimensional data;
determining whether first encoding is usable for encoding position information of one or more three-dimensional points included in the node based on the occupied neighborhood pattern; and
determining whether a parameter indicates a first value or a second value, the second value being different than the first value, wherein
when the parameter indicates the first value, the available neighboring nodes include sibling nodes of the node and other neighboring nodes neighboring the node different from the sibling nodes, and
when the parameter indicates the second value, the available neighboring nodes include only the sibling nodes of the node.