October 2023
·
5 Reads
·
14 Citations
This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.
October 2023
·
5 Reads
·
14 Citations
August 2023
·
10 Reads
Learning per-point semantic features from the hierarchical feature pyramid is essential for point cloud semantic segmentation. However, most previous methods suffered from ambiguous region features or failed to refine per-point features effectively, which leads to information loss and ambiguous semantic identification. To resolve this, we propose Retro-FPN to model the per-point feature prediction as an explicit and retrospective refining process, which goes through all the pyramid layers to extract semantic features explicitly for each point. Its key novelty is a retro-transformer for summarizing semantic contexts from the previous layer and accordingly refining the features in the current stage. In this way, the categorization of each point is conditioned on its local semantic pattern. Specifically, the retro-transformer consists of a local cross-attention block and a semantic gate unit. The cross-attention serves to summarize the semantic pattern retrospectively from the previous layer. And the gate unit carefully incorporates the summarized contexts and refines the current semantic features. Retro-FPN is a pluggable neural network that applies to hierarchical decoders. By integrating Retro-FPN with three representative backbones, including both point-based and voxel-based methods, we show that Retro-FPN can significantly improve performance over state-of-the-art backbones. Comprehensive experiments on widely used benchmarks can justify the effectiveness of our design. The source is available at https://github.com/AllenXiangX/Retro-FPN
October 2022
·
9 Reads
·
74 Citations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Most existing point cloud completion methods suffer from the discrete nature of point clouds and the unstructured prediction of points in local regions, which makes it difficult to reveal fine local geometric details. To resolve this issue, we propose SnowflakeNet with snowflake point deconvolution (SPD) to generate complete point clouds. SPD models the generation of point clouds as the snowflake-like growth of points, where child points are generated progressively by splitting their parent points after each SPD. Our insight into the detailed geometry is to introduce a skip-transformer in the SPD to learn the point splitting patterns that can best fit the local regions. The skip-transformer leverages attention mechanism to summarize the splitting patterns used in the previous SPD layer to produce the splitting in the current layer. The locally compact and structured point clouds generated by SPD precisely reveal the structural characteristics of the 3D shape in local patches, which enables us to predict highly detailed geometries. Moreover, since SPD is a general operation that is not limited to completion, we explore its applications in other generative tasks, including point cloud auto-encoding, generation, single image reconstruction, and upsampling. Our experimental results outperform state-of-the-art methods under widely used benchmarks.
March 2022
·
11 Reads
·
136 Citations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Point cloud completion concerns to predict missing part for incomplete 3D shapes. A common strategy is to generate complete shape according to incomplete input. However, unordered nature of point clouds will degrade generation of high-quality 3D shapes, as detailed topology and structure of unordered points are hard to be captured during the generative process using an extracted latent code. We address this problem by formulating completion as point cloud deformation process. Specifically, we design a novel neural network, named PMP-Net++, to mimic behavior of an earth mover. It moves each point of incomplete input to obtain a complete point cloud, where total distance of point moving paths (PMPs) should be the shortest. Therefore, PMP-Net++ predicts unique PMP for each point according to constraint of point moving distances. The network learns a strict and unique correspondence on point-level, and thus improves quality of predicted complete shape. Moreover, since moving points heavily relies on per-point features learned by network, we further introduce a transformer-enhanced representation learning network, which significantly improves completion performance of PMP-Net++. We conduct comprehensive experiments in shape completion, and further explore application on point cloud up-sampling, which demonstrate non-trivial improvement of PMP-Net++ over state-of-the-art point cloud completion/up-sampling methods.
February 2022
·
67 Reads
Most existing point cloud completion methods suffered from discrete nature of point clouds and unstructured prediction of points in local regions, which makes it hard to reveal fine local geometric details. To resolve this issue, we propose SnowflakeNet with Snowflake Point Deconvolution (SPD) to generate the complete point clouds. SPD models the generation of complete point clouds as the snowflake-like growth of points, where the child points are progressively generated by splitting their parent points after each SPD. Our insight of revealing detailed geometry is to introduce skip-transformer in SPD to learn point splitting patterns which can fit local regions the best. Skip-transformer leverages attention mechanism to summarize the splitting patterns used in previous SPD layer to produce the splitting in current SPD layer. The locally compact and structured point clouds generated by SPD precisely reveal the structure characteristic of 3D shape in local patches, which enables us to predict highly detailed geometries. Moreover, since SPD is a general operation, which is not limited to completion, we further explore the applications of SPD on other generative tasks, including point cloud auto-encoding, generation, single image reconstruction and upsampling. Our experimental results outperform the state-of-the-art methods under widely used benchmarks.
February 2022
·
22 Reads
Point cloud completion concerns to predict missing part for incomplete 3D shapes. A common strategy is to generate complete shape according to incomplete input. However, unordered nature of point clouds will degrade generation of high-quality 3D shapes, as detailed topology and structure of unordered points are hard to be captured during the generative process using an extracted latent code. We address this problem by formulating completion as point cloud deformation process. Specifically, we design a novel neural network, named PMP-Net++, to mimic behavior of an earth mover. It moves each point of incomplete input to obtain a complete point cloud, where total distance of point moving paths (PMPs) should be the shortest. Therefore, PMP-Net++ predicts unique PMP for each point according to constraint of point moving distances. The network learns a strict and unique correspondence on point-level, and thus improves quality of predicted complete shape. Moreover, since moving points heavily relies on per-point features learned by network, we further introduce a transformer-enhanced representation learning network, which significantly improves completion performance of PMP-Net++. We conduct comprehensive experiments in shape completion, and further explore application on point cloud up-sampling, which demonstrate non-trivial improvement of PMP-Net++ over state-of-the-art point cloud completion/up-sampling methods.
December 2021
·
31 Reads
·
1 Citation
As real-scanned point clouds are mostly partial due to occlusions and viewpoints, reconstructing complete 3D shapes based on incomplete observations becomes a fundamental problem for computer vision. With a single incomplete point cloud, it becomes the partial point cloud completion problem. Given multiple different observations, 3D reconstruction can be addressed by performing partial-to-partial point cloud registration. Recently, a large-scale Multi-View Partial (MVP) point cloud dataset has been released, which consists of over 100,000 high-quality virtual-scanned partial point clouds. Based on the MVP dataset, this paper reports methods and results in the Multi-View Partial Point Cloud Challenge 2021 on Completion and Registration. In total, 128 participants registered for the competition, and 31 teams made valid submissions. The top-ranked solutions will be analyzed, and then we will discuss future research directions.
October 2021
·
15 Reads
·
311 Citations
August 2021
·
95 Reads
·
1 Citation
Point cloud completion aims to predict a complete shape in high accuracy from its partial observation. However, previous methods usually suffered from discrete nature of point cloud and unstructured prediction of points in local regions, which makes it hard to reveal fine local geometric details on the complete shape. To resolve this issue, we propose SnowflakeNet with Snowflake Point Deconvolution (SPD) to generate the complete point clouds. The SnowflakeNet models the generation of complete point clouds as the snowflake-like growth of points in 3D space, where the child points are progressively generated by splitting their parent points after each SPD. Our insight of revealing detailed geometry is to introduce skip-transformer in SPD to learn point splitting patterns which can fit local regions the best. Skip-transformer leverages attention mechanism to summarize the splitting patterns used in the previous SPD layer to produce the splitting in the current SPD layer. The locally compact and structured point cloud generated by SPD is able to precisely capture the structure characteristic of 3D shape in local patches, which enables the network to predict highly detailed geometries, such as smooth regions, sharp edges and corners. Our experimental results outperform the state-of-the-art point cloud completion methods under widely used benchmarks. Code will be available at https://github.com/AllenXiangX/SnowflakeNet.
June 2021
·
39 Reads
·
233 Citations
... Gong et al. addressed the limitations of FPN in small target detection by proposing a fusion factor estimated through statistical methods [26], which controls the information transfer from deep to shallow layers to adapt FPN for small target detection. Xiang et al. proposed a retrospective feature pyramid network, Retro-FPN [27], which innovatively introduced a retro-transformer [41], and effectively extracts semantic features for each point through explicit and retrospective feature refinement processes. ...
October 2023
... Before they can be used in downstream applications (e.g., digital twin), they need to be faithfully completed, a process known as point cloud completion. Recent years have witnessed significant progress in this field (Yuan et al., 2018;Huang et al., 2020;Zhang et al., 2020;Yu et al., 2021;Xiang et al., 2023;Yan et al., 2022; Tang et al., 2022;Zhou et al., 2022;Zhang et al., 2023d;Yu et al., 2023a;Wang et al., 2022a). However, the sparsity and large structural incompleteness of point clouds still limit their ability to produce satisfactory results. ...
October 2022
IEEE Transactions on Pattern Analysis and Machine Intelligence
... We compare PointSea with 17 competitors (Yuan et al., 2018;Xie et al., 2020;Wang et al., 2020;Zhang et al., 2020;Yu et al., 2021;Xiang et al., 2023;Wen et al., 2023;Yan et al., 2022;Zhou et al., 2022;Zhang et al., 2023d;Tang et al., 2022;Fu et al., 2023;Zhang et al., 2023c;Xu et al., 2023b;Chen et al., 2023b;Yu et al., 2023a;Zhu et al., 2023b) in Table 3. The results demonstrate that PointSea achieves the best performance across all metrics. ...
March 2022
IEEE Transactions on Pattern Analysis and Machine Intelligence
... We first fit the SMPL model from input sparse views, and then feed the SMPL depth into a depth refiner to get refined depth, from which we obtain voxel-level features. These features are then aggregated with pixel-level features extracted from source images, followed by the SPD network [74,75] to generate dense image-aligned prior points for coarse Gaussian rasterization. To help model finer details, the image-aligned depth maps from coarse Gaussians are unprojected to yield finer pixel-wise points. ...
October 2021
... Among them, PCN [49] is the first work that directly generates high-resolution complete point clouds in a coarseto-fine manner for point cloud completion. A similar generation strategy is also adopted in a series of following works [18,23,36,37,39]. Transformer [35] has also been leveraged in recent works. ...
June 2021
... To this end, our prototype system will complete the independent point cloud model extracted by segmentation and restore its lost point cloud data. We chose the state-of-the-art point cloud completion algorithm based on deep learning-PMP-Net [90] and made a dataset to train the neural network. The network receives the incomplete point cloud model of each part as input and outputs the independent and complete point cloud model corresponding to each part. ...
December 2020