Book Chapter10.1007/11612704_34
Fast binary dilation/erosion algorithm using kernel subdivision
Ajay Narayanan
- 13 Jan 2006
- pp 335-342
17
TL;DR: A new algorithm for binary morphological dilation and erosion called the Kernel Sub-Division algorithm, which decomposes the n-dimensional structuring element, into several subsets and operates on the object contours in the image.
read more
Abstract: Numerous algorithms have been proposed in the literature to speed up dilation/erosion operations. The motivation has been to reduce computational complexity by exploiting the structuring element and the image object properties. This paper presents a new algorithm for binary morphological dilation and erosion called the Kernel Sub-Division algorithm and discusses its implementation in the two dimensional case. It decomposes the n-dimensional structuring element, into several subsets and operates on the object contours in the image. The image characteristics are exploited by subdividing the object contours into bins while performing contour processing. The elegance of the algorithm lies in its retaining the correspondence to the output of the classical implementation with massive speed gain. The results of the algorithm on a statistically significant test set of images, showed that it performed five times better than the classical implementation for a 3x3 kernel. It also demonstrated a marginal rise in execution time with increasing size of the kernel.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Mapping global urban boundaries from the global artificial impervious area (GAIA) data
Delineating multi-scenario urban growth boundaries with a CA-based FLUS model and morphological method.
TL;DR: This paper argues that the delineation needs to integrate the top-down approach with CA for projecting complex land use changes under designed scenarios, and proposes a CA-based method called the future land use simulation (FLUS) that can support urban planning by generating feasible patterns for UGBs under different planning scenarios.
403
High-throughput, label-free, single-cell, microalgal lipid screening by machine-learning-equipped optofluidic time-stretch quantitative phase microscopy.
Baoshan Guo,Cheng Lei,Cheng Lei,Hirofumi Kobayashi,Takuro Ito,Yaxiaer Yalikun,Yiyue Jiang,Yo Tanaka,Yasuyuki Ozeki,Keisuke Goda,Keisuke Goda +10 more
TL;DR: High‐throughput label‐free single‐cell screening of lipid‐producing microalgal cells with optofluidic time‐stretch quantitative phase microscopy holds promise as an effective analytical tool for microalgae‐based biofuel production.
76
A Novel Method for Multi-Targets ISAR Imaging Based on Particle Swarm Optimization and Modified CLEAN Technique
TL;DR: A novel multi-targets ISAR imaging method based on particle swarm optimization (PSO) and modified CLEAN technique that can be segmented and extracted based on clustering number estimation and K-means clustering algorithm and results verify the validity of the proposed method.
35
High-Throughput Accurate Single-Cell Screening of Euglena gracilis with Fluorescence-Assisted Optofluidic Time-Stretch Microscopy.
TL;DR: A fluorescence-assisted optofluidic time-stretch microscope that can detect fluorescence from every E. gracilis cell in a population and simultaneously obtain its image with a high throughput of 10,000 cells/s holds promise for evaluating cultivation techniques and selective breeding for microalgae-based biofuel production.
References
Recursive implementation of erosions and dilations along discrete lines at arbitrary angles
TL;DR: The algorithm is generalized to erosions and dilations along discrete lines at arbitrary angles and the padding problem is addressed; so that the operation can be performed in place without copying the pixels to and from an intermediate buffer.
154
Fast erosion and dilation by contour processing and thresholding of distance maps
TL;DR: The proposed algorithm performs ordered propagation using Euclidean distance transformation without generating any distance map, which allows optimization of both the time and memory demand.
67
Fast Euclidean morphological operators using local distance transformation by propagation, and applications
O. Cuisenaire,Benoît Macq +1 more
- 01 Jan 1999
TL;DR: In this paper, the authors proposed 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.
Recursive binary dilation and erosion using digital line structuring elements in arbitrary orientations
TL;DR: Two-pass algorithms that run at constant time for obtaining binary dilations and erosions with all possible length line structuring elements, simultaneously are presented.
27
A system for fast erosion and dilation of bi-level images
TL;DR: A recent method called global erosion is much faster whether used on small, in-memory images or large images residing on a file as discussed by the authors, which should allow processing of larger images, or a greater number of small images, than do the standard methods.