Skip to main content
Article thumbnail
Location of Repository

Reconstructing Loopy Curvilinear Structures Using Integer Programming

By Engin Türetken, Fethallah Benmansour, Bjoern Andres, Hanspeter Pfister and Pascal Fua

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. (Aerial) (Confocal

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.1845
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.andres.sc/publicati... (external link)
  • http://www.andres.sc/publicati... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.