Skip to content

VFC-Net: Point Cloud Completion via Voxel-based Transformer.

Sep 2026 · IEEE Transactions on Image Processing · Vol PP, pp. 1-1 · 0 citations
Medicine

TL;DR

A novel framework, VFC-Net, which generates a uniformly distributed coarse point cloud to effectively guide dense reconstruction and introduces a lightweight VoxAttn module in both stages to efficiently capture missing geometric structures.

Abstract

Point cloud completion aims to recover missing regions in 3D point clouds caused by sensor limitations and environmental occlusions. Although recent methods have achieved remarkable progress in recovering the overall shape of incomplete objects, explicitly controlling the spatial distribution of reconstructed points remains challenging, often leading to outliers and non-uniform point distributions. In this paper, we propose a novel framework, VFC-Net, which generates a uniformly distributed coarse point cloud to effectively guide dense reconstruction. Specifically, VFC-Net adopts a generation-upsampling paradigm. In the generation stage, termed VoxGen, the input point cloud is first converted into a voxel-based representation, from which a coarse yet complete point cloud is generated via voxel occupancy classification, naturally encouraging a uniform spatial distribution. In the upsampling stage, termed VoxPu, voxel occupancy predictions are fused with voxel features to guide dense reconstruction, thereby preserving the distribution consistency of the final output. Furthermore, we introduce a lightweight VoxAttn module in both stages to efficiently capture missing geometric structures. By decomposing the voxel grid into a set of 2D slices and performing attention-based feature aggregation, VoxAttn significantly reduces the computational complexity. To compensate for the information loss introduced by slicing, we further employ alternating slicing axes together with cross-slice feature aggregation. Extensive experiments on multiple challenging benchmarks demonstrate that VFC-Net achieves state-of-the-art performance in point cloud completion.

View source

Similar papers

Preprint Aug 2026

SUMI: Scalable Unified Model for 3D Point Cloud Inference

SUMI injects noisy geometric features into cross-attention with coarse structural features, enabling reverse denoising to refine local geometry while preserving global consistency in coarse-to-fine point cloud completion.

Yan-Long Li, Kanchana Thilakarathna · 0 citations
Preprint Sep 2026

ScaleBlind: Point Cloud Completion under Unknown Scale

Point cloud completion aims to infer a complete 3D shape from a partial point cloud and serves as a fundamental building block for downstream tasks such as reconstruction, editing, and simulation. Despite the recent progress, existing learning-based methods often implicitly rely on access to the ground-truth shape scal...

Sheng-Hui Wu, Chen Wang, Yuan Feng et al. · 0 citations
Open access Sep 2026

Image-Inpainting Guided Point Cloud Completion

Single object point cloud completion aims to recover complete object geometry from incomplete observations. Existing methods either rely solely on point cloud geometry or exploit auxiliary visual information, often re-quiring calibrated RGB images or other additional inputs. However, incomplete point clouds inheren...

Feng Zhou, Shi-Bo Liu, Jin Li et al. · 0 citations
Oct 2026

MLCompletion: Point Cloud Completion via Multiview Feature Augmentation and Progressive Refinement

Point cloud completion is a fundamental task in 3-D sensing and vision, yet it remains challenging when partial observations suffer from severe structural missing regions and ambiguous local geometry. To address these issues, we propose MLCompletion, a point-cloud-only completion framework that incorporates self-genera...

Zhi-Qiang Liu, Lin-Bo Hao, Shao-Hua Jiang et al. · 0 citations
Preprint Sep 2026

PointLAM: Local Attentive Mamba for Efficient Point-based 3D Object Detection

3D object detection from LiDAR point clouds faces a fundamental dilemma: voxel-based methods achieve efficiency at the cost of geometric quantization, while point-based methods preserve fidelity but suffer from prohibitive computational bottlenecks. Specifically, point-based architectures are crippled by slow downsampl...

Xuan-Ming Shang, Weijia Zhang, Chao Ma · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.