The many benefits of putting stack filters into disjunctive or conjunctive normal form

Authors:
Marcel Wild
Affiliations:
Department of Mathematics, University of Stellenbosch, Matieland 7602, South Africa
Venue:
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Year:
2005

Citing 5
Cited 1

Binary Polynomial and Nonlinear Digital Filters

Binary Polynomial and Nonlinear Digital Filters
New Results on Monotone Dualization and Generating Hypergraph Transversals

SIAM Journal on Computing
From max-plus algebra to nonexpansive mappings: a nonlinear theory for discrete event systems

Theoretical Computer Science
Idempotent and co-idempotent stack filters and min-max operators

Theoretical Computer Science
Image Analysis and Mathematical Morphology

Image Analysis and Mathematical Morphology

Computing the Output Distribution and Selection Probabilities of a Stack Filter from the DNF of Its Positive Boolean Function

Journal of Mathematical Imaging and Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

Stack filters are nonlinear filters used for image processing (examples: median filters, order statistics). In the translation-invariant case a stack filter is determined by a positive Boolean function b. Many important properties of stack filters (idempotency, co-idempotency, order relations) can be tested in polynomial time if the DNF and/or CNF of b are known.