Publications related to Signed distance function

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...

Association for Computing Machinery2024

Differentiable Signed Distance Function Rendering

Wenzel Alban Jakob, Delio Aleardo Vicini, Sébastien Nicolas Speierer

Physically-based differentiable rendering has recently emerged as an attractive new technique for solving inverse problems that recover complete 3D scene representations from images. The inversion of shape parameters is of particular interest but also pose ...

ASSOC COMPUTING MACHINERY2022

Efficient and Accurate Physically-Based Differentiable Rendering

Delio Aleardo Vicini

Physically-based rendering algorithms generate photorealistic images of virtual scenes. By simulating light paths in a scene, complex physical effects such as shadows, reflections and volumetric scattering can be reproduced. Over the last decade, physicall ...

EPFL2022

On Perfect Clustering of High Dimension, Low Sample Size Data

Soham Sarkar

Popular clustering algorithms based on usual distance functions (e.g., the Euclidean distance) often suffer in high dimension, low sample size (HDLSS) situations, where concentration of pairwise distances and violation of neighborhood structure have advers ...

IEEE COMPUTER SOC2020

Laser engraving device for multiple laser beams

Andreas Schueler, Luc Burnier

The present invention concerns a laser engraving device (1) for engraving a target surface (17). The laser engraving device (1) comprises: a beam splitter (7) for dividing a processing laser beam (25) into a plurality of engraving laser beams (27); a first ...

2020

High Fidelity Visualization of Large Scale Digitally Reconstructed Brain Circuitry with Signed Distance Functions

Felix Schürmann, Marwan Muhammad Ahmed Abdellah, Sébastien Nicolas Speierer, Samuel Lieven D. Lapere, Alessandro Enrico Foni, Jonas Kristofer Karlsson

We explore a first proof-of-concept application for visualizing large scale digitally reconstructed brain circuitry using signed distance functions. The significance of our method is demonstrated in comparison with using implicit geometry that is limited t ...

IEEE2019

Comic Digitization through the Extraction of Semantic Content and Style Analysis

Kalpani Anuradha Welivita

Comic book digitization would play a pivotal role in exploring new avenues on how digital comics can be consumed. As of present, the systems capable of doing such a task are limited in capability to achieve complete digitization. This task of digitization ...

IEEE2019

epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics

Lingxiao Huang, Jian Li

We study the problem of constructing epsilon-coresets for the (k, z)-clustering problem in a doubling metric M(X, d). An epsilon-coreset is a weighted subset S subset of X with weight function w : S -> R->= 0, such that for any k-subset C is an element of ...

IEEE COMPUTER SOC2018

Distinct Values Of Bilinear Forms On Algebraic Curves

Frank de Zeeuw, Adrian Claudiu Valculescu

Let B-M : C x C -> C be a bilinear form B-M(p, q) - p(T)Mq, with an invertible matrix M is an element of C-2x2. We prove that any finite set S contained in an irreducible algebraic curve C of degree d in C determines Omega(d)(vertical bar S vertical bar(4/ ...

Univ Calgary, Dept Math & Statistics2016

Space lower bounds for low-stretch greedy embeddings

Christos Kalaitzis

Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...

Elsevier Science Bv2016

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

Geometric Variational Models for Inverse Problems in Imaging

Virginia Estellers Casas

This dissertation develops geometric variational models for different inverse problems in imaging that are ill-posed, designing at the same time efficient numerical algorithms to compute their solutions. Variational methods solve inverse problems by the fo ...

EPFL2013

Analysis of Descent-Based Image Registration

Pascal Frossard, Elif Vural

We present a performance analysis for image registration with gradient descent. We consider a typical multiscale registration setting where the global 2-D translation between a pair of images is estimated by smoothing the images and minimizing the distance ...

2013

An Efficient Algorithm for Level Set Method Preserving Distance Function

Jean-Philippe Thiran, Xavier Bresson, Dominique Zosso, Virginia Estellers Casas

The level set method is a popular technique for tracking moving interfaces in several disciplines including computer vision and fluid dynamics. However, despite its high flexibility, the original level set method is limited by two important numerical issue ...

Institute of Electrical and Electronics Engineers2012

Distance-Based Discretization of Parametric Signal Manifolds

Pascal Frossard, Elif Vural

The characterization of signals and images in manifolds often lead to efficient dimensionality reduction algorithms based on manifold distance computation for analysis or classification tasks. We propose in this paper a method for the discretization of sig ...

2010

Harmonic symmetrization of convex sets and of Finsler structures, with applications to Hilbert geometry

Marc Troyanov

David Hilbert discovered in 1895 an important metric that is canonically associated to any convex domain

\Omega

in the Euclidean (or projective) space. This metric is known to be Finslerian, and the usual proof assumes a certain degree of smoothness of t ...

2009

Parametric B-Spline Snakes on Distance Maps—Application to Segmentation of Histology Images

Michaël Unser, Philippe Thévenaz, François Aguet, Chandra Sekhar Seelamantula

We construct parametric active contours (snakes) for outlining cells in histology images. These snakes are defined in terms of cubic B-spline basis functions. We use a steerable ridge detector for obtaining a reliable map of the cell boundaries. Using the ...

EURASIP2008

Evaluating automated parameter constraining procedures of neuron models by experimental and surrogate data

Henry Markram, Sean Lewis Hill, Thomas Berger, Felix Schürmann, Idan Segev

Neuron models, in particular conductance-based compartmental models, often have numerous parameters that cannot be directly determined experimentally and must be constrained by an optimization procedure. A common practice in evaluating the utility of such ...

2008

Landscape structure affects dispersal in the greater white-toothed shrew: inference between genetic and simulated ecological distances

Séverine Vuilleumier Varisco

Dispersal is often viewed as a process on which the landscape has little effect. This is particularly apparent in populations’ genetic and ecological studies, where isolation by distance is generally tested using a Euclidean distance between populations. H ...

Elsevier2007

A biomechanics-based articulation model for medical applications

Anderson Maciel

Computer Graphics came into the medical world especially after the arrival of 3D medical imaging. Computer Graphics techniques are already integrated in the diagnosis procedure by means of the visual tridimensional analysis of computer tomography, magnetic ...

EPFL2005