DOE OSTI · 956436
Learning algorithms for stack filter classifiers
Abstract
Stack Filters define a large class of increasing filter that is used widely in image and signal processing. The motivations for using an increasing filter instead of an unconstrained filter have been described as: (1) fast and efficient implementation, (2) the relationship to mathematical morphology and (3) more precise estimation with finite sample data. This last motivation is related to methods developed in machine learning and the relationship was explored in an earlier paper. In this paper we investigate this relationship by applying Stack Filters directly to classification problems. This provides a new perspective on how monotonicity constraints can help control estimation and approximation errors, and also suggests several new learning algorithms for Boolean function classifiers when they are applied to real-valued inputs.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Porter, Reid B, Hush, Don, Zimmer, Beate G. 2009-01-01. Learning algorithms for stack filter classifiers. https://www.osti.gov/biblio/956436
Cite the original work for its findings. Save a collection to share your selection of sources.