Publication

Stochastic Exploration of Ambiguities for Non-Rigid Shape Recovery

Related publications (38)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Complex pattern projection through a multimode fiber

Demetri Psaltis, Christophe Moser, Damien Claude-Marie Loterie, Salma Farahi

Wavefront shaping through multimode fibers has many interesting applications, such as micromanipulation and endoscopy, where the small diameter of fibers is an advantage in terms of miniaturization. However, pattern projection can suffer from deleterious i ...

Spie-Int Soc Optical Engineering2015

Rotation-Covariant Texture Learning Using Steerable Riesz Wavelets

Dimitri Nestor Alice Van De Ville, Adrien Raphaël Depeursinge

We propose a texture learning approach that exploits local organizations of scales and directions. First, linear combinations of Riesz wavelets are learned using kernel support vector machines. The resulting texture signatures are modeling optimal class-wi ...

Institute of Electrical and Electronics Engineers2014

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

, , , ,

Mesh editing under constraints is a challenging task with numerous applications in geometric modeling, industrial design, and architectural form finding. Recent methods support constraint-based exploration of meshes with fixed connectivity, but commonly la ...

Wiley-Blackwell2013

Using the Riemann Hypothesis over finite fields and bounds for the size of spherical codes, we give explicit upper bounds, of polynomial size with respect to the size of the field, for the number of geometric isomorphism classes of geometrically irreducibl ...

International Press2013

Sparse Iterative Closest Point

Mark Pauly, Sofien Bouaziz, Andrea Tagliasacchi

Rigid registration of two geometric data sets is essential in many applications, including robot navigation, surface reconstruction, and shape matching. Most commonly, variants of the Iterative Closest Point (ICP) algorithm are employed for this task. Thes ...

Wiley-Blackwell2013

Resolving Ambiguities in Monocular 3D Reconstruction of Deformable Surfaces

Aydin Varol

In this thesis, we focus on the problem of recovering 3D shapes of deformable surfaces from a single camera. This problem is known to be ill-posed as for a given 2D input image there exist many 3D shapes that give visually identical projections. We present ...

EPFL2012

We introduce a systematic and practical design for steerable wavelet frames in 3D. Our steerable wavelets are obtained by applying a 3D version of the generalized Riesz transform to a primary isotropic wavelet frame. The novel transform is self-reversible ...

Institute of Electrical and Electronics Engineers2012

A constraint sampling approach for multi-stage robust optimization

Daniel Kuhn

We propose a tractable approximation scheme for convex (not necessarily linear) multi-stage robust optimization problems. We approximate the adaptive decisions by finite linear combinations of prescribed basis functions and demonstrate how one can optimize ...

Elsevier2012

When implementing high-order surface impedance boundary conditions in collocation boundary element method (BEM) with constant or linear elements, difficulties arise due to the computation of the curvature of the conductors and of the tangential derivatives ...

2012