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

Trend · papers per month

84168251335 · Jun 202019922001200920172026
48 results for cloud properties

Deep learning detects cloud changes due to human aerosols.

problem Uncertainty in the effect of anthropogenic aerosols on cloud properties and Earth's energy balance.
method Deep convolutional neural networks to analyze cloud images.
result Identified and characterized specific cloud perturbations due to human aerosols.

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.

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 ↗

The cloud-based speech recognition/API provides developers or enterprises an easy way to create speech-enabled features in their applications. However, sending audios about personal or company internal information to the cloud, raises concerns about the privacy and security issues. The recognition results generated in …

2019-05-11abs ↗pdf ↗

New method uses scalar-based models to approximate spherical tensors efficiently.

problem Efficiently approximating spherical tensors with equivariant functions.
method Expressing equivariant functions as the product of a scalar function and a small tensor basis.
result Approximations are fast, simple to implement, and accurate in practical settings.

In this paper, we propose an efficient method to estimate the Weingarten map for point cloud data sampled from manifold embedded in Euclidean space. A statistical model is established to analyze the asymptotic property of the estimator. In particular, we show the convergence rate as the sample size tends to infinity. W…

2019-05-26abs ↗pdf ↗

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.

Study shows convergence rates for Cheeger cuts on data clouds.

problem Optimizing graph cuts for clustering data sampled from a manifold.
method Analyzes statistical properties of Cheeger cuts on proximity graphs built from data.
result Obtains high probability convergence rates for Cheeger constant and cuts.

In this contribution, we present a novel approach for segmenting laser radar (lidar) imagery into geometric time-height cloud locations with a fully convolutional network (FCN). We describe a semi-supervised learning method to train the FCN by: pre-training the classification layers of the FCN with image-level annotati…

2018-05-02abs ↗pdf ↗

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 ↗

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 ↗

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.

Paper estimates manifold reach using convexity defect function.

problem Estimating the reach of submanifolds from point clouds.
method Relates reach to convexity defect function, uses stability properties, and combines with recent estimators.
result Uniform expected loss bound and minimax rate lower bounds for reach estimation are provided.

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.

New approach uses distributed persistence for stable, parallelizable topological analysis of large point clouds.

problem Estimating the full persistence diagram of large point clouds is expensive, unstable, and not a sufficient statistic.
method Proposes distributed persistence as a new invariant, which is perfectly parallelizable, more stable, and has a rich inverse theory.
result The map from point clouds to distributed persistence invariants is a global quasi-isometry, interpolating between purely geometric and topological invariants.

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 ↗

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.

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.

This paper analyzes CNNs for malware detection in cloud IaaS.

problem Malware vulnerability in cloud IaaS environments.
method Analysis of Convolutional Neural Networks (CNNs) for online malware detection using process-level performance metrics.
result State-of-the-art DenseNets and ResNets effectively detect malware in online cloud systems.

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.

SPINN optimizes neural network inference on devices and cloud.

problem Inference on mobile devices is challenging due to high computational demands and dynamic connectivity.
method Synergistic progressive inference with a novel scheduler.
result SPINN achieves up to 2x higher throughput and reduces server cost by up to 6.8x.

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.