The segmentation effect of Tsallis entropy method is superior to that of Shannon entropy method, and the computation speed of two-dimensional Shannon cross entropy method can be further improved by optimization. The e...The segmentation effect of Tsallis entropy method is superior to that of Shannon entropy method, and the computation speed of two-dimensional Shannon cross entropy method can be further improved by optimization. The existing two-dimensional Tsallis cross entropy method is not the strict two-dimensional extension. Thus two new methods of image thresholding using two-dimensional Tsallis cross entropy based on either Chaotic Particle Swarm Optimization (CPSO) or decomposition are proposed. The former uses CPSO to find the optimal threshold. The recursive algorithm is adopted to avoid the repetitive computation of fitness function in iterative procedure. The computing speed is improved greatly. The latter converts the two-dimensional computation into two one-dimensional spaces, which makes the computational complexity further reduced from O(L2) to O(L). The experimental results show that, compared with the proposed recently two-dimensional Shannon or Tsallis cross entropy method, the two new methods can achieve superior segmentation results and reduce running time greatly.展开更多
基金supported by National Natural Science Foundation of China under Grant No.60872065Open Foundation of State Key Laboratory for Novel Software Technology at Nanjing University under Grant No.KFKT2010B17
文摘The segmentation effect of Tsallis entropy method is superior to that of Shannon entropy method, and the computation speed of two-dimensional Shannon cross entropy method can be further improved by optimization. The existing two-dimensional Tsallis cross entropy method is not the strict two-dimensional extension. Thus two new methods of image thresholding using two-dimensional Tsallis cross entropy based on either Chaotic Particle Swarm Optimization (CPSO) or decomposition are proposed. The former uses CPSO to find the optimal threshold. The recursive algorithm is adopted to avoid the repetitive computation of fitness function in iterative procedure. The computing speed is improved greatly. The latter converts the two-dimensional computation into two one-dimensional spaces, which makes the computational complexity further reduced from O(L2) to O(L). The experimental results show that, compared with the proposed recently two-dimensional Shannon or Tsallis cross entropy method, the two new methods can achieve superior segmentation results and reduce running time greatly.
