Browse
Submit Data
Databases
API
Help

Dataset Information

19 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Multi-Threshold Image Segmentation of Maize Diseases Based on Elite Comprehensive Particle Swarm Optimization and Otsu.

ABSTRACT: Maize is a major global food crop and as one of the most productive grain crops, it can be eaten; it is also a good feed for the development of animal husbandry and essential raw material for light industry, chemical industry, medicine, and health. Diseases are the main factor limiting the high and stable yield of maize. Scientific and practical identification is a vital link to reduce the damage of diseases and accurate segmentation of disease spots is one of the fundamental techniques for disease identification. However, one single method cannot achieve a good segmentation effect to meet the diversity and complexity of disease spots. In order to solve the shortcomings of noise interference and oversegmentation in the Otsu segmentation method, a non-local mean filtered two-dimensional histogram was used to remove the noise in disease images and a new elite strategy improved comprehensive particle swarm optimization (PSO) method was used to find the optimal segmentation threshold of the objective function in this study. The experimental results of segmenting three kinds of maize foliar disease images show that the segmentation effect of this method is better than other similar algorithms and it has better convergence and stability.

SUBMITTER: Chen C

PROVIDER: S-EPMC8710579 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Multilevel thresholding with divergence measure and improved particle swarm optimization algorithm for crack image segmentation.

Project description:Crack formation is a common phenomenon in engineering structures, which can cause serious damage to the safety and health of these structures. An important method of ensuring the safety and health of engineered structures is the prompt detection of cracks. Image threshold segmentation based on machine vision is a crucial technology for crack detection. Threshold segmentation can separate the crack area from the background, providing convenience for more accurate measurement and evaluation of the crack condition and location. The segmentation of cracks in complex scenes is a challenging task, and this goal can be achieved by means of multilevel thresholding. The arithmetic-geometric divergence combines the advantages of the arithmetic mean and the geometric mean in probability measures, enabling a more precise capture of the local features of an image in image processing. In this paper, a multilevel thresholding method for crack image segmentation based on the minimum arithmetic-geometric divergence is proposed. To address the issue of time complexity in multilevel thresholding, an enhanced particle swarm optimization algorithm with local stochastic perturbation is proposed. In crack detection, the thresholding criterion function based on the minimum arithmetic-geometric divergence can adaptively determine the thresholds according to the distribution characteristics of pixel values in the image. The proposed enhanced particle swarm optimization algorithm can increase the diversity of candidate solutions and enhance the global convergence performance of the algorithm. The proposed method for crack image segmentation is compared with seven state-of-the-art multilevel thresholding methods based on several metrics, including RMSE, PSNR, SSIM, FSIM, and computation time. The experimental results show that the proposed method outperforms several competing methods in terms of these metrics.

| S-EPMC10984966 | biostudies-literature

A Brain Tumor Image Segmentation Method Based on Quantum Entanglement and Wormhole Behaved Particle Swarm Optimization.

Project description:PurposeAlthough classical techniques for image segmentation may work well for some images, they may perform poorly or not work at all for others. It often depends on the properties of the particular image segmentation task under study. The reliable segmentation of brain tumors in medical images represents a particularly challenging and essential task. For example, some brain tumors may exhibit complex so-called "bottle-neck" shapes which are essentially circles with long indistinct tapering tails, known as a "dual tail." Such challenging conditions may not be readily segmented, particularly in the extended tail region or around the so-called "bottle-neck" area. In those cases, existing image segmentation techniques often fail to work well.MethodsExisting research on image segmentation using wormhole and entangle theory is first analyzed. Next, a random positioning search method that uses a quantum-behaved particle swarm optimization (QPSO) approach is improved by using a hyperbolic wormhole path measure for seeding and linking particles. Finally, our novel quantum and wormhole-behaved particle swarm optimization (QWPSO) is proposed.ResultsExperimental results show that our QWPSO algorithm can better cluster complex "dual tail" regions into groupings with greater adaptability than conventional QPSO. Experimental work also improves operational efficiency and segmentation accuracy compared with current competing reference methods.ConclusionOur QWPSO method appears extremely promising for isolating smeared/indistinct regions of complex shape typical of medical image segmentation tasks. The technique is especially advantageous for segmentation in the so-called "bottle-neck" and "dual tail"-shaped regions appearing in brain tumor images.

