1 May 1994 Decompositional algorithm for running stack filtering
Author Affiliations +
A new fast running filtering algorithm of decompositional type for realizing stack filters that are based on a subclass of positive Boolean functions, namely cyclic positive Boolean functions, is proposed. Peculiar to the presented algorithm is the use of Fibonacci p-codes, which make it possible to have a unified approach to running filtering, containing as special cases the complete threshold decomposition (when p is greater than the maximal value of input data) and the binary-tree threshold decomposition (when p equals 0). The choice of optimal value of p depends on the statistics of input data and reduces the complexity of running stack filtering.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Karen O. Egiazarian, Sos S. Agaian, David Zaven Gevorkian, Jaakko T. Astola, "Decompositional algorithm for running stack filtering", Proc. SPIE 2180, Nonlinear Image Processing V, (1 May 1994); doi: 10.1117/12.172575; https://doi.org/10.1117/12.172575


Back to Top