𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sequential piecewise-linear segmentation of binary contours

✍ Scribed by M Dhome; G Rives; M Richetin

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
382 KB
Volume
2
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Piecewise-linear approximation of discon
Piecewise-linear approximation of discontinuous contour images based on clustering procedure
✍ Takashi Watanabe; Kazuya Suzuki; Ryuhzou Yokoyama; Sumio Tanba πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 741 KB

## Abstract This paper discusses the problem of the piecewise‐linear approximation of contour images. Almost all the piecewise‐linear approximation methods that have been proposed can be applied only for continuous contours. Methods that can work well for discontinuous contours, for instance, have

On the number of segments needed in a pi
On the number of segments needed in a piecewise linear approximation
✍ C.L. Frenzen; Tsutomu Sasao; Jon T. Butler πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 526 KB

The introduction of high-speed circuits to realize an arithmetic function f as a piecewise linear approximation has created a need to understand how the number of segments depends on the interval a ≀ x ≀ b and the desired approximation error Ξ΅. For the case of optimum non-uniform segments, we show t

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