Shortest Paths with Curvature and Torsion

Petter Strandmark, Johannes Ulen, Fredrik Kahl, Leo Grady; Proceedings of the IEEE International Conference on Computer Vision (ICCV), 2013, pp. 2024-2031


This paper describes a 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 globally optimal method uses line graphs and its runtime is polynomial in the size of the discretization, often in the order of seconds on a single computer. To our knowledge, we are the first to perform experiments in three dimensions with curvature and torsion regularization. The largest graphs we process have almost one hundred billion arcs. Experiments on medical images and in multi-view reconstruction show the significance and practical usefulness of regularization based on curvature while torsion is still only tractable for small-scale problems.

Related Material

author = {Strandmark, Petter and Ulen, Johannes and Kahl, Fredrik and Grady, Leo},
title = {Shortest Paths with Curvature and Torsion},
booktitle = {Proceedings of the IEEE International Conference on Computer Vision (ICCV)},
month = {December},
year = {2013}