Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Inverse 4D conformal planning for lung SBRT using particle swarm optimization.

ABSTRACT: A critical aspect of highly potent regimens such as lung stereotactic body radiation therapy (SBRT) is to avoid collateral toxicity while achieving planning target volume (PTV) coverage. In this work, we describe four dimensional conformal radiotherapy using a highly parallelizable swarm intelligence-based stochastic optimization technique. Conventional lung CRT-SBRT uses a 4DCT to create an internal target volume and then, using forward-planning, generates a 3D conformal plan. In contrast, we investigate an inverse-planning strategy that uses 4DCT data to create a 4D conformal plan, which is optimized across the three spatial dimensions (3D) as well as time, as represented by the respiratory phase. The key idea is to use respiratory motion as an additional degree of freedom. We iteratively adjust fluence weights for all beam apertures across all respiratory phases considering OAR sparing, PTV coverage and delivery efficiency. To demonstrate proof-of-concept, five non-small-cell lung cancer SBRT patients were retrospectively studied. The 4D optimized plans achieved PTV coverage comparable to the corresponding clinically delivered plans while showing significantly superior OAR sparing ranging from 26% to 83% for D max heart, 10%-41% for D max esophagus, 31%-68% for D max spinal cord and 7%-32% for V 13 lung.

SUBMITTER: Modiri A

PROVIDER: S-EPMC5175212 | biostudies-other | 2016 Aug

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Similar Datasets

NEUTRON: Neural particle swarm optimization for material-aware inverse design of structural color.

Project description:Designing optical structures for generating structural colors is challenging because of the complex relationship between the optical structures and the color perceived by human eyes. Machine learning-based approaches have been developed to expedite this design process. However, existing methods solely focus on structural parameters of the optical design, which could lead to suboptimal color generation because of the inability to optimize the selection of materials. To address this issue, an approach known as Neural Particle Swarm Optimization is proposed in this paper. The proposed method achieves high design accuracy and efficiency on two structural color design tasks; the first task is designing environment-friendly alternatives to chrome coatings, and the second task concerns reconstructing pictures with multilayer optical thin films. Several designs that could replace chrome coatings have been discovered; pictures with more than 200,000 pixels and thousands of unique colors can be accurately reconstructed in a few hours.

| S-EPMC9117888 | biostudies-literature

Markerless human motion tracking using hierarchical multi-swarm cooperative particle swarm optimization.

Project description:The high-dimensional search space involved in markerless full-body articulated human motion tracking from multiple-views video sequences has led to a number of solutions based on metaheuristics, the most recent form of which is Particle Swarm Optimization (PSO). However, the classical PSO suffers from premature convergence and it is trapped easily into local optima, significantly affecting the tracking accuracy. To overcome these drawbacks, we have developed a method for the problem based on Hierarchical Multi-Swarm Cooperative Particle Swarm Optimization (H-MCPSO). The tracking problem is formulated as a non-linear 34-dimensional function optimization problem where the fitness function quantifies the difference between the observed image and a projection of the model configuration. Both the silhouette and edge likelihoods are used in the fitness function. Experiments using Brown and HumanEva-II dataset demonstrated that H-MCPSO performance is better than two leading alternative approaches-Annealed Particle Filter (APF) and Hierarchical Particle Swarm Optimization (HPSO). Further, the proposed tracking method is capable of automatic initialization and self-recovery from temporary tracking failures. Comprehensive experimental results are presented to support the claims.

| S-EPMC4433345 | biostudies-literature

Improved multi-objective clustering algorithm using particle swarm optimization.

Project description:Multi-objective clustering has received widespread attention recently, as it can obtain more accurate and reasonable solution. In this paper, an improved multi-objective clustering framework using particle swarm optimization (IMCPSO) is proposed. Firstly, a novel particle representation for clustering problem is designed to help PSO search clustering solutions in continuous space. Secondly, the distribution of Pareto set is analyzed. The analysis results are applied to the leader selection strategy, and make algorithm avoid trapping in local optimum. Moreover, a clustering solution-improved method is proposed, which can increase the efficiency in searching clustering solution greatly. In the experiments, 28 datasets are used and nine state-of-the-art clustering algorithms are compared, the proposed method is superior to other approaches in the evaluation index ARI.

