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

Fast median filtering algorithms for mesh computers

โœ Scribed by Steven L. Tanimoto


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
648 KB
Volume
28
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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 algorithms for designing variable F
โœ Aurobinda Routray; Smarak Swain ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 440 KB

## Abstract The paper presents fast algorithms for designing finite impulse response (FIR) notch filters. The aim is to design a digital FIR notch filter so that the magnitude of the filter has a deep notch at a specified frequency, and as the notch frequency changes, the filter coefficients should

Fast Spectral Projection Algorithms for
โœ Gregory Beylkin; Nicholas Coult; Martin J Mohlenkamp ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 196 KB

We present a fast algorithm for the construction of a spectral projector. This algorithm allows us to compute the density matrix, as used in, e.g., the Kohn-Sham iteration, and so obtain the electron density. We compute the spectral projector by constructing the matrix sign function through a simple