2000
DOI: 10.1007/3-540-45053-x_6
|View full text |Cite
|
Sign up to set email alerts
|

Image Segmentation by Nonparametric Clustering Based on the Kolmogorov-Smirnov Distance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2001
2001
2015
2015

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 10 publications
0
6
0
Order By: Relevance
“…In clustering, different 1-D clusters correspond to a multi-modal distribution, so clusters can be naturally described as combinations of monotonicity intervals separating local minima of the probability density function; see, e.g., [16], [19], [20].…”
Section: Formulation Of the Problemmentioning
confidence: 99%
“…In clustering, different 1-D clusters correspond to a multi-modal distribution, so clusters can be naturally described as combinations of monotonicity intervals separating local minima of the probability density function; see, e.g., [16], [19], [20].…”
Section: Formulation Of the Problemmentioning
confidence: 99%
“…The two-sample Kolmogorov-Smirnov (KS) test is one of the most useful and general nonparametric methods for comparing two samples. In other contexts, [40][41][42] the KS test statistic has been used to define distances for the purpose of hierarchical clustering. Borrowing the idea from hypothesis testing, we define the distance between a pair of amino acids by the normalized two-sample KS test statistic (Equation 2) when contrasting their RSA distributions.…”
Section: P C R E P C a R E P A R Ementioning
confidence: 99%
“…thresholds that are dictated by the structure apparent in the data [25]. To be more precise, assume that we have a numerical image feature x that can be computed at each of the n pixel in the image (e.g.…”
Section: Fig 4: Feature Detection Stepsmentioning
confidence: 99%