Image thresholding using Tsallis entropy

  • Authors:
  • M. Portes de Albuquerque;I. A. Esquef;A. R. Gesualdi Mello

  • Affiliations:
  • Centro Brasileiro de Pesquisas Fsicas, CBPF/MCT, Rua Dr. Xavier Sigaud 150 Urea, Rio de Janeiro 22290180, Brazil;Universidade Estadual do Norte Fluminense, UENF, Av. Alberto Lamego, no. 2000, Horto, Campos, RJ, Brazil;Centro Brasileiro de Pesquisas Fsicas, CBPF/MCT, Rua Dr. Xavier Sigaud 150 Urea, Rio de Janeiro 22290180, Brazil

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 2004

Quantified Score

Hi-index 0.10

Visualization

Abstract

Image analysis usually refers to processing of images with the goal of finding objects presented in the image. Image segmentation is one of the most critical tasks in automatic image analysis. The nonextensive entropy is a recent development in statistical mechanics and it is a new formalism in which a real quantity q was introduced as parameter for physical systems that present long range interactions, long time memories and fractal-type structures. In image processing, one of the most efficient techniques for image segmentation is entropy-based thresholding. This approach uses the Shannon entropy originated from the information theory considering the gray level image histogram as a probability distribution. In this paper, Tsallis entropy is applied as a general entropy formalism for information theory. For the first time image thresholding by nonextensive entropy is proposed regarding the presence of nonadditive information content in some image classes. Some typical results are presented to illustrate the influence of the parameter q in the thresholding.