Publications related to Monocular 3-D Tracking of the Golf Swing

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

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

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

SHAPE: Linear-Time Camera Pose Estimation With Quadratic Error-Decay

Martin Vetterli, Adam James Scholefield, Alireza Ghasemi

We propose a novel camera pose estimation or perspective-n-point (PnP) algorithm, based on the idea of consistency regions and half-space intersections. Our algorithm has linear time-complexity and a squared reconstruction error that decreases at least qua ...

Ieee2016

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

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

Heat recovery networks synthesis of large-scale industrial sites: Heat load distribution problem with virtual process subsystems

François Maréchal, Nasibeh Pouransari

This paper presents a targeting strategy to design a heat recovery network for an industrial plant by dividing the system into subsystems while considering the heat transfer opportunities between them. The methodology is based on a sequential approach. The ...

Elsevier2015

IMU Preintegration on Manifold for Efficient Visual-Inertial Maximum-a-Posteriori Estimation

Davide Scaramuzza

Recent results in monocular visual-inertial navigation (VIN) have shown that optimization-based approaches outperform filtering methods in terms of accuracy due to their capability to relinearize past states. However, the improvement comes at the cost of i ...

2015

Modified group delay feature based total variability space modelling for speaker recognition

In this paper, modified group delay (MODGD) features are used to model target speakers in the Total Variability Space (TVS) framework for speaker recognition. MODGD based features have been shown to improve speaker recognition performance owing to the abil ...

2015

Monocular 3-D Tracking of the Golf Swing

Graph Chatbot

Chat with Graph Search

Extreme Image Completion

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

A Comment on “Computational Complexity of Stochastic Programming Problems”

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

SHAPE: Linear-Time Camera Pose Estimation With Quadratic Error-Decay

Phase Transitions in Group Testing

K-Adaptability in Two-Stage Robust Binary Programming

Heat recovery networks synthesis of large-scale industrial sites: Heat load distribution problem with virtual process subsystems

IMU Preintegration on Manifold for Efficient Visual-Inertial Maximum-a-Posteriori Estimation

Modified group delay feature based total variability space modelling for speaker recognition

A Comment on “Computational Complexity of Stochastic Programming Problems”

Modified group delay feature based total variability space modelling for speaker recognition

Extreme Image Completion

Heat recovery networks synthesis of large-scale industrial sites: Heat load distribution problem with virtual process subsystems

IMU Preintegration on Manifold for Efficient Visual-Inertial Maximum-a-Posteriori Estimation

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

Phase Transitions in Group Testing

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

SHAPE: Linear-Time Camera Pose Estimation With Quadratic Error-Decay

K-Adaptability in Two-Stage Robust Binary Programming