CPSOGSA for Multilevel Image Thresholding

버전 1.1 (101 KB) 작성자: Sajad Ahmad Rather
CPSOGSA is employed to find the optimal pixels in the benchmark images
다운로드 수: 319
업데이트 날짜: 2021/7/7
This work introduces a new image segmentation method based on the constriction coefficient-based particle swarm optimization and gravitational search algorithm (CPSOGSA). The random samples of the image act as searcher agents of the CPSOGSA algorithm. The optimal number of thresholds is determined using Kapur's entropy method. The effectiveness and applicability of CPSOGSA in image segmentation is accomplished by applying it to five standard images from the USC-SIPI image database, namely Aeroplane, Cameraman, Clock, Lena, and Pirate.
This is the source code of the paper:
Rather, S. A., & Bala, P. S. (2021), “Constriction Coefficient Based Particle Swarm Optimization and Gravitational Search Algorithm for Multilevel Image Thresholding”, Expert Systems, https://doi.org/10.1111/exsy.12717, Wiley, SCIE (I.F = 2.587).
If you have no access to the paper, please drop me an email at sajad.win8@gmail.com and I will obviously send you the paper. All of the source codes and extra information as well as more optimization techniques can be found in my Github page at https://github.com/SajadAHMAD1.
My other Social Media Link(s)/Accounts:
13) Gmail: sajad.win8@gmail.com

인용 양식

Rather, Sajad Ahmad, and P. Shanthi Bala. “Constriction Coefficient Based Particle Swarm Optimization and Gravitational Search Algorithm for Multilevel Image Thresholding.” Expert Systems, Wiley, May 2021, doi:10.1111/exsy.12717.

양식 더 보기
MATLAB 릴리스 호환 정보
개발 환경: R2016a
모든 릴리스와 호환
플랫폼 호환성
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
버전 게시됨 릴리스 정보
1.1

See release notes for this release on GitHub: https://github.com/SajadAHMAD1/CPSOGSA-for-Multilevel-Image-Thresholding/releases/tag/1.1

이 GitHub 애드온의 문제를 보거나 보고하려면 GitHub 리포지토리로 가십시오.
이 GitHub 애드온의 문제를 보거나 보고하려면 GitHub 리포지토리로 가십시오.