Tomasz Piotr Trzcinski

This person is no longer with EPFL

About
Privacy
Disclaimer

Graph Chatbot

Related publications (6)

Learning Image Descriptors with Boosting

Vincent Lepetit, Tomasz Piotr Trzcinski, Christos Marios Christoudias

We propose a novel and general framework to learn compact but highly discriminative floating-point and binary local feature descriptors. By leveraging the boosting-trick we first show how to efficiently train a compact floating-point descriptor that is ver ...

Institute of Electrical and Electronics Engineers2015

Learning and Matching Binary Local Feature Descriptors

Tomasz Piotr Trzcinski

EPFL2014

Boosting Binary Keypoint Descriptors

Pascal Fua, Vincent Lepetit, Tomasz Piotr Trzcinski, Christos Marios Christoudias

Binary keypoint descriptors provide an efficient alternative to their floating-point competitors as they enable faster processing while requiring less memory. In this paper, we propose a novel framework to learn an extremely compact binary descriptor we ca ...

2013

BRIEF: Computing a Local Binary Descriptor Very Fast

Pascal Fua, Vincent Lepetit, Mustafa Özuysal, Michael Calonder, Christoph Strecha, Tomasz Piotr Trzcinski

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 to creating them is to first compute floating-point ones, using an algorithm ...

Institute of Electrical and Electronics Engineers2012

Learning Image Descriptors with the Boosting-Trick

Pascal Fua, Vincent Lepetit, Tomasz Piotr Trzcinski, Christos Marios Christoudias

In this paper we apply boosting to learn complex non-linear local visual feature representations, drawing inspiration from its successful application to visual object detection. The main goal of local feature descriptors is to distinctively repre- sent a s ...

2012

Thick Boundaries in Binary Space and Their Influence on Nearest-Neighbor Search

Pascal Fua, Vincent Lepetit, Tomasz Piotr Trzcinski

Binary descriptors allow faster similarity computation than real-valued ones while requiring much less storage. As a result, many algorithms have recently been proposed to binarize ﬂoating-point descriptors so that they can be searched for quickly. Unfortu ...

Elsevier2012

Page 1 of 1