An Efficient Algorithm for Fractal Analysis of Textures

  • Authors:
  • Alceu Ferraz Costa;Gabriel Humpire-Mamani;Agma Juci Machado Traina

  • Affiliations:
  • -;-;-

  • Venue:
  • SIBGRAPI '12 Proceedings of the 2012 25th SIBGRAPI Conference on Graphics, Patterns and Images
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we propose a new and efficient texture feature extraction method: the Segmentation-based Fractal Texture Analysis, or SFTA. The extraction algorithm consists in decomposing the input image into a set of binary images from which the fractal dimensions of the resulting regions are computed in order to describe segmented texture patterns. The decomposition of the input image is achieved by the Two-Threshold Binary Decomposition (TTBD) algorithm, which we also propose in this work. We evaluated SFTA for the tasks of content-based image retrieval (CBIR) and image classification, comparing its performance to that of other widely employed feature extraction methods such as Haralick and Gabor filter banks. SFTA achieved higher precision and accuracy for CBIR and image classification. Additionally, SFTA was at least 3.7 times faster than Gabor and 1.6 times faster than Haralick with respect to feature extraction time.