Concept

Fonction distance signée

Publications associées (32)

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 ...

2024

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

Scene Decomposition and Relighting from Image Collections in Neural Rendering

Dongqing Wang

The focus of our research is to generate controllable photo-realistic images of real-world scenes from existing observations, i.e., the inverse rendering problem. The approaches we focus on are those through neural rendering, utilizing neural network to de ...

2022

Laser engraving device for multiple laser beams using a data link for adjusting the focusing position

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 ...

2022

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

2020

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

Felix Schürmann, Marwan Muhammad Ahmed Abdellah, Alessandro Enrico Foni, Sébastien Nicolas Speierer, Samuel Lieven D. Lapere, 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

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

Jian Li, Lingxiao Huang

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

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search