Share Email Print

Proceedings Paper

Minimax optimization over the class of stack filters
Author(s): Moncef Gabbouj; Edward J. Coyle
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A new optimization theory for stack filters is presented in this paper. This new theory is based on the minimax error criterion rather than the mean absolute error (MAE) criterion used in [8]. In the binary case, a methodology will be designed to find the stack filter that minimizes the maximum absolute error between the input and the output signals. The most interesting feature of this optimization procedure is the fact that it can be solved using a linear program (LP), just like in the MAE case [8]. One drawback of this procedure is the problem of randomization due to the lost of structure in the constraint matrix of the LP. Several sub-optimal solutions will be discussed and an algorithm to find an optimal integer solution (still using a LP) under certain conditions will be provided. When generalizing to multiple-level inputs, complexity problems will arise and two alternatives will be suggested. One of these approaches assumes a parameterized stochastic model for the noise process and the LP is to pick the stack filter which minimizes the worst effect of the noise on the input signal.

Paper Details

Date Published: 1 September 1990
PDF: 12 pages
Proc. SPIE 1360, Visual Communications and Image Processing '90: Fifth in a Series, (1 September 1990); doi: 10.1117/12.24197
Show Author Affiliations
Moncef Gabbouj, Purdue Univ. (United States)
Edward J. Coyle, Purdue Univ. (United States)

Published in SPIE Proceedings Vol. 1360:
Visual Communications and Image Processing '90: Fifth in a Series
Murat Kunt, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?