Fast three-dimensional Otsu thresholding with shuffled frog-leaping algorithm

Authors:
Na Wang;Xia Li;Xiao-hong Chen
Affiliations:
College of Information Engineering, Shenzhen University, China;College of Information Engineering, Shenzhen University, China;College of Information Engineering, Shenzhen University, China
Venue:
Pattern Recognition Letters
Year:
2010

Citing 6
Cited 5

On the color image segmentation algorithm based on the thresholding and the fuzzy C-means techniques

Pattern Recognition
An analysis of the behavior of a class of genetic adaptive systems.

An analysis of the behavior of a class of genetic adaptive systems.
An Improved Threshold Selection Algorithm Based on Particle Swarm Optimization for Image Segmentation

ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 05
Maximum Variance Image Segmentation Based on Improved Genetic Algorithm

SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02
Multilevel Thresholding Methods for Image Segmentation with Otsu Based on QPSO

CISP '08 Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 3 - Volume 03
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization

IEEE Transactions on Evolutionary Computation

Unsupervised range-constrained thresholding

Pattern Recognition Letters
The optimal All-Partial-Sums algorithm in commutative semigroups and its applications for image thresholding segmentation

Theoretical Computer Science
Cytoplasm and nucleus segmentation in cervical smear images using Radiating GVF Snake

Pattern Recognition
Data field-based mechanism for three-dimensional thresholding

Neurocomputing
Granular Computing Based on Gaussian Cloud Transformation

Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday

Quantified Score

Hi-index	0.10

Visualization

Abstract

Three-dimensional (3-D) Otsu thresholding was regarded as an effective improvement over the original Otsu method, especially under low signal to noise ratio and poor contrast conditions. However, it is very time consuming for real-time applications. Shuffled frog-leaping algorithm (SFLA) is a newly developed memetic meta-heuristic evolutionary algorithm with good global search capability. In this paper, a fast threshold selection method based on SFLA is proposed to speed up the original 3-D Otsu thresholding for image segmentation. In this new paradigm, an updating rule is carefully designed to extend the length of each frog's jump by emulating frog's perception and action uncertainties. The modification widens the local search space thus helps to prevent premature convergence and improves the performance of the SFLA. It is then used to simplify the process for heuristic search of the optimal threshold instead of exhaustively exploring every possible threshold vector in three-dimensional space. Experimental results compared with the original 3-D Otsu and the fast recursive 3-D Otsu show that SFLA-based thresholding can exactly obtain the global optimal threshold with significant decrease in the computation time and the number of fitness function evaluation (FFE).