2434 search results - page 9 / 487 » Algorithmic Randomness of Closed Sets |
APAL
2010
14 years 9 months ago
2010
A real x is 1 1-Kurtz random (1 1-Kurtz random) if it is in no closed null 1 1 set (1 1 set). We show that there is a cone of 1 1-Kurtz random hyperdegrees. We characterize lowness...
ICIP
1995
IEEE
15 years 11 months ago
1995
IEEE
In recent work, we have shown that morphological openings and closings can be viewed as consistent MAP estimators of morphologically smooth binary image signals immersed in i.i.d....
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
In this paper, we build multi-resolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensional random vectors, dithering followe...
FOCS
2000
IEEE
15 years 1 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
JMIV
2010
14 years 7 months ago
2010
Shape estimation and object reconstruction are common problems in image analysis. Mathematically, viewing objects in the image plane as random sets reduces the problem of shape es...