DocumentCode :
2459698
Title :
Uninitialized, globally optimal, graph-based rectilinear shape segmentation - the opposing metrics method
Author :
Sinop, Ali Kemal ; Grady, Leo
Author_Institution :
Carnegie Mellon Univ. Pittsburgh, Pittsburgh
fYear :
2007
fDate :
14-21 Oct. 2007
Firstpage :
1
Lastpage :
8
Abstract :
We present a new approach for the incorporation of shape information into a segmentation algorithm. Unlike previous approaches to the problem, our method requires no initialization, is non-iterative and finds a steady-state (i.e., global optimum) solution. In the present work, we are specifically focused on the segmentation of rectilinear shapes. The key idea is to use the fact that certain shape classes optimize the ratio of specific metrics, which can be expressed as graph Laplacian matrices applied to indicator vectors. We show that a relaxation of the binary formulation of this problem allows a global solution via generalized eigenvectors. The approach is tested on both synthetic examples and natural images.
Keywords :
Laplace equations; eigenvalues and eigenfunctions; graph theory; image segmentation; matrix algebra; realistic images; eigenvector; graph Laplacian matrix; indicator vectors; natural image; opposing metrics; rectilinear shape segmentation; synthetic image; Computer science; Distortion measurement; Image segmentation; Iterative algorithms; Iterative methods; Laplace equations; Shape measurement; Steady-state; Testing; Visualization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Vision, 2007. ICCV 2007. IEEE 11th International Conference on
Conference_Location :
Rio de Janeiro
ISSN :
1550-5499
Print_ISBN :
978-1-4244-1630-1
Electronic_ISBN :
1550-5499
Type :
conf
DOI :
10.1109/ICCV.2007.4408957
Filename :
4408957
Link To Document :
بازگشت