Publications related to Spatial Fringe Analysis Methods and their Application to Holographic Interferometry and Fringe Projection Techniques

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.

Stable Fractional Matchings

Aris Filos Ratsikas

We study a generalization of the classical stable matching problem that allows for cardinal preferences (as opposed to ordinal) and fractional matchings (as opposed to integral). After observing that, in this cardinal setting, stable fractional matchings c ...

ASSOC COMPUTING MACHINERY2019

Super Resolution Phase Retrieval for Sparse Signals

Martin Vetterli, Juri Ranieri, Gilles Baechler, Amina Chebira, Miranda Krekovic

In a variety of fields, in particular those involving imaging and optics, we often measure signals whose phase is missing or has been irremediably distorted. Phase retrieval attempts to recover the phase information of a signal from the magnitude of its Fo ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018

Optimal Representations for Adaptive Streaming in Interactive Multiview Video Systems

Pascal Frossard, Laura Toni

Interactive multiview video streaming (IMVS) services permit to remotely navigate within a 3D scene with an immersive experience. This is possible by transmitting a set of reference camera views (anchor views), which are used by the clients to freely navig ...

Ieee-Inst Electrical Electronics Engineers Inc2017

A Comment on “Computational Complexity of Stochastic Programming Problems”

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

Although stochastic programming problems were always believed to be computationally challenging, this perception has only recently received a theoretical justification by the seminal work of Dyer and Stougie (Mathematical Programming A, 106(3):423–432, 200 ...

Springer Heidelberg2016

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

We propose to approximate two-stage distributionally robust programs with binary recourse decisions by their associated K-adaptability problems, which pre-select K candidate second-stage policies here-and-now and implement the best of these policies once t ...

Elsevier Science Bv2016

Estimation of Phase and Its Higher Order Derivatives from a Single Complex Interferogram

Pramod Rastogi, Rishikesh Dilip Kulkarni

This paper reports a method for the simultaneous estimation of unwrapped phase and higher order phase derivatives from a single phase fringe pattern recorded in an optical interferometric setup, thereby overcoming substantial barriers to achieving such mea ...

2016

Weyl and Ricci gauging from the coset construction

Alexander Monin, Georgios Karananas

In this paper we demonstrate how, using the coset construction, a theory can be systematically made Weyl invariant by gauging the scale symmetry. We show that an analog of the inverse Higgs constraint allows the elimination of the Weyl vector (gauge) field ...

Amer Physical Soc2016

K-Adaptability in Two-Stage Robust Binary Programming

Daniel Kuhn, Grani Adiwena Hanasusanto, Wolfram Wiesemann

Over the last two decades, robust optimization has emerged as a computationally attractive approach to formulate and solve single-stage decision problems affected by uncertainty. More recently, robust optimization has been successfully applied to multi-sta ...

Informs2015

Matrix Recipes for Hard Thresholding Methods

Volkan Cevher, Anastasios Kyrillidis

In this paper, we present and analyze a new set of low-rank recovery algorithms for linear inverse problems within the class of hard thresholding methods. We provide strategies on how to set up these algorithms via basic ingredients for different configura ...

Springer Verlag2014