Skip to main content
Article thumbnail
Location of Repository

An efficient algorithm for attribute openings and closings

By Jérôme Darbon and Ceyhun Burak Akgül

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 exhibits considerable performance compared to the state-of-the art in this domain. 1

Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.133.9449
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://jerome.berbiqui.org/pap... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.