Reconstructing Loopy Curvilinear Structures Using Integer Programming

We propose a novel approach to automated delineation of linear structures that form complex and potentially loopy networks. This is in contrast to earlier approaches that usually assume a tree topology for the networks. At the heart of our method is an Integer Programming formulation that allows us to find the global optimum of an objective function designed to allow cycles but penalize spurious junctions and early terminations. We demonstrate that it outperforms state-of-the-art techniques on a wide range of datasets.


Published in:
Proceedings of IEEE Conference on Computer Vision and Pattern Recognition
Presented at:
Conference on Computer Vision and Pattern Recognition (CVPR), Portland, Oregon, USA, June, 2013
Year:
2013
Publisher:
New York, Ieee
Keywords:
Laboratories:




 Record created 2013-04-23, last modified 2018-10-07

n/a:
Download fulltextPDF
External link:
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)