| S-EPMC5716574 | biostudies-literature

Adaptive feature selection using v-shaped binary particle swarm optimization.

Project description:Feature selection is an important preprocessing method in machine learning and data mining. This process can be used not only to reduce the amount of data to be analyzed but also to build models with stronger interpretability based on fewer features. Traditional feature selection methods evaluate the dependency and redundancy of features separately, which leads to a lack of measurement of their combined effect. Moreover, a greedy search considers only the optimization of the current round and thus cannot be a global search. To evaluate the combined effect of different subsets in the entire feature space, an adaptive feature selection method based on V-shaped binary particle swarm optimization is proposed. In this method, the fitness function is constructed using the correlation information entropy. Feature subsets are regarded as individuals in a population, and the feature space is searched using V-shaped binary particle swarm optimization. The above procedure overcomes the hard constraint on the number of features, enables the combined evaluation of each subset as a whole, and improves the search ability of conventional binary particle swarm optimization. The proposed algorithm is an adaptive method with respect to the number of feature subsets. The experimental results show the advantages of optimizing the feature subsets using the V-shaped transfer function and confirm the effectiveness and efficiency of the feature subsets obtained under different classifiers.

| S-EPMC5373580 | biostudies-literature

Lagrange Interpolation Learning Particle Swarm Optimization.

Project description:In recent years, comprehensive learning particle swarm optimization (CLPSO) has attracted the attention of many scholars for using in solving multimodal problems, as it is excellent in preserving the particles' diversity and thus preventing premature convergence. However, CLPSO exhibits low solution accuracy. Aiming to address this issue, we proposed a novel algorithm called LILPSO. First, this algorithm introduced a Lagrange interpolation method to perform a local search for the global best point (gbest). Second, to gain a better exemplar, one gbest, another two particle's historical best points (pbest) are chosen to perform Lagrange interpolation, then to gain a new exemplar, which replaces the CLPSO's comparison method. The numerical experiments conducted on various functions demonstrate the superiority of this algorithm, and the two methods are proven to be efficient for accelerating the convergence without leading the particle to premature convergence.

| S-EPMC4849747 | biostudies-literature

Automated planning through robust templates and multicriterial optimization for lung VMAT SBRT of lung lesions.

Project description:PURPOSE:To develop and validate a robust template for VMAT SBRT of lung lesions, using the multicriterial optimization (MCO) of a commercial treatment planning system. METHODS:The template was established and refined on 10 lung SBRT patients planned for 55 Gy/5 fr. To improve gradient and conformity a ring structure around the planning target volume (PTV) was set in the list of objectives. Ideal fluence optimization was conducted giving priority to organs at risk (OARs) and using the MCO, which further pushes OARs doses. Segmentation was conducted giving priority to PTV coverage. Two different templates were produced with different degrees of modulation, by setting the Fluence Smoothing parameter to Medium (MFS) and High (HFS). Each template was applied on 20 further patients. Automatic and manual plans were compared in terms of dosimetric parameters, delivery time, and complexity. Statistical significance of differences was evaluated using paired two-sided Wilcoxon signed-rank test. RESULTS:No statistically significant differences in PTV coverage and maximum dose were observed, while an improvement was observed in gradient and conformity. A general improvement in dose to OARs was seen, which resulted to be significant for chest wall V30 Gy , total lung V20 Gy , and spinal cord D0.1 cc . MFS plans are characterized by a higher modulation and longer delivery time than manual plans. HFS plans have a modulation and a delivery time comparable to manual plans, but still present an advantage in terms of gradient. CONCLUSION:The automation of the planning process for lung SBRT using robust templates and MCO was demonstrated to be feasible and more efficient.

| S-EPMC7324702 | biostudies-literature

Selectively-informed particle swarm optimization.

