Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Group-wise Point-set registration using a novel CDF-based Havrda-Charvat Divergence.

ABSTRACT: This paper presents a novel and robust technique for group-wise registration of point sets with unknown correspondence. We begin by defining a Havrda-Charvát (HC) entropy valid for cumulative distribution functions (CDFs) which we dub the HC Cumulative Residual Entropy (HC-CRE). Based on this definition, we propose a new measure called the CDF-HC divergence which is used to quantify the dis-similarity between CDFs estimated from each point-set in the given population of point sets. This CDF-HC divergence generalizes the CDF based Jensen-Shannon (CDF-JS) divergence introduced earlier in the literature, but is much simpler in implementation and computationally more efficient.A closed-form formula for the analytic gradient of the cost function with respect to the non-rigid registration parameters has been derived, which is conducive for efficient quasi-Newton optimization. Our CDF-HC algorithm is especially useful for unbiased point-set atlas construction and can do so without the need to establish correspondences. Mathematical analysis and experimental results indicate that this CDF-HC registration algorithm outperforms the previous group-wise point-set registration algorithms in terms of efficiency, accuracy and robustness.

SUBMITTER: Chen T

PROVIDER: S-EPMC2835416 | biostudies-other | 2010 Jan

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

Iterative point set registration for aligning scRNA-seq data.

Project description:Several studies profile similar single cell RNA-Seq (scRNA-Seq) data using different technologies and platforms. A number of alignment methods have been developed to enable the integration and comparison of scRNA-Seq data from such studies. While each performs well on some of the datasets, to date no method was able to both perform the alignment using the original expression space and generalize to new data. To enable such analysis we developed Single Cell Iterative Point set Registration (SCIPR) which extends methods that were successfully applied to align image data to scRNA-Seq. We discuss the required changes needed, the resulting optimization function, and algorithms for learning a transformation function for aligning data. We tested SCIPR on several scRNA-Seq datasets. As we show it successfully aligns data from several different cell types, improving upon prior methods proposed for this task. In addition, we show the parameters learned by SCIPR can be used to align data not used in the training and to identify key cell type-specific genes.

| S-EPMC7647120 | biostudies-literature

Point Set Denoising Using Bootstrap-Based Radial Basis Function.

Project description:This paper examines the application of a bootstrap test error estimation of radial basis functions, specifically thin-plate spline fitting, in surface smoothing. The presence of noisy data is a common issue of the point set model that is generated from 3D scanning devices, and hence, point set denoising is one of the main concerns in point set modelling. Bootstrap test error estimation, which is applied when searching for the smoothing parameters of radial basis functions, is revisited. The main contribution of this paper is a smoothing algorithm that relies on a bootstrap-based radial basis function. The proposed method incorporates a k-nearest neighbour search and then projects the point set to the approximated thin-plate spline surface. Therefore, the denoising process is achieved, and the features are well preserved. A comparison of the proposed method with other smoothing methods is also carried out in this study.

| S-EPMC4912139 | biostudies-literature

Characterizing Anatomical Variability And Alzheimer's Disease Related Cortical Thinning in the Medial Temporal Lobe Using Graph-Based Groupwise Registration And Point Set Geodesic Shooting.

Project description:The perirhinal cortex (PRC) is a site of early neurofibrillary tangle (NFT) pathology in Alzheimer's disease (AD). Subtle morphological changes in the PRC have been reported in MRI studies of early AD, which has significance for clinical trials targeting preclinical AD. However, the PRC exhibits considerable anatomical variability with multiple discrete variants described in the neuroanatomy literature. We hypothesize that different anatomical variants are associated with different patterns of AD-related effects in the PRC. Single-template approaches conventionally used for automated image-based brain morphometry are ill-equipped to test this hypothesis. This study uses graph-based groupwise registration and diffeomorphic landmark matching with geodesic shooting to build statistical shape models of discrete PRC variants and examine variant-specific effects of AD on PRC shape and thickness. Experimental results demonstrate that the statistical models recover the folding patterns of the known PRC variants and capture the expected shape variability within the population. By applying the proposed pipeline to a large dataset with subjects from different stages in the AD spectrum, we find 1) a pattern of cortical thinning consistent with the NFT pathology progression, 2) different patterns of the initial spatial distribution of cortical thinning between anatomical variants, and 3) an effect of AD on medial temporal lobe shape. As such, the proposed pipeline could have important utility in the early detection and monitoring of AD.

