A Versatile and Efficient Voxelization-Based Meshing Algorithm of Multiple Phases.
Ontology highlight
ABSTRACT:
SUBMITTER: Chouchane M
PROVIDER: S-EPMC6648448 | biostudies-literature | 2019 Jun
REPOSITORIES: biostudies-literature
Publications
A Versatile and Efficient Voxelization-Based Meshing Algorithm of Multiple Phases.
Chouchane Mehdi M Rucci Alexis A Franco Alejandro A AA
ACS omega 20190626 6
This paper presents a new algorithm (INNOV) capable of generating a mesh of three-dimensional objects containing multiple phases. This mesh can later be imported into commercial or open-source software to perform multiphysics-based simulations based on partial differential equations. While the range of application is large, this algorithm is designed as a post-processing tool of micro/nanotomography images and electrode mesostructures predicted from CGMD (coarse-grained molecular dynamics) simul ...[more]
Similar Datasets
Project description:Path planning algorithms for automated fiber placement are used to determine the directions of the fiber paths and the start and end positions on the mold surfaces. The quality of the fiber paths determines largely the efficiency and quality of the automated fiber placement process. The presented work investigated an efficient path planning algorithm based on surface meshing. In addition, an update method of the datum direction vector via a guide-line update strategy was proposed to make the path planning algorithm applicable for complex surfaces. Finally, accuracy analysis was performed on the proposed algorithm and it can be adopted as the reference for the triangulation parameter selection for the path planning algorithm.
| S-EPMC7560477 | biostudies-literature
Project description:We study the problem of decomposing a volume with a smooth boundary into a collection of Voronoi cells. Unlike the dual problem of conforming Delaunay meshing, a principled solution to this problem for generic smooth surfaces remained elusive. VoroCrust leverages ideas from weighted ?-shapes and the power crust algorithm to produce unweighted Voronoi cells conforming to the surface, yielding the first provably-correct algorithm for this problem. Given a ?-sparse ?-sample, we work with the balls of radius ? times the local feature size centered at each sample. The corners of the union of these balls on both sides of the surface are the Voronoi sites and the interface of their cells is a watertight surface reconstruction embedded in the dual shape of the union of balls. With the surface protected, the enclosed volume can be further decomposed by generating more sites inside it. Compared to clipping-based algorithms, VoroCrust cells are full Voronoi cells, with convexity and fatness guarantees. Compared to the power crust algorithm, VoroCrust cells are not filtered, are unweighted, and offer greater flexibility in meshing the enclosed volume by either structured or randomly genenerated samples.
| S-EPMC6344055 | biostudies-literature
Project description:BACKGROUND: The comparison of homologous sequences from different species is an essential approach to reconstruct the evolutionary history of species and of the genes they harbour in their genomes. Several complete mitochondrial and nuclear genomes are now available, increasing the importance of using multiple sequence alignment algorithms in comparative genomics. MtDNA has long been used in phylogenetic analysis and errors in the alignments can lead to errors in the interpretation of evolutionary information. Although a large number of multiple sequence alignment algorithms have been proposed to date, they all deal with linear DNA and cannot handle directly circular DNA. Researchers interested in aligning circular DNA sequences must first rotate them to the "right" place using an essentially manual process, before they can use multiple sequence alignment tools. RESULTS: In this paper we propose an efficient algorithm that identifies the most interesting region to cut circular genomes in order to improve phylogenetic analysis when using standard multiple sequence alignment algorithms. This algorithm identifies the largest chain of non-repeated longest subsequences common to a set of circular mitochondrial DNA sequences. All the sequences are then rotated and made linear for multiple alignment purposes.To evaluate the effectiveness of this new tool, three different sets of mitochondrial DNA sequences were considered. Other tests considering randomly rotated sequences were also performed. The software package Arlequin was used to evaluate the standard genetic measures of the alignments obtained with and without the use of the CSA algorithm with two well known multiple alignment algorithms, the CLUSTALW and the MAVID tools, and also the visualization tool SinicView. CONCLUSION: The results show that a circularization and rotation pre-processing step significantly improves the efficiency of public available multiple sequence alignment algorithms when used in the alignment of circular DNA sequences. The resulting alignments lead to more realistic phylogenetic comparisons between species.
| S-EPMC2722656 | biostudies-literature
Project description:BACKGROUND: Research in epistasis or gene-gene interaction detection for human complex traits has grown over the last few years. It has been marked by promising methodological developments, improved translation efforts of statistical epistasis to biological epistasis and attempts to integrate different omics information sources into the epistasis screening to enhance power. The quest for gene-gene interactions poses severe multiple-testing problems. In this context, the maxT algorithm is one technique to control the false-positive rate. However, the memory needed by this algorithm rises linearly with the amount of hypothesis tests. Gene-gene interaction studies will require a memory proportional to the squared number of SNPs. A genome-wide epistasis search would therefore require terabytes of memory. Hence, cache problems are likely to occur, increasing the computation time. In this work we present a new version of maxT, requiring an amount of memory independent from the number of genetic effects to be investigated. This algorithm was implemented in C++ in our epistasis screening software MBMDR-3.0.3. We evaluate the new implementation in terms of memory efficiency and speed using simulated data. The software is illustrated on real-life data for Crohn's disease. RESULTS: In the case of a binary (affected/unaffected) trait, the parallel workflow of MBMDR-3.0.3 analyzes all gene-gene interactions with a dataset of 100,000 SNPs typed on 1000 individuals within 4 days and 9 hours, using 999 permutations of the trait to assess statistical significance, on a cluster composed of 10 blades, containing each four Quad-Core AMD Opteron(tm) Processor 2352 2.1 GHz. In the case of a continuous trait, a similar run takes 9 days. Our program found 14 SNP-SNP interactions with a multiple-testing corrected p-value of less than 0.05 on real-life Crohn's disease (CD) data. CONCLUSIONS: Our software is the first implementation of the MB-MDR methodology able to solve large-scale SNP-SNP interactions problems within a few days, without using much memory, while adequately controlling the type I error rates. A new implementation to reach genome-wide epistasis screening is under construction. In the context of Crohn's disease, MBMDR-3.0.3 could identify epistasis involving regions that are well known in the field and could be explained from a biological point of view. This demonstrates the power of our software to find relevant phenotype-genotype higher-order associations.
| S-EPMC3648350 | biostudies-literature
Project description: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.
| S-EPMC4363901 | biostudies-literature
Project description:Video analysis of animal behaviour is widely used in fields such as ecology, ecotoxicology, and evolutionary research. However, when tracking multiple animals, occlusion and crossing are problematic, especially when the identity of each individual needs to be preserved. We present a new algorithm, ToxId, which preserves the identity of multiple animals by linking trajectory segments using their intensity histogram and Hu-moments. We verify the performance and accuracy of our algorithm using video sequences with different animals and experimental conditions. The results show that our algorithm achieves state-of-the-art accuracy using an efficient approach without the need of learning processes, complex feature maps or knowledge of the animal shape. ToxId is also computationally efficient, has low memory requirements, and operates without accessing future or past frames.
| S-EPMC5676683 | biostudies-literature
Project description:The extraction of higher-value products from lignin degradations under mild conditions is a challenge. Previous research reported efficient two-step oxidation and reduction strategies for lignin degradation, which has great significance to lignin degradation. In this paper, the mechanism about the C-O bond cleavage of lignin with and without Cα oxidations has been studied systematically. Our calculation results show that the degradation of anionized lignin with Cα oxidations is kinetically and thermodynamically feasible. In addition, the calculations predict that the anionized lignin compounds without Cα oxidation also could be degraded under mild conditions. Moreover, we propose special lignin catalytic degradation systems containing the characteristic structure of "double hydrogen bonds." The double hydrogen bonds structure could further decrease the energy barriers of the C-O bond cleavage reaction. This provides a versatile strategy to design novel lignin degradation.
| S-EPMC8810403 | biostudies-literature
Project description:Sleep-stage classification is essential for sleep research. Various automatic judgment programs, including deep learning algorithms using artificial intelligence (AI), have been developed, but have limitations with regard to data format compatibility, human interpretability, cost, and technical requirements. We developed a novel program called GI-SleepNet, generative adversarial network (GAN)-assisted image-based sleep staging for mice that is accurate, versatile, compact, and easy to use. In this program, electroencephalogram and electromyography data are first visualized as images, and then classified into three stages (wake, NREM, and REM) by a supervised image learning algorithm. To increase its accuracy, we adopted GAN and artificially generated fake REM sleep data to equalize the number of stages. This resulted in improved accuracy, and as little as one mouse's data yielded significant accuracy. Due to its image-based nature, the program is easy to apply to data of different formats, different species of animals, and even outside sleep research. Image data can be easily understood; thus, confirmation by experts is easily obtained, even when there are prediction anomalies. As deep learning in image processing is one of the leading fields in AI, numerous algorithms are also available.
| S-EPMC8628800 | biostudies-literature
Project description:Adoptive cell transfer is an important approach for basic research and emerges as an effective treatment for various diseases, including infections and blood cancers. Direct genetic manipulation of primary immune cells opens up unprecedented research opportunities and could be applied to enhance cellular therapeutic products. In this article, we report highly efficient genome engineering in primary murine T cells using a plasmid-based RNA-guided CRISPR system. We developed a straightforward approach to ablate genes in up to 90% of cells and to introduce precisely targeted single nucleotide polymorphisms in up to 25% of the transfected primary T cells. We used gene editing-mediated allele switching to quantify homology-directed repair, systematically optimize experimental parameters, and map a native B cell epitope in primary T cells. Allele switching of a surrogate cell surface marker can be used to enrich cells, with successful simultaneous editing of a second gene of interest. Finally, we applied the approach to correct two disease-causing mutations in the Foxp3 gene. Repairing the cause of the scurfy syndrome, a 2-bp insertion in Foxp3, and repairing the clinically relevant Foxp3K276X mutation restored Foxp3 expression in primary T cells.
| S-EPMC5857648 | biostudies-literature
Project description:Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain applications. What has been missing is a robust polyhedral meshing algorithm that can handle broad classes of domains exhibiting arbitrary curved boundaries and sharp features. In addition, the power of primal-dual mesh pairs, exemplified by Voronoi-Delaunay meshes, has been recognized as an important ingredient in numerous formulations. The VoroCrust algorithm is the first provably correct algorithm for conforming Voronoi meshing for non-convex and possibly non-manifold domains with guarantees on the quality of both surface and volume elements. A robust refinement process estimates a suitable sizing field that enables the careful placement of Voronoi seeds across the surface circumventing the need for clipping and avoiding its many drawbacks. The algorithm has the flexibility of filling the interior by either structured or random samples, while all sharp features are preserved in the output mesh. We demonstrate the capabilities of the algorithm on a variety of models and compare against state-of-the-art polyhedral meshing methods based on clipped Voronoi cells establishing the clear advantage of VoroCrust output.
| S-EPMC7439975 | biostudies-literature