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.
Proposes dynamic graph and node feature learning in GCNNs for better adaptability.
problem Fixed graphs for all GCNN layers limit adaptability to node feature structures.
method Dynamic graph and node feature learning using Mahalanobis distance metric.
result Superior performance in point clouds and citation networks.
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.
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.
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.
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.
The introduction of cheap RGB-D cameras, stereo cameras, and LIDAR devices has given the computer vision community 3D information that conventional RGB cameras cannot provide. This data is often stored as a point cloud. In this paper, we present a novel method to apply the concept of convolutional neural networks to th…
A new rotation invariant method for 3D medical imaging classification.
problem Computational expense and lack of rotation invariance in 3D medical image processing.
method Proposes a rotation invariant convolution operator using hypersphere topology.
result Demonstrates improved classification accuracy and rotation invariance.
Proposes a new convolutional neural network for non-grid data.
problem Limited applicability of standard CNNs to non-grid structured data.
method Introduces Parametric Continuous Convolution (PCC) with learnable kernel functions.
result Significant improvement in point cloud segmentation and lidar motion estimation.
Trans-Unet predicts brain folding patterns from 3D point-clouds using novel 3D-to-2D transformation.
problem Challenges in learning high-fidelity 3D point-cloud features, including permutation invariance and fine-grained surface reconstruction.
method Transform 3D point-clouds into a 2D grid domain, then use a U-shaped hybrid model with CNNs and self-attention mechanisms.
result Trans-Unet achieves high-resolution predictions of brain patch growth, surpassing existing methods in fidelity and accuracy.
Efficient point cloud compression is fundamental to enable the deployment of virtual and mixed reality applications, since the number of points to code can range in the order of millions. In this paper, we present a novel data-driven geometry compression method for static point clouds based on learned convolutional tra…
Graph convolutional neural networks (Graph-CNNs) extend traditional CNNs to handle data that is supported on a graph. Major challenges when working with data on graphs are that the support set (the vertices of the graph) do not typically have a natural ordering, and in general, the topology of the graph is not regular …
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.
3D capsule network for point clouds handles rotations and translations.
problem Processing 3D point clouds with equivariance and invariance.
method Quaternion equivariant capsule network with dynamic routing on quaternions.
result Parsimonious capsule network disentangles geometry and pose.
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.
When classifying point clouds, a large amount of time is devoted to the process of engineering a reliable set of features which are then passed to a classifier of choice. Generally, such features - usually derived from the 3D-covariance matrix - are computed using the surrounding neighborhood of points. While these fea…
New methods implement manifold scattering transform for high-dimensional point cloud data.
problem Classifying data on complex, non-linear manifolds.
method Adapting diffusion maps theory for numerical implementation.
result Effective for signal and manifold classification tasks.
Object detection in point clouds is an important aspect of many robotics applications such as autonomous driving. In this paper we consider the problem of encoding a point cloud into a format appropriate for a downstream detection pipeline. Recent literature suggests two types of encoders; fixed encoders tend to be fas…
LieTransformer extends self-attention to Lie groups for improved deep learning tasks.
problem Improving deep learning performance through group equivariant self-attention.
method LieSelfAttention layers that are equivariant to arbitrary Lie groups and their discrete subgroups.
result Competitive experimental results on various tasks.
Study shows consistency of shallow GCNNs on sampled point clouds under manifold assumption.
problem Consistency of shallow GCNNs on sampled point clouds under manifold assumption.
method Functional analysis perspective, weakly compact product of unit balls, Sobolev regularity, frequency cutoff.
result Proves Γ-convergence of regularized empirical risk minimization functionals and convergence of their global minimizers. A new method evolves point clouds using B-splines for smooth surfaces.
problem Evolution of smooth surfaces from discrete point clouds.
method Adaptive Lagrangian B-spline framework for geometric evolution.
result Efficient and accurate reproduction of surface evolution phenomena.
Recently, graph neural networks have been adopted in a wide variety of applications ranging from relational representations to modeling irregular data domains such as point clouds and social graphs. However, the space of graph neural network architectures remains highly fragmented impeding the development of optimized …
A graph is a powerful concept for representation of relations between pairs of entities. Data with underlying graph structure can be found across many disciplines and there is a natural desire for understanding such data better. Deep learning (DL) has achieved significant breakthroughs in a variety of machine learning …
Study improves semantic segmentation of LiDAR point clouds for autonomous vehicles.
problem Semantic understanding of 3D LiDAR data for autonomous vehicles.
method Image-based semantic segmentation architectures, network size optimization, improved point cloud projection, soft Dice loss, reduced weight-sharing convolution.
result 3.2% increase in mIoU segmentation performance with 42% reduction in inference time.
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.
System detects multiple patients' behaviors in real-time using mmWave radar and CNN.
problem Real-time patient behavior monitoring in hospitals.
method Used mmWave radar for tracking and collecting Doppler patterns. Created a three-layer CNN model for behavior classification.
result System achieved very good inference accuracy in predicting patient behaviors in real-time.
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…
Method locates equilibria on unknown Riemannian manifolds using iterative sampling and parallel transport.
problem Locating equilibria on unknown Riemannian manifolds defined by point-clouds.
method Iterative sampling, parallel transport, and generalized isoclines.
result Algorithm reliably locates equilibria of dynamical systems on unknown manifolds.
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.
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.
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.
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.
Overview of methods for rotating 2D and 3D data.
problem Processing data with equivariance/invariance under rotations.
method An overview of methods for 2D and 3D rotations.
result Identification of commonalities and links between methods.
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.
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…
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…
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.
Framework for efficient defect classification and inspection.
problem Adaptive defect classification and inspection from high volume data.
method Continual learning framework for dynamic classifier updates.
result Efficient storage and computational needs reduction.
A new GCN variant tackles large eigengaps in dense graphs and hypergraphs.
problem Large eigengaps in dense graphs and hypergraphs hinder popular GCN architectures.
method Uses pseudoinverse of the Laplacian and low-rank approximation for efficient computation.
result Improves runtime and accuracy in various experiments with real-world datasets.
In the following article we discuss Delaunay triangulations for a point cloud on an embedded surface in R3. We give sufficient conditions on the point cloud to show that the diagonal switch algorithm finds an embedded Delaunay triangulation.
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.
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 associative memory uses Sinkhorn divergence for efficient pattern retrieval.
problem Efficiently retrieving patterns from large datasets of weighted point clouds.
method Derived retrieval dynamics as a SHK gradient flow, discretized for a deterministic algorithm.
result Proved basin invariance, geometric convergence, and robust recovery from perturbations.
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.
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…