We propose a novel statistical 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 nonparametric noise of unknown level. The noise density is assumed
to be unknown and can be very irregular. Our procedure substantially differs
from wavelets-based algorithms. The algorithm has linear complexity and
exponential accuracy and is appropriate for real-time systems.
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.
We study statistical detection of grayscale objects in noisy images. The
object of interest is of unknown shape and has an unknown intensity, that can
be varying over the object and can be negative. No boundary shape constraints
are imposed on the object, only a weak bulk condition for the object's interior
is required. We propose an algorithm that can be used to detect grayscale
objects of unknown shapes in the presence of nonparametric noise of unknown
level. Our algorithm is based on a nonparametric multiple testing procedure.
We propose a novel statistical hypothesis testing method for 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.
In the series of our earlier papers on the subject, we proposed a novel
statistical hypothesis testing method for detection of objects in noisy images.
The method uses results from percolation theory and random graph theory. We
developed algorithms that allowed to detect objects of unknown shapes in the
presence of nonparametric noise of unknown level and of unknown distribution.
No boundary shape constraints were imposed on the objects, only a weak bulk
condition for the object's interior was required. Our algorithms have linear
complexity and exponential accuracy.
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. Our procedure substantially differs from
wavelets-based algorithms. 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.