Concept

Dérivée seconde

Publications associées (96)

Local Non-Rigid Structure-from-Motion from Diffeomorphic Mappings

Pascal Fua, Mathieu Salzmann, Shaifali Parashar

We propose a new formulation to non-rigid structure-from-motion that only requires the deforming surface to preserve its differential structure. This is a much weaker assumption than the traditional ones of isometry or conformality. We show that it is neve ...

IEEE2020

Local Non-Rigid Structure-from-Motion from Locally Diffeomorphic Mappings

Pascal Fua, Mathieu Salzmann, Shaifali Parashar

We propose a new formulation to the non-rigid structure-from-motion problem that only requires the deforming surface to meaning that its differential structure is preserved. This is a much weaker assumption than the traditional ones of isometry or conforma ...

2020

Computation of "Best" Interpolants in the Lp Sense

Michaël Unser, Pakshal Narendra Bohra

We study a variant of the interpolation problem where the continuously defined solution is regularized by minimizing the L p -norm of its second-order derivative. For this continuous-domain problem, we propose an exact discretization scheme that restricts ...

2020

COMPUTATION OF "BEST" INTERPOLANTS IN THE L-p SENSE

Michaël Unser, Pakshal Narendra Bohra

We study a variant of the interpolation problem where the continuously defined solution is regularized by minimizing the L-p-norm of its second-order derivative. For this continuous-domain problem, we propose an exact discretization scheme that restricts t ...

IEEE2020

A critically degenerate elliptic Dirichlet problem, spectral theory and bifurcation

Charles Stuart

In an open, bounded subset Omega of R-N such that 0 is an element of Omega we consider the nonlinear eigenvalue problem -Sigma(N)(i,j,=1) partial derivative(i){A(ij)(x)partial derivative(j)u} + V(x)u + n(x,del u)+ g(x, u) = lambda u in Omega integral(Omega ...

2020

Linear Speedup In Saddle-Point Escape For Decentralized Non-Convex Optimization

Ali H. Sayed, Stefan Vlaski

Under appropriate cooperation protocols and parameter choices, fully decentralized solutions for stochastic optimization have been shown to match the performance of centralized solutions and result in linear speedup (in the number of agents) relative to no ...

IEEE2020

On design strategies for binary dielectric metasurfaces based on the Fourier modal method

Kévin Müller

Binary dielectric metasurfaces are arrays of sub-wavelength structures that act as a thin layer of artificial material. They are generally lossless and relatively simple to fabricate since only a single structuring step is required. By carefully designing ...

EPFL2020

A note on efficient computation of privileged directions in modifier adaptation

Dominique Bonvin, Timm Faulwasser, Alejandro Gabriel Marchetti, Martand Singhal

In the presence of plant-model mismatch, the estimation of plant gradients is key to the performance of measurement-based iterative optimization schemes. However, gradient estimation requires time-consuming experiments, wherein the plant is sequentially pe ...

PERGAMON-ELSEVIER SCIENCE LTD2020

Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach

Shaul Nadav Hallak

This paper introduces a method for computing points satisfying the second-order necessary optimality conditions for nonconvex minimization problems subject to a closed and convex constraint set. The method comprises two independent steps corresponding to t ...

SPRINGER/PLENUM PUBLISHERS2020

Radiative Backpropagation: An Adjoint Method for Lightning-Fast Differentiable Rendering

Wenzel Alban Jakob, Sébastien Nicolas Speierer, Merlin Eléazar Nimier-David

Physically based differentiable rendering has recently evolved into a powerful tool for solving inverse problems involving light. Methods in this area perform a differentiable simulation of the physical process of light transport and scattering to estimate ...

ASSOC COMPUTING MACHINERY2020

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