Fast Marching Energy CNN
- URL: http://arxiv.org/abs/2306.16109v1
- Date: Wed, 28 Jun 2023 11:24:51 GMT
- Title: Fast Marching Energy CNN
- Authors: Nicolas Makaroff, Th\'eo Bertrand and Laurent D. Cohen
- Abstract summary: We introduce a new method by generating isotropic Riemannian metrics adapted to a problem using CNN.
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.
We show that geodesic distance modules can be used to achieve state-of-the-art performances while ensuring geometrical and/or topological properties.
- Score: 5.392025723672817
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- Image Segmentation: Inducing graph-based learning [4.499833362998488]
This study explores the potential of graph neural networks (GNNs) to enhance semantic segmentation across diverse image modalities.
GNNs explicitly model relationships between image regions by constructing and operating on a graph representation of the image features.
Our analysis demonstrates the versatility of GNNs in addressing diverse segmentation challenges and highlights their potential to improve segmentation accuracy in various applications.
arXiv Detail & Related papers (2025-01-07T13:09:44Z) - GeoX: Geometric Problem Solving Through Unified Formalized Vision-Language Pre-training [45.42400674977197]
GeoX is a multi-modal large model focusing on geometric understanding and reasoning tasks.
We introduce unimodal pre-training to develop a diagram encoder and symbol decoder, enhancing the understanding of geometric images and corpora.
We propose a Generator-And-Sampler Transformer (GS-Former) to generate discriminative queries and eliminate uninformative representations from unevenly distributed geometric signals.
arXiv Detail & Related papers (2024-12-16T15:20:03Z) - Geometry Distributions [51.4061133324376]
We propose a novel geometric data representation that models geometry as distributions.
Our approach uses diffusion models with a novel network architecture to learn surface point distributions.
We evaluate our representation qualitatively and quantitatively across various object types, demonstrating its effectiveness in achieving high geometric fidelity.
arXiv Detail & Related papers (2024-11-25T04:06:48Z) - Geometry-Aware Generative Autoencoders for Warped Riemannian Metric Learning and Generative Modeling on Data Manifolds [18.156807299614503]
We introduce Geometry-Aware Generative Autoencoder (GAGA), a novel framework that combines manifold learning with generative modeling.
GAGA shows competitive performance in simulated and real-world datasets, including a 30% improvement over the state-of-the-art methods in single-cell population-level trajectory inference.
arXiv Detail & Related papers (2024-10-16T17:53:26Z) - A Learned Generalized Geodesic Distance Function-Based Approach for Node Feature Augmentation on Graphs [9.48959147458029]
We introduce an approach called LGGD' (Learned Generalized Geodesic Distances)
This method involves generating node features by learning a generalized geodesic distance function through a training pipeline.
The strength of this method lies in the proven robustness of the generalized geodesic distances to noise and outliers.
arXiv Detail & Related papers (2024-07-01T11:39:15Z) - NeuroGF: A Neural Representation for Fast Geodesic Distance and Path
Queries [77.04220651098723]
This paper presents the first attempt to represent geodesics on 3D mesh models using neural implicit functions.
Specifically, we introduce neural geodesic fields (NeuroGFs), which are learned to represent the all-pairs geodesics of a given mesh.
NeuroGFs exhibit exceptional performance in solving the single-source all-destination (SSAD) and point-to-point geodesics.
arXiv Detail & Related papers (2023-06-01T13:32:21Z) - GraphCSPN: Geometry-Aware Depth Completion via Dynamic GCNs [49.55919802779889]
We propose a Graph Convolution based Spatial Propagation Network (GraphCSPN) as a general approach for depth completion.
In this work, we leverage convolution neural networks as well as graph neural networks in a complementary way for geometric representation learning.
Our method achieves the state-of-the-art performance, especially when compared in the case of using only a few propagation steps.
arXiv Detail & Related papers (2022-10-19T17:56:03Z) - Revisiting Near/Remote Sensing with Geospatial Attention [24.565068569913382]
This work addresses the task of overhead image segmentation when auxiliary ground-level images are available.
Recent work has shown that performing joint inference over these two modalities, often called near/remote sensing, can yield significant accuracy improvements.
We introduce the concept of geospatial attention, a geometry-aware attention mechanism that explicitly considers the geospatial relationship between the pixels in a ground-level image and a geographic location.
arXiv Detail & Related papers (2022-04-04T19:19:50Z) - DONet: Learning Category-Level 6D Object Pose and Size Estimation from
Depth Observation [53.55300278592281]
We propose a method of Category-level 6D Object Pose and Size Estimation (COPSE) from a single depth image.
Our framework makes inferences based on the rich geometric information of the object in the depth channel alone.
Our framework competes with state-of-the-art approaches that require labeled real-world images.
arXiv Detail & Related papers (2021-06-27T10:41:50Z) - The Geometry of Deep Generative Image Models and its Applications [0.0]
Generative adversarial networks (GANs) have emerged as a powerful unsupervised method to model the statistical patterns of real-world data sets.
These networks are trained to map random inputs in their latent space to new samples representative of the learned data.
The structure of the latent space is hard to intuit due to its high dimensionality and the non-linearity of the generator.
arXiv Detail & Related papers (2021-01-15T07:57:33Z) - Graph Signal Processing for Geometric Data and Beyond: Theory and
Applications [55.81966207837108]
Graph Signal Processing (GSP) enables processing signals that reside on irregular domains.
GSP methodologies for geometric data in a unified manner by bridging the connections between geometric data and graphs.
Recently developed Graph Neural Networks (GNNs) interpret the operation of these networks from the perspective of GSP.
arXiv Detail & Related papers (2020-08-05T03:20:16Z) - Neural Topological SLAM for Visual Navigation [112.73876869904]
We design topological representations for space that leverage semantics and afford approximate geometric reasoning.
We describe supervised learning-based algorithms that can build, maintain and use such representations under noisy actuation.
arXiv Detail & Related papers (2020-05-25T17:56:29Z) - Uniform Interpolation Constrained Geodesic Learning on Data Manifold [28.509561636926414]
Along the learned geodesic, our method can generate high-qualitys between two given data samples.
We provide a theoretical analysis of our model and use image translation as an example to demonstrate the effectiveness of our method.
arXiv Detail & Related papers (2020-02-12T07:47:41Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.