From Ramp Discontinuities to Segmentation Tree

  • Emre Akbas
  • Narendra Ahuja
Conference paper

DOI: 10.1007/978-3-642-12307-8_12

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5994)
Cite this paper as:
Akbas E., Ahuja N. (2010) From Ramp Discontinuities to Segmentation Tree. In: Zha H., Taniguchi R., Maybank S. (eds) Computer Vision – ACCV 2009. ACCV 2009. Lecture Notes in Computer Science, vol 5994. Springer, Berlin, Heidelberg

Abstract

This paper presents a new algorithm for low-level multiscale segmentation of images. The algorithm is designed to detect image regions regardless of their shapes, sizes, and levels of interior homogeneity, by doing a multiscale analysis without assuming any prior models of region geometry. As in previous work, a region is modeled as a homogeneous set of connected pixels surrounded by ramp discontinuities. A new transform, called the ramp transform, is described, which is used to detect ramp discontinuities and seeds for all regions in an image. Region seeds are grown towards the ramp discontinuity areas by utilizing a relaxation labeling procedure. Segmentation is achieved by analyzing the output of this procedure at multiple photometric scales. Finally, all detected regions are organized into a tree data structure based on their recursive containment relations. Experiments on real and synthetic images verify the desired properties of the proposed algorithm.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Emre Akbas
    • 1
  • Narendra Ahuja
    • 1
  1. 1.Beckman Institute for Advanced Science and TechnologyUniversity of Illinois at Urbana-Champaign 

Personalised recommendations