Publications related to Autofocus for Digital Fresnel Holograms by Use of a Fresnelet-Sparsity Criterion

Blind as a bat: spatial perception without sight

Among our five senses, we rely mostly on audition and vision to perceive an environment. Our ears are able to detect stimuli from all directions, especially from obstructed and far-away objects. Even in smoke, harsh weather conditions, or at night â situ ...

EPFL2021

An Improved Analysis of Local Search for Max-Sum Diversification

Friedrich Eisenbrand, Rico Zenklusen, Alfonso Bolívar Cevallos Manzano

We present new techniques to analyze natural local search algorithms for several variants of the max-sum diversification problem which, in its most basic form, is as follows: given an n-point set X subset of R-d and an integer k, select k points in X so th ...

INFORMS2019

Formal Analysis of Distance Bounding with Secure Hardware

Serge Vaudenay, Handan Kilinç Alper

A distance bounding (DB) protocol is a two-party authentication protocol between a prover and a verifier which is based on the distance between the prover and the verifier. It aims to defeat threats by malicious provers who try to convince that they are cl ...

2018

Omnidirectional bats, point-to-plane distances, and the price of uniqueness

Martin Vetterli, Ivan Dokmanic, Miranda Krekovic

We study simultaneous localization and mapping with a device that uses reflections to measure its distance from walls. Such a device can be realized acoustically with a synchronized collocated source and receiver; it behaves like a bat with no capacity for ...

Ieee2017

From Tarski's Plank Problem to Simultaneous Approximation

János Pach, Andrei Kupavskii

A slab (or plank) is the part of the d-dimensional Euclidean space that lies between two parallel hyperplanes. The distance between the these hyperplanes is called the width of the slab. It is conjectured that the members of any infinite family of slabs wi ...

Mathematical Assoc Amer2017

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

Space lower bounds for low-stretch greedy embeddings

Christos Kalaitzis

Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...

Elsevier Science Bv2016

Indoor localization method and system

Martin Vetterli, Reza Parhizkar, Gilles Baechler

An indoor localization method for estimating the location of nodes (n1, n2), at least one node (n1) being connected to at least another node (n2) by at least two different channels (ch1, ch1′), comprising the following steps: measuring a distance between t ...

2015

Towards an incoherent off-axis digital holographic microscope

Christian Depeursinge, Frédéric Montfort

We propose and experimentally demonstrate a system in which off-axis digital holographic microscopy is realized using a broadband illumination source. Single-shot holographic measurements are enabled, while the coherence noise is removed thanks to the broa ...

Spie-Int Soc Optical Engineering2015

Theoretical Analysis of Euclidean Distance Matrix Completion for Ad hoc Microphone Array Calibration

Mohammadjavad Taghizadeh

We consider the problem of ad~hoc microphone array calibration where the distance matrix consisted of all microphones pairwise distances have entries missing corresponding to distances greater than

d_{\text{max}}

. Furthermore, the known entries are noisy ...

Idiap2014

Autofocus for Digital Fresnel Holograms by Use of a Fresnelet-Sparsity Criterion

Graph Chatbot

Chat with Graph Search

Blind as a bat: spatial perception without sight

An Improved Analysis of Local Search for Max-Sum Diversification

Formal Analysis of Distance Bounding with Secure Hardware

Omnidirectional bats, point-to-plane distances, and the price of uniqueness

From Tarski's Plank Problem to Simultaneous Approximation

Approximation algorithms for geometric dispersion

Space lower bounds for low-stretch greedy embeddings

Indoor localization method and system

Towards an incoherent off-axis digital holographic microscope

Theoretical Analysis of Euclidean Distance Matrix Completion for Ad hoc Microphone Array Calibration

An Improved Analysis of Local Search for Max-Sum Diversification

Formal Analysis of Distance Bounding with Secure Hardware

Blind as a bat: spatial perception without sight

From Tarski's Plank Problem to Simultaneous Approximation

Approximation algorithms for geometric dispersion

Space lower bounds for low-stretch greedy embeddings

Theoretical Analysis of Euclidean Distance Matrix Completion for Ad hoc Microphone Array Calibration

Omnidirectional bats, point-to-plane distances, and the price of uniqueness

Towards an incoherent off-axis digital holographic microscope

Indoor localization method and system