2010
DOI: 10.1016/j.imavis.2010.01.002
|View full text |Cite
|
Sign up to set email alerts
|

Finding stable salient contours

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2011
2011
2015
2015

Publication Types

Select...
2
1
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 18 publications
0
7
0
Order By: Relevance
“…The proposed approach is composed of four steps: 1) sieve the input volume to four logarithmically-spaced scales; 2) compute four channel volumes; 3) label the channel volumes using Sedgewick's connected component analysis [86] and 4) merge the labelled channel volumes into a single labelled volume. Merging is performed by determining the similarities between the density histograms for each labelled object in each channel volume using the KolmogorovSmirnov (K-S) test [55], which computes the probability that the histograms have been drawn from the same distribution. The specific strengths and weaknesses of the approach are not addressed in any great detail [23].…”
Section: Discussionmentioning
confidence: 99%
“…The proposed approach is composed of four steps: 1) sieve the input volume to four logarithmically-spaced scales; 2) compute four channel volumes; 3) label the channel volumes using Sedgewick's connected component analysis [86] and 4) merge the labelled channel volumes into a single labelled volume. Merging is performed by determining the similarities between the density histograms for each labelled object in each channel volume using the KolmogorovSmirnov (K-S) test [55], which computes the probability that the histograms have been drawn from the same distribution. The specific strengths and weaknesses of the approach are not addressed in any great detail [23].…”
Section: Discussionmentioning
confidence: 99%
“…This observation was the original motivation for simplifying the tree. However, independently [7], it was realized that contours could provide stable regions known as MSERs and in [8] it was shown that these regions are a subset of the nodes of opening and closing trees. Since it is known that M and N -sieves are more robust than open/close trees [15] it has been postulated that contours extracted from M -and N -trees should be as stable, and possibly more stable, than MSERs which are known to be among the best performing regions in terms of repeatability.…”
Section: Algorithmsmentioning
confidence: 99%
“…Since it is known that M and N -sieves are more robust than open/close trees [15] it has been postulated that contours extracted from M -and N -trees should be as stable, and possibly more stable, than MSERs which are known to be among the best performing regions in terms of repeatability. In [8] such regions are termed Stable Salient Contours or SSCs.…”
Section: Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations