Volume 5 Number 7 (Jul. 2010)
Home > Archive > 2010 > Volume 5 Number 7 (Jul. 2010) >
JCP 2010 Vol.5(7): 1054-1061 ISSN: 1796-203X
doi: 10.4304/jcp.5.7.1054-1061

A Fast Image Thresholding Method Based on Chaos Optimization and Recursive Algorithm for Two- Dimensional Tsallis Entropy

Xinming Zhang and Lin Yan
College of Computer and Information Technology, Henan Normal University, Xinxiang 453007, China

Abstract—The two-dimensional (2-D) maximum Tsallis entropy method often gets ideal segmentation results, because it not only takes advantage of the spatial neighbor information with using the 2-D histogram of the image, but also has some flexibility with a parameter. However, its time-consuming computation is often an obstacle in real time application systems. In this paper, a fast image thresholding method based on chaos optimization and recursive algorithm for 2-D Tsallis entropy is presented. Firstly, improve the traditional chaos optimization algorithm(COA) so that it can get global solution with lower computation load, then propose a recursive algorithm with the stored matrix variables, finally combine the improved COA and the recursive algorithm to reduce much computational cost in the process of solving the 2-D maximum Tsallis entropy problem. Experimental results show the proposed approach can get better segmentation performance and has much faster speed.

Index Terms—Image thresholding, Two-dimensional (2-D) Tsallis entropy, Chaos optimization algorithm (COA), Recursive algorithm

[PDF]

Cite: Xinming Zhang and Lin Yan, " A Fast Image Thresholding Method Based on Chaos Optimization and Recursive Algorithm for Two- Dimensional Tsallis Entropy," Journal of Computers vol. 5, no. 7, pp. 1054-1061, 2010.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>