Primitive fitting based on the efficient multiBaySAC algorithm.

PLoS One

School of Land Science and Technology, China University of Geosciences, No. 29 Xueyuan Road, Haidian District, Beijing, 100083, China.

Published: February 2016

Although RANSAC is proven to be robust, the original RANSAC algorithm selects hypothesis sets at random, generating numerous iterations and high computational costs because many hypothesis sets are contaminated with outliers. This paper presents a conditional sampling method, multiBaySAC (Bayes SAmple Consensus), that fuses the BaySAC algorithm with candidate model parameters statistical testing for unorganized 3D point clouds to fit multiple primitives. This paper first presents a statistical testing algorithm for a candidate model parameter histogram to detect potential primitives. As the detected initial primitives were optimized using a parallel strategy rather than a sequential one, every data point in the multiBaySAC algorithm was assigned to multiple prior inlier probabilities for initial multiple primitives. Each prior inlier probability determined the probability that a point belongs to the corresponding primitive. We then implemented in parallel a conditional sampling method: BaySAC. With each iteration of the hypothesis testing process, hypothesis sets with the highest inlier probabilities were selected and verified for the existence of multiple primitives, revealing the fitting for multiple primitives. Moreover, the updated version of the initial probability was implemented based on a memorable form of Bayes' Theorem, which describes the relationship between prior and posterior probabilities of a data point by determining whether the hypothesis set to which a data point belongs is correct. The proposed approach was tested using real and synthetic point clouds. The results show that the proposed multiBaySAC algorithm can achieve a high computational efficiency (averaging 34% higher than the efficiency of the sequential RANSAC method) and fitting accuracy (exhibiting good performance in the intersection of two primitives), whereas the sequential RANSAC framework clearly suffers from over- and under-segmentation problems. Future work will aim at further optimizing this strategy through its application to other problems such as multiple point cloud co-registration and multiple image matching.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4363901PMC
http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0117341PLOS

Publication Analysis

Top Keywords

multiple primitives
16
multibaysac algorithm
12
hypothesis sets
12
data point
12
high computational
8
paper presents
8
conditional sampling
8
sampling method
8
algorithm candidate
8
candidate model
8

Similar Publications

Robust multi-source geographic entities matching by maximizing geometric and semantic similarity.

Sci Rep

December 2024

Department of Geographic Information System, Chinese Academy of Surveying and mapping, Beijing, 100036, China.

Geographic entity matching is an important means for multi-source spatial data fusion and information association and sharing. Corresponding matching methods have been designed by existing studies for different types of entity data characteristics, such as line and area. However, these approaches are often limited in the generalization ability for matching heterogeneous data from multiple sources and the accuracy for complex pattern matching.

View Article and Find Full Text PDF

Gamma-ray coded-aperture imaging technology has important applications in the fields of nuclear security, isolated source detection, and the decommissioning of nuclear facilities. However, artifacts can reduce the quality of reconstructed images and affect the identification of the intensity and location of radioactive sources. In this paper, a gamma-ray coded-aperture imaging method based on primitive and reversed coded functions (PRCF) was proposed to reduce imaging artifacts.

View Article and Find Full Text PDF

Enabling a robot to learn skills from a human and adapt to different task scenarios will enable the use of robots in manufacturing to improve efficiency. Movement Primitives (MPs) are prominent tools for encoding skills. This paper investigates how to learn MPs from a small number of human demonstrations and adapt to different task constraints, including waypoints, joint limits, virtual walls, and obstacles.

View Article and Find Full Text PDF
Article Synopsis
  • Polyphosphate kinase 2 (PPK2) enzymes are key to transferring phosphate to nucleotides and are categorized into three classes, each with unique preferences.
  • The study of PPK2's distribution among prokaryotes helps understand its evolutionary history and potential adaptations across various species.
  • Observations revealed a significant preference for Class I enzymes in species with multiple PPK2 genes, alongside insights about gene duplication and possible functional versatility that challenge previous understandings of PPK2 evolution.
View Article and Find Full Text PDF

Neuromorphic Computing Primitives Using Polymer-Networked Nanoparticles.

J Phys Chem C Nanomater Interfaces

December 2024

Department of Chemistry, Johns Hopkins University, Baltimore, Maryland 21218, United States.

Nanoparticle networks have potential applications in brain-like computing yet their ability to adopt different states remains unexplored. In this work, we reveal the dynamics of the attachment of polyelectrolytes onto gold nanoparticles (AuNPs), using a bottom-up two-bead-monomer dissipative particle dynamics (TBM-DPD) model to show the heterogeneity of polymer coverage. We found that the use of one polyelectrolyte homopolymer limits the complexity of the possible engineered nanoparticle networks (ENPNs) that can be built.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!