A thinning transform for digital images

Bel-Lan, A.; Montoto, L.

doi:10.1016/0165-1684(81)90063-3

Cited by 17 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From the hardware implementation perspective it leads to a complex overlapping mesh of local interconnections, internal logic complexity and correspondingly area increase. The second group of algorithms is based on division of every iteration step into four or two sub-iterations [35][36][37][38][39], deleting only one contour point (in the North, West, South or East direction) per sub-iteration. Considering the asynchronous realisation, such an approach becomes difficult to implement due to requirements of complex inter-pixel synchronisation mechanism (e.g.…”

Section: Approaches To Binary Skeletonizationmentioning

confidence: 99%

Hardware Implementation of Skeletonization Algorithm for Parallel Asynchronous Image Processing

Lopich

Dudek

2008

J Sign Process Syst Sign Image Video Technol

View full text Add to dashboard Cite

This paper presents an FPGA realisation of an application-specific cellular processor array designed for asynchronous skeletonization of binary images. The skeletonization algorithm is based on iterative thinning utilizing a 'grassfire' transformation approach. The purpose of this work was to test the performance of a fully parallel asynchronous processor array and to evaluate the inhomogeneity of wave propagation velocity. A proof-of-concept design has been implemented and evaluated, the results are presented and discussed.

show abstract

Section: Approaches To Binary Skeletonizationmentioning

confidence: 99%

Hardware Implementation of Skeletonization Algorithm for Parallel Asynchronous Image Processing

Lopich

Dudek

2008

J Sign Process Syst Sign Image Video Technol

View full text Add to dashboard Cite

show abstract

“…At the end of each subiteration, the remaining image is updated for the next subiteration. Four subcycles have been used in which each type of contour point (north, east, south, and west) is removed in each subcycle [115], [loll, [17]. These have also been combined into two subiterations [115], [136], [21], [118], [49] with one subiteration deleting the north and east contour points and the other deleting the rest, for example.…”

Section: Parallel Thinning Algorithmsmentioning

confidence: 99%

Thinning methodologies-a comprehensive survey

Lam

Lee

Suen

1992

IEEE Trans. Pattern Anal. Machine Intell.

1,521

722

View full text Add to dashboard Cite

This article is a comprehensive survey of thinning methodologies. It discusses the wide range of thinning algorithms, including iterative deletion of pixels and nonpixel-based methods, whereas skeletonization algorithms based on medial axis and other distance transforms will be the subject matter of a subsequent study. This self-contained paper begins with an overview of the iterative thinning process and the pixel-deletion criteria needed to preserve the connectivity of the image pattern. Thinning algorithms are then considered in terms of these criteria as well as their modes of operation. This is followed by a discussion of nonpixel-based methods that usually produce a center line of the pattern directly in one pass without examining all the individual pixels. Algorithms are considered in greater detail and scope here than in other surveys, and the relationships among them are also explored.

show abstract

A Simple and Efficient Thinning Method

Wang¹

1995

Intelligent Systems Third Golden West International Conference

View full text Add to dashboard Cite

A thinning transform for digital images

Cited by 17 publications

References 7 publications

Hardware Implementation of Skeletonization Algorithm for Parallel Asynchronous Image Processing

Hardware Implementation of Skeletonization Algorithm for Parallel Asynchronous Image Processing

Thinning methodologies-a comprehensive survey

A Simple and Efficient Thinning Method

Contact Info

Product

Resources

About