Publication

Mirror Match: Reliable Feature Point Matching Without Geometric Constraints

Related publications (68)

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.

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

Disparity Search Range Estimation: Enforcing Temporal Consistency

Zafer Arican

This paper presents a new approach for estimating the disparity search range in stereo video that enforces temporal consistency. Reliable search range estimation is very important since an incorrect estimate causes most stereo matching methods to get trapp ...

2010

Detecting the Origin of Text Segments Efficiently

Monika Henzinger

In the origin detection problem an algorithm is given a set S of documents, ordered by creation time, and a query document D. It needs to output for every consecutive sequence of k alphanumeric terms in D the earliest document in S in which the sequence ap ...

ACM2009

Through thickness air permeability of prepregs during cure

Véronique Michaud, Sandra Sequeira Lopes Tavares

An experimental method based on a falling pressure measurement is proposed to evaluate the through thickness air permeability of prepregs during cure, with two set-up variants. One concerns the measurement of the inherent air permeability and the other app ...

2009

A Topological Treatment of Early-Deciding Set-Agreement

Rachid Guerraoui, Bastian Pochon

The k-set-agreement problem consists for a set of n processes to agree on less than k among n possibly different Values, each initially known to only one process. The problem is at the heart of distributed computing and generalizes the celebrated consensus ...

2009

A collaborative approach to image segmentation and behavior recognition from image sequences

Laura Ioana Gui

Visual behavior recognition is currently a highly active research area. This is due both to the scientific challenge posed by the complexity of the task, and to the growing interest in its applications, such as automated visual surveillance, human-computer ...

EPFL2008

Fully Reversible Image Rotation by 1-D Filtering

Dimitri Nestor Alice Van De Ville

In this work, we propose a new image rotation algorithm. The main feature of our approach is the symmetric reversibility, which means that when using the same algorithm for the converse operation, then the initial data is recovered exactly. To that purpose ...

IEEE2008

Diffusion LMS algorithms with information exchange

Ali H. Sayed

We consider the problem of distributed estimation, where a set of nodes are required to collectively estimate some parameter of interest. We motivate and propose new versions of the diffusion LMS algorithm, including a version that outperforms previous sol ...

IEEE2008

Illuminant retrieval for fixed location cameras

Sabine Süsstrunk, Joanna Marguier

Fixed location cameras, such as panoramic cameras or surveillance cameras, are very common. In images taken with these cameras, there will be changes in lighting and dynamic image content, but there will also be constant objects in the background. We propo ...

2008

Segmenting memory colours

Sabine Süsstrunk, Francisco Estrada

Memory colours refer to the colour of specific image classes that have the essential attribute of being perceived in a consistent manner by human observers. In colour correction or rendering tasks, this consistency implies that they have to be faithfully r ...

2008