Multilevel thresholding using an improved cuckoo search algorithm for image segmentation
| Autor: | Longzhen Duan, Dongbo Zhang, Shuqing Yang |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Wilcoxon signed-rank test
Computer science business.industry Heuristic (computer science) Brute-force search Image segmentation Thresholding Theoretical Computer Science Hardware and Architecture Benchmark (computing) Local search (optimization) Cuckoo search business Algorithm Software Information Systems |
| Zdroj: | The Journal of Supercomputing. 77:6734-6753 |
| ISSN: | 1573-0484 0920-8542 |
| DOI: | 10.1007/s11227-020-03566-7 |
| Popis: | Multilevel thresholding image segmentation is an important technique, which has attracted much attention in recent years. The conventional exhaustive search method for image segmentation is efficient for bilevel thresholding. However, they are time expensive when dealing with multilevel thresholding image segmentation. To better tackle this problem, an improved cuckoo search algorithm (ICS) is proposed to search for the optimal multilevel thresholding in this paper, and Otsu is considered as its objective function. In the ICS, two modifications are used to improve the standard cuckoo search algorithm. First, a parameter adaptation strategy is utilized to improve exploration performance. Second, a dynamic weighted random-walk method is adopted to enhance the local search efficiency. A total of six benchmark test images are used to perform the experiments, and seven state-of-the-art metaheuristic algorithms are introduced to compare with the ICS. A series of measure indexes such as objective function value and standard deviation, PSNR, FSIM, and SSIM as well as the Wilcoxon rank sum and convergence performance are performed in the experiments; the experimental results show that the proposed algorithm is superior to other seven well-known heuristic algorithms. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|