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,695 papers · 148 categories

Trend · papers per month

326495127 · Jun 202019922001200920172026
48 results for point-cloud averaging

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.

We introduce a new wavelet transform suitable for analyzing functions on point clouds and graphs. Our construction is based on a generalization of the average interpolating refinement scheme of Donoho. The most important ingredient of the original scheme that needs to be altered is the choice of the interpolant. Here, …

2011-10-10abs ↗pdf ↗

Frame Averaging makes neural networks invariant or equivariant to new symmetries.

problem Designing neural networks that respect symmetries while being expressive and efficient.
method Introduces Frame Averaging (FA) as a systematic framework to adapt architectures to become invariant or equivariant to new symmetries.
result Frame Averaging guarantees exact invariance or equivariance while being simpler to compute than full group averaging.

CDP reduces point cloud dimensions by preserving detour-induced local non-convexity.

problem Preserving local non-convexity in point cloud dimensionality reduction.
method CDP builds a k-NN graph, identifies admissible pairs, aggregates normalized directions, and uses top-k eigenvectors for projection.
result CDP provides verifiable guarantees on post-projection distortion and direction energy.

We present a 3D capsule module for processing point clouds that is equivariant to 3D rotations and translations, as well as invariant to permutations of the input points. The operator receives a sparse set of local reference frames, computed from an input point cloud and establishes end-to-end transformation equivarian…

2019-12-27abs ↗pdf ↗

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.

Proposes MFSWB for marginal fairness in SWB, improving efficiency and performance.

problem Achieving marginal fairness in SWB averaging.
method Defining MFSWB as a constrained SWB problem, proposing two surrogate problems and a new slicing distribution.
result Surrogate MFSWB problems effectively minimize distances to marginals and encourage marginal fairness.

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…

2015-11-20abs ↗pdf ↗

Existing techniques to compress point cloud attributes leverage either geometric or video-based compression tools. We explore a radically different approach inspired by recent advances in point cloud representation learning. Point clouds can be interpreted as 2D manifolds in 3D space. Specifically, we fold a 2D grid on…

2020-02-11abs ↗pdf ↗

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.

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…

2019-01-24abs ↗pdf ↗

Optimal Transport Graph Neural Networks (OT-GNN) improves graph embeddings by using optimal transport.

problem Graph Neural Networks (GNN) often lose structural or semantic information when aggregating node embeddings.
method Combines optimal transport (OT) with parametric graph models to compute graph embeddings from Wasserstein distances between node embeddings and prototype point clouds.
result OT-GNN outperforms popular methods on molecular property prediction tasks and produces smoother graph representations.

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…

2019-10-16abs ↗pdf ↗

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.

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…

2016-11-15abs ↗pdf ↗

In this work, we develop a new approach to generative density estimation for exchangeable, non-i.i.d. data. The proposed framework, FlowScan, combines invertible flow transformations with a sorted scan to flexibly model the data while preserving exchangeability. Unlike most existing methods, FlowScan exploits the intra…

2019-02-05abs ↗pdf ↗

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.

We consider a problem of manifold estimation from noisy observations. Many manifold learning procedures locally approximate a manifold by a weighted average over a small neighborhood. However, in the presence of large noise, the assigned weights become so corrupted that the averaged estimate shows very poor performance…

2019-06-12abs ↗pdf ↗

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.

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.

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…

2019-10-07abs ↗pdf ↗

The importance of training robust neural network grows as 3D data is increasingly utilized in deep learning for vision tasks in robotics, drone control, and autonomous driving. One commonly used 3D data type is 3D point clouds, which describe shape information. We examine the problem of creating robust models from the …

2019-08-16abs ↗pdf ↗

Mapper-GIN simplifies 3D point cloud classification with lightweight structure.

problem Robust 3D point cloud classification under corruption.
method Mapper algorithm for structural decomposition, GIN for graph classification.
result Mapper-GIN achieves competitive accuracy with minimal parameters.

Proposes a robust 3D classification method for sparse point clouds.

problem Invariance to rotation, positional shift, scaling, and robustness to point sparsity in point cloud classification.
method Introduces a graph-based feature learning approach with an end-to-end neural network.
result Significantly improves 3D object classification and retrieval tasks with sparse point clouds.

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\mathcal L_1 effectively smooths, predicts, and extracts features from flows on manifolds.

Generative Adversarial Networks (GAN) can achieve promising performance on learning complex data distributions on different types of data. In this paper, we first show a straightforward extension of existing GAN algorithm is not applicable to point clouds, because the constraint required for discriminators is undefined…

2018-10-13abs ↗pdf ↗

Deep learning within the context of point clouds has gained much research interest in recent years mostly due to the promising results that have been achieved on a number of challenging benchmarks, such as 3D shape recognition and scene semantic segmentation. In many realistic settings however, snapshots of the environ…

2018-11-30abs ↗pdf ↗

PointGMM learns hGMMs from point clouds for 3D shape representation.

problem Lack of shape priors and non-local information in point cloud representations.
method Neural network that learns hierarchical Gaussian mixture models (hGMMs) for 3D shapes.
result Generative model learns meaningful latent space for interpolations and novel shape synthesis.

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.