Breakdown probabilities of recursive stack filters

Pertti Koivisto; Olli Yli-Harja; Antti Niemistö; Ilya Shmulevich

doi:10.1016/S0165-1684(00)00222-X

Breakdown probabilities of recursive stack filters

Pertti Koivisto
, Olli Yli-Harja
, Antti Niemistö
, Ilya Shmulevich

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

A method for calculating breakdown probabilities of recursive stack filters is presented. The method is based on Markov chain models and on an interpretation of a noisy signal as a binary signal. As an example, the breakdown probabilities of recursive median filters are calculated.

Original language	English
Pages (from-to)	227-231
Number of pages	5
Journal	Signal Processing
Volume	81
Issue number	1
DOIs	https://doi.org/10.1016/S0165-1684(00)00222-X
State	Published - Jan 2001
Externally published	Yes

Access to Document

10.1016/S0165-1684(00)00222-X

Cite this

@article{570cf25ac866410baca2b11c26524900,

title = "Breakdown probabilities of recursive stack filters",

abstract = "A method for calculating breakdown probabilities of recursive stack filters is presented. The method is based on Markov chain models and on an interpretation of a noisy signal as a binary signal. As an example, the breakdown probabilities of recursive median filters are calculated.",

author = "Pertti Koivisto and Olli Yli-Harja and Antti Niemist{\"o} and Ilya Shmulevich",

year = "2001",

month = jan,

doi = "10.1016/S0165-1684(00)00222-X",

language = "English",

volume = "81",

pages = "227--231",

journal = "Signal Processing",

issn = "0165-1684",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Breakdown probabilities of recursive stack filters

AU - Koivisto, Pertti

AU - Yli-Harja, Olli

AU - Niemistö, Antti

AU - Shmulevich, Ilya

PY - 2001/1

Y1 - 2001/1

N2 - A method for calculating breakdown probabilities of recursive stack filters is presented. The method is based on Markov chain models and on an interpretation of a noisy signal as a binary signal. As an example, the breakdown probabilities of recursive median filters are calculated.

AB - A method for calculating breakdown probabilities of recursive stack filters is presented. The method is based on Markov chain models and on an interpretation of a noisy signal as a binary signal. As an example, the breakdown probabilities of recursive median filters are calculated.

UR - https://www.scopus.com/pages/publications/0034817756

U2 - 10.1016/S0165-1684(00)00222-X

DO - 10.1016/S0165-1684(00)00222-X

M3 - Article

AN - SCOPUS:0034817756

SN - 0165-1684

VL - 81

SP - 227

EP - 231

JO - Signal Processing

JF - Signal Processing

IS - 1

ER -

Breakdown probabilities of recursive stack filters

Abstract

Access to Document

Other files and links

Fingerprint

Cite this