Publications de Michael Calonder

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

BRIEF: Computing a Local Binary Descriptor Very Fast

Pascal Fua, Vincent Lepetit, Christoph Strecha, Michael Calonder, Tomasz Piotr Trzcinski, Mustafa Özuysal

Binary descriptors are becoming increasingly popular as a means to compare feature points very fast and while requiring comparatively small amounts of memory. The typical approach to creating them is to first compute floating-point ones, using an algorithm ...

Institute of Electrical and Electronics Engineers2012

Fast Keypoint Recognition using Random Ferns

Pascal Fua, Vincent Lepetit, Michael Calonder, Mustafa Özuysal

While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle perspective distortion. In this paper, we show that formulating the problem in ...

2010

BRIEF: Binary Robust Independent Elementary Features

Pascal Fua, Vincent Lepetit, Christoph Strecha, Michael Calonder

We propose to use binary strings as an efficient feature point descriptor, which we call BRIEF. We show that it is highly discriminative even when using relatively few bits and can be computed using simple intensity difference tests. Furthermore, the descr ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

View-Based Maps

Pascal Fua, Vincent Lepetit, Michael Calonder

Robotic systems that can create and use visual maps in real-time have obvious advantages in many applications, from automatic driving to mobile manipulation in the home. In this paper we describe a mapping system based on retaining stereo views of the envi ...

SAGE Publications2010

Pareto-optimal Dictionaries for Signatures

Pascal Fua, Vincent Lepetit, Michael Calonder

We present an effective method to optimize over the parameters of an image patch descriptor to obtain one that is computationally more efficient while maintaining a high recognition rate. We formulate the optimization problem in a multi-objective manner, w ...

IEEE2010

View-Based Maps

Pascal Fua, Vincent Lepetit, Michael Calonder

Robotic systems that can create and use visual maps in realtime have obvious advantages in many applications, from automatic driving to mobile manipulation in the home. In this paper we describe a mapping system based on retaining views of the environment ...

2009

Compact Signatures for High-speed Interest Point Description and Matching

Pascal Fua, Vincent Lepetit, Michael Calonder

Prominent feature point descriptors such as SIFT and SURF allow reliable real-time matching but at a computational cost that limits the number of points that can be handled on PCs, and even more on less powerful mobile devices. A recently proposed techniqu ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Keypoint Signatures for Fast Learning and Recognition

Pascal Fua, Vincent Lepetit, Michael Calonder

Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the training itself is usually relatively slow and performed offline. Although methods hav ...

2008

Keypoint Signatures for Fast Learning and Recognition

Pascal Fua, Vincent Lepetit, Michael Calonder

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

Michael Calonder

Graph Chatbot

Chattez avec Graph Search

BRIEF: Computing a Local Binary Descriptor Very Fast

Fast Keypoint Recognition using Random Ferns

Robust, High-Speed Interest Point Matching for Real-Time Applications

BRIEF: Binary Robust Independent Elementary Features

View-Based Maps

Pareto-optimal Dictionaries for Signatures

View-Based Maps

Compact Signatures for High-speed Interest Point Description and Matching

Keypoint Signatures for Fast Learning and Recognition

Keypoint Signatures for Fast Learning and Recognition

BRIEF: Computing a Local Binary Descriptor Very Fast

Robust, High-Speed Interest Point Matching for Real-Time Applications

View-Based Maps

View-Based Maps

Compact Signatures for High-speed Interest Point Description and Matching

Keypoint Signatures for Fast Learning and Recognition

Keypoint Signatures for Fast Learning and Recognition

Fast Keypoint Recognition using Random Ferns

BRIEF: Binary Robust Independent Elementary Features

Pareto-optimal Dictionaries for Signatures