1
|
Hu K, Chen W, Sun Y, Hu X, Zhou Q, Zheng Z. PPNet: Pyramid pooling based network for polyp segmentation. Comput Biol Med 2023; 160:107028. [PMID: 37201273 DOI: 10.1016/j.compbiomed.2023.107028] [Citation(s) in RCA: 10] [Impact Index Per Article: 10.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/14/2023] [Revised: 04/24/2023] [Accepted: 05/09/2023] [Indexed: 05/20/2023]
Abstract
Colonoscopy is the gold standard method for investigating the gastrointestinal tract. Localizing the polyps in colonoscopy images plays a vital role when doing a colonoscopy screening, and it is also quite important for the following treatment, e.g., polyp resection. Many deep learning-based methods have been applied for solving the polyp segmentation issue. However, precisely polyp segmentation is still an open issue. Considering the effectiveness of the Pyramid Pooling Transformer (P2T) in modeling long-range dependencies and capturing robust contextual features, as well as the power of pyramid pooling in extracting features, we propose a pyramid pooling based network for polyp segmentation, namely PPNet. We first adopt the P2T as the encoder for extracting more powerful features. Next, a pyramid feature fusion module (PFFM) combining the channel attention scheme is utilized for learning a global contextual feature, in order to guide the information transition in the decoder branch. Aiming to enhance the effectiveness of PPNet on feature extraction during the decoder stage layer by layer, we introduce the memory-keeping pyramid pooling module (MPPM) into each side branch of the encoder, and transmit the corresponding feature to each lower-level side branch. Experimental results conducted on five public colorectal polyp segmentation datasets are given and discussed. Our method performs better compared with several state-of-the-art polyp extraction networks, which demonstrate the effectiveness of the mechanism of pyramid pooling for colorectal polyp segmentation.
Collapse
Affiliation(s)
- Keli Hu
- Department of Computer Science and Engineering, Shaoxing University, Shaoxing, 312000, PR China; Cancer Center, Department of Gastroenterology, Zhejiang Provincial People's Hospital (Affiliated People's Hospital, Hangzhou Medical College), Hangzhou, 310014, PR China; Information Technology R&D Innovation Center of Peking University, Shaoxing, 312000, PR China
| | - Wenping Chen
- Department of Computer Science and Engineering, Shaoxing University, Shaoxing, 312000, PR China.
| | - YuanZe Sun
- Department of Computer Science and Engineering, Shaoxing University, Shaoxing, 312000, PR China
| | - Xiaozhao Hu
- Shaoxing People's Hospital, Shaoxing, 312000, PR China
| | - Qianwei Zhou
- College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou, 310023, PR China
| | - Zirui Zheng
- Department of Computer Science and Engineering, Shaoxing University, Shaoxing, 312000, PR China
| |
Collapse
|
2
|
Shi M, Chen C, Liu L, Kuang F, Zhao D, Chen X. A grade-based search adaptive random slime mould optimizer for lupus nephritis image segmentation. Comput Biol Med 2023; 160:106950. [PMID: 37120988 DOI: 10.1016/j.compbiomed.2023.106950] [Citation(s) in RCA: 2] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 12/23/2022] [Revised: 04/04/2023] [Accepted: 04/15/2023] [Indexed: 05/02/2023]
Abstract
The segmentation of medical images is a crucial and demanding step in medical image processing that offers a solid foundation for subsequent extraction and analysis of medical image data. Although multi-threshold image segmentation is the most used and specialized basic image segmentation technique, it is computationally demanding and often produces subpar segmentation results, hence restricting its application. To solve this issue, this work develops a multi-strategy-driven slime mould algorithm (RWGSMA) for multi-threshold image segmentation. Specifically, the random spare strategy, the double adaptive weigh strategy, and the grade-based search strategy are used to improve the performance of SMA, resulting in an enhanced SMA version. The random spare strategy is mainly used to accelerate the convergence rate of the algorithm. To prevent SMA from falling towards the local optimum, the double adaptive weights are also applied. The grade-based search approach has also been developed to boost convergence performance. This study evaluates the efficacy of RWGSMA from many viewpoints using 30 test suites from IEEE CEC2017 to effectively demonstrate the importance of these techniques in RWGSMA. In addition, numerous typical images were used to show RWGSMA's segmentation performance. Using the multi-threshold segmentation approach with 2D Kapur's entropy as the RWGSMA fitness function, the suggested algorithm was then used to segment instances of lupus nephritis. The experimental findings demonstrate that the suggested RWGSMA beats numerous similar rivals, suggesting that it has a great deal of promise for segmenting histopathological images.
Collapse
Affiliation(s)
- Manrong Shi
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035, China.
| | - Chi Chen
- Wenzhou University of Technology, Wenzhou, 325035, China.
| | - Lei Liu
- College of Computer Science, Sichuan University, Chengdu, Sichuan, 610065, China.
| | - Fangjun Kuang
- School of Information engineering, Wenzhou Business College, Wenzhou, 325035, China.
| | - Dong Zhao
- College of Computer Science and Technology, Changchun Normal University, Changchun, Jilin, 130032, China.
| | - Xiaowei Chen
- Department of Rheumatology and Immunology, The First Affiliated Hospital of Wenzhou Medical University, Wenzhou, 325000, China.
| |
Collapse
|
3
|
Hua C, Cao X, Liao B, Li S. Advances on intelligent algorithms for scientific computing: an overview. Front Neurorobot 2023; 17:1190977. [PMID: 37152414 PMCID: PMC10161734 DOI: 10.3389/fnbot.2023.1190977] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/21/2023] [Accepted: 04/06/2023] [Indexed: 05/09/2023] Open
Abstract
The field of computer science has undergone rapid expansion due to the increasing interest in improving system performance. This has resulted in the emergence of advanced techniques, such as neural networks, intelligent systems, optimization algorithms, and optimization strategies. These innovations have created novel opportunities and challenges in various domains. This paper presents a thorough examination of three intelligent methods: neural networks, intelligent systems, and optimization algorithms and strategies. It discusses the fundamental principles and techniques employed in these fields, as well as the recent advancements and future prospects. Additionally, this paper analyzes the advantages and limitations of these intelligent approaches. Ultimately, it serves as a comprehensive summary and overview of these critical and rapidly evolving fields, offering an informative guide for novices and researchers interested in these areas.
Collapse
Affiliation(s)
- Cheng Hua
- College of Computer Science and Engineering, Jishou University, Jishou, China
| | - Xinwei Cao
- School of Business, Jiangnan University, Wuxi, China
| | - Bolin Liao
- College of Computer Science and Engineering, Jishou University, Jishou, China
- *Correspondence: Bolin Liao
| | - Shuai Li
- Faculty of Information Technology and Electrical Engineering, University of Oulu, Oulu, Finland
- VTT Technical Research Centre of Finland, Oulu, Finland
- Shuai Li
| |
Collapse
|
4
|
Boosting Slime Mould Algorithm for High-Dimensional Gene Data Mining: Diversity Analysis and Feature Selection. COMPUTATIONAL AND MATHEMATICAL METHODS IN MEDICINE 2022; 2022:8011003. [PMID: 36277020 PMCID: PMC9584684 DOI: 10.1155/2022/8011003] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 07/28/2022] [Revised: 08/26/2022] [Accepted: 08/30/2022] [Indexed: 11/17/2022]
Abstract
Slime mould algorithm (SMA) is a new metaheuristic algorithm, which simulates the behavior and morphology changes of slime mould during foraging. The slime mould algorithm has good performance; however, the basic version of SMA still has some problems. When faced with some complex problems, it may fall into local optimum and cannot find the optimal solution. Aiming at this problem, an improved SMA is proposed to alleviate the disadvantages of SMA. Based on the original SMA, Gaussian mutation and Levy flight are introduced to improve the global search performance of the SMA. Adding Gaussian mutation to SMA can improve the diversity of the population, and Levy flight can alleviate the local optimum of SMA, so that the algorithm can find the optimal solution as soon as possible. In order to verify the effectiveness of the proposed algorithm, a continuous version of the proposed algorithm, GLSMA, is tested on 33 classical continuous optimization problems. Then, on 14 high-dimensional gene datasets, the effectiveness of the proposed discrete version, namely, BGLSMA, is verified by comparing with other feature selection algorithm. Experimental results reveal that the performance of the continuous version of the algorithm is better than the original algorithm, and the defects of the original algorithm are alleviated. Besides, the discrete version of the algorithm has a higher classification accuracy when fewer features are selected. This proves that the improved algorithm has practical value in high-dimensional gene feature selection.
Collapse
|
5
|
Multilevel threshold image segmentation for COVID-19 chest radiography: A framework using horizontal and vertical multiverse optimization. Comput Biol Med 2022; 146:105618. [PMID: 35690477 PMCID: PMC9113963 DOI: 10.1016/j.compbiomed.2022.105618] [Citation(s) in RCA: 84] [Impact Index Per Article: 42.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 03/26/2022] [Revised: 05/07/2022] [Accepted: 05/12/2022] [Indexed: 11/28/2022]
Abstract
COVID-19 is currently raging worldwide, with more patients being diagnosed every day. It usually is diagnosed by examining pathological photographs of the patient's lungs. There is a lot of detailed and essential information on chest radiographs, but manual processing is not as efficient or accurate. As a result, how efficiently analyzing and processing chest radiography of COVID-19 patients is an important research direction to promote COVID-19 diagnosis. To improve the processing efficiency of COVID-19 chest films, a multilevel thresholding image segmentation (MTIS) method based on an enhanced multiverse optimizer (CCMVO) is proposed. CCMVO is improved from the original Multi-Verse Optimizer by introducing horizontal and vertical search mechanisms. It has a more assertive global search ability and can jump out of the local optimum in optimization. The CCMVO-based MTIS method can obtain higher quality segmentation results than HHO, SCA, and other forms and is less prone to stagnation during the segmentation process. To verify the performance of the proposed CCMVO algorithm, CCMVO is first compared with DE, MVO, and other algorithms by 30 benchmark functions; then, the proposed CCMVO is applied to image segmentation of COVID-19 chest radiography; finally, this paper verifies that the combination of MTIS and CCMVO is very successful with good segmentation results by using the Feature Similarity Index (FSIM), the Peak Signal to Noise Ratio (PSNR), and the Structural Similarity Index (SSIM). Therefore, this research can provide an effective segmentation method for a medical organization to process COVID-19 chest radiography and then help doctors diagnose coronavirus pneumonia (COVID-19).
Collapse
|
6
|
Colorectal polyp region extraction using saliency detection network with neutrosophic enhancement. Comput Biol Med 2022; 147:105760. [DOI: 10.1016/j.compbiomed.2022.105760] [Citation(s) in RCA: 17] [Impact Index Per Article: 8.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/27/2022] [Revised: 06/02/2022] [Accepted: 06/18/2022] [Indexed: 11/19/2022]
|
7
|
Abstract
The dragonfly algorithm is a swarm intelligence optimization algorithm based on simulating the swarming behavior of dragonfly individuals. An efficient algorithm must have a symmetry of information between the participating entities. An improved dragonfly algorithm is proposed in this paper to further improve the global searching ability and the convergence speed of DA. The improved DA is named GGBDA, which adds Gaussian mutation and Gaussian barebone on the basis of DA. Gaussian mutation can randomly update the individual positions to avoid the algorithm falling into a local optimal solution. Gaussian barebone can quicken the convergent speed and strengthen local exploitation capacities. Enhancing algorithm efficiency relative to the symmetric concept is a critical challenge in the field of engineering design. To verify the superiorities of GGBDA, this paper sets 30 benchmark functions, which are taken from CEC2014 and 4 engineering design problems to compare GGBDA with other algorithms. The experimental result show that the Gaussian mutation and Gaussian barebone can effectively improve the performance of DA. The proposed GGBDA, similar to the DA, presents improvements in global optimization competence, search accuracy, and convergence performance.
Collapse
|
8
|
Individual Disturbance and Attraction Repulsion Strategy Enhanced Seagull Optimization for Engineering Design. MATHEMATICS 2022. [DOI: 10.3390/math10020276] [Citation(s) in RCA: 13] [Impact Index Per Article: 6.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
The seagull optimization algorithm (SOA) is a novel swarm intelligence algorithm proposed in recent years. The algorithm has some defects in the search process. To overcome the problem of poor convergence accuracy and easy to fall into local optimality of seagull optimization algorithm, this paper proposed a new variant SOA based on individual disturbance (ID) and attraction-repulsion (AR) strategy, called IDARSOA, which employed ID to enhance the ability to jump out of local optimum and adopted AR to increase the diversity of population and make the exploration of solution space more efficient. The effectiveness of the IDARSOA has been verified using representative comprehensive benchmark functions and six practical engineering optimization problems. The experimental results show that the proposed IDARSOA has the advantages of better convergence accuracy and a strong optimization ability than the original SOA.
Collapse
|
9
|
Multi-Population Enhanced Slime Mould Algorithm and with Application to Postgraduate Employment Stability Prediction. ELECTRONICS 2022. [DOI: 10.3390/electronics11020209] [Citation(s) in RCA: 5] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 02/01/2023]
Abstract
In this study, the authors aimed to study an effective intelligent method for employment stability prediction in order to provide a reasonable reference for postgraduate employment decision and for policy formulation in related departments. First, this paper introduces an enhanced slime mould algorithm (MSMA) with a multi-population strategy. Moreover, this paper proposes a prediction model based on the modified algorithm and the support vector machine (SVM) algorithm called MSMA-SVM. Among them, the multi-population strategy balances the exploitation and exploration ability of the algorithm and improves the solution accuracy of the algorithm. Additionally, the proposed model enhances the ability to optimize the support vector machine for parameter tuning and for identifying compact feature subsets to obtain more appropriate parameters and feature subsets. Then, the proposed modified slime mould algorithm is compared against various other famous algorithms in experiments on the 30 IEEE CEC2017 benchmark functions. The experimental results indicate that the established modified slime mould algorithm has an observably better performance compared to the algorithms on most functions. Meanwhile, a comparison between the optimal support vector machine model and other several machine learning methods on their ability to predict employment stability was conducted, and the results showed that the suggested the optimal support vector machine model has better classification ability and more stable performance. Therefore, it is possible to infer that the optimal support vector machine model is likely to be an effective tool that can be used to predict employment stability.
Collapse
|
10
|
Hu J, Liu Y, Heidari AA, Bano Y, Ibrohimov A, Liang G, Chen H, Chen X, Zaguia A, Turabieh H. An effective model for predicting serum albumin level in hemodialysis patients. Comput Biol Med 2022; 140:105054. [PMID: 34847387 DOI: 10.1016/j.compbiomed.2021.105054] [Citation(s) in RCA: 13] [Impact Index Per Article: 6.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/26/2021] [Revised: 11/13/2021] [Accepted: 11/16/2021] [Indexed: 12/31/2022]
Abstract
Patients on hemodialysis (HD) are known to be at an increased risk of mortality. Hypoalbuminemia is one of the most important risk factors of death in HD patients, and is an independent risk factor for all-cause mortality that is associated with cardiac death, infection, and Protein-Energy Wasting (PEW). It is a clinical challenge to elevate serum albumin level. In addition, predicting trends in serum albumin level is effective for personalized treatment of hypoalbuminemia. In this study, we analyzed a total of 3069 records collected from 314 HD patients using a machine learning method that is based on an improved binary mutant quantum grey wolf optimizer (MQGWO) combined with Fuzzy K-Nearest Neighbor (FKNN). The performance of the proposed MQGWO method was evaluated using a series of experiments including global optimization experiments, feature selection experiments on open data sets, and prediction experiments on an HD dataset. The experimental results showed that the most critical relevant indicators such as age, presence or absence of diabetes, dialysis vintage, and baseline albumin can be identified by feature selection. Remarkably, the accuracy and the specificity of the method were 98.39% and 96.77%, respectively, demonstrating that this model has great potential to be used for detecting serum albumin level trends in HD patients.
Collapse
Affiliation(s)
- Jiao Hu
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035, China.
| | - Yi Liu
- Department of Nephrology, The First Affiliated Hospital of Wenzhou Medical University, China.
| | - Ali Asghar Heidari
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035, China.
| | - Yasmeen Bano
- Department of Urology, The First Affiliated Hospital of Wenzhou Medical University, China.
| | - Alisherjon Ibrohimov
- Department of Urology, The First Affiliated Hospital of Wenzhou Medical University, China.
| | - Guoxi Liang
- Department of Information Technology, Wenzhou Polytechnic, Wenzhou, 325035, China.
| | - Huiling Chen
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035, China.
| | - Xumin Chen
- Department of Nephrology, The First Affiliated Hospital of Wenzhou Medical University, China.
| | - Atef Zaguia
- Department of Computer Science, College of Computers and Information Technology, Taif University, P.O. BOX 11099, Taif, 21944, Saudi Arabia.
| | - Hamza Turabieh
- Department of Information Technology, College of Computers and Information Technology, P.O. Box 11099, Taif, 21944, Taif, Saudi Arabia.
| |
Collapse
|
11
|
Zhang Q, Wang Z, Heidari AA, Gui W, Shao Q, Chen H, Zaguia A, Turabieh H, Chen M. Gaussian Barebone Salp Swarm Algorithm with Stochastic Fractal Search for medical image segmentation: A COVID-19 case study. Comput Biol Med 2021; 139:104941. [PMID: 34801864 DOI: 10.1016/j.compbiomed.2021.104941] [Citation(s) in RCA: 22] [Impact Index Per Article: 7.3] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/21/2021] [Revised: 10/11/2021] [Accepted: 10/11/2021] [Indexed: 01/11/2023]
Abstract
An appropriate threshold is a key to using the multi-threshold segmentation method to solve image segmentation problems, and the swarm intelligence (SI) optimization algorithm is one of the popular methods to obtain the optimal threshold. Moreover, Salp Swarm Algorithm (SSA) is a recently released swarm intelligent optimization algorithm. Compared with other SI optimization algorithms, the optimization solution strategy of the SSA still needs to be improved to enhance further the solution accuracy and optimization efficiency of the algorithm. Accordingly, this paper designs an effective segmentation method based on a non-local mean 2D histogram and 2D Kapur's entropy called SSA with Gaussian Barebone and Stochastic Fractal Search (GBSFSSSA) by combining Gaussian Barebone and Stochastic Fractal Search mechanism. In GBSFSSSA, the Gaussian Barebone and Stochastic Fractal Search mechanism effectively balance the global search ability and local search ability of the basic SSA. The CEC2017 competition data set is used to prove the algorithm's performance, and GBSFSSSA shows an absolute advantage over some typical competitive algorithms. Furthermore, the algorithm is applied in image segmentation of COVID-19 CT images, and the results are analyzed based on three different metrics: peak signal-to-noise ratio (PSNR), structural similarity (SSIM), and feature similarity (FSIM), which can lead to the conclusion that the overall performance of GBSFSSSA is better than the comparison algorithm and can effectively improve the segmentation of medical images. Therefore, it is justified that GBSFSSSA is a reliable and effective method in solving the multi-threshold image segmentation problem.
Collapse
Affiliation(s)
- Qian Zhang
- Wenzhou University of Technology, Wenzhou, 325035, China.
| | - Zhiyan Wang
- School of Artificial Intelligence, Jilin International Studies University, Changchun, 130000, China.
| | - Ali Asghar Heidari
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035, China.
| | - Wenyong Gui
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035, China.
| | - Qike Shao
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035, China.
| | - Huiling Chen
- Department of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, 325035, China.
| | - Atef Zaguia
- Department of Computer Science, College of Computers and Information Technology, Taif University, P.O. BOX 11099, Taif, 21944, Saudi Arabia.
| | - Hamza Turabieh
- Department of Information Technology, College of Computers and Information Technology, PO Box 11099, Taif, 21944, Saudi Arabia.
| | - Mayun Chen
- Department of Pulmonary and Critical Care Medicine, The First Affiliated Hospital of Wenzhou Medical University, Wenzhou, 325000, China.
| |
Collapse
|
12
|
Zhao S, Wang P, Heidari AA, Chen H, He W, Xu S. Performance optimization of salp swarm algorithm for multi-threshold image segmentation: Comprehensive study of breast cancer microscopy. Comput Biol Med 2021; 139:105015. [PMID: 34800808 DOI: 10.1016/j.compbiomed.2021.105015] [Citation(s) in RCA: 20] [Impact Index Per Article: 6.7] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/01/2021] [Revised: 11/01/2021] [Accepted: 11/01/2021] [Indexed: 11/30/2022]
Abstract
Multi-threshold image segmentation (MIS) is now a well known image segmentation technique, and many researchers have applied intelligent algorithms to it, but these methods suffer from local optimal drawbacks. This paper presented a novel approach to improve the Salp Swarm Algorithm (SSA), namely EHSSA, and applied it to MIS. Knowing the inaccuracies and discussions on implementation of this method, a new efficient mechanism is proposed to improve global search capability of the algorithm and avoid falling into a local optimum. Moreover, the excellence of the proposed algorithm was proved by comparative experiments at IEEE CEC2014. Afterward, the performance of EHSSA was demonstrated by testing a set of images selected from the Berkeley segmentation data set 500 (BSDS500), and the experimental results were analyzed by evaluating the parameters, which proved the efficiency of the proposed algorithm in MIS. Furthermore, EHSSA was applied to the microscopic image segmentation of breast cancer. Medical image segmentation is the study of how to quickly extract objects of interest (human organs) from various images to perform qualitative and quantitative analysis of diseased tissues and improve the accuracy of their diagnosis, which assists the physician in making more informed decisions and patient rehabilitation. The results of this set of experiments also proved its superior performance. For any info about this paper, readers can refer to https://aliasgharheidari.com.
Collapse
Affiliation(s)
- Songwei Zhao
- College of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, Zhejiang, 325035, China.
| | - Pengjun Wang
- College of Electrical and Electronic Engineering, Wenzhou University, Wenzhou, 325035, China.
| | - Ali Asghar Heidari
- School of Surveying and Geospatial Engineering, College of Engineering, University of Tehran, Tehran, Iran.
| | - Huiling Chen
- College of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, Zhejiang, 325035, China.
| | - Wenming He
- The Affiliated Hospital of Medical School, Ningbo University, Ningbo, 315020, China.
| | - Suling Xu
- The Affiliated Hospital of Medical School, Ningbo University, Ningbo, 315020, China.
| |
Collapse
|
13
|
Hu J, Heidari AA, Zhang L, Xue X, Gui W, Chen H, Pan Z. Chaotic diffusion‐limited aggregation enhanced grey wolf optimizer: Insights, analysis, binarization, and feature selection. INT J INTELL SYST 2021. [DOI: 10.1002/int.22744] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/20/2023]
Affiliation(s)
- Jiao Hu
- Department of Computer Science and Artificial Intelligence Wenzhou University Wenzhou China
| | - Ali Asghar Heidari
- Department of Computer Science and Artificial Intelligence Wenzhou University Wenzhou China
| | - Lejun Zhang
- College of Information Engineering Yangzhou University Yangzhou China
| | - Xiao Xue
- College of Computer Science and Technology Henan Polytechnic University Zhengzhou China
| | - Wenyong Gui
- Department of Computer Science and Artificial Intelligence Wenzhou University Wenzhou China
| | - Huiling Chen
- Department of Computer Science and Artificial Intelligence Wenzhou University Wenzhou China
| | - Zhifang Pan
- Zhejiang Engineering Research Center of Intelligent Medicine The First Affiliated Hospital of Wenzhou Medical University Wenzhou China
| |
Collapse
|
14
|
MILDMS: Multiple Instance Learning via DD Constraint and Multiple Part Similarity. Symmetry (Basel) 2019. [DOI: 10.3390/sym11091080] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/16/2022] Open
Abstract
As a subject area of symmetry, multiple instance learning (MIL) is a special form of a weakly supervised learning problem where the label is related to the bag, not the instances contained in it. The difficulty of MIL lies in the incomplete label information of instances. To resolve this problem, in this paper, we propose a novel diverse density (DD) and multiple part similarity combination method for multiple instance learning, named MILDMS. First, we model the target concepts optimization with a DD function constraint on positive and negative instance space, which can greatly improve the robustness to label noise problem. Next, we combine the positive and negative instances in the bag (generated by hand-crafted and convolutional neural network features) with multiple part similarities to construct an MIL kernel. We evaluate the proposed approach on the MUSK dataset, whose results MUSK1 (91.9%) and MUSK2 (92.2%) show our method is comparable to other MIL algorithms. To further demonstrate generality, we also present experimental results on the PASCAL VOC 2007 and 2012 (46.5% and 42.2%) and COREL (78.6%) that significantly outperforms the state-of-the-art algorithms including deep MIL and other non-deep MIL algorithms.
Collapse
|