๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An Isodata algorithm for straight line fitting

โœ Scribed by Tsai-Yun Phillips; Azriel Rosenfeld


Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
575 KB
Volume
7
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An algorithm for straight-line represent
โœ Lin Woo ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 841 KB

An algorithm is developed for drawing straight-line planar graphs which are isomorphic to a convex polyhedron and simple (i.e. a connected graph with no self-loops or multiple branches). The construction of such graphs is outlined in three stages. Stage 1 determines all the independent cycles of the

An adaptive algorithm for fitting with s
โœ T. M. Tao; A. T. Watson ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› American Institute of Chemical Engineers ๐ŸŒ English โš– 411 KB ๐Ÿ‘ 1 views
Parallel algorithms for generating the r
โœ William E. Wright ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 366 KB

This paper presents two parallel algorithms for generating graphics primitives on a raster scan display device. The first algorithm is for drawing straight lines and the second is for drawing circles. The line algorithm requires three integer multiplies and one or two integer divides in its setup an

A fuzzy median-of-intercept straight-lin
โœ H. B. Mitchell ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 106 KB

Recently, a crisp robust median-of-intercept (MI) straight-line fitting algorithm was devised for use in image-processing applications. The algorithm is specifically designed for use in noisy images when the input data is corrupted with both noise and outliers. In this article we describe a fuzzy MI

An Optimal Algorithm for the Straight Se
โœ Y.M. Sharaiha; N. Christofides ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science โš– 842 KB

In this paper, we define the straight segment approximation problem (SSAP) for a given digital arc as that of locating a minimum subset of vertices on the arc such that they form a connected sequence of digital straight segments. Sharaiha (Ph.D. thesis, Imperial College, London, 1991) introduced the