Point clouds provide a flexible and natural representation usable in countless applications such as robotics or self-driving cars. Recently, deep neural networks operating on raw point cloud data have shown promising results on supervised learning tasks such as object classification and semantic segmentation. While mas…
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,695 papers · 148 categories
Trend · papers per month
48 results for “point-cloud reconstruction”
Reconstructing the local density field with combined convolutional and point cloud architectureastro-ph.CO
Neural net reconstructs dark matter density from halo velocities.
problem Reconstructing local dark matter density from halo velocities.
method Hybrid architecture combining U-Net and DeepSets.
result Hybrid network recovers density amplitudes and phases better than U-Net.
Improves point-cloud reconstruction by optimizing projections with self-attention.
problem Inefficient and non-metric projection methods for sliced Wasserstein distances.
method Proposes distributional sliced Wasserstein distance with self-attention for permutation-invariant and metric optimization.
result Self-attention amortized distributional projection optimization achieves better performance in point-cloud reconstruction.
Reconstruct trapezoidal surfaces from point clouds.
problem Reconstructing trapezoidal surfaces from point clouds.
method Kinematic approach: find axis direction, polygonal path, and reconstruct surface.
result Reconstructs trapezoidal surfaces from point clouds.
We proposed a novel graph convolutional neural network that could construct a coarse, sparse latent point cloud from a dense, raw point cloud. With a novel non-isotropic convolution operation defined on irregular geometries, the model then can reconstruct the original point cloud from this latent cloud with fine detail…
Simultaneous Monitoring of Shape and Surface Color via 4D Point Clouds: A Registration-free Approachcs.CV
A registration-free framework monitors shape and color in 4D point clouds.
problem Monitoring shape and color changes in complex parts without registration.
method Laplace-Beltrami operator spectral properties for geometric and color feature capture; combined monitoring scheme for shape and color anomalies.
result Effective detection of shape deformations and color anomalies without registration or mesh reconstruction.
Registration-Free Monitoring of Unstructured Point Cloud Data via Intrinsic Geometrical Propertiescs.CV
A new method monitors unstructured 3D shapes without registration.
problem Error-prone registration and mesh reconstruction steps in PCD monitoring.
method Intrinsic geometric properties of shapes, using Laplacian and geodesic distances.
result Effective monitoring of defects without registration and mesh reconstruction.
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.
Often noisy point clouds are given as an approximation of a particular compact set of interest. A finite point cloud is a compact set. This paper proves a reconstruction theorem which gives a sufficient condition, as a bound on the Hausdorff distance between two compact sets, for when certain offsets of these two sets …
Proposes an energy-based sliced Wasserstein distance for improved probability measure comparison.
problem Inefficiencies and limitations in existing sliced Wasserstein distance approaches.
method Introduces an energy-based slicing distribution for better performance and stability.
result Demonstrates superior performance of the EBSW distance in various applications.
EggNet: An Evolving Graph-based Graph Attention Network for Particle Track Reconstructionphysics.data-an
EggNet reconstructs particle tracks from hits using evolving graph attention networks.
problem Particle track reconstruction is computationally expensive and combinatorial.
method EggNet uses a one-shot object condensation approach with evolving graph attention networks.
result EggNet outperforms methods requiring fixed input graphs on TrackML dataset.
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…
ManiFlow models manifold data by optimizing NFs on perturbed data.
problem Capturing manifold data with NFs' invertibility constraint.
method Train NFs on perturbed data to implicitly represent manifold.
result NFs implicitly model manifold in regions of maximum likelihood.
New method for high-fidelity shape representations from raw data.
problem Creating accurate shape representations from raw data.
method A simple loss function encouraging neural network to vanish on input point cloud and have unit norm gradient.
result Our method produces high-fidelity, smooth, and natural zero level set surfaces.
LION generates high-quality 3D shapes using hierarchical latent diffusion models.
problem Creating high-quality 3D shapes for digital artists.
method Hierarchical Latent Point Diffusion Model (LION) with a global shape latent and point-structured latent space.
result LION achieves state-of-the-art generation performance on ShapeNet benchmarks.
Framework for analyzing dynamic topological changes in point clouds using persistent homology and dynamic optimal transport.
problem Analyzing transient structural reorganizations during dynamic phase transitions in time-evolutionary point clouds.
method Hierarchical dynamic evaluation framework driven by topological and hypergraph reconstruction strategy.
result Combining transport-based alignment with multi-scale entropy diagnostics for dynamic topological analysis.
Deep generative architectures provide a way to model not only images but also complex, 3-dimensional objects, such as point clouds. In this work, we present a novel method to obtain meaningful representations of 3D shapes that can be used for challenging tasks including 3D points generation, reconstruction, compression…
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.
3D shape instantiation which reconstructs the 3D shape of a target from limited 2D images or projections is an emerging technique for surgical intervention. It improves the currently less-informative and insufficient 2D navigation schemes for robot-assisted Minimally Invasive Surgery (MIS) to 3D navigation. Previously,…
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…
Bayesian framework optimizes 3D view selection for specific tasks.
problem Optimizing 3D view selection for specific tasks in reconstruction.
method Bayesian decision theory, prior and posterior distributions, stochastic surface reconstruction.
result Framework achieves superior performance with fewer views.
New method upsamples sparse, non-uniform point clouds more accurately.
problem Suboptimal results from existing point cloud upsampling methods.
method Imposes manifold distribution constraints using Gaussian functions.
result Generates higher-quality, more uniformly distributed dense point clouds.
In recent decades, the use of 3D point clouds has been widespread in computer industry. The development of techniques in analyzing point clouds is increasingly important. In particular, mapping of point clouds has been a challenging problem. In this paper, we develop a discrete analogue of the Teichmüller extremal mapp…
A novel method compresses point cloud attributes by folding them onto a 2D grid.
problem Efficiently compressing point cloud attributes for storage and transmission.
method Interpreting point clouds as 2D manifolds, folding onto a grid, and mapping attributes to the grid using optimized methods.
result The proposed folding-based approach achieves performance comparable to state-of-the-art codecs.
A novel method compares 3D point clouds using information geometry.
problem Comparing 3D point clouds in machine learning applications.
method Interprets point clouds as probability density functions on a statistical manifold, using GMM and Modified Symmetric KL divergence.
result Demonstrates effectiveness through various case studies.
Develops a method for conformal parameterization of point clouds without fixed boundaries.
problem Desirable distortion in fixed-boundary parameterizations of point clouds.
method Free-boundary conformal parameterization method involving approximation of point cloud Laplacian and boundary treatment.
result High-quality point cloud meshing achieved through the proposed method.
Extends gradient-based optimization to spline functions.
problem Limitations of standard differentiable programming methods.
method Derives Jacobian of spline functions and uses it in predictive models.
result Improved performance in various applications.
Algorithm classifies point clouds using deep set linearized optimal transport.
problem Classifying point clouds efficiently and accurately.
method Deep Set Linearized Optimal Transport, ICNNs, and a discriminator network.
result Efficiently distinguishes between various classes of point clouds.
Estimating boundaries from point clouds with improved accuracy and rigorous error estimates.
problem Identifying the boundary of a domain from point cloud samples.
method Developed new estimators for normal vectors, distances, and boundary tests; provided error estimates.
result Efficient and accurate estimators for boundary properties on point clouds.
The field of multiple view geometry has seen tremendous progress in reconstruction and calibration due to methods for extracting reliable point features and key developments in projective geometry. Point features, however, are not available in certain applications and result in unstructured point cloud reconstructions.…
Point cloud is the most fundamental representation of 3D geometric objects. Analyzing and processing point cloud surfaces is important in computer graphics and computer vision. However, most of the existing algorithms for surface analysis require connectivity information. Therefore, it is desirable to develop a mesh st…
This paper focuses on a novel generative approach for 3D point clouds that makes use of invertible flow-based models. The main idea of the method is to treat a point cloud as a probability density in 3D space that is modeled using a cloud-specific neural network. To capture the similarity between point clouds we rely o…
The paper transforms a convex hull into a concave surface around a point cloud.
problem Creating a concave surface that encloses all points in a point cloud.
method Iterative facet replacement and expansion of the convex hull.
result A method to evolve a convex hull into a concave surface that fits the point cloud.
In the following article we discuss Delaunay triangulations for a point cloud on an embedded surface in . We give sufficient conditions on the point cloud to show that the diagonal switch algorithm finds an embedded Delaunay triangulation.
We present an Expectation-Maximization algorithm for the fractal inverse problem: the problem of fitting a fractal model to data. In our setting the fractals are Iterated Function Systems (IFS), with similitudes as the family of transformations. The data is a point cloud in with arbitrary dimension .…
Method computes harmonic and conformal maps from point clouds.
problem Computing maps from irregular point cloud data.
method Meshless method using cubic lattice approximations.
result Harmonic and conformal maps computed accurately.
Self-supervised learning improves few-shot classification and segmentation on point clouds.
problem Efficiently learn from limited labeled data in point cloud applications.
method Hierarchical cover-tree partitioning for self-supervised pre-training; restricted to support set for few-shot learning.
result Self-supervised learning significantly improves downstream classification and segmentation accuracy.
Estimator calculates surface curvature from point cloud samples.
problem Accurately estimating curvature from limited point cloud data.
method Algorithm using probability distribution and nearby points control.
result Controlled number of points ensures accurate curvature estimation.
The concept of a Point Cloud has played an increasingly important role in many areas of Engineering, Science, and Mathematics. Examples are: LIDAR, 3D-Printing, Data Analysis, Computer Graphics, Machine Learning, Mathematical Visualization, Numerical Analysis, and Monte Carlo Methods. Entering point cloud into Google r…
New method improves Gaussian process regression on complex, sparse point clouds.
problem Traditional Gaussian processes struggle with restricted domains and point clouds.
method Atlas Gaussian Processes (RC-AGPs) combining heat kernel and RBF kernels.
result RC-AGPs outperform existing methods in regression accuracy.
Improved road segmentation on low-res LIDAR data for autonomous vehicles.
problem Low-resolution LIDAR data affects road segmentation accuracy in autonomous vehicles.
method Subsampled LIDAR data transformation into feature maps, use local normal vector with spherical coordinates.
result Improves road segmentation accuracy on low-resolution LIDAR data.
Advanced 3D metrology technologies such as Coordinate Measuring Machine (CMM) and laser 3D scanners have facilitated the collection of massive point cloud data, beneficial for process monitoring, control and optimization. However, due to their high dimensionality and structure complexity, modeling and analysis of point…
SCENE-Net improves 3D point cloud segmentation with low resource usage and transparency.
problem Lack of resources and transparency in 3D semantic segmentation models.
method SCENE-Net uses signature shapes identified via GENEOs to achieve semantic segmentation with minimal resources.
result SCENE-Net achieves comparable IoU to state-of-the-art methods with less data and computational resources.
Recent years have witnessed the emergence of 3D medical imaging techniques with the development of 3D sensors and technology. Due to the presence of noise in image acquisition, registration researchers focused on an alternative way to represent medical images. An alternative way to analyze medical imaging is by underst…
Deep Learning on Point Clouds for False Positive Reduction at Nodule Detection in Chest CT Scanseess.IV
Paper reduces false positives in lung nodule detection using deep learning on point clouds.
problem Reduces false positives in lung nodule detection.
method Uses deep learning models for point clouds to transform 3D CT scan data.
result Achieved 85.98 FROC compared to 77.26 FROC for baseline models.
Many data-rich industries are interested in the efficient discovery and modelling of structures underlying large data sets, as it allows for the fast triage and dimension reduction of large volumes of data embedded in high dimensional spaces. The modelling of these underlying structures is also beneficial for the creat…
Novel neural network layer improves long-range interactions in point clouds.
problem Efficiently treating long-range interactions in point clouds.
method Long-range convolutional (LRC)-layer that incorporates Fourier transforms.
result Global all-to-all convolution operation performed in nearly-linear time.
Paper improves deep point cloud compression techniques.
problem Efficiently compressing 3D point cloud data for various applications.
method Integrates scale hyperprior model, deeper transforms, focal loss, and optimal thresholding.
result Achieves significant BD-PSNR gains over existing methods.