Publication

Stochastic Exploration of Ambiguities for Non-Rigid Shape Recovery

Publications associées (38)

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

State of the Art in Dense Monocular Non-Rigid 3D Reconstruction

Pascal Fua

3D reconstruction of deformable (or non-rigid) scenes from a set of monocular 2D image observations is a long-standing and actively researched area of computer vision and graphics. It is an ill-posed inverse problem, since-without additional prior assumpti ...

WILEY2023

, , ,

This paper considers the problem of distributed lossy compression where the goal is to recover one or more linear combinations of the sources at the decoder, subject to distortion constraints. For certain configurations, it is known that codes with algebra ...

2023

Robust Isometric Non-Rigid Structure-From-Motion

Shaifali Parashar

Non-Rigid Structure-from-Motion (NRSfM) reconstructs a deformable 3D object from keypoint correspondences established between monocular 2D images. Current NRSfM methods lack statistical robustness, which is the ability to cope with correspondence errors. T ...

IEEE COMPUTER SOC2022

Lidar point-to-point correspondences for rigorous registration of kinematic scanning in dynamic networks

Jan Skaloud, Davide Antonio Cucci, Aurélien Arnaud Brun

With the objective of improving the registration of lidar point clouds produced by kinematic scanning systems, we propose a novel trajectory adjustment procedure that leverages on the automated extraction of selected reliable 3D point–to–point corresponden ...

2022

Computational Inverse Design of Surface-based Inflatables

Mark Pauly, Florin Isvoranu, Tian Chen

We present a computational inverse design method for a new class of surface-based inflatable structure. Our deployable structures are fabricated by fusing together two layers of inextensible sheet material along carefully selected curves. The fusing curves ...

ASSOC COMPUTING MACHINERY2021

Fast Projection Onto Convex Smooth Constraints

Maryam Kamgarpour, Andreas Krause, Ilnura Usmanova

The Euclidean projection onto a convex set is an important problem that arises in numerous constrained optimization tasks. Unfortunately, in many cases, computing projections is computationally demanding. In this work, we focus on projection problems where ...

PMLR2021

Convex optimization in sums of Banach spaces

Michaël Unser, Shayan Aziznejad

We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...

2021

MATHICSE Technical Report: Existence of dynamical low rank approximations for random semi-linear evolutionary equations on the maximal interval

Fabio Nobile, Yoshihito Kazashi

An existence result is presented for the dynamical low rank (DLR) approximation for random semi-linear evolutionary equations. The DLR solution approximates the true solution at each time instant by a linear combination of products of deterministic and sto ...

MATHICSE2020

Existence of dynamical low rank approximations for random semi-linear evolutionary equations on the maximal interval

Fabio Nobile, Yoshihito Kazashi

2020

The coded cooperative data exchange problem is studied for the fully connected network. In this problem, each node initially only possesses a subset of the K packets making up the file. Nodes make broadcast transmissions that are received by all other node ...

2017