DocumentCode :
698396
Title :
An efficient algorithm for attribute openings and closings
Author :
Darbon, Jerome ; Akgul, Ceyhun Burak
Author_Institution :
EPITA R&D Lab. (LRDE), Le Kremlin-Bicetre, France
fYear :
2005
fDate :
4-8 Sept. 2005
Firstpage :
1
Lastpage :
4
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.
Keywords :
image representation; trees (mathematics); Salembier max-tree based algorithm; area closing; area opening; grayscale image; image representation; Arrays; Gray-scale; Heuristic algorithms; Image segmentation; Morphology; Signal processing algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing Conference, 2005 13th European
Conference_Location :
Antalya
Print_ISBN :
978-160-4238-21-1
Type :
conf
Filename :
7077981
Link To Document :
بازگشت