Reconstructing Loopy Curvilinear Structures Using Integer Programming

Engin Turetken, Fethallah Benmansour, Bjoern Andres, Hanspeter Pfister, Pascal Fua; Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2013, pp. 1822-1829

Abstract


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.

Related Material


[pdf]
[bibtex]
@InProceedings{Turetken_2013_CVPR,
author = {Turetken, Engin and Benmansour, Fethallah and Andres, Bjoern and Pfister, Hanspeter and Fua, Pascal},
title = {Reconstructing Loopy Curvilinear Structures Using Integer Programming},
booktitle = {Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR)},
month = {June},
year = {2013}
}