Sciweavers

32 search results - page 1 / 7
» BRIEF: Computing a Local Binary Descriptor Very Fast
Sort
View
PAMI
2012
11 years 7 months ago
BRIEF: Computing a Local Binary Descriptor Very Fast
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...
Michael Calonder, Vincent Lepetit, Mustafa Öz...
ECCV
2010
Springer
13 years 9 months ago
BRIEF: Binary Robust Independent Elementary Features
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...
ECCV
2010
Springer
13 years 8 months ago
Binary coherent edge descriptors
Patch descriptors are used for a variety of tasks ranging from finding corresponding points across images, to describing object category parts. In this paper, we propose an image ...
PODC
2010
ACM
13 years 8 months ago
Brief announcement: complexity and solution of the send-receive correlation problem
During the analysis of packet log files from network experiments, the question arises which received packet belongs to which of the potentially many binary identical send events....
Benito van der Zander, Egon Wanke, Wolfgang Kie&sz...
ICPR
2010
IEEE
13 years 5 months ago
Local Rotation Invariant Patch Descriptors for 3D Vector Fields
In this paper, we present two novel methods for the fast computation of local rotation invariant patch descriptors for 3D vectorial data. Patch based algorithms have recently becom...
Fehr Janis