Abstract
Image segmentation has long been an important problem in the computer vision community. In our recent work we have addressed the problem of texture segmentation, where we combined top-down and bottom-up views of the image into a unified procedure. In this paper we extend our work by proposing a modified procedure which makes use of graphs of image regions. In the top-down procedure a quadtree of image region descriptors is obtained in which a novel affine contractive transformation based on neighboring regions is used to update descriptors and determine stable segments. In the bottom-up procedure we form a planar graph on the resulting stable segments, where edges are present between vertices representing neighboring image regions. We then use a vertex merging technique to obtain the final segmentation. We verify the effectiveness of this procedure by demonstrating results which compare well to other recent techniques.
Original language | English |
---|---|
Title of host publication | Lecture Notes in Computer Science |
Place of Publication | Berlin / Heidelberg |
Publisher | Springer |
Publication date | 2009 |
Edition | 1 |
Pages | 343-352 |
ISBN (Print) | 978-3-642-02123-7 |
DOIs | |
Publication status | Published - 2009 |
Event | 7th IAPR -TC15 Workshop on Graph-based Representations in Pattern Recognition - Venice, Italy Duration: 26 May 2009 → 28 May 2009 Conference number: 7 |
Conference
Conference | 7th IAPR -TC15 Workshop on Graph-based Representations in Pattern Recognition |
---|---|
Number | 7 |
Country/Territory | Italy |
City | Venice |
Period | 26/05/2009 → 28/05/2009 |