Three-dimensional narrow volume reconstruction method with unconditional stability based on a phase-field Lagrange multiplier approach

• URL: http://arxiv.org/abs/2511.00508v1
• Date: Sat, 01 Nov 2025 11:21:12 GMT
• Title: Three-dimensional narrow volume reconstruction method with unconditional stability based on a phase-field Lagrange multiplier approach
• Authors: Renjun Gao, Xiangjie Kong, Dongting Cai, Boyi Fu, Junxiang Yang,
• Abstract summary: Reconstruction of an object from points cloud is essential in prosthetics, medical imaging, computer vision, etc.<n>We present an effective algorithm for an Allen--Cahn-type model of reconstruction, employing the Lagrange multiplier approach.<n> Comprehensive numerical experiments, including reconstructions of complex 3D volumes such as characters from textitStar Wars, validate the algorithm's accuracy, stability, and effectiveness.
• Score: 3.0012646624584245
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Reconstruction of an object from points cloud is essential in prosthetics, medical imaging, computer vision, etc. We present an effective algorithm for an Allen--Cahn-type model of reconstruction, employing the Lagrange multiplier approach. Utilizing scattered data points from an object, we reconstruct a narrow shell by solving the governing equation enhanced with an edge detection function derived from the unsigned distance function. The specifically designed edge detection function ensures the energy stability. By reformulating the governing equation through the Lagrange multiplier technique and implementing a Crank--Nicolson time discretization, we can update the solutions in a stable and decoupled manner. The spatial operations are approximated using the finite difference method, and we analytically demonstrate the unconditional stability of the fully discrete scheme. Comprehensive numerical experiments, including reconstructions of complex 3D volumes such as characters from \textit{Star Wars}, validate the algorithm's accuracy, stability, and effectiveness. Additionally, we analyze how specific parameter selections influence the level of detail and refinement in the reconstructed volumes. To facilitate the interested readers to understand our algorithm, we share the computational codes and data in https://github.com/cfdyang521/C-3PO/tree/main.

Related papers

• Continuous-time reinforcement learning: ellipticity enables model-free value function approximation [1.3350982138577037]
  We study off-policy reinforcement learning for controlling continuous-time Markov diffusion processes with discrete-time observations and actions.<n>We consider model-free algorithms with function approximation that learn value and advantage functions directly from data.
  arXiv  Detail & Related papers  (2026-02-06T18:25:33Z)
• Spatially Aware Dictionary-Free Eigenfunction Identification for Modeling and Control of Nonlinear Dynamical Systems [0.0]
  We propose a new approach to data-driven discovery of Koopman eigenfunctions without a pre-defined set of basis functions.<n>The approach is successfully tested on several benchmark nonlinear dynamical systems.
  arXiv  Detail & Related papers  (2025-11-27T17:33:40Z)
• Differentiable Topology Estimating from Curvatures for 3D Shapes [5.122262236258208]
  This paper introduces a novel, differentiable algorithm tailored to accurately estimate the global topology of 3D shapes.<n>It ensures high accuracy, efficiency, and instant computation with GPU compatibility.<n> Experimental results demonstrate the method's superior performance across various datasets.
  arXiv  Detail & Related papers  (2024-11-28T17:14:35Z)
• Accelerated zero-order SGD under high-order smoothness and overparameterized regime [79.85163929026146]
  We present a novel gradient-free algorithm to solve convex optimization problems. Such problems are encountered in medicine, physics, and machine learning. We provide convergence guarantees for the proposed algorithm under both types of noise.
  arXiv  Detail & Related papers  (2024-11-21T10:26:17Z)
• A Sample Efficient Alternating Minimization-based Algorithm For Robust Phase Retrieval [56.67706781191521]
  In this work, we present a robust phase retrieval problem where the task is to recover an unknown signal. Our proposed oracle avoids the need for computationally spectral descent, using a simple gradient step and outliers.
  arXiv  Detail & Related papers  (2024-09-07T06:37:23Z)
