Publications related to Keypoint Recognition using Randomized Trees

Practicality and time complexity of a sparsified RNA folding algorithm

Philipp Bucher, Slavica Dimitrieva Janeva

Commonly used RNA folding programs compute the minimum free energy structure of a sequence under the pseudoknot exclusion constraint. They are based on Zuker's algorithm which runs in time O(n^3). Recently, it has been claimed that RNA folding can be achie ...

2012

Scale Invariant Features and Polar Descriptors in Omnidirectional Imaging

Pascal Frossard, Zafer Arican

We propose a method to compute scale invariant features in omnidirectional images. We present a formulation based on Riemannian geometry for the definition of differential operators on non-Euclidian manifolds that describe the mirror and lens structure in ...

Institute of Electrical and Electronics Engineers2012

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

Springer Verlag2012

FREAK: Fast Retina Keypoint

Pierre Vandergheynst, Alexandre Massoud Alahi, Raphaël Ortiz

A large number of vision applications rely on matching keypoints across images. The last decade featured an arms-race towards faster and more robust keypoints and association algorithms: Scale Invariant Feature Transform (SIFT), Speed-up Robust Feature (SU ...

Ieee2012

Efficient Large Scale Multi-View Stereo for Ultra High Resolution Image Sets

Pascal Fua, Christoph Strecha, Engin Tola

We present a new approach for large scale multi-view stereo matching, which is designed to operate on ultra high resolution image sets and efficiently compute dense 3D point clouds. We show that, by using a robust descriptor for matching purposes and high ...

Springer Verlag2012

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

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

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

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

Scale Invariant Features and Polar Descriptors in Omnidirectional Imaging

Pascal Frossard, Zafer Arican

We propose a method to compute scale invariant features in omnidirectional images. We present a formulation based on Riemannian geometry for the definition of differential operators on non-Euclidian manifolds that describe the mirror and lens structure in ...

2010

Sampling-aware Polar Descriptors on the Sphere

Pascal Frossard, Zafer Arican

We present a new descriptor and feature matching solution for omnidirectional images. The descriptor builds on the log-polar planar descriptors, but adapts to the specific geometry and non-uniform sampling density of spherical images. We further propose a ...

2010

Keypoint Recognition using Randomized Trees

Graph Chatbot

Chat with Graph Search

Practicality and time complexity of a sparsified RNA folding algorithm

Scale Invariant Features and Polar Descriptors in Omnidirectional Imaging

Generating Fast Indulgent Algorithms

FREAK: Fast Retina Keypoint

Efficient Large Scale Multi-View Stereo for Ultra High Resolution Image Sets

SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

Generating Fast Indulgent Algorithms

Fast Keypoint Recognition using Random Ferns

Scale Invariant Features and Polar Descriptors in Omnidirectional Imaging

Sampling-aware Polar Descriptors on the Sphere

Generating Fast Indulgent Algorithms

Fast Keypoint Recognition using Random Ferns

SCOOP: A Real-Time Sparsity Driven People Localization Algorithm

Scale Invariant Features and Polar Descriptors in Omnidirectional Imaging

Practicality and time complexity of a sparsified RNA folding algorithm

FREAK: Fast Retina Keypoint

Generating Fast Indulgent Algorithms

Scale Invariant Features and Polar Descriptors in Omnidirectional Imaging

Sampling-aware Polar Descriptors on the Sphere

Efficient Large Scale Multi-View Stereo for Ultra High Resolution Image Sets