Publication

Fast Euclidean morphological operators using local distance transformation by propagation

Olivier Cuisenaire
1999
Conference Papers

Abstract

We propose a new method to compute the morphological dilation of a binary image with a circular structuring element of any given size, on a discrete lattice. The algorithm is equivalent to applying a threshold on an exact Euclidean distance map, but computations are restricted to a minimum number of pixels. The complexity of this dilation algorithm is compared to the complexity of the commonly used approximation of circular structuring elements and found to have a similar cost, while providing better results.

Official source

https://infoscience.epfl.ch/entities/publication/c2844cae-aa35-463b-a2df-707db228af61

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Olivier Cuisenaire
1999
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/c2844cae-aa35-463b-a2df-707db228af61

About this result

Related concepts (31)

Mathematical morphology

Mathematical morphology (MM) is a theory and technique for the analysis and processing of geometrical structures, based on set theory, lattice theory, topology, and random functions. MM is most commonly applied to s, but it can be employed as well on graphs, surface meshes, solids, and many other spatial structures. Topological and geometrical continuous-space concepts such as size, shape, convexity, connectivity, and geodesic distance, were introduced by MM on both continuous and discrete spaces.

Dilation (morphology)

Dilation (usually represented by ⊕) is one of the basic operations in mathematical morphology. Originally developed for , it has been expanded first to grayscale images, and then to complete lattices. The dilation operation usually uses a structuring element for probing and expanding the shapes contained in the input image. In binary morphology, dilation is a shift-invariant (translation invariant) operator, equivalent to Minkowski addition. A binary image is viewed in mathematical morphology as a subset of a Euclidean space Rd or the integer grid Zd, for some dimension d.

Opening (morphology)

In mathematical morphology, opening is the dilation of the erosion of a set A by a structuring element B: where and denote erosion and dilation, respectively. Together with closing, the opening serves in computer vision and as a basic workhorse of morphological noise removal. Opening removes small objects from the foreground (usually taken as the bright pixels) of an image, placing them in the background, while closing removes small holes in the foreground, changing small islands of background into foreground.

Related publications (2)

Fast Euclidean morphological operators using local distance transformation by propagation

Chat with Graph Search

Impact of Simple Parameters on Fibre Diameter in Melt Electrowriting (MEW)

Segmentation and Grid Generation for Numerical Simulations of VAD Connections with Patientspecific Data