Sciweavers

Share
ICCV
2011
IEEE

Recursive MDL via Graph Cuts: Application to Segmentation

9 years 4 months ago
Recursive MDL via Graph Cuts: Application to Segmentation
We propose a novel patch-based image representation that is useful because it (1) inherently detects regions with repetitive structure at multiple scales and (2) yields a parameterless hierarchical segmentation. We describe an image by breaking it into coherent regions where each region is well-described (easily reconstructed) by repeatedly instantiating a patch using a set of simple transformations. In other words, a good segment is one that has sufficient repetition of some pattern, and a patch is useful if it contains a pattern that is repeated in the image. Our criterion is naturally expressed by the wellestablished minimum description length (MDL) principle. MDL prefers spatially coherent regions with consistent appearance and avoids parameter tuning. We minimize the description length (in bits) of the image by encoding it with patches. Because a patch is itself an image, we measure its description length by applying the same idea recursively: encode a patch by breaking it into ...
Lena Gorelick, Andrew Delong, Olga Veksler, Yuri B
Added 11 Dec 2011
Updated 11 Dec 2011
Type Journal
Year 2011
Where ICCV
Authors Lena Gorelick, Andrew Delong, Olga Veksler, Yuri Boykov
Comments (0)
books