Paper uses tensor regression to analyze point clouds for process optimization.
problem Challenges in modeling and analyzing high-dimensional point cloud data.
method Utilizes multilinear algebra and tensor regression techniques.
result Successfully models and links point cloud variational patterns to process variables.
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…
A new Helmholtzian operator from point clouds for flow analysis.
problem Analyzing flows and vector fields on manifolds from point cloud data.
method Estimation of manifold Helmholtzian from point cloud data using weighted 1-Laplacian.
result The Helmholtzian operator L1 effectively smooths, predicts, and extracts features from flows on manifolds. 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.
Enhanced 3D shape analysis using information geometry.
problem Challenges in comparing 3D point clouds due to their unstructured nature and complex geometry.
method Information geometric framework for 3D point cloud shape analysis using Gaussian Mixture Models (GMMs) on a statistical manifold. Proposed MSKL divergence with upper and lower bounds.
result MSKL provides stable and monotonically varying values that directly reflect geometric variation, outperforming traditional distances and existing KL approximations.
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…
Robustly computes intrinsic coordinates on point clouds using resampling and averaging.
problem Computing intrinsic coordinates on noisy or outlier-prone point clouds.
method Subsample data, vary hyperparameters, cluster candidate embeddings, identify representative embeddings, and average them using Procrustes analysis.
result Robust to noise and outliers, validated on synthetic and real data.
Mapper and Ball Mapper tools for complex data analysis.
problem Exploring and visualizing high-dimensional data and scalar functions.
method Combining Mapper and Ball Mapper, adding new features for encoding structure and symmetries.
result A new hybrid algorithm, Mapper on Ball Mapper, for comparing high-dimensional data descriptors.
Proposes a new layer for efficient 3D shape discrimination.
problem Irregular structure and redundancy in 3D point clouds hinder efficient inter-class discrimination.
method Integrates Blended Convolution and Synthesis layer that projects and synthesizes 3D point clouds, followed by 3D convolution in the unit ball.
result End-to-end architecture achieves compelling results on 3D shape recognition and retrieval.
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.
Generative model for 3D point clouds using invertible flows.
problem Generating realistic 3D point clouds.
method Invertible flow-based models for point cloud generation with parameter sharing and embedding vectors.
result The model generates high-quality 3D point clouds with good similarity.
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…
LOT framework embeds high-dimensional cell data into interpretable Euclidean space.
problem Lack of interpretable methods for high-dimensional cell data.
method Adapts Linear Optimal Transport (LOT) to irregular point clouds.
result Accurate and interpretable classification and synthetic data generation.
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.
Graph neural network constructs a sparse latent point cloud from dense point clouds.
problem Efficiently reconstructing and simulating point clouds with fine details.
method Irregular graph convolutional neural network with non-isotropic operations.
result The model can reconstruct dense point clouds from a sparse latent representation.
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.
We consider a point cloud Xn:={x1,…,xn} uniformly distributed on the flat torus Td:=Rd/Zd, and construct a geometric graph on the cloud by connecting points that are within distance ε of each other. We let P(Xn) be the space of probability …
A new method for computing shape barycenters from point clouds using Procrustes-Wasserstein distance.
problem Computing representative shapes from point clouds with precise alignment and shape preservation.
method Developed a new distance metric (Procrustes-Wasserstein) and algorithms for computing barycenters.
result Superior performance in precise alignment and shape preservation compared to existing OT approaches.
Self-supervised method learns from unlabelled point clouds by reconstructing them.
problem Efficiently learning from large, unlabelled 3D point cloud datasets.
method Trains neural networks to reconstruct point clouds with randomly rearranged parts.
result Method learns semantic properties of point clouds and improves downstream object classification.
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.
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.
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.
Proposes a novel approach for cluster-aware matching using Laplacian Optimal Transport.
problem Matching point clouds with intrinsic cluster structure requires robust region-to-region alignment over precise point-to-point correspondence.
method Laplacian Optimal Transport (LapOT) with regularization for cluster-aware matching and Refined Simultaneous Clustering (RSC) for consistent partitions.
result Laplacian Optimal Transport produces more consistent and meaningful alignments between point clouds.
This paper studies the large sample asymptotics of data analysis procedures based on the optimization of functionals defined on k-NN graphs on point clouds. The paper is framed in the context of minimization of balanced cut functionals, but our techniques, ideas and results can be adapted to other functionals of rele…
Cluster analysis of very high dimensional data can benefit from the properties of such high dimensionality. Informally expressed, in this work, our focus is on the analogous situation when the dimensionality is moderate to small, relative to a massively sized set of observations. Mathematically expressed, these are the…
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.
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.
CloudLSTM forecasts geospatial point-cloud data streams accurately.
problem Forecasting over geospatial point-cloud data streams.
method Introduces CloudLSTM, a recurrent neural model with a Dynamic Point-cloud Convolution (DConv) operator.
result CloudLSTM outperforms competitor models in long-term predictions for point-cloud data.
The article discusses how to create a special type of triangle mesh for surfaces in 3D space.
problem Creating a special type of triangle mesh for surfaces in 3D space.
method Using sufficient conditions and the diagonal switch algorithm to find an embedded Delaunay triangulation.
result The diagonal switch algorithm can find an embedded Delaunay triangulation for a point cloud on an embedded surface in R3. A new graph signature invariant to graph automorphisms.
problem Graph symmetry and feature generation.
method Power spectrum signature derived from squared graph Fourier transform.
result Power spectrum signature is stable under graph perturbations.
3D point cloud attacks examine how neural networks can be fooled.
problem Understanding how 3D neural networks can be exploited by attackers.
method Examined two categories of attacks: distributional and shape attacks.
result Some shape attacks can fool 3D point cloud classification models even after preprocessing.
The paper proves Lipschitz regularity of graph Laplacian eigenvectors on random data clouds.
problem Analyzing the regularity of solutions to graph Laplacian equations on random data points.
method Probabilistic coupling of random walks and interpolation method for point clouds to continuum.
result Graph Laplacian eigenvectors are essentially Lipschitz with constants depending on eigenvalues.
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.
A new method models galaxies as points in space for better analysis.
problem Limitations of binning and voxelization in galaxy surveys.
method A diffusion-based generative model for galaxy point clouds.
result Demonstrated on dark matter haloes in Quijote simulations.
Generative model creates high-quality meshes from point clouds.
problem Creating accurate meshes from point cloud data.
method Modeling point cloud generation as sphere deformation through deep neural networks.
result The model efficiently generates high-quality meshes from point clouds.
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.
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.
A new method compresses point clouds efficiently, outperforming existing techniques.
problem Efficiently compressing large point cloud datasets for VR applications.
method Learned convolutional transforms and uniform quantization for joint rate and distortion optimization.
result Significant rate-distortion improvement (51.5% BDBR savings) on Microsoft Voxelized Upper Bodies dataset.
t-SNE algorithm's points remain bounded under gradient flow.
problem Understanding the boundedness of t-SNE points.
method Gradient flow of t-SNE with KL divergence, examining weak convergence assumptions.
result Points generated by t-SNE remain bounded under gradient flow.
A new method learns stable, temporally coherent features in point clouds.
problem Flickering and halo structures in inferred solutions for time-varying point clouds.
method Proposes a novel temporal loss function and super-resolution method.
result Demonstrates flexibility and effectiveness on large, deforming point sets.
LatticeNet segments 3D point clouds faster and more efficiently.
problem Challenges in applying CNNs to 3D point cloud data.
method Embeds point cloud geometry into a permutohedral lattice for fast convolutions.
result Achieves state-of-the-art performance in 3D segmentation.
A GMM-based method generates new 3D structures from medical images.
problem Generating new medical images from limited data and different modalities.
method Gaussian Mixture Model (GMM) for point-cloud generation.
result Generated point-clouds closely match training samples from the same class.
Generative Adversarial Networks are adapted for point cloud generation.
problem Applying GAN to point clouds is challenging due to data structure differences.
method Proposed PC-GAN framework with hierarchical sampling, posterior inference, and sandwiching objective.
result PC-GAN trained with sandwiching objective outperforms existing methods on point cloud generation.
Graph-CNN for 3D point cloud classification tackles non-regular graph topology.
problem Classifying 3D point cloud data with non-regular graph topology.
method Developed PointGCN combining localized graph convolutions and graph downsampling.
result Achieves competitive performance on 3D object classification benchmark ModelNet.
PointPillars improves object detection speed and accuracy in point clouds.
problem Encoding point clouds for efficient object detection.
method PointPillars uses PointNets to learn pillar representations of point clouds, combined with a lean downstream network.
result PointPillars outperforms previous encoders in both speed and accuracy.
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.
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.