pith. sign in

arxiv: 1102.5014 · v1 · pith:XTSZZPDUnew · submitted 2011-02-24 · 🧮 math.ST · math.PR· stat.ME· stat.ML· stat.TH

Randomized algorithms for statistical image analysis and site percolation on square lattices

classification 🧮 math.ST math.PRstat.MEstat.MLstat.TH
keywords algorithmcomplexitymethodobjectspercolationrandomresultsaccuracy
0
0 comments X
read the original abstract

We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algorithm that allows to detect objects of unknown shapes in the presence of random noise. 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 procedure.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.