𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithm 35 an algorithm for non-smoothing contour representations of two-dimensional arrays

✍ Scribed by Hildegrad Schultheis; R. Schultheis

Book ID
105514074
Publisher
Springer Vienna
Year
1978
Tongue
English
Weight
309 KB
Volume
19
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An efficient algorithm for smoothing, li
An efficient algorithm for smoothing, linearization and detection of structural feature points of binary image contours
✍ Donggang Yu; Hong Yan πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 704 KB

ln this paper, an efficient algorithm is developed for smoothing, linearization and detection of structural feature points of binary image contours. Using this algorithm, we can remove noisy pixels along a contour, decompose the contour into a set of straight lines, and detect structural feature poi