Publications related to Moving horizon partition-based state estimation of large-scale systems

The complexity of error metrics

Approximate computing exploits the fact that many applications do not require the results to be exact but not to exceed a threshold in a given error metric. Algorithms in approximate computing require to compute the error of the approximation in order to m ...

ELSEVIER SCIENCE BV2018

Perception-aware Receding Horizon Navigation for MAVs

Davide Scaramuzza

To reach a given destination safely and accurately, a micro aerial vehicle needs to be able to avoid obstacles and minimize its state estimation uncertainty at the same time. To achieve this goal, we propose a perception-aware receding horizon approach. In ...

2018

Extreme Image Completion

Sabine Süsstrunk, Radhakrishna Achanta, Nikolaos Arvanitopoulos Darginis

It is challenging to complete an image whose 99 percent pixels are randomly missing. We present a solution to this extreme image completion problem. As opposed to existing techniques, our solution has a computational complexity that is linear in the number ...

Ieee2017

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Michaël Unser, Martin Kurt Storath

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

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

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

Phase Transitions in Group Testing

Volkan Cevher, Jonathan Mark Scarlett

The group testing problem consists of determining a sparse subset of a set of items that are ``defective'' based on a set of possibly noisy tests, and arises in areas such as medical testing, fault detection, communication protocols, pattern matching, and ...

2016

Optimized Packet Scheduling in Multiview Video Navigation Systems

Pascal Frossard, Thomas Maugey, Laura Toni

In multiview video systems, multiple cameras generally acquire the same scene from different perspectives, such that users have the possibility to select their preferred viewpoint. This results in large amounts of highly redundant data, which needs to be p ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Rigorous optimization recipes for sparse and low rank inverse problems with applications in data sciences

Anastasios Kyrillidis

Many natural and man-made signals can be described as having a few degrees of freedom relative to their size due to natural parameterizations or constraints; examples include bandlimited signals, collections of signals observed from multiple viewpoints in ...

EPFL2014

Packet Scheduling in Multicamera Capture Systems

Pascal Frossard, Thomas Maugey, Laura Toni

In multiview video services, multiple cameras acquire the same scene from different perspectives, which results in correlated video streams. This generates large amounts of highly redundant data, which need to be properly handled during encoding and transm ...

2014

Moving horizon partition-based state estimation of large-scale systems

Graph Chatbot

Chat with Graph Search

The complexity of error metrics

Perception-aware Receding Horizon Navigation for MAVs

Extreme Image Completion

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

A Comment on “Computational Complexity of Stochastic Programming Problems”

Phase Transitions in Group Testing

Optimized Packet Scheduling in Multiview Video Navigation Systems

Rigorous optimization recipes for sparse and low rank inverse problems with applications in data sciences

Packet Scheduling in Multicamera Capture Systems

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

The complexity of error metrics

Rigorous optimization recipes for sparse and low rank inverse problems with applications in data sciences

Perception-aware Receding Horizon Navigation for MAVs

Extreme Image Completion

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

A Comment on “Computational Complexity of Stochastic Programming Problems”

Phase Transitions in Group Testing

Packet Scheduling in Multicamera Capture Systems

Optimized Packet Scheduling in Multiview Video Navigation Systems