Abstract

A hybrid image segmentation algorithm is proposed which combines edge- and region-based techniques through the morphological algorithm of watersheds. The algorithm consists of the following steps: a) Edge-preserving statistical noise reduction, b) Gradient Approximation, c) Detection of watersheds on gradient magnitude image, and d) Hierarchical Region Merging (HRM) in order to get semantically meaningful segmentations. The HRM process uses the Region Adjacency Graph (RAG) representation of the image regions. At each step, the most similar pair of regions is determined (minimum cost RAG edge), the regions are merged and the RAG is updated. Traditionally, the above is implemented by storing all the RAG edges in a priority queue (heap). We propose a signi cantly faster algorithm which maintains an additional graph, the Most Similar Neighbor Graph, through which the priority queue size and processing time are drastically reduced. The nal segmentation is an image partition which, through the RAG, provides information that can be used by knowledge-based high level processes, i.e. recognition. In addition, this region based representation provides one-pixel wide, closed, and accurately localized contours/surfaces. Due to the small number of free parameters, the algorithm can be quite eectively used in interactive image processing. Experimental results obtained with 2D MR images are presented.

Citations