Abstract
In this paper, we present a graph-based image segmentation method (patch-cuts) that incorporates features and spatial relations obtained from image patches. In the first step, patch-cuts extracts a set of patches that can assume arbitrary shape and size. Patches are determined by a combination of intensity quantization and morphological operations and render the proposed method robust against noise. Upon patch extraction, a set of intensity, texture and shape features are computed for each patch. These features are integrated and minimized simultaneously in a tunable energy function. Patch-cuts explores the benefit of information theory-based measures such as the Kullback-Leibler and the Jensen-Shannon divergence in its energy terms. In our experiments, we applied patchcuts to general images as well as to non-contrast Computed Tomography heart scans.
| Original language | English (US) |
|---|---|
| DOIs | |
| State | Published - 2010 |
| Event | 2010 21st British Machine Vision Conference, BMVC 2010 - Aberystwyth, United Kingdom Duration: Aug 31 2010 → Sep 3 2010 |
Conference
| Conference | 2010 21st British Machine Vision Conference, BMVC 2010 |
|---|---|
| Country/Territory | United Kingdom |
| City | Aberystwyth |
| Period | 8/31/10 → 9/3/10 |
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
Fingerprint
Dive into the research topics of 'Patch-cuts: A graph-based image segmentation method using patch features and spatial relations'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS