Shortest Paths with Curvature and Torsion

Summary, in English

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

• Författare: Petter Strandmark; Johannes Ulén; Fredrik Kahl; Leo Grady
• Avdelning/ar: Matematik LTH; Mathematical Imaging Group; ELLIIT: the Linköping-Lund initiative on IT and mobile communication; eSSENCE: The e-Science Collaboration
• Publiceringsår: 2013
• Språk: Engelska
• Sidor: 2024-2031
• Publikation/Tidskrift/Serie: Computer Vision (ICCV), 2013 IEEE International Conference on
• Fulltext: - 2 MB; Download statistics
• Länkar: http://www.cv-foundation.org/openaccess/content_iccv_2013/papers/Strandmark_Shortest_Paths_with_2013_ICCV_paper.pdf; http://dx.doi.org/10.1109/ICCV.2013.253
• Dokumenttyp: Konferensbidrag
• Förlag: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Ämne: Computer Vision and Robotics (Autonomous Systems); Mathematics
• Conference name: IEEE International Conference on Computer Vision (ICCV), 2013
• Conference date: 2013-12-01 - 2013-12-08
• Conference place: Sydney, Australia
• Status: Published
• Forskningsgrupp: Mathematical Imaging Group
• ISBN/ISSN/Övrigt: ISSN: 1550-5499