DocumentCode
2607070
Title
A fast algorithm for checking the relationship between stack filters and weighted median filters
Author
Yu, Pao-Ta ; Liao, Wei-Hsiang
Author_Institution
Inst. of Comput. Sci. & Inf. Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan
fYear
1993
fDate
3-6 May 1993
Firstpage
954
Abstract
A stack filter (SF) corresponds to a weighted median filter (WMF) if and only if the positive Boolean function (PBF) on which the stack filter is based is self-dual and linearly separable. A fast algorithm is proposed to check whether PBF correspond to WMF or not. If a given PBF is not self-dual or not regular, then this algorithm can check it rapidly
Keywords
Boolean functions; filtering theory; median filters; fast algorithm; linearly separable function; nonlinear filters; positive Boolean function; relationship checking algorithm; self-dual function; stack filters; weighted median filters; Algorithm design and analysis; Boolean functions; Computer science; Information filtering; Information filters; Logic functions; Sorting; Stacking; Statistics; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1993., ISCAS '93, 1993 IEEE International Symposium on
Conference_Location
Chicago, IL
Print_ISBN
0-7803-1281-3
Type
conf
DOI
10.1109/ISCAS.1993.393881
Filename
393881
Link To Document