A new parallel binary image shrinking algorithm
Related Experiment Video
Updated: Jul 7, 2026

Quantifying Intermembrane Distances with Serial Image Dilations
Published on: September 28, 2018
1Center for Comput. Vision Res., Florida Univ., Gainesville, FL.
Abstract:
A new parallel binary image shrinking algorithm that can be considered as an improvement of Levialdi's (1972) parallel shrinking algorithm and can be used in many image labeling algorithms as a basic operation in order to reduce the storage requirements for local memory and speed up the labeling process is presented. This new parallel shrinking algorithm shrinks an nxn binary image to an image with no black pixels in O(n) parallel steps with a multiplicative constant of 1.5, preserving the 8-connectivity in the shrinking process.
Related Concept Videos
Parallel-axis Theorem
Parallel-Axis Theorem for an Area
For a flywheel approximated as a solid disc, consider an infinitesimal differential element with an arbitrary distance...
Downsampling
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
Parallel Processing
Upsampling
Reducing Line Loss
With a step-up transformer at the source, the voltage is increased, thereby reducing the current in the transmission lines since power loss in...