| S-EPMC6469499 | biostudies-literature

Clinical Accuracy of Holographic Navigation Using Point-Based Registration on Augmented-Reality Glasses.

Project description:BackgroundAs current augmented-reality (AR) smart glasses are self-contained, powerful computers that project 3-dimensional holograms that can maintain their position in physical space, they could theoretically be used as a low-cost, stand-alone neuronavigation system.ObjectiveTo determine feasibility and accuracy of holographic neuronavigation (HN) using AR smart glasses.MethodsWe programmed a fully functioning neuronavigation system on commercially available smart glasses (HoloLens®, Microsoft, Redmond, Washington) and tested its accuracy and feasibility in the operating room. The fiducial registration error (FRE) was measured for both HN and conventional neuronavigation (CN) (Brainlab, Munich, Germany) by using point-based registration on a plastic head model. Subsequently, we measured HN and CN FRE on 3 patients.ResultsA stereoscopic view of the holograms was successfully achieved in all experiments. In plastic head measurements, the mean HN FRE was 7.2 ± 1.8 mm compared to the mean CN FRE of 1.9 ± 0.45 (mean difference: -5.3 mm; 95% confidence interval [CI]: -6.7 to -3.9). In the 3 patients, the mean HN FRE was 4.4 ± 2.5 mm compared to the mean CN FRE of 3.6 ± 0.5 (mean difference: -0.8 mm; 95% CI: -3.0 to 4.6).ConclusionOwing to the potential benefits and promising results, we believe that HN could eventually find application in operating rooms. However, several improvements will have to be made before the device can be used in clinical practice.

| S-EPMC6995446 | biostudies-literature

sensaas: Shape-based Alignment by Registration of Colored Point-based Surfaces.

