Ceyhun Burak Akgül

An efficient algorithm for connected attribute thinnings and thickenings

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

2006-08-09

In Proceedings of the second international conference on visual computing

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.

Continue reading

An efficient algorithm for attribute openings and closings

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

2005-04-14

In Proceedings of the 13th european signal processing conference (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 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.

Continue reading