paper-with-me

홈 › Papers

MongeNet: Efficient Sampler for Geometric Deep Learning

2021-04-29 · CVPR 2021 1 · Léo Lebrat, Rodrigo Santa Cruz, Clinton Fookes, Olivier Salvado

Recent advances in geometric deep-learning introduce complex computational challenges for evaluating the distance between meshes. From a mesh model, point clouds are necessary along with a robust distance metric to assess surface quality or as part of the loss function for training models. Current methods often rely on a uniform random mesh discretization, which yields irregular sampling and noisy distance estimation. In this paper we introduce MongeNet, a fast and optimal transport based sampler that allows for an accurate discretization of a mesh with better approximation properties. We compare our method to the ubiquitous random uniform sampling and show that the approximation error is almost half with a very small computational overhead.

📄 PDF Abstract BibTeX arXiv:2104.14554

Code (1)

lebrat/MongeNet 공식 구현 pytorch

Tasks

Deep Learning

Similar Papers 제목 키워드 기반

Stereographic Markov Chain Monte Carlo

2022-05-24 · Jun Yang, Krzysztof Łatuszyński, Gareth O. Roberts

High-dimensional distributions, especially those with heavy tails, are notoriously difficult for off-the-shelf MCMC samplers: the combination of unbounded state spaces, diminishing gradient information, and local moves r…

Geometric adaptive Monte Carlo in random environment

2016-08-29 · Theodore Papamarkou, Alexey Lindo, Eric B. Ford

Manifold Markov chain Monte Carlo algorithms have been introduced to sample more effectively from challenging target densities exhibiting multiple modes or strong correlations. Such algorithms exploit the local geometry …

Adaptive Reordering Sampler with Neurally Guided MAGSAC

2021-11-28 · ICCV 2023 1 · Tong Wei, Jiri Matas, Daniel Barath

We propose a new sampler for robust estimators that always selects the sample with the highest probability of consisting only of inliers. After every unsuccessful iteration, the inlier probabilities are updated in a prin…

MAGSAC++, a fast, reliable and accurate robust estimator

2019-12-11 · CVPR 2020 6 · Daniel Barath, Jana Noskova, Maksym Ivashechkin, Jiri Matas

A new method for robust estimation, MAGSAC++, is proposed. It introduces a new model quality (scoring) function that does not require the inlier-outlier decision, and a novel marginalization procedure formulated as an it…

Localized Schrödinger Bridge Sampler

2024-09-12 · Georg A. Gottwald, Sebastian Reich

We consider the problem of sampling from an unknown distribution for which only a sufficiently large number of training samples are available. In this paper, we build on previous work combining Schr\"odinger bridges and …

Bayesian InferenceDenoising