✦ LIBER ✦

Fast algorithm for identifying clusters in digitized images

✍ Scribed by S.E. Sobottka; R.J. Chandross; G.G. Cornick; B.D. Justice; R.S. Stewart; J.A. Thomas

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 347 KB
Volume: 51
Category: Article
ISSN: 0010-4655
DOI: 10.1016/0010-4655(88)90142-7

No coin nor oath required. For personal study only.

✦ Synopsis

A fast algorithm for identifying clusters of intense pixels in digitized two-dimensional images is described. Measurements show a decrease by several orders of magnitude over times required by an algorithm by Stoddard.

📜 SIMILAR VOLUMES

Fast clustering algorithms for vector qu

Fast clustering algorithms for vector quantization

✍ J.S. Pan; F.R. McInnes; M.A. Jack 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 595 KB

Fast pyramidal algorithms for image thre

Fast pyramidal algorithms for image thresholding

✍ L. Cinque; S. Levialdi; A. Rosenfeld 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 437 KB

A fast algorithm for convex hull extract

A fast algorithm for convex hull extraction in 2D images

✍ Qin-Zhong Ye 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 506 KB

Fast algorithm for generating CPK images

Fast algorithm for generating CPK images on graphics workstations

✍ Chris Schafmeister 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 562 KB

A fast, simple active contour algorithm

A fast, simple active contour algorithm for biomedical images

✍ H. Eviatar; R.L. Somorjai 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 288 KB

Fast Algorithm for Local Statistics Calc

Fast Algorithm for Local Statistics Calculation for N -Dimensional Images

✍ Changming Sun 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 383 KB

L ocal mean and variance measures are frequently required in multi-dimensional image analysis. These measures are needed when calculating correlation coefficients for local image matching purposes. Other measures such as skewness and autocorrelation are useful for texture analysis. This paper presen