Texture Segmentation by Contractive Decomposition and Planar Grouping

Anders Lindbjerg Dahl, Peter Bogunovich, Ali Shokoufandeh

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    325 Downloads (Pure)

    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 languageEnglish
    Title of host publicationLecture Notes in Computer Science
    Place of PublicationBerlin / Heidelberg
    PublisherSpringer
    Publication date2009
    Edition1
    Pages343-352
    ISBN (Print)978-3-642-02123-7
    DOIs
    Publication statusPublished - 2009
    Event7th IAPR -TC15 Workshop on Graph-based Representations in Pattern Recognition - Venice, Italy
    Duration: 26 May 200928 May 2009
    Conference number: 7

    Conference

    Conference7th IAPR -TC15 Workshop on Graph-based Representations in Pattern Recognition
    Number7
    Country/TerritoryItaly
    CityVenice
    Period26/05/200928/05/2009

    Fingerprint

    Dive into the research topics of 'Texture Segmentation by Contractive Decomposition and Planar Grouping'. Together they form a unique fingerprint.

    Cite this