DocumentCode
480970
Title
Local curvature constrained Level Set segmentation using a Spectral Bi-Partitioning algorithm
Author
Djabelkhir, Fahima ; Mokrani, Karim
Author_Institution
Electron. Dept., Univ. of Jijel, Jijel
Volume
1
fYear
2008
fDate
10-12 Sept. 2008
Firstpage
91
Lastpage
95
Abstract
Coupling the level set method and graph cut optimization method in a complementary fashion demonstrates a superior performance in two-class segmentation problems. The basic idea is to first define an energy function according to curve evolution using Level Set method and then construct a similarity graph with well selected edge weights based on the boundary curvature values, which is further optimized via our proposed spectral bi-partitioning algorithm. By the way, our model shares advantages of both level set methods and graph cut algorithms. Difficulties are found in computing due to the fact that curvature values are very critic and not easy to manipulate, start working with those values leads to instability in computing. To avoid this problem, we have chosen images with two-class segmentation problems. Accordingly, the proposed method uses local criteria and yet produces results that reflect global properties of the image.
Keywords
graph theory; image segmentation; optimisation; curvature constrained level set segmentation; graph cut algorithms; graph cut optimization method; image segmentation; level set method; similarity graph; spectral bipartitioning algorithm; two-class segmentation problems; Active contours; Active shape model; Geometry; Image analysis; Image segmentation; Indexing; Layout; Level set; Optimization methods; Power engineering and energy; Graph Cut method; Level Set method; Local Curvature; Spectral Bi-Partitioning algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
ELMAR, 2008. 50th International Symposium
Conference_Location
Zadar
ISSN
1334-2630
Print_ISBN
978-1-4244-3364-3
Type
conf
Filename
4747445
Link To Document