CN113453009A - Point cloud space scalable coding geometric reconstruction method based on fitting plane geometric error minimum - Google Patents
Point cloud space scalable coding geometric reconstruction method based on fitting plane geometric error minimum Download PDFInfo
- Publication number
- CN113453009A CN113453009A CN202110753984.0A CN202110753984A CN113453009A CN 113453009 A CN113453009 A CN 113453009A CN 202110753984 A CN202110753984 A CN 202110753984A CN 113453009 A CN113453009 A CN 113453009A
- Authority
- CN
- China
- Prior art keywords
- geometric
- neighbor
- node
- point
- plane
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
- H04N19/33—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability in the spatial domain
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/154—Measured or subjectively estimated visual quality after decoding, e.g. measurement of distortion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
- H04N19/597—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding specially adapted for multi-view video sequence encoding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
- H04N19/96—Tree coding, e.g. quad-tree coding
Abstract
The invention relates to a point cloud space scalable coding geometric reconstruction method based on minimum fitting plane geometric error, belonging to the technical field of video coding and decoding. And fitting a local plane of the current node by using neighbor node information through a local space formed by each node and 26 neighbor nodes around, constructing a geometric error function according to a point-to-point geometric error measurement principle, and solving a corresponding coordinate value when the geometric error minimum value is solved to serve as a reconstructed geometric coordinate. The problem of the geometric error is great in the space scalable back geometry reconstruction process is solved.
Description
Technical Field
The invention relates to the technical field of video coding and decoding, in particular to a point cloud space scalable coding geometric reconstruction method based on minimum geometric error of a fitting plane.
Background
In a point cloud G-PCC encoder framework, the slice is independently encoded after the input point cloud is divided. In slice, the geometric information of the point cloud and the attribute information corresponding to the points in the point cloud are encoded separately. The G-PCC encoder first encodes the geometry information. The encoder performs coordinate conversion on the geometric information to enable the point clouds to be contained in a bounding box; and then, quantization is carried out, wherein the quantization step mainly plays a role of scaling, as the quantization rounding ensures that the geometric information of a part of points is the same, whether to remove the repeated points is determined according to the parameters, the process of not removing the repeated points is called geometric lossless compression, the process of removing the repeated points is called geometric lossy compression, and the process of quantizing and removing the repeated points is also called a voxelization process. Next, the bounding box is divided based on octree. The geometric lossless compression process and the geometric lossy compression process have geometric reconstruction processes when the octree division is completed.
In the point cloud G-PCC decoder framework, the geometric bit stream information of the point cloud and the attribute bit stream corresponding to the points in the point cloud are decoded separately. The G-PCC decoder first decodes the geometry bitstream. The decoder performs arithmetic decoding on the geometric bit stream to decode a bounding box of the point cloud and occupied bits (1 is non-empty and 0 is empty) based on octree; decoding of geometric information is divided into two frames based on octree and trisup (triangular patch set) according to the difference of the hierarchy depth of octree partitioning during encoding.
spatial scalability (spatial scalability) is an important function of G-PCC, generating point cloud thumbnails by decoding partial point cloud bitstream information, and currently only works in decoding frameworks based on octree geometry information. skip Layer is an octree level with less decoding at the decoding end. As shown in fig. 1, the octree geometry is encoded to the K-th layer, and when the spatial scalability process is not performed, the K-th layer is completely decoded; and partial decoding is carried out when the spatial scalability process is carried out until the M Layer is finished (M is K-skip Layer).
Its function is controlled by the parameter scalable _ shifting _ enabled _ flag. When the scalable _ shifting _ enabled _ flag is equal to 0, the spatial scalability function is not performed; when the scalable _ shifting _ enabled _ flag is 1, the spatial scalability function is performed.
In an octree-based geometric information decoding frame, a maximum cube box of a current point cloud in a space is calculated according to a bounding box, then, non-empty sub cubes are continuously subjected to octal division according to occupied bits, the division is stopped when leaf nodes obtained through the division are unit cubes of 1 multiplied by 1, but if Spatial scalability is carried out in the decoding process, the leaf nodes are divided to a specified skip Layer, and 2 is generatedskipLayer×2skipLayer×2skipLayerThe cube of (1). Then, generating geometric coordinates through the cube, wherein the geometric coordinates are coordinates of the left front lower corner of the cube for a unit cube with leaf nodes of 1 multiplied by 1, and the geometric coordinates are coordinates of 2 for the leaf nodesskipLayer×2skipLayer×2skipLayerAccording to the different skip Layer, different reconstruction strategies are adopted for the geometrical coordinates of the unit cube.
The current scalable coding geometry reconstruction method in the standard is proposed by Hyejung Hur, Sejin Oh of LGelectronics Inc in proposal m52315 at 1 month 2020 and is received by the MPEG G-PCC standard (i.e., MPEG-I (ISO/IEC 23090) Part 9). The technical scheme is that different reconstruction strategies are adopted according to different levels of the skip Layer.
The specific implementation of the decoding end is described as follows:
when the skip Layer is equal to 1, the geometric coordinate is the coordinate of the lower left front corner of the cube, as shown in fig. 3.Q point position;
when the skip Layer is greater than 1, the geometric coordinate is the coordinate of the center position of the cube, such as the position of a P point in FIG. 3;
the technique is currently in the standard appendix C.
C.3 decoded position shift procedure
When mingeotnesizelog 2 is greater than 1, the process operates as follows for each slice of the current point cloud image in the octree-based geometric information decoding framework:
MinGeomNodeSizeLog2 is the minimum node side length of the current octree, and the value is equal to skip Layer;
PointCount is the total number of nodes when the current slice is decoded to the level of MinGeomNodeSizeLog 2;
PointPos [ i ] [0] is the x-axis coordinate of the current node reconstruction geometric point;
PointPos [ i ] [1] is the y-axis coordinate of the current node reconstruction geometric point;
PointPos [ i ] [2] is the z-axis coordinate of the current node reconstruction geometric point;
mask is the intermediate mask;
the initial value of PointPos [ i ] [0] PointPos [ i ] [1] PointPos [ i ] [2] is the coordinates of the left/front/lower corner of the cube with the current side length of MinGeomNodeSizeLog2 node, as shown in FIG. 3.Q, and through the shift operation of the codes, the value of PointPos [ i ] [0] PointPos [ i ] [1] PointPos [ i ] [2] is equal to the coordinates of the center position of the cube of the current node, as shown in FIG. 3.P point.
Currently, G-PCC measures the process geometry error using the following two methods.
(1) Using the point-to-point distance representation, the point-to-point geometric error measure calculation process is shown in FIG. 5, which is a black dot (b)i) Red point (a) as the point generated after point cloud expansion coding and decodingj) The point in the original point cloud with the closest distance. The difference between the coordinates of the black dot and the red dot (E (i, j) ═ b)i-aj) Is a point-to-point error vector. The length of the error vector is a point-to-point geometric error, namely:
b is a sparse point cloud after expansion coding, A is an original point cloud, and the point-to-point distance of B belongs to all points i
With NBFor the number of points in point cloud B, the point-to-point error D1 for the entire point cloud is defined as:
(2) using the point-to-plane distance representation, error vector E (i, j) is oriented normal to NjProjecting to obtain a new error vector
Thus, the point-to-plane error is calculated as:
in the above technology, only part of the geometric bitstream information is decoded, and all points in the node range are represented by one geometric point in the node space with the side length of the skip Layer, so that the geometric reconstruction process after the spatial scalability is performed is a lossy process.
Disclosure of Invention
Technical problem to be solved
The method aims to solve the problems that in the existing geometric reconstruction process after space scalability, the difference of distribution conditions of internal points of different nodes is not considered, and the geometric error in the geometric reconstruction process after space scalability is large. The invention provides a point cloud space scalable coding geometric reconstruction method based on minimum fitting plane geometric error.
Technical scheme
A point cloud space scalable coding geometric reconstruction method based on fitting plane geometric error minimum is characterized in that: and fitting a local plane of the current node by using neighbor node information through a local space formed by each node and 26 neighbor nodes around, constructing a geometric error function according to a point-to-point geometric error measurement principle, and solving a corresponding coordinate value when the geometric error minimum value is solved to serve as a reconstructed geometric coordinate.
The further technical scheme of the invention is as follows: the surrounding 26 neighbor nodes comprise 6 coplanar neighbor nodes, 12 common-edge neighbor nodes and 8 common-point neighbor nodes.
The further technical scheme of the invention is as follows: the fitting of the local plane of the current node by using the neighbor node information specifically comprises the following steps:
1) k neighbor node plane fitting judgment
Retrieving 26 neighbor situations of the current neighbor node, and setting the number of neighbors existing in the 26 neighbors as: neighNum;
when the neighbor num is larger than or equal to K, calculating K neighbor nodes closest to the node center position coordinate by using the neighbor num nodes existing in 26 neighbor nodes around the node, and calculating the neighbor node center position coordinate by using the P point coordinate, the octreeSize of the node side length of the octree and the position of the neighbor;
2) least square method plane fitting
The final equation for plane fitting by using the least square method plane fitting principle and the central position coordinates of N1-Nk is as follows:
a0*x+al*y+a2-z＝O
wherein xi、yi、ziAnd the coordinates of the center position of the neighbor node.
The further technical scheme of the invention is as follows: the method is characterized in that the K value is equal to the number of searching neighbors of a point cloud image plane normal vector, and can be 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 and 16.
The further technical scheme of the invention is as follows: when the minimum value of the geometric error is solved, the corresponding coordinate value is taken as the reconstructed geometric coordinate as follows:
advantageous effects
The point cloud space scalable coding geometric reconstruction method based on the minimum fitting plane geometric error provided by the invention makes full use of the spatial correlation of the point cloud, so that the error of geometric reconstruction after spatial scalability is reduced. The geometric information PSNR represents: compared with the prior art, under the condition of the same code rate, the geometric error brought by the method provided by the invention is reduced (PSNR is a positive value) or increased (PSNR is a negative value) than that brought by the prior art.
Drawings
The drawings are only for purposes of illustrating particular embodiments and are not to be construed as limiting the invention, wherein like reference numerals are used to designate like parts throughout.
FIG. 1 is a schematic view of a spatial scalability;
FIG. 2G-PCC decoder framework diagram;
FIG. 3 a scalable post-coding geometric reconstruction method;
FIG. 4 is a schematic diagram of the location of the present invention in the frame of a point cloud G-PCC decoder;
FIG. 5 is a schematic of a point-to-point error;
FIG. 6 is a schematic diagram of the center positions of the nodes and the neighboring nodes.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in further detail below with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. In addition, the technical features involved in the embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.
The terms and expressions referred to in the present invention are used for the following explanations:
1) point Cloud Compression (PCC)
2) Geometry-based Point Cloud Compression (G-PCC)
3) Sheet (slice)
4) Bounding box (bounding box)
5) OctreeImage (octree)
6) Intra-frame prediction (intra prediction)
7) Triangular patch set (triangle soup, trisup)
8) Context-based Adaptive Binary Arithmetic Coding (CABAC)
9) Block (block)
10) Crossing point (vertex)
11) Level of Detail (Level of Detail, LOD)
12) Region Adaptive Hierarchical Transform (RAHT)
13) Skipping Layer (skip Layer)
14) Spatial Scalability (Spatial Scalability)
15) Moving Picture Experts Group (MPEG)
16) International Organization for Standardization (ISO)
17) International Electrotechnical Commission (IEC)
18) Log2 logarithm of Minimum geometric Node side length (Minimum Geometry Node Size Log2, MinGeomNodeSizeLog2)
19) Direct code Point (Direct Point Count )
The invention provides a brand-new point cloud space scalable coding geometric reconstruction method based on the minimum geometric error of a fitting plane, which is characterized in that a local space is formed by each node and 26 surrounding neighbor nodes, the local plane of the current node is fitted by using neighbor node information, a geometric error function is constructed according to a point-to-point geometric error measurement principle, and a corresponding coordinate value when the minimum geometric error is solved is used as a reconstructed geometric coordinate. The specific process is as follows:
Njis a point ajThe normal vector of (a) is a normal vector using a point ajAnd neighbor points (K points in total) of the local plane are fitted with the normal vector of the local plane, and after scalable is carried out, each specific position information of the point cloud cannot be obtained at a decoding end, and the accurate local plane and plane normal vector cannot be calculated, so that neighbor occupation information of the current node is adopted to carry out approximate fitting on the local plane, and the local plane equation is calculated.
K neighbor node plane fitting judgment
Retrieving 26 neighbor situations of the current neighbor node, and setting the number of neighbors existing in the 26 neighbors as: neighNum;
when neighNum is larger than or equal to K, K neighbor nodes closest to the node center position coordinate (point P in figure 6 is the node center position) are calculated by using neighNum nodes existing in 26 neighbor nodes around the node, and the neighbor node center position coordinate (point N1-Nk in figure 6 are the neighbor node center position coordinates) is calculated by using the point P coordinate, octreeSize node side length and neighbor positions.
2. Least square method plane fitting
And performing plane fitting by using the least square method plane fitting principle through the central position coordinates of N1-Nk. According to the least square method plane fitting principle and a general plane formula:
z＝a0*x+a1*y+a2
the least square method shows that:
S＝minΣ[(a0*xi+a1*yi+a2)-2i]2
for the above formula, respectively take a0,a1,a2Partial derivatives of (a):
and then, converting the formula into a matrix form after shifting:
then, a is obtained by the Kramer rule according to the formula0,a1,a2A determinant expression of (a);
namely: the final equation for plane fitting by using the least square method plane fitting principle and the central position coordinates of N1-Nk is as follows:
a0*x+al*y+a2-z＝O
3. calculation of geometrical reconstruction coordinates after plane fitting
According to the prior condition, the coordinate point after geometric reconstruction can not exceed the node space, namely, a point coordinate point P is selected1(x, y, z) satisfies the following constraints:
(Point P)1(x, y, z) are geometric coordinates satisfying the above conditions, and the point P1(x, y, z) is on the fitted plane. )
From the point-to-point error measure, point P1(x, y, z) in local space (e.g., the largest cubic space in FIG. 3), the point-to-point geometric error equation:
and because of the point P1(x, y, z) satisfies the fitted plane equation described above, i.e.:
a0*x+al*y+a2＝z
therefore, the above-mentioned error function is equivalent to:
partial derivatives of f (x, y) in the x direction:
when in use
When the temperature of the water is higher than the set temperature,
partial derivatives of f (x, y) in the y direction:
when in use
When the temperature of the water is higher than the set temperature,
wherein the content of the first and second substances,
the minimum value of the above error equation is:
and because of
z＝a0*x+a1*y+a2
Therefore, the final geometric coordinates of the selected points are as follows:
this value is the minimum solution of the above-mentioned geometric error equation.
In the following, the case where the skip Layer is 3 different from the skip Layer is compared.
D1-PSNR is calculated as follows:
D2-PSNR is calculated as follows:
(where p is the peak constant value for each reference point cloud defined in the table, determined from the point cloud sequence, as shown in Table 2. bold.)
TABLE 1 PSNR for geometric information
TABLE 2 constant value of point cloud sequence peak
While the invention has been described with reference to specific embodiments, the invention is not limited thereto, and various equivalent modifications or substitutions can be easily made by those skilled in the art within the technical scope of the present disclosure.
Claims (5)
1. A point cloud space scalable coding geometric reconstruction method based on fitting plane geometric error minimum is characterized in that: and fitting a local plane of the current node by using neighbor node information through a local space formed by each node and 26 neighbor nodes around, constructing a geometric error function according to a point-to-point geometric error measurement principle, and solving a corresponding coordinate value when the geometric error minimum value is solved to serve as a reconstructed geometric coordinate.
2. The method of claim 1, wherein the surrounding 26 neighbor nodes comprise 6 coplanar neighbor nodes, 12 common edge neighbor nodes, and 8 common point neighbor nodes.
3. The method for point cloud space scalable coding geometric reconstruction based on fitting plane geometric error minimization according to claim 1, wherein fitting the local plane of the current node using neighbor node information specifically comprises:
1) k neighbor node plane fitting judgment
Retrieving 26 neighbor situations of the current neighbor node, and setting the number of neighbors existing in the 26 neighbors as: neighNum;
when the neighbor num is larger than or equal to K, calculating K neighbor nodes closest to the node center position coordinate by using the neighbor num nodes existing in 26 neighbor nodes around the node, and calculating the neighbor node center position coordinate by using the P point coordinate, the octreeSize of the node side length of the octree and the position of the neighbor;
2) least square method plane fitting
The final equation for plane fitting by using the least square method plane fitting principle and the central position coordinates of N1-Nk is as follows:
a0*x+al*y+a2-z＝O
wherein xi、yi、ziAnd the coordinates of the center position of the neighbor node.
4. The method of claim 3, wherein the K value is equal to the number of neighbors searched in the plane normal vector of the point cloud image, which is 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16.
5. The method of claim 1, wherein the geometric error of the point cloud space based on the fitting plane is minimum, and the method comprises: when the minimum value of the geometric error is solved, the corresponding coordinate value is taken as the reconstructed geometric coordinate as follows:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110753984.0A CN113453009B (en) | 2021-07-04 | 2021-07-04 | Point cloud space scalable coding geometric reconstruction method based on fitting plane geometric error minimum |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110753984.0A CN113453009B (en) | 2021-07-04 | 2021-07-04 | Point cloud space scalable coding geometric reconstruction method based on fitting plane geometric error minimum |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113453009A true CN113453009A (en) | 2021-09-28 |
| CN113453009B CN113453009B (en) | 2023-02-14 |
Family
ID=77814977
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110753984.0A Active CN113453009B (en) | 2021-07-04 | 2021-07-04 | Point cloud space scalable coding geometric reconstruction method based on fitting plane geometric error minimum |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113453009B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023193533A1 (en) * | 2022-04-07 | 2023-10-12 | Beijing Xiaomi Mobile Software Co., Ltd. | Apparatus for coding vertex position for point cloud, and data stream including vertex position |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101702237A (en) * | 2009-11-10 | 2010-05-05 | 南京大学 | Horizontal surface fitting method based on quadric error metrics (QEM) |
| CN107016725A (en) * | 2017-02-27 | 2017-08-04 | 电子科技大学 | A kind of vegetation three-dimensional live modeling method for taking LiDAR point cloud data distribution difference into account |
| CN107687816A (en) * | 2017-08-22 | 2018-02-13 | 大连理工大学 | A kind of measuring method based on point cloud local feature extraction fit-up gap |
| CN112270746A (en) * | 2020-11-06 | 2021-01-26 | 太原科技大学 | Aluminum alloy 3D printing point cloud simplification algorithm based on neighborhood covariance characteristic parameter threshold |
| CN112381884A (en) * | 2020-11-12 | 2021-02-19 | 北京航空航天大学 | RGBD camera-based space circular target pose measurement method |
| CN112565764A (en) * | 2020-12-03 | 2021-03-26 | 西安电子科技大学 | Point cloud geometric information interframe coding and decoding method |
| CN112637608A (en) * | 2020-12-18 | 2021-04-09 | 南京邮电大学 | Compression ratio distortion optimization method and device for dynamic point cloud geometric information |
| US20210168386A1 (en) * | 2019-12-02 | 2021-06-03 | Tencent America LLC | Method and apparatus for point cloud coding |
| CN113014903A (en) * | 2021-03-15 | 2021-06-22 | 北京大学深圳研究生院 | Point cloud neighbor determination, point cloud prediction, point cloud encoding, point cloud decoding methods and devices |
-
2021
- 2021-07-04 CN CN202110753984.0A patent/CN113453009B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101702237A (en) * | 2009-11-10 | 2010-05-05 | 南京大学 | Horizontal surface fitting method based on quadric error metrics (QEM) |
| CN107016725A (en) * | 2017-02-27 | 2017-08-04 | 电子科技大学 | A kind of vegetation three-dimensional live modeling method for taking LiDAR point cloud data distribution difference into account |
| CN107687816A (en) * | 2017-08-22 | 2018-02-13 | 大连理工大学 | A kind of measuring method based on point cloud local feature extraction fit-up gap |
| US20210168386A1 (en) * | 2019-12-02 | 2021-06-03 | Tencent America LLC | Method and apparatus for point cloud coding |
| CN112270746A (en) * | 2020-11-06 | 2021-01-26 | 太原科技大学 | Aluminum alloy 3D printing point cloud simplification algorithm based on neighborhood covariance characteristic parameter threshold |
| CN112381884A (en) * | 2020-11-12 | 2021-02-19 | 北京航空航天大学 | RGBD camera-based space circular target pose measurement method |
| CN112565764A (en) * | 2020-12-03 | 2021-03-26 | 西安电子科技大学 | Point cloud geometric information interframe coding and decoding method |
| CN112637608A (en) * | 2020-12-18 | 2021-04-09 | 南京邮电大学 | Compression ratio distortion optimization method and device for dynamic point cloud geometric information |
| CN113014903A (en) * | 2021-03-15 | 2021-06-22 | 北京大学深圳研究生院 | Point cloud neighbor determination, point cloud prediction, point cloud encoding, point cloud decoding methods and devices |
Non-Patent Citations (10)
| Title |
|---|
| LEI WEI,ET AL.: "Weighted Attribute Prediction Based on Morton Code for Point Cloud Compression", 《2020 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA & EXPO WORKSHOPS (ICMEW)》, 9 June 2020 (2020-06-09) * |
| SEBASTIAN SCHWARZ,ET AL.: "Emerging MPEG Standards for Point Cloud Compression", 《 IEEE JOURNAL ON EMERGING AND SELECTED TOPICS IN CIRCUITS AND SYSTEMS ( VOLUME: 9, ISSUE: 1, MARCH 2019)》, 10 December 2018 (2018-12-10) * |
| ZHANG CHEN.: "CuFusion2: Accurate and Denoised Volumetric 3D Object Reconstruction Using Depth Cameras", 《IEEE ACCESS ( VOLUME: 7)》, 15 April 2019 (2019-04-15) * |
| 卞玉霞.: "序列图像三维点云重建的不确定研究", 《中国优秀博士学位论文全文数据库（电子期刊）》, 15 July 2019 (2019-07-15), pages 15 - 16 * |
| 杜福洲等: "基于最小二乘法的几何元素拟合算法研究", 《航空制造技术》 * |
| 杜福洲等: "基于最小二乘法的几何元素拟合算法研究", 《航空制造技术》, no. 21, 30 November 2011 (2011-11-30) * |
| 段志鑫.: "三维激光扫描数据精简、表面重构方法及应用研究", 《中国优秀硕士学位论文全文数据库（电子期刊）》, 15 December 2019 (2019-12-15), pages 20 - 59 * |
| 王宗敏等: "面向点云数据的复杂几何模型对象优化方法研究", 《华中师范大学学报(自然科学版)》 * |
| 王宗敏等: "面向点云数据的复杂几何模型对象优化方法研究", 《华中师范大学学报(自然科学版)》, no. 05, 31 October 2020 (2020-10-31) * |
| 魏磊，万帅等.: "面向点云无损压缩的快速细节层次优化方法", 《西安交通大学学报》, 2 June 2021 (2021-06-02) * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2023193533A1 (en) * | 2022-04-07 | 2023-10-12 | Beijing Xiaomi Mobile Software Co., Ltd. | Apparatus for coding vertex position for point cloud, and data stream including vertex position |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113453009B (en) | 2023-02-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112771850B (en) | Motion compensation method, system and storage medium using 3D auxiliary data | |
| CN108781281B (en) | Shape adaptive model based codec for lossy and lossless image compression | |
| CN104853200A (en) | Method and apparatus for entropy encoding using hierarchical data unit | |
| CN104365099A (en) | Parameter update method for entropy coding and decoding of conversion coefficient level, and entropy coding device and entropy decoding device of conversion coefficient level using same | |
| WO2021062743A1 (en) | Occupancy information prediction method, encoder, decoder, and storage medium | |
| Dricot et al. | Hybrid octree-plane point cloud geometry coding | |
| CN103596003B (en) | Interframe predication quick mode selecting method for high-performance video coding | |
| CN112565795A (en) | Point cloud geometric information encoding and decoding method | |
| US20220345695A1 (en) | Methods for intra prediction, and encoder | |
| CN113453009B (en) | Point cloud space scalable coding geometric reconstruction method based on fitting plane geometric error minimum | |
| WO2022042538A1 (en) | Block-based point cloud geometric inter-frame prediction method and decoding method | |
| Freitas et al. | Lossy point cloud geometry compression via dyadic decomposition | |
| CN103299638B (en) | Self-adaptive scanning device and scan method thereof | |
| CN113542756B (en) | Point cloud space scalable coding geometric reconstruction method based on plane fitting center coordinate projection | |
| CN105306946A (en) | Quality scalable video coding method based on mean square error threshold | |
| CN103379349A (en) | Viewpoint composite predictive encoding method, decoding method, corresponding devices and code stream | |
| TW202141989A (en) | Intra-frame prediction method and apparatus, encoder, decoder, and storage medium | |
| Carmo et al. | Binary tree decomposition depth coding for 3D video applications | |
| WO2024065406A1 (en) | Encoding and decoding methods, bit stream, encoder, decoder, and storage medium | |
| US11611775B2 (en) | Method and apparatus for point cloud coding | |
| WO2023193709A1 (en) | Coding method and apparatus, decoding method and apparatus, and device | |
| CN112601086B (en) | String length parameter hybrid coding and decoding method and device | |
| CN117157671A (en) | Methods, encoder and decoder for encoding and decoding 3D point clouds | |
| WO2022170511A1 (en) | Point cloud decoding method, decoder, and computer storage medium | |
| Zuo et al. | Diverse Context Model for Large-Scale Dynamic Point Cloud Compression |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |