articleNov 1, 2011GREEN OA

BRISK: Binary Robust invariant scalable keypoints

ETH Zurich

Indexed incrossrefdatacite

Abstract

Effective and efficient generation of keypoints from an image is a well-studied problem in the literature and forms the basis of numerous Computer Vision applications. Established leaders in the field are the SIFT and SURF algorithms which exhibit great performance under a variety of image transformations, with SURF in particular considered as the most computationally efficient amongst the high-performance methods to date. In this paper we propose BRISK 1 , a novel method for keypoint detection, description and matching. A comprehensive evaluation on benchmark datasets reveals BRISK's adaptive, high quality performance as in state-of-the-art algorithms, albeit at a dramatically lower computational cost (an…

Citation impact

3,411
total citations
FWCI
3618.63
Percentile
100%
References
21
Citations per year

Authors

3

Topics & keywords

Keywords
  • Scalability
  • Computer science
  • Invariant (physics)
  • Binary number
  • Artificial intelligence
  • Mathematics
  • Arithmetic
  • Database
No related works found for this paper.