首页 > AI前沿 > Bayesian methods and Markov chain Monte Carlo algorithms for curve reconstruction and point cloud data analysis

Bayesian methods and Markov chain Monte Carlo algorithms for curve reconstruction and point cloud data analysis

arXiv机器学习 2026-08-28 12:00 1 阅读 查看原文

Computer Science > Machine Learning

arXiv:2608.26490 (cs)

Title:Bayesian methods and Markov chain Monte Carlo algorithms for curve reconstruction and point cloud data analysis

View PDF HTML (experimental)
Abstract:Point-cloud data routinely captured by modern imaging and sensor technologies provide detailed geometric descriptions of objects and environments, but their analysis is hindered by large data volumes, localization noise, and missing information. In addition, existing point-cloud reconstruction pipelines typically return a single best-fit structure without uncertainty quantification. We introduce a fully Bayesian framework for representing point-cloud data and reconstructing closed curves, in which observed points are modeled as noisy perturbations of latent locations constrained to lie on the underlying curve that is regularized by a non-parametric prior. Posterior inference in our framework is carried out using a series of Markov chain Monte Carlo samplers tailored to point-cloud characteristics. Numerical experiments, including synthetic examples and real-world LiDAR datasets, show accurate reconstructions and quantified uncertainty over the recovered curves.
Comments:
Subjects: Machine Learning (cs.LG); Machine Learning (stat.ML)
MSC classes: 62F15 (Primary), 62-08, 65C40 (Secondary)
Cite as: arXiv:2608.26490 [cs.LG]
  (or arXiv:2608.26490v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2608.26490

Submission history

From: Asir Intesar Tushar [view email]
[v1] Thu, 27 Aug 2026 00:26:00 UTC (3,598 KB)
Full-text links:

Access Paper:

  • View PDF
  • HTML (experimental)
  • TeX Source

Current browse context:

cs.LG
< prev   |   next >
Change to browse by:

References & Citations

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.