Shortest Paths with Higher-Order Regularization

Summary, in English

This paper describes a new method of finding thin, elongated structures in images and volumes. We use shortest paths to minimize very general functionals of higher-order curve properties, such as curvature and torsion. Our method uses line graphs to find the optimal path on a given discretization, often in the order of seconds on a single computer. The curves are then refined using local optimization making it possible to recover very smooth curves. We are able to place constraints on our curves such as maximum integrated curvature, or a maximum curvature at any point of the curve. To our knowledge, we are the first to perform experiments in three dimensions with curvature and torsion regularization. The largest graphs we process have over a hundred billion arcs. Experiments on medical images and in multi-view reconstruction show the significance and practical usefulness of higher order regularization.

• Författare: Johannes Ulén; Petter Strandmark; Fredrik Kahl
• Avdelning/ar: Matematik LTH; ELLIIT: the Linköping-Lund initiative on IT and mobile communication
• Publiceringsår: 2015
• Språk: Engelska
• Sidor: 2588-2600
• Publikation/Tidskrift/Serie: IEEE Transactions on Pattern Analysis and Machine Intelligence
• Volym: 37
• Issue: 12
• Länkar: http://dx.doi.org/10.1109/TPAMI.2015.2409869
• Dokumenttyp: Artikel i tidskrift
• Förlag: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Ämne: Mathematics
• Status: Published
• ISBN/ISSN/Övrigt: ISSN: 1939-3539