Homogeneity Pursuit for 3D Point Clouds

This paper proposes a novel classification learning approach to identify the latent group structures in 3D point clouds collected with irregular shapes, which allows 3D point clouds to be classified into different groups with the number of groups and the group membership unknown. 3D point clouds within a group have a common mean function, while mean function heterogeneity is allowed across groups. We first obtain preliminary estimates of the individual mean functions by penalized trivariate splines over triangulation. Based on these preliminary estimates, we develop an agglomerative clustering algorithm to estimate the unknown group structures and propose a ratio criterion to determine the number of groups. We establish the consistency of the estimated number of groups and group membership. Furthermore, we investigate a post-grouping trivariate penalized spline estimation procedure for group-specific mean functions and derive the corresponding asymptotic theory. The proposed method is validated through simulation studies and showcased with an application to the imaging data from the Alzheimer's Disease Neuroimaging Initiative database.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-26
DOI
https://doi.org/10.48550/arxiv.2610.35417
Primary Topic
Advanced Clustering Algorithms Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Homogeneity Pursuit for 3D Point Clouds

Haojie Dong, Hanbing Zhu, Xinyuan Song, Xuejun Wang et al.
arXiv (Cornell University)
Advanced Clustering Algorithms Research
preprint

Homogeneity Pursuit for 3D Point Clouds

Haojie Dong, Hanbing Zhu, Xinyuan Song, Xuejun Wang, Xinghui Wang
preprint en

Abstract

This paper proposes a novel classification learning approach to identify the latent group structures in 3D point clouds collected with irregular shapes, which allows 3D point clouds to be classified into different groups with the number of groups and the group membership unknown. 3D point clouds within a group have a common mean function, while mean function heterogeneity is allowed across groups. We first obtain preliminary estimates of the individual mean functions by penalized trivariate splines over triangulation. Based on these preliminary estimates, we develop an agglomerative clustering algorithm to estimate the unknown group structures and propose a ratio criterion to determine the number of groups. We establish the consistency of the estimated number of groups and group membership. Furthermore, we investigate a post-grouping trivariate penalized spline estimation procedure for group-specific mean functions and derive the corresponding asymptotic theory. The proposed method is validated through simulation studies and showcased with an application to the imaging data from the Alzheimer's Disease Neuroimaging Initiative database.

arXiv (Cornell University)
Advanced Clustering Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon