Share Email Print

Journal of Electronic Imaging

Efficient nonlinear transform methods for image processing
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A filter structure formed as a linear combination of stack filters (L-stack-filters), is studied. This type of filters include many useful filter classes, e.g., linear FIR filters and nonlinear threshold Boolean filters, and L-filters. An efficient algorithm for finding optimal filter coefficients under the mean squared error (MSE) criterion is derived. A subclass of the above filters, called FFT-ordered L-filters (FFT-LF), is studied in detail. In this case the bank of filters is formed according to a generalized structure of the FFT flowchart. It is shown that FFT-LFs effectively remove mixed Gaussian and impulsive noise. While possessing good characteristics of performance, FFT-LFs are simple in implementation. In the sense of implementation the most complicated FFT-LFs are the well-known L-filters. We suggest an efficient parallel architecture implementing FFT-LFs as well as a family of discrete orthogonal transforms including discrete Fourier and Walsh transforms. Both linear and nonlinear L-filter-type filters are implemented effectively on the architecture. Comparison with known architectures implementing both linear and nonlinear filters reveals advantages of the proposed architecture. An efficient implementation of L-stack-filters is also proposed.

Paper Details

Date Published: 1 July 1996
PDF: 12 pages
J. Electron. Imag. 5(3) doi: 10.1117/12.242907
Published in: Journal of Electronic Imaging Volume 5, Issue 3
Show Author Affiliations
Samvel M. Atourian, Tampere Univ. of Technology (Finland)
David Zaven Gevorkian, Tampere Univ. of Technology (Finland)
Karen O. Egiazarian, Tampere Univ. of Technology (Finland)
Jaakko T. Astola, Tampere Univ. of Technology (Finland)

© SPIE. Terms of Use
Back to Top