DocumentCode :
1220418
Title :
A new parallel binary image shrinking algorithm
Author :
Hongchi Shi ; Ritter, Gerhard X.
Author_Institution :
Center for Comput. Vision Res., Florida Univ., Gainesville, FL
Volume :
4
Issue :
2
fYear :
1995
fDate :
2/1/1995 12:00:00 AM
Firstpage :
224
Lastpage :
226
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 n×n 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
Keywords :
data compression; image coding; parallel algorithms; 8-connectivity; binary image; image labeling algorithms; labeling process; local memory; multiplicative constant; parallel binary image shrinking algorithm; storage requirements; Application specific processors; Computer vision; Image storage; Labeling; Military computing; Parallel algorithms; Pixel; Visualization;
fLanguage :
English
Journal_Title :
Image Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1057-7149
Type :
jour
DOI :
10.1109/83.342194
Filename :
342194
Link To Document :
بازگشت