• Decomposed Global Optimization for Robust Point Matching with Low-Dimensional Branching [41.05165517541873]
  We introduce a novel global optimization method for align partially overlapping point sets.<n>Our method exhibits superior robustness to non-rigid deformations, positional noise and outliers.<n> Experiments on 2D and 3D synthetic and real-world data demonstrate that our method, compared to state-of-the-art approaches, exhibits superior robustness to outliers.
  arXiv  Detail & Related papers  (2024-05-14T13:28:57Z)
• Stochastic Gradient Descent for Nonparametric Regression [11.24895028006405]
  This paper introduces an iterative algorithm for training nonparametric additive models.<n>We show that the resulting inequality satisfies an oracle that allows for model mis-specification.
  arXiv  Detail & Related papers  (2024-01-01T08:03:52Z)
• Score-based Diffusion Models in Function Space [137.70916238028306]
  Diffusion models have recently emerged as a powerful framework for generative modeling.<n>This work introduces a mathematically rigorous framework called Denoising Diffusion Operators (DDOs) for training diffusion models in function space.<n>We show that the corresponding discretized algorithm generates accurate samples at a fixed cost independent of the data resolution.
  arXiv  Detail & Related papers  (2023-02-14T23:50:53Z)
• Numerically Stable Sparse Gaussian Processes via Minimum Separation using Cover Trees [57.67528738886731]
  We study the numerical stability of scalable sparse approximations based on inducing points. For low-dimensional tasks such as geospatial modeling, we propose an automated method for computing inducing points satisfying these conditions.
  arXiv  Detail & Related papers  (2022-10-14T15:20:17Z)
• Detecting Rotated Objects as Gaussian Distributions and Its 3-D Generalization [81.29406957201458]
  Existing detection methods commonly use a parameterized bounding box (BBox) to model and detect (horizontal) objects. We argue that such a mechanism has fundamental limitations in building an effective regression loss for rotation detection. We propose to model the rotated objects as Gaussian distributions. We extend our approach from 2-D to 3-D with a tailored algorithm design to handle the heading estimation.
  arXiv  Detail & Related papers  (2022-09-22T07:50:48Z)
• Parametric Level-sets Enhanced To Improve Reconstruction (PaLEnTIR) [0.0]
  We introduce PaLEnTIR, a significantly enhanced parametric level-set (PaLS) method addressing the restoration and reconstruction of piecewise constant objects. Our key contribution involves a unique PaLS formulation utilizing a single level-set function to restore scenes containing multi-contrast piecewise-constant objects.
  arXiv  Detail & Related papers  (2022-04-21T00:03:44Z)
• Multiway Non-rigid Point Cloud Registration via Learned Functional Map Synchronization [105.14877281665011]
  We present SyNoRiM, a novel way to register multiple non-rigid shapes by synchronizing the maps relating learned functions defined on the point clouds. We demonstrate via extensive experiments that our method achieves a state-of-the-art performance in registration accuracy.
  arXiv  Detail & Related papers  (2021-11-25T02:37:59Z)
• Sparse PCA via $l_{2,p}$-Norm Regularization for Unsupervised Feature Selection [138.97647716793333]
  We propose a simple and efficient unsupervised feature selection method, by combining reconstruction error with $l_2,p$-norm regularization. We present an efficient optimization algorithm to solve the proposed unsupervised model, and analyse the convergence and computational complexity of the algorithm theoretically.
  arXiv  Detail & Related papers  (2020-12-29T04:08:38Z)
• Curvature Regularized Surface Reconstruction from Point Cloud [4.389913383268497]
  We propose a variational functional and fast algorithms to reconstruct implicit surface from point cloud data with a curvature constraint. The proposed method shows against noise, and recovers concave features and sharp corners better compared to models without curvature constraint.
  arXiv  Detail & Related papers  (2020-01-22T05:34:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.