Publications related to Computational geometry

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

Real-time model learning using Incremental Sparse Spectrum Gaussian Process Regression

Novel applications in unstructured and non-stationary human environments require robots that learn from experience and adapt autonomously to changing conditions. Predictive models therefore not only need to be accurate, but should also be updated increment ...

2013

Graph-Based vs Depth-Based Data Representation for Multiview Images

Pascal Frossard, Thomas Maugey

In this paper, we propose a representation and coding method for multiview images. As an alternative to depth-based schemes, we propose a representation that captures the geometry and the dependencies between pixels in different views in the form of connec ...

2013

Convex computation of the region of attraction of polynomial control systems

Milan Korda

We address the long-standing problem of computing the region of attraction (ROA) of a target set (typically a neighborhood of an equilibrium point) of a controlled nonlinear system with polynomial dynamics and semialgebraic state and input constraints. We ...

2013

Fabrication-aware Design with Intersecting Planar Pieces

Mark Pauly, Yuliy Gennadievich Schwartzburg

We propose a computational design approach to generate 3D models composed of interlocking planar pieces. We show how intricate 3D forms can be created by sliding the pieces into each other along straight slits, leading to a simple construction that does no ...

Blackwell Publishing2013

Randomized recovery for boolean compressed sensing

Martin Vetterli, Mitra Fatemi

We consider the problem of boolean compressed sensing, which is alternatively known as group testing. The goal is to recover a small number of defective items in a large set from a few collective binary tests. This problem can be formulated as a binary lin ...

2013

To Convexify or Not? Regression with Clustering Penalties on Graphs

Volkan Cevher, Luca Baldassarre, Marwa El Halabi

We consider minimization problems that are compositions of convex functions of a vector

\x \in\reals^N

with submodular set functions of its support (i.e., indices of the non-zero coefficients of

\x

). Such problems are in general difficult for large

N

...

IEEE2013

Convex computation of the maximum controlled invariant set for discrete-time polynomial control systems

Colin Neil Jones, Milan Korda

We characterize the maximum controlled invariant (MCI) set for discrete-time systems as the solution of an infinite-dimensional linear programming problem. In the case of systems with polynomial dynamics and semialgebraic state and control constraints, we ...

2013

SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

Pierre Vandergheynst, Alexandre Massoud Alahi, Mohammad Golbabaee

Detecting and tracking people in scenes monitored by cameras is an important step in many application scenarios such as surveillance, urban planning or behavioral studies to name a few. The amount of data produced by camera feeds is so large that it is als ...

Springer Verlag2012

A Fast Parts-Based Approach to Speaker Verification Using Boosted Slice Classifiers

Sébastien Marcel, Mathew Magimai Doss, Anindya Roy

Speaker verification (SV) on portable devices like smartphones is gradually becoming popular. In this context, two issues need to be considered: 1) such devices have relatively limited computation resources, and 2) they are liable to be used everywhere, po ...

2012

Computational geometry

Graph Chatbot

Chat with Graph Search

Sparse Iterative Closest Point

Real-time model learning using Incremental Sparse Spectrum Gaussian Process Regression

Graph-Based vs Depth-Based Data Representation for Multiview Images

Convex computation of the region of attraction of polynomial control systems

Fabrication-aware Design with Intersecting Planar Pieces

Randomized recovery for boolean compressed sensing

To Convexify or Not? Regression with Clustering Penalties on Graphs

Convex computation of the maximum controlled invariant set for discrete-time polynomial control systems

SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

A Fast Parts-Based Approach to Speaker Verification Using Boosted Slice Classifiers

Real-time model learning using Incremental Sparse Spectrum Gaussian Process Regression

Graph-Based vs Depth-Based Data Representation for Multiview Images

Randomized recovery for boolean compressed sensing

Fabrication-aware Design with Intersecting Planar Pieces

Convex computation of the region of attraction of polynomial control systems

Convex computation of the maximum controlled invariant set for discrete-time polynomial control systems

To Convexify or Not? Regression with Clustering Penalties on Graphs

SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

A Fast Parts-Based Approach to Speaker Verification Using Boosted Slice Classifiers

Sparse Iterative Closest Point