Cargando…

Optimal Paths for Variants of the 2D and 3D Reeds–Shepp Car with Applications in Image Analysis

We present a PDE-based approach for finding optimal paths for the Reeds–Shepp car. In our model we minimize a (data-driven) functional involving both curvature and length penalization, with several generalizations. Our approach encompasses the two- and three-dimensional variants of this model, state...

Descripción completa

Detalles Bibliográficos
Autores principales: Duits, R., Meesters, S. P. L., Mirebeau, J.-M., Portegies, J. M.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2018
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6445415/
https://www.ncbi.nlm.nih.gov/pubmed/31007388
http://dx.doi.org/10.1007/s10851-018-0795-z
_version_ 1783408188960276480
author Duits, R.
Meesters, S. P. L.
Mirebeau, J.-M.
Portegies, J. M.
author_facet Duits, R.
Meesters, S. P. L.
Mirebeau, J.-M.
Portegies, J. M.
author_sort Duits, R.
collection PubMed
description We present a PDE-based approach for finding optimal paths for the Reeds–Shepp car. In our model we minimize a (data-driven) functional involving both curvature and length penalization, with several generalizations. Our approach encompasses the two- and three-dimensional variants of this model, state-dependent costs, and moreover, the possibility of removing the reverse gear of the vehicle. We prove both global and local controllability results of the models. Via eikonal equations on the manifold [Formula: see text] we compute distance maps w.r.t. highly anisotropic Finsler metrics, which approximate the singular (quasi)-distances underlying the model. This is achieved using a fast-marching (FM) method, building on Mirebeau (Numer Math 126(3):515–557, 2013; SIAM J Numer Anal 52(4):1573–1599, 2014). The FM method is based on specific discretization stencils which are adapted to the preferred directions of the Finsler metric and obey a generalized acuteness property. The shortest paths can be found with a gradient descent method on the distance map, which we formalize in a theorem. We justify the use of our approximating metrics by proving convergence results. Our curve optimization model in [Formula: see text] with data-driven cost allows to extract complex tubular structures from medical images, e.g., crossings, and incomplete data due to occlusions or low contrast. Our work extends the results of Sanguinetti et al. (Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications LNCS 9423, 2015) on numerical sub-Riemannian eikonal equations and the Reeds–Shepp car to 3D, with comparisons to exact solutions by Duits et al. (J Dyn Control Syst 22(4):771–805, 2016). Numerical experiments show the high potential of our method in two applications: vessel tracking in retinal images for the case [Formula: see text] and brain connectivity measures from diffusion-weighted MRI data for the case [Formula: see text] , extending the work of Bekkers et al. (SIAM J Imaging Sci 8(4):2740–2770, 2015). We demonstrate how the new model without reverse gear better handles bifurcations.
format Online
Article
Text
id pubmed-6445415
institution National Center for Biotechnology Information
language English
publishDate 2018
publisher Springer US
record_format MEDLINE/PubMed
spelling pubmed-64454152019-04-17 Optimal Paths for Variants of the 2D and 3D Reeds–Shepp Car with Applications in Image Analysis Duits, R. Meesters, S. P. L. Mirebeau, J.-M. Portegies, J. M. J Math Imaging Vis Article We present a PDE-based approach for finding optimal paths for the Reeds–Shepp car. In our model we minimize a (data-driven) functional involving both curvature and length penalization, with several generalizations. Our approach encompasses the two- and three-dimensional variants of this model, state-dependent costs, and moreover, the possibility of removing the reverse gear of the vehicle. We prove both global and local controllability results of the models. Via eikonal equations on the manifold [Formula: see text] we compute distance maps w.r.t. highly anisotropic Finsler metrics, which approximate the singular (quasi)-distances underlying the model. This is achieved using a fast-marching (FM) method, building on Mirebeau (Numer Math 126(3):515–557, 2013; SIAM J Numer Anal 52(4):1573–1599, 2014). The FM method is based on specific discretization stencils which are adapted to the preferred directions of the Finsler metric and obey a generalized acuteness property. The shortest paths can be found with a gradient descent method on the distance map, which we formalize in a theorem. We justify the use of our approximating metrics by proving convergence results. Our curve optimization model in [Formula: see text] with data-driven cost allows to extract complex tubular structures from medical images, e.g., crossings, and incomplete data due to occlusions or low contrast. Our work extends the results of Sanguinetti et al. (Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications LNCS 9423, 2015) on numerical sub-Riemannian eikonal equations and the Reeds–Shepp car to 3D, with comparisons to exact solutions by Duits et al. (J Dyn Control Syst 22(4):771–805, 2016). Numerical experiments show the high potential of our method in two applications: vessel tracking in retinal images for the case [Formula: see text] and brain connectivity measures from diffusion-weighted MRI data for the case [Formula: see text] , extending the work of Bekkers et al. (SIAM J Imaging Sci 8(4):2740–2770, 2015). We demonstrate how the new model without reverse gear better handles bifurcations. Springer US 2018-02-20 2018 /pmc/articles/PMC6445415/ /pubmed/31007388 http://dx.doi.org/10.1007/s10851-018-0795-z Text en © The Author(s) 2018 Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
spellingShingle Article
Duits, R.
Meesters, S. P. L.
Mirebeau, J.-M.
Portegies, J. M.
Optimal Paths for Variants of the 2D and 3D Reeds–Shepp Car with Applications in Image Analysis
title Optimal Paths for Variants of the 2D and 3D Reeds–Shepp Car with Applications in Image Analysis
title_full Optimal Paths for Variants of the 2D and 3D Reeds–Shepp Car with Applications in Image Analysis
title_fullStr Optimal Paths for Variants of the 2D and 3D Reeds–Shepp Car with Applications in Image Analysis
title_full_unstemmed Optimal Paths for Variants of the 2D and 3D Reeds–Shepp Car with Applications in Image Analysis
title_short Optimal Paths for Variants of the 2D and 3D Reeds–Shepp Car with Applications in Image Analysis
title_sort optimal paths for variants of the 2d and 3d reeds–shepp car with applications in image analysis
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6445415/
https://www.ncbi.nlm.nih.gov/pubmed/31007388
http://dx.doi.org/10.1007/s10851-018-0795-z
work_keys_str_mv AT duitsr optimalpathsforvariantsofthe2dand3dreedssheppcarwithapplicationsinimageanalysis
AT meestersspl optimalpathsforvariantsofthe2dand3dreedssheppcarwithapplicationsinimageanalysis
AT mirebeaujm optimalpathsforvariantsofthe2dand3dreedssheppcarwithapplicationsinimageanalysis
AT portegiesjm optimalpathsforvariantsofthe2dand3dreedssheppcarwithapplicationsinimageanalysis