Hierarchical multiple Markov chain model for unsupervised texture segmentation

  • Authors:
  • Giuseppe Scarpa;Raffaele Gaetano;Michal Haindl;Josiane Zerubia

  • Affiliations:
  • DIBET, University;DIBET, University;PR Department, ÚTIA, Czech Academy of Sciences, Prague 8, Czech Republic;INRIA-I3S, Sophia Antipolis Cedex, France

  • Venue:
  • IEEE Transactions on Image Processing
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, we present a novel multiscale texture model and a related algorithm for the unsupervised segmentation of color images. Elementary textures are characterized by their spatial interactions with neighboring regions along selected directions. Such interactions are modeled, in turn, by means of a set of Markov chains, one for each direction, whose parameters are collected in a feature vector that synthetically describes the texture. Based on the feature vectors, the texture are then recursively merged, giving rise to larger and more complex textures, which appear at different scales of observation: accordingly, the model is named Hierarchical Multiple Markov Chain (H-MMC). The Texture Fragmentation and Reconstruction (TFR) algorithm, addresses the unsupervised segmentation problem based on the H-MMC model. The "fragmentation" step allows one to find the elementary textures of the model, while the "reconstruction" step defines the hierarchical image segmentation based on a probabilistic measure (texture score) which takes into account both region scale and inter-region interactions. The performance of the proposed method was assessed through the Prague segmentation benchmark, based on mosaics of real natural textures, and also tested on real-world natural and remote sensing images.