Journal of nonparametric statistics · 2013 · 10 citations · 11 references
ComputingComputer ScienceMathematicsComputer VisionProbability TheoryStatisticsDensity EstimationNonparametric StatisticsObject DetectionPattern RecognitionPercolation TheoryShape AnalysisComplexityNonparametric EstimationNonparametric InferencePercolationPercolation ProcessesRandom Graph ModelsRandom Graph TheoryShape Detection
We propose a novel statistical hypothesis testing method for the detection of objects in noisy images. The method uses results from percolation theory and random graph theory. We present an algorithm that allows to detect objects of unknown shapes in the presence of nonparametric noise of unknown level and of unknown distribution. No boundary shape constraints are imposed on the object, only a weak bulk condition for the object's interior is required. The algorithm has linear complexity and exponential accuracy and is appropriate for real-time systems. We prove results on consistency and algorithmic complexity of our testing procedure. In addition, we address not only an asymptotic behaviour of the method, but also a finite sample performance of our test.
11
Depth-First Search and Linear Graph Algorithms
Robert E. Tarjan · SIAM Journal on Computing · 1972 · 6K citations
Identification and expansion of human colon-cancer-initiating cells
Lucia Ricci‐Vitiani, Dario Lombardi, Emanuela Pilozzi et al. · Nature · 2006 · 4K citations
Medicine, Cancer Biology, Oncology +12
Depth-first search and linear graph algorithms
Robert E. Tarjan · 1971 · 655 citations