Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

4387130173 · May 202619922001200920172026
48 results for surface reconstruction

Single linear solve combines surface reconstruction and uncertainty quantification.

problem Reconstructing surfaces from partial point clouds with uncertainty.
method Geometric Gaussian processes for stochastic surface reconstruction.
result Single linear solve for surface reconstruction with probabilistic capabilities.

Deep learning models reconstruct volatility surfaces from noisy data under no-arbitrage constraints.

problem Reconstructing implied volatility surfaces from sparse and noisy option quotes.
method Compared multiple neural architectures including Transformers, U-Nets, and variational autoencoders.
result Transformer and U-Net architectures achieve strong reconstruction accuracy, especially under sparse observation regimes.

Improves MRI-based brain surface reconstruction with minimal deformation energy loss.

problem Ensuring optimal deformation energy and consistency in learning-based cortical surface reconstruction.
method Design and implementation of a Minimal Energy Deformation (MED) loss in the V2C-Flow model.
result Significant improvements in training consistency and reproducibility without sacrificing reconstruction accuracy and topological correctness.

The reconstruction of an object's shape or surface from a set of 3D points plays an important role in medical image analysis, e.g. in anatomy reconstruction from tomographic measurements or in the process of aligning intra-operative navigation and preoperative planning data. In such scenarios, one usually has to deal w…

2016-02-26abs ↗pdf ↗

Optimally estimate distances on surfaces using reconstructed meshes.

problem Estimating intrinsic distances on smooth submanifolds.
method Reconstruction of the surface using a tangential Delaunay complex, and Isomap variant.
result Minimax optimality achieved for distance estimation.

DPW method reconstructs minimal and symmetric CMC surfaces in 3-sphere.

problem Reconstructing minimal and symmetric CMC surfaces in S3\mathbb{S}^3.
method DPW method for reconstructing minimal surfaces and extending to symmetric CMC surfaces.
result DPW potential for Lawson surfaces reconstructs minimal immersions in S3\mathbb{S}^3.

We give reconstruction formulas inverting the geodesic X-ray transform over functions (call it I0I_0) and solenoidal vector fields on surfaces with negative curvature and strictly convex boundary. These formulas generalize the Pestov-Uhlmann formulas in [Pestov-Uhlmann, IMRN '04] (established for simple surfaces) to ca…

2015-11-17abs ↗pdf ↗

Study proper sampling for X-ray transforms on simple surfaces.

problem Proper discretizing and sampling issues related to geodesic X-ray transforms on simple surfaces.
method Provide minimal sampling rates for faithful reconstruction, quantify sampling quality, and predict artifacts.
result Minimal sampling rates and artifact prediction for geodesic X-ray transforms on simple surfaces.

Regularizes 3D inverse scattering with tangent-point energy for better solutions.

problem Ill-conditioned inverse obstacle scattering problems in 3D.
method Tikhonov regularization using tangent-point energy to penalize surface roughness and ensure well-posedness.
result Regularized solutions converge to true solution as noise level decreases.

Study reconstructs Morse-Bott functions with specific preimage conditions on 3D manifolds.

problem Reconstructing Morse-Bott functions with prescribed preimages on 3D manifolds.
method Conditions and approach based on previous work by Sharko and others.
result New result on reconstruction of nice smooth functions with specified preimages.

New method for sensing non-planar surfaces using ERT.

problem Limited computational techniques for planar surfaces in ERT-based sensing skins.
method Generalized ERT to non-planar surfaces using Riemannian geometry.
result Feasibility and applicability of ERT-based sensing skins for non-planar geometries demonstrated.

We present a definition of discrete channel surfaces in Lie sphere geometry, which reflects several properties for smooth channel surfaces. Various sets of data, defined at vertices, on edges or on faces, are associated with a discrete channel surface that may be used to reconstruct the underlying particular discrete L…

2018-09-05abs ↗pdf ↗

Researchers reconstruct stiffness tensors from limited data in anisotropic elasticity.

problem Reconstructing stiffness tensors from partial data around one polarization.
method Using algebraic geometry and slowness surfaces, the approach leverages the algebraic geometry of families of slowness surfaces.
result For tensors in a dense open subset, a small amount of data around one polarization uniquely determines the entire slowness surface and stiffness tensor.

The paper studies curves in surfaces using flow-spines and apparent contours.

problem Understanding curves in arbitrary surfaces using flow-spines and apparent contours.
method By considering generic curves and their apparent contours relative to a traversing flow, the paper reconstructs curves and allows them to vary up to homotopy.
result A finite set of local moves on decorated graphs allows for the reconstruction and variation of curves within a fixed generic flow.

In this paper we construct a new family of simply connected minimal complex surfaces of general type with pg=1p_g=1, q=0q=0, and K2=3,4,5,6,8K^2=3, 4, 5, 6, 8 using a Q\mathbb{Q}-Gorenstein smoothing theory. We also reconstruct minimal complex surfaces of general type with pg=1p_g=1, q=0q=0, and K2=1,2K^2=1, 2 using the same method.

2009-06-29abs ↗pdf ↗

In this paper, we propose a new variational model for image reconstruction by minimizing the L1L^1 norm of the \emph{Weingarten map} of image surface (x,y,f(x,y))(x,y,f(x,y)) for a given image f:ΩRf:{\mathrmΩ}\rightarrow \mathbb R. We analytically prove that the Weingarten map minimization model can not only keep the greyscale int…

2019-12-02abs ↗pdf ↗

3-manifold triangulation can be reconstructed from its intersection matrix.

problem Reconstructing the triangulation of 3-manifolds from their intersection matrix.
method Using the intersection matrix of a simplicial complex to determine the triangulation of a 3-manifold up to isomorphism.
result The intersection matrix is sufficient to determine the triangulation of a 3-manifold up to isomorphism.

Given a compact manifold with boundary with unknown Riemannian metric. The problem is to reconstruct the metric in a class of conformal metrics from knowledge of lengths of all closed geodesics (kinematic data). An integral inequality is stated which implies uniqueness and stability for this problem. If the conformal c…

2012-02-24abs ↗pdf ↗

We address the problem of surface inpainting, which aims to fill in holes or missing regions on a Riemann surface based on its surface geometry. In practical situation, surfaces obtained from range scanners often have holes where the 3D models are incomplete. In order to analyze the 3D shapes effectively, restoring the…

2012-12-05abs ↗pdf ↗

Framework reconstructs missing spatio-temporal data for extreme value prediction.

problem Predicting extreme values from incomplete spatio-temporal data.
method Convolutional deep neural networks and autoencoder-like models for conditional sampling.
result Framework produces accurate reconstructions of missing data for extremal values.

The paper introduces a method for dimension reduction using sub-Riemannian geometry.

problem Dimension reduction for manifold learning and surface reconstruction.
method Combining local linear approximations of a point cloud to obtain lower dimensional bundles.
result Sub-Riemannian geodesics can successfully be applied to problems like constructing an approximating submanifold and computing distances.

The level sets of neural networks represent fundamental properties such as decision boundaries of classifiers and are used to model non-linear manifold data such as curves and surfaces. Thus, methods for controlling the neural level sets could find many applications in machine learning. In this paper we present a simpl…

2019-05-28abs ↗pdf ↗

Algorithm reconstructs vertex positions in random geometric graphs with improved accuracy.

problem Reconstructing vertex positions in random geometric graphs with high accuracy.
method Hybrid of graph distances and short-range estimates based on common neighbors.
result Algorithm reconstructs vertex positions with error of O(nβ)O(n^β), improving over previous results.

Study geodesic X-ray transforms on hyperbolic surfaces, proposing new reconstruction methods.

problem Inverting geodesic X-ray transforms for symmetric tensor fields on asymptotically hyperbolic surfaces.
method Developed a decomposition theorem for m-tensor fields, used Guillemin-Kazhdan operators and 0-calculus, and provided explicit reconstruction methods.
result Explicit reconstruction methods for even tensor fields from their X-ray transform or normal operator.

Researchers reconstruct simple Riemannian manifolds from boundary wave arrival times.

problem Reconstructing Riemannian manifolds from unknown interior sources and arrival times.
method Discrete metric approximation using labeled Gromov--Hausdorff distance.
result Finite-time approximations converge to the true Riemannian manifold.

New attack recovers user-level information from large batch images.

problem Recovering private information from user-level gradients in distributed learning.
method Proposes a gradient inversion attack using a denoising diffusion model as a prior.
result Demonstrates recovery of realistic facial images and private attributes.

Photometric stereo is a method that seeks to reconstruct the normal vectors of an object from a set of images of the object illuminated under different light sources. While effective in some situations, classical photometric stereo relies on a diffuse surface model that cannot handle objects with complex reflectance pa…

2017-10-24abs ↗pdf ↗

Researchers prove rigidity of 2D manifolds from boundary geodesic lengths.

problem Reconstructing a Riemann surface from boundary geodesic lengths.
method Re-casting lens data as generalized Riemannian circles and solving a system of equations.
result Essentially optimal results on boundary and lens rigidity for 2D manifolds.

Study characterizes bladder motion using dynamic MRI and statistical analysis.

problem Limited volume coverage in dynamic MRI sequences hinders 3D shape reconstruction.
method 3D dense velocity measurements, LDDMM framework, statistical characterization, mean curvature changes, surface deformation analysis.
result Stable shape descriptor for characterizing bladder surface dynamics.

Gaussian processes (GPs) with derivatives are useful in many applications, including Bayesian optimization, implicit surface reconstruction, and terrain reconstruction. Fitting a GP to function values and derivatives at nn points in dd dimensions requires linear solves and log determinants with an ${n(d+1) \times n(d…

2018-10-29abs ↗pdf ↗