-
1
-
-
0025601386
-
Nonrecursive and recursive stack filters and their filtering behavior
-
Dec.
-
P. D. Wendt, “Nonrecursive and recursive stack filters and their filtering behavior,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 38, no. 12, Dec. 1990.
-
(1990)
IEEE Trans. Acoust., Speech, Signal Processing
, vol.38
, Issue.12
-
-
Wendt, P.D.1
-
2
-
-
84939706148
-
Stack filters
-
Aug.
-
P. D. Wendt, E. J. Coyle, and N. C. Gallagher, “Stack filters,” IEEE Trans. Acoust, Speech, Signal Processing, vol. ASSP-34, Aug. 1986.
-
(1986)
IEEE Trans. Acoust, Speech, Signal Processing
, vol.ASSP-34
-
-
Wendt, P.D.1
Coyle, E.J.2
Gallagher, N.C.3
-
3
-
-
0003351476
-
Lattice-theoretic properties of frontal switching functions
-
Apr.
-
E. N. Gilbert, “Lattice-theoretic properties of frontal switching functions,” Math. Phys., vol. 33, Apr. 1954.
-
(1954)
Math. Phys.
, vol.33
-
-
Gilbert, E.N.1
-
4
-
-
0022160683
-
Decreasing energy functions as a tool for studying threshold networks
-
E. Goles, F. Fogelman-Soulie, and D. Pellegrin, “Decreasing energy functions as a tool for studying threshold networks,” Discrete Applied Math., vol. 12, 1985.
-
(1985)
Discrete Applied Math.
, vol.12
-
-
Goles, E.1
Fogelman-Soulie, F.2
Pellegrin, D.3
-
5
-
-
0042907617
-
Comportement periodique des functions a seuil binares et applications
-
E. Goles and J. Olivos, “Comportement periodique des functions a seuil binares et applications,” Discrete Applied Math., vol. 3, 1981.
-
(1981)
Discrete Applied Math.
, vol.3
-
-
Goles, E.1
Olivos, J.2
-
6
-
-
0021469360
-
Iterative behavior of one-dimensional threshold automata
-
E. Goles and M. Tchuente, “Iterative behavior of one-dimensional threshold automata,” Discrete Applied Math., vol. 8, 1984.
-
(1984)
Discrete Applied Math.
, vol.8
-
-
Goles, E.1
Tchuente, M.2
-
7
-
-
0026103778
-
Analysis of the properties of median and weighted median filters using threshold logic and stack filter representation
-
Feb.
-
O. Yli-Harja, J. Astola, and Y. Neuvo, “Analysis of the properties of median and weighted median filters using threshold logic and stack filter representation,” IEEE Trans. Signal Processing, vol. 39, no. 2, Feb. 1991.
-
(1991)
IEEE Trans. Signal Processing
, vol.39
, Issue.2
-
-
Yli-Harja, O.1
Astola, J.2
Neuvo, Y.3
-
8
-
-
0027561348
-
A new class of nonlinear filters—Neural filters
-
Mar.
-
L. Yin, J. Astola, and Y. Neuvo, “A new class of nonlinear filters—Neural filters,” IEEE Trans. Signal Processing, vol. 41, no. 3, Mar. 1993.
-
(1993)
IEEE Trans. Signal Processing
, vol.41
, Issue.3
-
-
Yin, L.1
Astola, J.2
Neuvo, Y.3
-
9
-
-
84975590944
-
Optimization of the weighted median filter by learning
-
Feb.
-
A. Asano, K. Itoh, and Y. Ichioka, “Optimization of the weighted median filter by learning,” Opt. Lett., vol. 16, no. 3, Feb. 1991.
-
(1991)
Opt. Lett.
, vol.16
, Issue.3
-
-
Asano, A.1
Itoh, K.2
Ichioka, Y.3
-
11
-
-
0025488799
-
Convergence behavior and N-roots of stack filters
-
Sept.
-
P.-T. Yu and E. J. Coyle, “Convergence behavior and N-roots of stack filters,” IEEE Trans. Acoust., Speech, Signal Processing, vol. 38, no. 9, Sept. 1990.
-
(1990)
IEEE Trans. Acoust., Speech, Signal Processing
, vol.38
, Issue.9
-
-
Yu, P.-T.1
Coyle, E.J.2
-
12
-
-
0026726983
-
Convergence behavior and root signal set of stack filters
-
Nov.
-
M. Gabbouj, P.-T. Yu, and E. J. Coyle, “Convergence behavior and root signal set of stack filters,” Special Issue on Median and Morphological Filters in Circuit Syst. Signal Processing, vol. 11, no. 1, Nov. 1992.
-
(1992)
Special Issue on Median and Morphological Filters in Circuit Syst. Signal Processing
, vol.11
, Issue.1
-
-
Gabbouj, M.1
Yu, P.-T.2
Coyle, E.J.3
-
13
-
-
0027699028
-
Weighted medians—Positive Boolean functions conversion algorithm
-
J. Niewsglowski, M. Gabbouj, and Y. Neuvo, “Weighted medians—Positive Boolean functions conversion algorithm,” Signal Processing, vol. 34, no. 2, 1993.
-
(1993)
Signal Processing
, vol.34
, Issue.2
-
-
Niewsglowski, J.1
Gabbouj, M.2
Neuvo, Y.3
-
14
-
-
0003415652
-
-
Reading, MA: Addison-Wesley
-
A. Aho, J. E. Hoperoft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974, p. 2.
-
(1974)
The Design and Analysis of Computer Algorithms
, pp. 2
-
-
Aho, A.1
Hoperoft, J.E.2
Ullman, J.D.3
-
15
-
-
0018444935
-
An algorithm to dualize a regular switching function
-
P. L. Hammer, U. N. Peled, and M. A. Pollatschek, “An algorithm to dualize a regular switching function,” IEEE Trans. Comput., vol. C-28, 1979.
-
(1979)
IEEE Trans. Comput.
, vol.C-28
-
-
Hammer, P.L.1
Peled, U.N.2
Pollatschek, M.A.3
-
16
-
-
0022122149
-
Polynomial-time algorithms for regular set-covering and threshold synthesis
-
U. N. Peled and B. Simeone, “Polynomial-time algorithms for regular set-covering and threshold synthesis,” Discrete Applied Math., vol. 12, pp. 57–69, 1985.
-
(1985)
Discrete Applied Math.
, vol.12
, pp. 57-69
-
-
Peled, U.N.1
Simeone, B.2
-
17
-
-
0023111480
-
Dualization of regular Boolean functions
-
Y. Crama, “Dualization of regular Boolean functions,” Discrete Applied Math., vol. 16, pp. 79–85, 1987.
-
(1987)
Discrete Applied Math.
, vol.16
, pp. 79-85
-
-
Crama, Y.1
|