Project description:Particle swarm optimization (PSO) is a nature-inspired algorithm that has shown outstanding performance in solving many realistic problems. In the original PSO and most of its variants all particles are treated equally, overlooking the impact of structural heterogeneity on individual behavior. Here we employ complex networks to represent the population structure of swarms and propose a selectively-informed PSO (SIPSO), in which the particles choose different learning strategies based on their connections: a densely-connected hub particle gets full information from all of its neighbors while a non-hub particle with few connections can only follow a single yet best-performed neighbor. Extensive numerical experiments on widely-used benchmark functions show that our SIPSO algorithm remarkably outperforms the PSO and its existing variants in success rate, solution quality, and convergence speed. We also explore the evolution process from a microscopic point of view, leading to the discovery of different roles that the particles play in optimization. The hub particles guide the optimization process towards correct directions while the non-hub particles maintain the necessary population diversity, resulting in the optimum overall performance of SIPSO. These findings deepen our understanding of swarm intelligence and may shed light on the underlying mechanism of information exchange in natural swarm and flocking behaviors.

| S-EPMC4365407 | biostudies-other

Binary particle swarm optimization for operon prediction.

Project description:An operon is a fundamental unit of transcription and contains specific functional genes for the construction and regulation of networks at the entire genome level. The correct prediction of operons is vital for understanding gene regulations and functions in newly sequenced genomes. As experimental methods for operon detection tend to be nontrivial and time consuming, various methods for operon prediction have been proposed in the literature. In this study, a binary particle swarm optimization is used for operon prediction in bacterial genomes. The intergenic distance, participation in the same metabolic pathway, the cluster of orthologous groups, the gene length ratio and the operon length are used to design a fitness function. We trained the proper values on the Escherichia coli genome, and used the above five properties to implement feature selection. Finally, our study used the intergenic distance, metabolic pathway and the gene length ratio property to predict operons. Experimental results show that the prediction accuracy of this method reached 92.1%, 93.3% and 95.9% on the Bacillus subtilis genome, the Pseudomonas aeruginosa PA01 genome and the Staphylococcus aureus genome, respectively. This method has enabled us to predict operons with high accuracy for these three genomes, for which only limited data on the properties of the operon structure exists.

| S-EPMC2896535 | biostudies-literature

ChemMORT: an automatic ADMET optimization platform using deep learning and multi-objective particle swarm optimization.

Project description:Drug discovery and development constitute a laborious and costly undertaking. The success of a drug hinges not only good efficacy but also acceptable absorption, distribution, metabolism, elimination, and toxicity (ADMET) properties. Overall, up to 50% of drug development failures have been contributed from undesirable ADMET profiles. As a multiple parameter objective, the optimization of the ADMET properties is extremely challenging owing to the vast chemical space and limited human expert knowledge. In this study, a freely available platform called Chemical Molecular Optimization, Representation and Translation (ChemMORT) is developed for the optimization of multiple ADMET endpoints without the loss of potency (https://cadd.nscc-tj.cn/deploy/chemmort/). ChemMORT contains three modules: Simplified Molecular Input Line Entry System (SMILES) Encoder, Descriptor Decoder and Molecular Optimizer. The SMILES Encoder can generate the molecular representation with a 512-dimensional vector, and the Descriptor Decoder is able to translate the above representation to the corresponding molecular structure with high accuracy. Based on reversible molecular representation and particle swarm optimization strategy, the Molecular Optimizer can be used to effectively optimize undesirable ADMET properties without the loss of bioactivity, which essentially accomplishes the design of inverse QSAR. The constrained multi-objective optimization of the poly (ADP-ribose) polymerase-1 inhibitor is provided as the case to explore the utility of ChemMORT.

| S-EPMC10883642 | biostudies-literature

Optimization of carton recycling site selection using particle swarm optimization algorithm considering residents' recycling willingness.

Project description:With the development of the express delivery industry, how to increase the recycling rate of waste cartons has become a problem that needs to be solved. Recycling enterprises began to provide the new recycling mode, door-to-door recycling services, to residents with waste cartons. In this article, we constructed a site selection model for a carton recycling site with the aim of maximizing total profits. Considering the residents' recycling willingness and the government subsidy earned through the contribution to carbon emission reduction, this model achieves the task of site selection and unit price fixation for carton recycling. We used the particle swarm optimization (PSO) algorithm to solve the model and compared it with the genetic algorithm (GA) for validity testing. PSO algorithm was also used to carry out sensitivity analysis in this model. The proposed model and the results of the sensitivity analysis can be used for decision-making in recycling enterprises as well as for further research on waste recycling and reverse logistics.

| S-EPMC10495949 | 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