Fast Euclidean Morphological Operators Using Local Distance Transformation
نویسندگان
چکیده
Symmetrical and circular structural elements (SE) play a central role in mathematical morphology in the continuous plane, since they provide an isotropic treatment of the image. On the other hand, for digital images, circular SE are rarely used because there is no simple and efficient implementation of the dilation by such a SE on a discrete lattice. Indeed, a direct application of the definition above leads to a computation cost of complexity o(n.d) for an image of size n×n and a SE of radius d. Such a cost is prohibitive for many pattern recognition applications.
منابع مشابه
Fast and exact signed Euclidean distance transformation with linear complexity
We propose a new signed or unsigned Euclidean distance transformation algorithm, based on the local corrections of the well-known 4SED algorithm of Danielsson. Those corrections are only applied to a small neighborhood of a small subset of pixels from the image, which keeps the cost of the operation low. In contrast with all fast algorithms previously published, our algorithm produces perfect E...
متن کاملFast Euclidean distance transformation in two scans using a 3 × 3 neighborhood
Cuisenaire and Macq [Comp. Vis. Image Understand., 76(2) (1999) 163] proposed a fast Euclidean distance transformation (EDT) by propagation using multiple neighborhoods and bucket sorting. To save the time for bucket sorting and to reduce the complexity of multiple neighborhoods, we propose a new, simple and fast EDT in two scans using a 3 3 neighborhood. By recording the relative xand y-coordi...
متن کاملFast Euclidean Distance Transformation by Propagation Using Multiple Neighborhoods
We propose a new exact Euclidean distance transformation (DT) by propagation, using bucket sorting. A fast but approximate DT is first computed using a coarse neighborhood. A sequence of larger neighborhoods is then used to gradually improve this approximation. Computations are kept short by restricting the use of these large neighborhoods to the tile borders in the Voronoi diagram of the image...
متن کاملAutomatic segmentation and measurement of axons in microscopic images
We propose a method for the automatic segmentation, recognition and measurement of neuronal fibers in microscopic images of nerves. This permits a quantitative analysis of the distribution of the areas of the fibers, while nowadays such morphometrical methods are limited by the practical impossibility to process large amounts of fibers in histological routine. First, the image is thresholded to...
متن کاملVolumetric analysis of digital objects using distance transformation: performance issues and applications
In binary images, the distance transformation (DT) and the geometrical medial axis are classic tools for shape analysis. In the digital geometry literature, recent articles have demonstrated that fast algorithms can be designed without any approximation of the Euclidean metric. The aim of the paper is to first give an overview of separable techniques to compute the distance transformation, the ...
متن کامل