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

02/24/2011
by   Mikhail A. Langovoy, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/23/2011

Detection of objects in noisy images and site percolation on square lattices

We propose a novel probabilistic method for detection of objects in nois...
research
02/24/2011

Detection of objects in noisy images based on percolation theory

We propose a novel statistical method for detection of objects in noisy ...
research
02/23/2011

Computationally efficient algorithms for statistical image processing. Implementation in R

In the series of our earlier papers on the subject, we proposed a novel ...
research
02/23/2011

Multiple testing, uncertainty and realistic pictures

We study statistical detection of grayscale objects in noisy images. The...
research
12/26/2020

An Affine moment invariant for multi-component shapes

We introduce an image based algorithmic tool for analyzing multi-compone...
research
07/20/2019

Unsupervised Separation of Dynamics from Pixels

We present an approach to learn the dynamics of multiple objects from im...
research
10/14/2019

Beauty and structural complexity

We revisit the long-standing question of the relation between image appr...

Please sign up or login with your details

Forgot password? Click here to reset