Publication

BRIEF: Binary Robust Independent Elementary Features

Pascal Fua, Vincent Lepetit, Christoph Strecha, Michael Calonder
2010
Conference Papers

Abstract

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 descriptor similarity can be evaluated using the Hamming distance, which is very efficient to compute, instead of the L-2 norm as is usually done.

Official source

https://infoscience.epfl.ch/entities/publication/6206c1ef-8c33-43ef-ab5a-3221892fd43f

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

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.

BRIEF: Binary Robust Independent Elementary Features

Chat with Graph Search

A Gapless Post-quantum Hash Proof System in the Hamming Metric

Geometric Variational Models for Inverse Problems in Imaging

LDAHash: Improved Matching with Smaller Descriptors