Sorry, you need to enable JavaScript to visit this website.

facebooktwittermailshare

A Directed Graph Approach to Active Contours

Abstract: 

Active contours based on level sets are popular segmentation algorithms but their local optimization approach makes their results to depend on initialization, especially for edge-based formulations. In this paper we present a novel energy minimization method based on directed graph optimization that minimizes the same type of active contour energy function without the need of an initialization.

up
0 users have voted:

Paper Details

Authors:
Adrian Barbu
Submitted On:
13 September 2017 - 3:23pm
Short Link:
Type:
Presentation Slides
Event:
Presenter's Name:
Adrian Barbu
Paper Code:
1863
Document Year:
2017
Cite

Document Files

SegFW-17-09-18-ICIP.pdf

(22 downloads)

Subscribe

[1] Adrian Barbu, "A Directed Graph Approach to Active Contours", IEEE SigPort, 2017. [Online]. Available: http://sigport.org/1981. Accessed: Nov. 23, 2017.
@article{1981-17,
url = {http://sigport.org/1981},
author = {Adrian Barbu },
publisher = {IEEE SigPort},
title = {A Directed Graph Approach to Active Contours},
year = {2017} }
TY - EJOUR
T1 - A Directed Graph Approach to Active Contours
AU - Adrian Barbu
PY - 2017
PB - IEEE SigPort
UR - http://sigport.org/1981
ER -
Adrian Barbu. (2017). A Directed Graph Approach to Active Contours. IEEE SigPort. http://sigport.org/1981
Adrian Barbu, 2017. A Directed Graph Approach to Active Contours. Available at: http://sigport.org/1981.
Adrian Barbu. (2017). "A Directed Graph Approach to Active Contours." Web.
1. Adrian Barbu. A Directed Graph Approach to Active Contours [Internet]. IEEE SigPort; 2017. Available from : http://sigport.org/1981