Publication

Scale-invariant representation of light field images for object recognition and tracking

Related publications (49)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

LDAHash: Improved Matching with Smaller Descriptors

Pascal Fua, Christoph Strecha

SIFT-like local feature descriptors are ubiquitously employed in computer vision applications such as content-based retrieval, video analysis, copy detection, object recognition, photo tourism, and 3D reconstruction. Feature descriptors can be designed to ...

Institute of Electrical and Electronics Engineers2012

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

Randomized versus Deterministic Implementations of Concurrent Data Structures

Dan Alistarh

One of the key trends in computing over the past two decades has been increased distribution, both at the processor level, where multi-core architectures are now the norm, and at the system level, where many key services are currently distributed overmulti ...

EPFL2012

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

The complexity of robust atomic storage

Rachid Guerraoui, Marko Vukolic

We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolerating the largest possible number t of Byzantine storage component failures ( ...

ACM Press2011

Rotation, Scale and Translation invariant image retrieval method based on Circular Segmentation and Color Density

Pierre-André Farine, Sara Grassi Pauletti, Pradyumna Ayyalasomayajula

We propose a fast and efficient method for Content Based Image Retrieval (CBIR) which uses color densities within concentric circular zones of the image, encompassing edge-pixels. This method is invariant to Rotation, Scale and Translation (RST). Small-siz ...

IEEE2011

Low complexity RST invariant image recognition using Fourier Mellin transform

Pierre-André Farine, Sara Grassi Pauletti, Pradyumna Ayyalasomayajula

In this paper we propose a low complexity method for Rotation, Scale and Translation (RST) invariant content-based image retrieval, suitable for a handheld image recognition device. The RST compensation method is based on Fourier-Mellin Transform (FMT) whi ...

EURASIP2011

Object Duplicate Detection

Péter Vajda

With the technological evolution of digital acquisition and storage technologies, millions of images and video sequences are captured every day and shared in online services. One way of exploring this huge volume of images and videos is through searching a ...

EPFL2011

Complexity of the critical node problem over trees

Marco Di Summa

In this paper we deal with the critical node problem (CNP), i.e., the problem of searching for a given number K of nodes in a graph G, whose removal minimizes the (weighted or unweighted) number of connections between pairs of nodes in the residual graph. ...

2011

LDAHash: Improved matching with smaller descriptors

Pascal Fua, Christoph Strecha

SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications as content-based retrieval, video analysis, copy detection, object recognition, photo-tourism and 3D reconstruction. Feature descriptors can be designed to b ...

2010