1 / 13

BRIEF Computing a Local Binary Descriptor Very Fast

BRIEF Computing a Local Binary Descriptor Very Fast. Published in: Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:34 ,  Issue: 7  ) Michael Calonder , Vincent Lepetit , Mustafa O¨ zuysal , Tomasz Trzcinski , Christoph Strecha , and Pascal Fua , Fellow, IEEE.

nay
Download Presentation

BRIEF Computing a Local Binary Descriptor Very Fast

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. BRIEFComputing a Local Binary Descriptor Very Fast Published in:Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:34 ,  Issue: 7 ) Michael Calonder, Vincent Lepetit, Mustafa O¨ zuysal, Tomasz Trzcinski, ChristophStrecha, and Pascal Fua, Fellow, IEEE

  2. outline • INTRODUCTION • METHOD • ANALYSIS • RESULTS

  3. INTRODUCTION • SIFTkeypoint detector and descriptor 、以及SURF，雖然已經超過十年，但是被證明非常成功的應用在一些影像處理上，包括物體識別、圖像拼接、視覺映射等。但是它們運算量都較為龐大。

  4. METHOD • Binary test • BRIEF descriptor • For each S*S patch • Smooth it • Pick pixels using pre-defined binary tests

  5. TABLE • Invariance Properties of SURF, SIFT, • and the Four Different BRIEF Variants 尺度不變性 旋轉不變性

  6. ANALYSIS

  7. RESULTS

More Related