Numerical integration of Riemannian gradient flows for image labeling

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The image labeling problem can be described as assigning to each pixel a single element from a finite set of predefined labels. Recently, a smooth geometric approach was proposed [2] by following the Riemannian gradient flow of a given objective function on the socalled assignment manifold. In this paper, we adopt an approach from the literature on uncoupled replicator dynamics and extend it to the geometric labeling flow, that couples the dynamics through Riemannian averaging over spatial neighborhoods. As a result, the gradient flow on the assignment manifold transforms to a flow on a vector space of matrices, such that parallel numerical update schemes can be derived by established numerical integration. A quantitative comparison of various schemes reveals a superior performance of the adaptive scheme originally proposed, regarding both the number of iterations and labeling accuracy.

Cite

CITATION STYLE

APA

Savarino, F., Hühnerbein, R., Åström, F., Recknagel, J., & Schnörr, C. (2017). Numerical integration of Riemannian gradient flows for image labeling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10302 LNCS, pp. 361–372). Springer Verlag. https://doi.org/10.1007/978-3-319-58771-4_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free