Project description:sensaas is a tool developed for aligning and comparing molecular shapes and sub-shapes. Alignment is obtained by registration of 3D point-based representations of the van der Waals surface. The method uses local properties of the shape to identify the correspondence relationships between two point clouds containing up to several thousand colored (labeled) points. Our rigid-body superimposition method follows a two-stage approach. An initial alignment is obtained by matching pose-invariant local 3D descriptors, called FPFH, of the input point clouds. This stage provides a global superimposition of the molecular surfaces, without any knowledge of their initial pose in 3D space. This alignment is then refined by optimizing the matching of colored points. In our study, each point is colored according to its closest atom, which itself belongs to a user defined physico-chemical class. Finally, sensaas provides an alignment and evaluates the molecular similarity by using Tversky coefficients. To assess the efficiency of this approach, we tested its ability to reproduce the superimposition of X-ray structures of the benchmarking AstraZeneca (AZ) data set and, compared its results with those generated by the two shape-alignment approaches shaep and shafts. We also illustrated submatching properties of our method with respect to few substructures and bioisosteric fragments. The code is available upon request from the authors (demo version at https://chemoinfo.ipmc.cnrs.fr/SENSAAS).

| S-EPMC7507133 | biostudies-literature

Group-wise consistent cortical parcellation based on connectional profiles.

Project description:For decades, seeking common, consistent and corresponding anatomical/functional regions across individual brains via cortical parcellation has been a longstanding challenging problem. In our opinion, two major barriers to solve this problem are determining meaningful cortical boundaries that segregate homogeneous regions and establishing correspondences among parcellated regions of multiple brains. To establish a corresponding system across subjects, we recently developed the Dense Individualized and Common Connectivity-based Cortical Landmarks (DICCCOL) system which possesses group-wise consistent white matter fiber connection patterns across individuals and thus provides a dense map of corresponding cortical landmarks. Despite this useful property, however, the DICCCOL landmarks are still far from covering the whole cerebral cortex and do not provide clear structural/functional cortical boundaries. To address the above limitation while leveraging the advantage of DICCCOL, in this paper, we present a novel approach for group-wise consistent parcellation of the cerebral cortex via a hierarchical scheme. In each hierarchical level, DICCCOLs are used as corresponding samples to automatically determine the cluster number so that other cortical surface vertices are iteratively classified into corresponding clusters across subjects within a group-wise classification framework. Experimental results showed that this approach can achieve consistent fine-granularity cortical parcellation with intrinsically-established structural correspondences across individual brains. Besides, comparisons with resting-state and task-based fMRI datasets demonstrated that the group-wise parcellation boundaries segregate functionally homogeneous areas.

| S-EPMC4903920 | biostudies-literature

Robust iterative closest point algorithm based on global reference point for rotation invariant registration.

Project description:The iterative closest point (ICP) algorithm is efficient and accurate for rigid registration but it needs the good initial parameters. It is easily failed when the rotation angle between two point sets is large. To deal with this problem, a new objective function is proposed by introducing a rotation invariant feature based on the Euclidean distance between each point and a global reference point, where the global reference point is a rotation invariant. After that, this optimization problem is solved by a variant of ICP algorithm, which is an iterative method. Firstly, the accurate correspondence is established by using the weighted rotation invariant feature distance and position distance together. Secondly, the rigid transformation is solved by the singular value decomposition method. Thirdly, the weight is adjusted to control the relative contribution of the positions and features. Finally this new algorithm accomplishes the registration by a coarse-to-fine way whatever the initial rotation angle is, which is demonstrated to converge monotonically. The experimental results validate that the proposed algorithm is more accurate and robust compared with the original ICP algorithm.

| S-EPMC5703502 | biostudies-other

Robust 3D point cloud registration based on bidirectional Maximum Correntropy Criterion.

Project description:This paper presents a robust 3D point cloud registration algorithm based on bidirectional Maximum Correntropy Criterion (MCC). Comparing with traditional registration algorithm based on the mean square error (MSE), using the MCC is superior in dealing with complex registration problem with non-Gaussian noise and large outliers. Since the MCC is considered as a probability measure which weights the corresponding points for registration, the noisy points are penalized. Moreover, we propose to use bidirectional measures which can maximum the overlapping parts and avoid the registration result being trapped into a local minimum. Both of these strategies can better apply the information theory method to the point cloud registration problem, making the algorithm more robust. In the process of implementation, we integrate the fixed-point optimization technique based on the iterative closest point algorithm, resulting in the correspondence and transformation parameters that are solved iteratively. The comparison experiments under noisy conditions with related algorithms have demonstrated good performance of the proposed algorithm.

| S-EPMC5969772 | biostudies-literature

Automatic point cloud registration algorithm based on the feature histogram of local surface.

Project description:In this paper, we present an efficient algorithm for point cloud registration in presence of low overlap rate and high noise. The proposed registration method mainly includes four parts: the loop voxel filtering, the curvature-based key point selection, the robust geometric descriptor, and the determining and optimization of correspondences based on key point spatial relationship. The loop voxel filtering filters point clouds to a specified resolution. We propose a key point selection algorithm which has a better anti-noise and fast ability. The feature descriptor of key points is highly exclusive which is based on the geometric relationship between the neighborhood points and the center of gravity of the neighborhood. The correspondences in the pair of two point clouds are determined according to the combined features of key points. Finally, the singular value decomposition and ICP algorithm are applied to align two point clouds. The proposed registration method can accurately and quickly register point clouds of different resolutions in noisy situations. We validate our proposal by presenting a quantitative experimental comparison with state-of-the-art methods. Experimental results show that the proposed point cloud registration algorithm has faster calculation speed, higher registration accuracy, and better anti-noise performance.

| S-EPMC7485869 | biostudies-literature

A method of partially overlapping point clouds registration based on differential evolution algorithm.

Project description:3D point cloud registration is a key technology in 3D point cloud processing, such as 3D reconstruction, object detection. Trimmed Iterative Closest Point algorithm is a prevalent method for registration of two partially overlapping clouds. However, it relies heavily on the initial value and is liable to be trapped in to local optimum. In this paper, we adapt the Differential Evolution algorithm to obtain global optimal solution. By design appropriate evolutionary operations, the algorithm can make the populations distributed more widely, and keep the individuals from concentrating to a local optimum. In the experiment, the proposed algorithm is compared with existing methods which are based on global optimization algorithm such as Genetic Algorithm and particle filters. And the results have demonstrated that the proposed algorithm is more robust and can converge to a good result in fewer generations.

| S-EPMC6303034 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data