Skip to content

Heat Field Signatures: From Point Clouds to Smooth Geometry

Sep 2026 · 0 citations · 43 references
Computer Science Mathematics

TL;DR

HFS turns a classical heat field into a practical interface for multiscale geometric analysis in modern point-cloud learning, and introduces the Heat Dimension Spectrum (HDS), a compact summary of multiscale geometric composition.

Abstract

Bringing multiscale geometric analysis directly to irregular point clouds remains difficult: quantities such as local dimension, anisotropy, density variation, and geometric transitions are typically estimated through explicit neighborhood, manifold, or graph constructions, or left for neural networks to infer from coordinates. We introduce Heat Field Signatures (HFS), which lift a point cloud to a multiscale family of smooth ambient heat fields, providing a direct interface from discrete samples to geometric analysis. From this field, HFS computes closed-form global and local signatures directly from pairwise distances, capturing heat concentration, intrinsic dimension, anisotropy, and scale transitions. We further introduce the Heat Dimension Spectrum (HDS), a compact summary of multiscale geometric composition. HFS can be used as a closed-form descriptor, a lightweight learned representation, or a geometric feature channel for neural point-cloud models. Across synthetic and real-world benchmarks spanning subcellular, neuronal, tree, and protein data, HFS outperforms strong point-cloud and multiparameter-persistence baselines while substantially reducing end-to-end cost. On SCOP protein-fold classification, HFS improves over the strongest deep baseline by nearly $24$ percentage points using coordinates alone, while standalone HFS representations are exactly rotation-invariant by construction. More broadly, HFS turns a classical heat field into a practical interface for multiscale geometric analysis in modern point-cloud learning.

View source

Similar papers

#machine learning Preprint Sep 2026

Gaussian Linear Functional Manifold Method for Massive Point Cloud Data

The Gaussian Linear Functional Manifold (GLFM), a physics-informed statistical framework that represents continuous surface topography using deterministic linear functional bases while modeling microscale diffuse laser backscatter as an isotropic Gaussian process, is introduced.

Hong Zhao, Tong-Lin Zhang, Bai-Jian Yang et al. · 0 citations
Preprint Oct 2026

Spectral Recovery of Point Clouds from Noisy Geometric Graphs

We study the problem of recovering low-dimensional latent geometry from a random geometric graph generated by noisy, high-dimensional data. Specifically, we analyze the performance of a spectral embedding algorithm on the Signal+Noise Graph Model, in which vertices are associated to points perturbed by Gaussian noise,...

Tatiana Brailovskaya, Nicholas A. Cook, Sofia Poinelli · 0 citations
Preprint Oct 2026

OptimusMesh: Compact Autoregressive Mesh Generation from Point Clouds via Sparse Latent Pivots

Generating compact and geometrically faithful 3D meshes directly from point clouds remains a fundamental challenge. Point clouds are unordered and sparse, whereas meshes exhibit irregular structure and varying topology. As a result, many existing approaches rely on implicit representations followed by surface extractio...

M. Iqbal, Xuan-Meng Sha, Naoya Chiba et al. · 0 citations
Preprint Sep 2026

Hierarchical Frequency-Domain Compression of Implicit Geometric Representations for Large-Scale Point Clouds

Large-scale point cloud representations of complex geome tries incur prohibitive computational and memory costs, necessitating compressed implicit representations. To ad dress this, we propose a unified framework comprising im plicit geometric field representation, hierarchical frequency domain compression, and conditi...

Man-Lin Yao, Jia-Bin Liu, Guan Wang et al. · 0 citations
#machine learning Preprint Aug 2026

Beyond Pairwise Graphs in Science: Hypergraph Adaptive Wavelet Operators for Parametric PDEs

The Hypergraph Adaptive waveLet Operator (HALO), which lifts the domain to a hypergraph and learns in its spectral wavelet domain, achieves best or near-best accuracy among frequency-, transformer-, DeepONet-, state-space-, and graph-based baselines and sustains stable multi-step rollouts.

R. Sarkar, Venkataramana Runkana, Souvik Chakraborty · 0 citations
#machine learning Preprint Sep 2026

Beyond Unimodal Bases: Pullback Geometry for Multimodal Data

Data-driven Riemannian geometry provides nonlinear interpolation and geometric representations of high-dimensional data. For these operations to be statistically meaningful, paths between observations should preferentially traverse high-likelihood regions. Existing scalable pullback constructions typically use a unimod...

Honglei Brinkmann, Lucas Ng, Georgios Batzolis et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.

Microsoft Research Blog Jul 13, 2026

Verifying Rust cryptography in SymCrypt, from standards to code

Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.