Difference between revisions of "Publications/lesage.06.isvc"
From LRDE
(Created page with "{{Publication | date = 2006-11-01 | authors = David Lesage, Jérôme Darbon, Ceyhun Burak Akgül | title = An Efficient Algorithm for Connected Attribute Thinnings and Thicken...") |
|||
Line 12: | Line 12: | ||
| urllrde = 200611-ISVC |
| urllrde = 200611-ISVC |
||
| abstract = Connected attribute filters are anti-extensive morphological operators widely used for their ability of simplifying the image without moving its contours. In this paper, we present a fast, versatile and easy-to-implement algorithm for grayscale connected attribute thinnings and thickennings, a subclass of connected filters for the wide range of non-increasing attributes. We show that our algorithm consumes less memory and is computationally more efficient than other available methods on natural images. |
| abstract = Connected attribute filters are anti-extensive morphological operators widely used for their ability of simplifying the image without moving its contours. In this paper, we present a fast, versatile and easy-to-implement algorithm for grayscale connected attribute thinnings and thickennings, a subclass of connected filters for the wide range of non-increasing attributes. We show that our algorithm consumes less memory and is computationally more efficient than other available methods on natural images. |
||
+ | | lrdekeywords = Image |
||
| type = inproceedings |
| type = inproceedings |
||
| id = lesage.06.isvc |
| id = lesage.06.isvc |
||
Line 37: | Line 38: | ||
range of non-increasing attributes. We show that our |
range of non-increasing attributes. We show that our |
||
algorithm consumes less memory and is computationally more |
algorithm consumes less memory and is computationally more |
||
− | efficient than other available methods on natural images.<nowiki>}</nowiki> |
+ | efficient than other available methods on natural images.<nowiki>}</nowiki>, |
+ | lrdekeywords = <nowiki>{</nowiki>Image<nowiki>}</nowiki> |
||
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Revision as of 18:08, 4 November 2013
- Authors
- David Lesage, Jérôme Darbon, Ceyhun Burak Akgül
- Where
- Proceedings of the second International Conference on Visual Computing
- Place
- Lake Tahoe, Nevada, USA
- Type
- inproceedings
- Publisher
- Springer-Verlag
- Keywords
- Image
- Date
- 2006-11-01
Abstract
Connected attribute filters are anti-extensive morphological operators widely used for their ability of simplifying the image without moving its contours. In this paper, we present a fast, versatile and easy-to-implement algorithm for grayscale connected attribute thinnings and thickennings, a subclass of connected filters for the wide range of non-increasing attributes. We show that our algorithm consumes less memory and is computationally more efficient than other available methods on natural images.
Bibtex (lrde.bib)
@InProceedings{ lesage.06.isvc, author = {David Lesage and J\'er\^ome Darbon and Ceyhun Burak Akg\"ul}, title = {An Efficient Algorithm for Connected Attribute Thinnings and Thickenings}, booktitle = {Proceedings of the second International Conference on Visual Computing}, year = 2006, address = {Lake Tahoe, Nevada, USA}, month = nov, project = {Image}, pages = {393--404}, volume = 4292, series = {Lecture Notes in Computer Science Series}, publisher = {Springer-Verlag}, abstract = {Connected attribute filters are anti-extensive morphological operators widely used for their ability of simplifying the image without moving its contours. In this paper, we present a fast, versatile and easy-to-implement algorithm for grayscale connected attribute thinnings and thickennings, a subclass of connected filters for the wide range of non-increasing attributes. We show that our algorithm consumes less memory and is computationally more efficient than other available methods on natural images.}, lrdekeywords = {Image} }