DocumentCode
3219374
Title
Parallel smoothing and decomposition of digital shapes using a multiresolution structure
Author
Borgefors, Gunilla ; Di Baja, Gabriella Sanniti
Author_Institution
Swedish Defence Res. Establ., Linkoping, Sweden
Volume
i
fYear
1990
fDate
16-21 Jun 1990
Firstpage
745
Abstract
A parallel algorithm for smoothing and/or decomposing binary digital shapes is presented. The method uses a multiresolution pyramid, making it particularly suitable for parallel pyramid machines. The binary shape is first converted into a resolution pyramid. The lower resolution levels are used to smooth the shape at higher resolution levels. The smoothed versions, at different resolution levels, are then used to decompose the shape. This means that the shape is decomposed into parts according to the local thickness of the shape. The small and the slice-shaped components of the decomposition are finally merged into the larger components
Keywords
parallel algorithms; pattern recognition; picture processing; binary digital shapes; decomposition; multiresolution pyramid; parallel decomposition algorithm; parallel pyramid machines; parallel smoothing algorithm; smoothing; Noise level; Noise shaping; Parallel algorithms; Parallel architectures; Parallel machines; Pattern recognition; Prototypes; Shape; Smoothing methods; USA Councils;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 1990. Proceedings., 10th International Conference on
Conference_Location
Atlantic City, NJ
Print_ISBN
0-8186-2062-5
Type
conf
DOI
10.1109/ICPR.1990.118208
Filename
118208
Link To Document