paper-with-me

Papers

NeuroGF: A Neural Representation for Fast Geodesic Distance and Path Queries

2023-06-01 · NeurIPS 2023 11 · Qijian Zhang, Junhui Hou, Yohanes Yudhi Adikusuma, Wenping Wang, Ying He

Geodesics are essential in many geometry processing applications. However, traditional algorithms for computing geodesic distances and paths on 3D mesh models are often inefficient and slow. This makes them impractical for scenarios that require extensive querying of arbitrary point-to-point geodesics. Although neural implicit representations have emerged as a popular way of representing 3D shape geometries, there is still no research on representing geodesics with deep implicit functions. To bridge this gap, 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. By using NeuroGFs, we can efficiently and accurately answer queries of arbitrary point-to-point geodesic distances and paths, overcoming the limitations of traditional algorithms. Evaluations on common 3D models show that NeuroGFs exhibit exceptional performance in solving the single-source all-destination (SSAD) and point-to-point geodesics, and achieve high accuracy consistently. Besides, NeuroGFs also offer the unique advantage of encoding both 3D geometry and geodesics in a unified representation. Moreover, we further extend generalizable learning frameworks of NeuroGFs by adding shape feature encoders, which also show satisfactory performances for unseen shapes and categories. Code is made available at https://github.com/keeganhk/NeuroGF/tree/master.

📄 PDF Abstract BibTeX arXiv:2306.00658

Code (1)

keeganhk/neurogf 공식 구현 pytorch

Tasks

3D geometry

Similar Papers 제목 키워드 기반

Automated Segmentation of Retinal Layers from Optical Coherent Tomography Images Using Geodesic Distance

2016-09-07 · Jinming Duan, Christopher Tench, Irene Gottlob, Frank Proudlock 외

Optical coherence tomography (OCT) is a non-invasive imaging technique that can produce images of the eye at the microscopic level. OCT image segmentation to localise retinal layer boundaries is a fundamental procedure f…

Image SegmentationSegmentationSemantic Segmentation

Geodesic Learning via Unsupervised Decision Forests

2019-07-05 · Meghana Madhyastha, Percy Li, James Browne, Veronika Strnadova-Neeley 외

Geodesic distance is the shortest path between two points in a Riemannian manifold. Manifold learning algorithms, such as Isomap, seek to learn a manifold that preserves geodesic distances. However, such methods operate …

Geodesic Sinkhorn for Fast and Accurate Optimal Transport on Manifolds

2022-11-02 · Guillaume Huguet, Alexander Tong, María Ramos Zapatero, Christopher J. Tape 외

Efficient computation of optimal transport distance between distributions is of growing importance in data science. Sinkhorn-based methods are currently the state-of-the-art for such computations, but require $O(n^2)$ co…

Dimensionality ReductionTime SeriesTime Series AnalysisVocal Bursts Intensity Prediction

Fast Patch-Based Denoising Using Approximated Patch Geodesic Paths

2013-06-01 · CVPR 2013 6 · Xiaogang Chen, Sing Bing Kang, Jie Yang, Jingyi Yu

Patch-based methods such as Non-Local Means (NLM) and BM3D have become the de facto gold standard for image denoising. The core of these approaches is to use similar patches within the image as cues for denoising. The op…

DenoisingImage Denoising

Geodesic Models with Convexity Shape Prior

2021-11-01 · Da Chen, Jean-Marie Mirebeau, Minglei Shu, Xuecheng Tai 외

The minimal geodesic models based on the Eikonal equations are capable of finding suitable solutions in various image segmentation scenarios. Existing geodesic-based segmentation approaches usually exploit image features…

Image SegmentationSegmentationSemantic Segmentation