ArticleJournal of computational and graphical statistics : a joint publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America2025
Efficient Nonparametric Estimation of 3D Point Cloud Signals through Distributed Learning.
Article in Journal of computational and graphical statistics : a joint publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
1 citing paper in PubMed.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
Abstract
Advancements in technology have elevated the prominence of 3D point cloud data, making its analysis increasingly vital across various applications. This need drives the demand for advanced statistical analytic approaches to handle challenges such as size, sparsity, and irregularity in 3D point clouds while ensuring accurate and efficient information extraction. This paper introduces a novel nonparametric distributed (NPD) learning framework that utilizes trivariate spline smoothing over a triangulation of domain. The proposed NPD algorithm features a straightforward, scalable, and communication-efficient implementation scheme that can achieve near-linear speedup. In addition, we provide rigorous theoretical support for the NPD estimation framework and demonstrate that the NPD spline estimators attain the same convergence rate as the global spline estimators obtained using the entire dataset and achieve the optimal nonparametric convergence rate established by Stone (1982) under some regularity conditions. To evaluate the efficacy of the proposed NPD method, we conduct simulation studies comparing it with several global nonparametric estimation methods used to smooth the 3D data. The results demonstrate the superior performance of the NPD method in accurately and efficiently processing and learning from 3D point clouds, highlighting its potential to advance large and complex data analysis. Supplementary material, which contains related technical details, proofs of the theoretical results, and additional results in simulation studies, is available online.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.