Sub-Riemannian Fast Marching in SE(2)
We propose a Fast Marching based implementation for computing sub-Riemanninan (SR) geodesics in the roto-translation group SE(2), with a metric depending on a cost induced by the image data. The key ingredient is a Riemannian approximation of the SR-metric. Then, a state of the art Fast Marching solver that is able to deal with extreme anisotropies is used to compute a SR-distance map as the solution of a corresponding eikonal equation. Subsequent backtracking on the distance map gives the geodesics. To validate the method, we consider the uniform cost case in which exact formulas for SR-geodesics are known and we show remarkable accuracy of the numerically computed SR-spheres. We also show a dramatic decrease in computational time with respect to a previous PDE-based iterative approach. Regarding image analysis applications, we show the potential of considering these data adaptive geodesics for a fully automated retinal vessel tree segmentation.
KeywordsRoto-translation group Sub-riemannian Fast marching
Unable to display preview. Download preview PDF.
- 1.Bekkers, E., Duits, R., Mashtakov, A., Sanguinetti, G.: A PDE approach to Data-Driven Sub-Riemannian Geodesics. SIIMS (In press)Google Scholar
- 8.Li, H., Yezzi, A.: Vessels as 4-d curves: Global minimal 4-d paths to extract 3-d tubular surfaces and centerlines. IEEE TMI 26, 1213–1223 (2007)Google Scholar
- 10.Péchaud, M., Peyré, G., Keriven, R.: Extraction of tubular structures over an orientation domain. In: Proc. IEEE Conf. CVPR, pp. 336–343 (2009)Google Scholar
- 11.Peyré, G., Péchaud, M., Keriven, R., Cohen, L.: Geodesic methods in computer vision and graphics. F. Trends in Comp. Graphics and Vision 5(3–4), 197–397 (2010)Google Scholar
- 13.Sethian, J.A.: Level Set Methods and Fast Marching Methods. Cambridge Univ. Press (1999)Google Scholar