Fast Marching Energy CNN

Nicolas Makaroff, Théo Bertrand, Laurent D. Cohen
6/28/2023
cs.CV

No confident code implementation found for this paper.

Abstract

Leveraging geodesic distances and the geometrical information they convey is key for many data-oriented applications in imaging. Geodesic distance computation has been used for long for image segmentation using Image based metrics. We introduce a new method by generating isotropic Riemannian metrics adapted to a problem using CNN and give as illustrations an example of application. We then apply this idea to the segmentation of brain tumours as unit balls for the geodesic distance computed with the metric potential output by a CNN, thus imposing geometrical and topological constraints on the output mask. We show that geodesic distance modules work well in machine learning frameworks and can be used to achieve state-of-the-art performances while ensuring geometrical and/or topological properties.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{makaroff2023fast,
  title  = {Fast Marching Energy CNN},
  author = {Nicolas Makaroff and Théo Bertrand and Laurent D. Cohen},
  year   = {2023},
  eprint = {2306.16109},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.16109v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2306.16109.svg)](https://codeofpaper.com/paper/2306.16109)

Discussion