1985
DOI: 10.1109/tcs.1985.1085740
|View full text |Cite
|
Sign up to set email alerts
|

Threshold decomposition of multidimensional ranked order operations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0
4

Year Published

1990
1990
2023
2023

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 104 publications
(30 citation statements)
references
References 6 publications
0
26
0
4
Order By: Relevance
“…This idea is also at the basis of the so-called -"lters introduced by Preston [60] in 1983. More precisely, -"lters use the threshold decomposition and stacking (i.e., increasing) properties [18,40] of rank "lters for processing grey scale images with a "nite number of grey scale levels: the output image is obtained by summing up the thresholds of the convolution of each level set of the image. -"lters may use an additional &level parameter' which indicates whether a low rank/high rank or high rank/low rank sequence must be applied below or above the speci"ed level.…”
Section: Linksmentioning
confidence: 99%
“…This idea is also at the basis of the so-called -"lters introduced by Preston [60] in 1983. More precisely, -"lters use the threshold decomposition and stacking (i.e., increasing) properties [18,40] of rank "lters for processing grey scale images with a "nite number of grey scale levels: the output image is obtained by summing up the thresholds of the convolution of each level set of the image. -"lters may use an additional &level parameter' which indicates whether a low rank/high rank or high rank/low rank sequence must be applied below or above the speci"ed level.…”
Section: Linksmentioning
confidence: 99%
“…They showed that all rank-order-based filters possess a limited superposition property called the threshold decomposition [43], [44], which says that median filtering any sequence whose elements take on values in the set Q = {0, 1,..., M -1} is equivalent to decomposing the signal into binary sequences by thresholding at each level from 1 through M -1, filtering each resulting binary sequence by a (binary) median filter, and then adding up the results.…”
Section: Generalization Of Median-type Filters : Theoretical Analysismentioning
confidence: 99%
“…Getting back to the threshold decomposition of the median filter, Fitch et al [44] showed that this property was a powerful tool that can be used to analyze the whole class of rank-order filters, not just median filters as in [43]. Arce and McLoughlin [10] also used this tool to analyze the behavior of their max/median filters.…”
Section: Generalization Of Median-type Filters : Theoretical Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…Several VLSI designs for median filters are studied in [3], where it is stated that for a relatively small pixel value resolution the threshold decomposition technique [4] is probably the best choice. However, implementation of filters capable of handling high-resolution numbers is not practical, since the complexity increases exponentially with both the data resolution and data window size.…”
Section: Introductionmentioning
confidence: 99%