| S-EPMC9127532 | biostudies-literature

Advancing image segmentation with DBO-Otsu: Addressing rubber tree diseases through enhanced threshold techniques.

Project description:Addressing the profound impact of Tapping Panel Dryness (TPD) on yield and quality in the global rubber industry, this study introduces a cutting-edge Otsu threshold segmentation technique, enhanced by Dung Beetle Optimization (DBO-Otsu). This innovative approach optimizes the segmentation threshold combination by accelerating convergence and diversifying search methodologies. Following initial segmentation, TPD severity levels are meticulously assessed using morphological characteristics, enabling precise determination of optimal thresholds for final segmentation. The efficacy of DBO-Otsu is rigorously evaluated against mainstream benchmarks like Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Index (SSIM), and Feature Similarity Index (FSIM), and compared with six contemporary swarm intelligence algorithms. The findings reveal that DBO-Otsu substantially surpasses its counterparts in image segmentation quality and processing speed. Further empirical analysis on a dataset comprising TPD cases from level 1 to 5 underscores the algorithm's practical utility, achieving an impressive 80% accuracy in severity level identification and underscoring its potential for TPD image segmentation and recognition tasks.

| S-EPMC10956860 | biostudies-literature

Multiswarm comprehensive learning particle swarm optimization for solving multiobjective optimization problems.

Project description:Comprehensive learning particle swarm optimization (CLPSO) is a powerful state-of-the-art single-objective metaheuristic. Extending from CLPSO, this paper proposes multiswarm CLPSO (MSCLPSO) for multiobjective optimization. MSCLPSO involves multiple swarms, with each swarm associated with a separate original objective. Each particle's personal best position is determined just according to the corresponding single objective. Elitists are stored externally. MSCLPSO differs from existing multiobjective particle swarm optimizers in three aspects. First, each swarm focuses on optimizing the associated objective using CLPSO, without learning from the elitists or any other swarm. Second, mutation is applied to the elitists and the mutation strategy appropriately exploits the personal best positions and elitists. Third, a modified differential evolution (DE) strategy is applied to some extreme and least crowded elitists. The DE strategy updates an elitist based on the differences of the elitists. The personal best positions carry useful information about the Pareto set, and the mutation and DE strategies help MSCLPSO discover the true Pareto front. Experiments conducted on various benchmark problems demonstrate that MSCLPSO can find nondominated solutions distributed reasonably over the true Pareto front in a single run.

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

Stochastic optimized relevance feedback particle swarm optimization for content based image retrieval.

Project description:One of the major challenges for the CBIR is to bridge the gap between low level features and high level semantics according to the need of the user. To overcome this gap, relevance feedback (RF) coupled with support vector machine (SVM) has been applied successfully. However, when the feedback sample is small, the performance of the SVM based RF is often poor. To improve the performance of RF, this paper has proposed a new technique, namely, PSO-SVM-RF, which combines SVM based RF with particle swarm optimization (PSO). The aims of this proposed technique are to enhance the performance of SVM based RF and also to minimize the user interaction with the system by minimizing the RF number. The PSO-SVM-RF was tested on the coral photo gallery containing 10908 images. The results obtained from the experiments showed that the proposed PSO-SVM-RF achieved 100% accuracy in 8 feedback iterations for top 10 retrievals and 80% accuracy in 6 iterations for 100 top retrievals. This implies that with PSO-SVM-RF technique high accuracy rate is achieved at a small number of iterations.

| S-EPMC4121098 | biostudies-other

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

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

A twinning bare bones particle swarm optimization algorithm.

Project description:A twinning bare bones particle swarm optimization(TBBPSO) algorithm is proposed in this paper. The TBBPSO is combined by two operators, the twins grouping operator (TGO) and the merger operator (MO). The TGO aims at the reorganization of the particle swarm. Two particles will form as a twin and influence each other in subsequent iterations. In a twin, one particle is designed to do the global search while the other one is designed to do the local search. The MO aims at merging the twins and enhancing the search ability of the main group. Two operators work together to enhance the local minimum escaping ability of proposed methods. In addition, no parameter adjustment is needed in TBBPSO, which means TBBPSO can solve different types of optimization problems without previous information or parameter adjustment. In the benchmark functions test, the CEC2014 benchmark functions are used. Experimental results prove that proposed methods can present high precision results for various types of optimization problems.

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