Publications related to Bounding volume hierarchy

Comparing the effect of different spine and leg designs for a small, bounding quadruped robot

Auke Ijspeert, Alexander Spröwitz, Peter Eckert

We present Lynx-robot, a quadruped, modular, compliant robot. It features an either directly actuated, singlejoint spine design, or an actively supported, passive compliant, multi-joint spine configuration. This study aims at characterizing these two, larg ...

2014

On the Need for Secure Distance-Bounding

Serge Vaudenay, Aikaterini Mitrokotsa

Distance-bounding is a practical solution to prevent relay attacks. Yet, security models are not well-established. We will briefly show recent techniques that expose serious distance-frauds, mafia-frauds, and/or terrorist-frauds on distance-bounding protoc ...

2013

From Discrete Measurements to Bounded Gradient Estimates: A Look at Some Regularizing Structures

Dominique Bonvin, Grégory François, Gene Bunin

Obtaining a reliable gradient estimate for an unknown function when given only its discrete measurements is a common problem in many engineering disciplines. While there are many approaches to obtaining an estimate of a gradient, obtaining lower and upper ...

American Chemical Society2013

A Polynomial-Time Solution Scheme for Quadratic Stochastic Programs

Daniel Kuhn

We consider quadratic stochastic programs with random recourse—a class of problems which is perceived to be computationally demanding. Instead of using mainstream scenario tree-based techniques, we reduce computational complexity by restricting the space o ...

2013

On Secure and Precise IR-UWB Ranging

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Panagiotis Papadimitratos, Marcin Poturalski, Manuel Flury

To provide high ranging precision in multipath environments, a ranging protocol should find the first arriving path, rather than the strongest path. We demonstrate a new attack vector that disrupts such precise Time-of-Arrival (ToA) estimation, and allows ...

Institute of Electrical and Electronics Engineers2012

Lower Bounds on the Area Requirements of Series-Parallel Graphs

Fabrizio Frati

We show that there exist series-parallel graphs requiring Omega(n2(root log n)) area in any straight-line or poly-line grid drawing. Such a result is achieved in two steps. First, we show that, in any straight-line or poly-line drawing of K-2,K-n, one side ...

2011

An Alternative Scanning Strategy to Detect Faces

Sébastien Marcel, Venkatesh Bala Subburaman

The sliding window approach is the most widely used technique to detect faces in an image. Usually a classifier is applied on a regular grid and to speed up the scanning, the grid spacing is increased, which increases the number of miss detections. In this ...

2010

Fast Bounding Box Estimation based Face Detection

Sébastien Marcel, Venkatesh Bala Subburaman

The sliding window approach is the most widely used technique to detect an object from an image. In the past few years, classifiers have been improved in many ways to increase the scanning speed. Apart from the classifier design (such as cascade), the scan ...

2010

Fast Bounding Box Estimation based Face Detection

Sébastien Marcel, Venkatesh Bala Subburaman

The sliding window approach is the most widely used technique to detect an object from an image. In the past few years, classifiers have been improved in many ways to increase the scanning speed. Apart from the classifier design (such as cascade), the scan ...

Idiap2010

Pose Estimation for Category Specific Multiview Object Localization

Pascal Fua, Vincent Lepetit, Mustafa Özuysal

We propose an approach to overcome the two main challenges of 3D multiview object detection and localization: The variation of object features due to changes in the viewpoint and the variation in the size and aspect ratio of the object. Our approach procee ...

IEEE2009

Bounding volume hierarchy

Comparing the effect of different spine and leg designs for a small, bounding quadruped robot

On the Need for Secure Distance-Bounding

From Discrete Measurements to Bounded Gradient Estimates: A Look at Some Regularizing Structures

A Polynomial-Time Solution Scheme for Quadratic Stochastic Programs

On Secure and Precise IR-UWB Ranging

Lower Bounds on the Area Requirements of Series-Parallel Graphs

An Alternative Scanning Strategy to Detect Faces

Fast Bounding Box Estimation based Face Detection

Fast Bounding Box Estimation based Face Detection

Pose Estimation for Category Specific Multiview Object Localization

Graph Chatbot

Chat with Graph Search

An Alternative Scanning Strategy to Detect Faces

A Polynomial-Time Solution Scheme for Quadratic Stochastic Programs

From Discrete Measurements to Bounded Gradient Estimates: A Look at Some Regularizing Structures

On the Need for Secure Distance-Bounding

Comparing the effect of different spine and leg designs for a small, bounding quadruped robot

Fast Bounding Box Estimation based Face Detection

Fast Bounding Box Estimation based Face Detection

Pose Estimation for Category Specific Multiview Object Localization

Lower Bounds on the Area Requirements of Series-Parallel Graphs

On Secure and Precise IR-UWB Ranging