An efficient algorithm for attribute openings and closings

Authors

Jérôme Darbon, Ceyhun Burak Akgül

Where

Proceedings of the 13th European Signal Processing Conference (EUSIPCO)

Place

Antalya, Turkey

Type

inproceedings

Projects

Olena

Keywords

Image

Date

2005-04-14

Abstract

In this paper, we present fast algorithms for area opening and closing on grayscale images. Salembier's max-tree based algorithm is one of the well known methods to perform area opening. It makes use of a special representation where each node in the tree stands for a flat region and the tree itself is oriented towards the maxima of the grayscale image. Pruning the tree with respect to some attributee.g., the area, boils down to attribute opening. Following the same approach, we propose an algorithm for area opening (closing) without building the max-tree (min-tree). Our algorithm exhibit considerable performance compared to the state-of-the art in this domain.

Bibtex (lrde.bib)

@InProceedings{	  darbon.05.eusipco,
  author	= {J\'er\^ome Darbon and Ceyhun Burak Akg\"ul},
  title		= {An efficient algorithm for attribute openings and
		  closings},
  booktitle	= {Proceedings of the 13th European Signal Processing
		  Conference (EUSIPCO)},
  year		= 2005,
  address	= {Antalya, Turkey},
  month		= sep,
  abstract	= {In this paper, we present fast algorithms for area opening
		  and closing on grayscale images. Salembier's max-tree based
		  algorithm is one of the well known methods to perform area
		  opening. It makes use of a special representation where
		  each node in the tree stands for a flat region and the tree
		  itself is oriented towards the maxima of the grayscale
		  image. Pruning the tree with respect to some attribute,
		  e.g., the area, boils down to attribute opening. Following
		  the same approach, we propose an algorithm for area opening
		  (closing) without building the max-tree (min-tree). Our
		  algorithm exhibit considerable performance compared to the
		  state-of-the art in this domain.}
}