IP Library › Granted Patent US 11,206,426
Granted Patent B2
US 11,206,426 · App. 17/126,848 · Granted Dec 21, 2021

Three-dimensional data encoding method, three-dimensional data decoding method, three-dimensional data encoding device, and three-dimensional data decoding device using occupancy patterns

Inventor: Toshiyasu Sugio (Osaka, JP)
Assignee: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
H04N19/597H04N19/105H04N19/1883H04N19/46H04N19/96
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,206,426
App. No.
17/126,848
Filed
Dec 18, 2020
Granted
Dec 21, 2021
Kind
B2
Art Unit
2485
USPC
375/240.12
Abstract

A three-dimensional data encoding method includes: (i) when a first flag indicates a first value, creating a first occupancy pattern indicating occupancy states of second neighboring nodes including a first neighboring node having a parent node different from a parent node of a current node included in an N-ary tree structure of three-dimensional points included in three-dimensional data, and determining whether first encoding is usable based on the first occupancy pattern, the first encoding being for encoding pieces of position information of three-dimensional points included in the current node without dividing the current node into child nodes; (ii) when the first flag indicates a second value, creating a second occupancy pattern indicating occupancy states of third neighboring nodes excluding the first neighboring node, and determining whether the first encoding is usable based on the second occupancy pattern; and (iii) generating a bitstream including the first flag.

Claims (38)

1. A method for encoding three-dimensional data, comprising:

(i) when a first parameter indicates a first value,

generating a first occupancy pattern based on neighboring nodes neighboring a current node and located inside or outside a parent node of the current node included in an N-ary tree structure of three-dimensional points included in three-dimensional data, and

determining whether to set a candidate node as an early terminated node included in the current node based on the first occupancy pattern, wherein position information of three-dimensional points included in the early terminated node is encoded by first encoding;

(ii) when the first parameter indicates a second value different from the first value,

generating a second occupancy pattern based on neighboring nodes neighboring the current node and located inside a parent node of the current node, and

determining whether to set the candidate node as the early terminated node included in the current node based on the second occupancy pattern; and

(iii) generating a bitstream including the first parameter.

2. A method for decoding three-dimensional data, comprising:

obtaining a first parameter;

(i) when the first parameter indicates a first value,

generating a first occupancy pattern based on neighboring nodes neighboring a current node and located inside or outside a parent node of the current node included in an N-ary tree structure of three-dimensional points included in three-dimensional data, and

determining whether to set a candidate node as an early terminated node included in the current node based on the first occupancy pattern, wherein position information of three-dimensional points included in the early terminated node is decoded by first decoding; and

(ii) when the first parameter indicates a second value different from the first value,

generating a second occupancy pattern based on neighboring nodes neighboring the current node and located inside a parent node of the current node, and

determining whether to set the candidate node as the early terminated node included in the current node based on the second occupancy pattern.

3. A device for encoding three-dimensional data, the device comprising:

a processor; and

memory,

wherein using the memory, the processor:

(i) when a first parameter indicates a first value,

generates a first occupancy pattern based on neighboring nodes neighboring a current node and located inside or outside a parent node of the current node included in an N-ary tree structure of three-dimensional points included in three-dimensional data, and

determines whether to set a candidate node as an early terminated node included in the current node based on the first occupancy pattern, wherein position information of three-dimensional points included in the early terminated node is encoded by first encoding;

(ii) when the first parameter indicates a second value different from the first value,

generates a second occupancy pattern based on neighboring nodes neighboring the current node and located inside a parent node of the current node, and

determines whether to set the candidate node as the early terminated node included in the current node based on the second occupancy pattern; and

(iii) generates a bitstream including the first parameter.

4. A device for decoding three-dimensional data, the device comprising:

a processor; and

memory,

wherein using the memory, the processor:

obtains a first parameter;

(i) when the first parameter indicates a first value,

generates a first occupancy pattern based on neighboring nodes neighboring a current node and located inside or outside a parent node of the current node included in an N-ary tree structure of three-dimensional points included in three-dimensional data, and

determines whether to set a candidate node as an early terminated node included in the current node based on the first occupancy pattern, wherein position information of three-dimensional points included in the early terminated node is decoded by first decoding; and

(ii) when the first parameter indicates a second value different from the first value,

generates a second occupancy pattern based on neighboring nodes neighboring the current node and located inside a parent node of the current node, and

determines whether to set the candidate node as the early terminated node included in the current node based on the second occupancy pattern.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 22, 2021
From: SUGIO, TOSHIYASU
To: PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA
Reel/Frame 055676/0798 →
Continuity (3)
Continuation PCTJP2019025376 · Jun 26, 2019
Provisional Application 62690581 · Jun 27, 2018
Related Publication 20210105505A1 · Apr 8, 2021
Cited By (7)
US 12,225,241 US 12,230,004 US 12,327,386 US 12,389,031 US 12,389,032 US 12,406,404 US 12,432,341