Difference between revisions of "Publications/darbon.05.eusipco"
From LRDE
(Created page with "{{Publication | date = 2005-04-14 | authors = Jérôme Darbon, Ceyhun Burak Akgül | title = An efficient algorithm for attribute openings and closings | booktitle = Proceedin...") |
|||
| (4 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{Publication |
{{Publication |
||
| + | | published = true |
||
| date = 2005-04-14 |
| date = 2005-04-14 |
||
| authors = Jérôme Darbon, Ceyhun Burak Akgül |
| authors = Jérôme Darbon, Ceyhun Burak Akgül |
||
| Line 5: | Line 6: | ||
| booktitle = Proceedings of the 13th European Signal Processing Conference (EUSIPCO) |
| booktitle = Proceedings of the 13th European Signal Processing Conference (EUSIPCO) |
||
| address = Antalya, Turkey |
| address = Antalya, Turkey |
||
| − | | |
+ | | lrdeprojects = Olena |
| − | | urllrde = 200509-Eusipco |
||
| 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. |
| 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. |
||
| lrdekeywords = Image |
| lrdekeywords = Image |
||
| Line 22: | Line 22: | ||
address = <nowiki>{</nowiki>Antalya, Turkey<nowiki>}</nowiki>, |
address = <nowiki>{</nowiki>Antalya, Turkey<nowiki>}</nowiki>, |
||
month = sep, |
month = sep, |
||
| − | project = <nowiki>{</nowiki>Image<nowiki>}</nowiki>, |
||
abstract = <nowiki>{</nowiki>In this paper, we present fast algorithms for area opening |
abstract = <nowiki>{</nowiki>In this paper, we present fast algorithms for area opening |
||
and closing on grayscale images. Salembier's max-tree based |
and closing on grayscale images. Salembier's max-tree based |
||
Latest revision as of 15:07, 22 February 2017
- 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.}
}