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

Fast algorithms for estimating local image properties

โœ Scribed by Peter J. Burt


Publisher
Elsevier Science
Year
1982
Weight
83 KB
Volume
19
Category
Article
ISSN
0146-664X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Fast Algorithm for Local Statistics Calc
โœ 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

Fast GLS algorithm for parameter estimat
โœ M.S. Ahmed ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 491 KB

Akstraet--A computationally efficient off-line algorithm for estimating the parameters of a linear discrete-time SISO system is presented. The algorithm is based on the generalized leastsquares (GLS) principle. It is essentially a correlation version of the GLS method that (1) eliminates all the red

A fast algorithm for vertex estimation
โœ E. Calligarich; R. Dolfini; M. Genoni; A. Rotondi ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 516 KB
A Fast Algorithm for Image Component Lab
โœ H.C. Shi; G.X. Ritter ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 562 KB

A new parallel algorithm for image component labeling with local operators on SIMD mesh connected computers is presented. This algorithm provides a positive answer to the open question of whether there exists an \(O(n)\)-time and \(O(\log n)\)-space local labeling algorithm on SIMD mesh connected co

Fast algorithm for identifying clusters
โœ S.E. Sobottka; R.J. Chandross; G.G. Cornick; B.D. Justice; R.S. Stewart; J.A. Th ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 347 KB

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.