TY - GEN
T1 - Multilevel minimum cross entropy threshold selection based on quantum particle swarm optimization
AU - Yong, Zhao
AU - Zongde, Fang
AU - Kanwei, Wang
AU - Hui, Pang
PY - 2007
Y1 - 2007
N2 - The minimum cross entropy thresholding (MCET) has been proven as an efficient method in image segmentation for bilevel thresholding. However, this method is computationally intensive when extended to multilevel thresholding. This paper first employs a recursive programming technique which can reduce an order of magnitude for computing the MCET fitness function. Then, a quantum particle swarm optimization (QPSO) algorithm is proposed for searching the nearoptimal MCET thresholds. The experimental results show that the proposed QPSO-based algorithm can get ideal segmentation result with less computation cost.
AB - The minimum cross entropy thresholding (MCET) has been proven as an efficient method in image segmentation for bilevel thresholding. However, this method is computationally intensive when extended to multilevel thresholding. This paper first employs a recursive programming technique which can reduce an order of magnitude for computing the MCET fitness function. Then, a quantum particle swarm optimization (QPSO) algorithm is proposed for searching the nearoptimal MCET thresholds. The experimental results show that the proposed QPSO-based algorithm can get ideal segmentation result with less computation cost.
UR - http://www.scopus.com/inward/record.url?scp=35148856284&partnerID=8YFLogxK
U2 - 10.1109/SNPD.2007.376
DO - 10.1109/SNPD.2007.376
M3 - 会议稿件
AN - SCOPUS:35148856284
SN - 0769529097
SN - 9780769529097
T3 - Proceedings - SNPD 2007: Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
SP - 65
EP - 69
BT - Proceedings - SNPD 2007
T2 - SNPD 2007: 8th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Y2 - 30 July 2007 through 1 August 2007
ER -