资源分类
》 资源 》论文》Asymmetric sparse kernel approximations for large-scale visual search

Asymmetric sparse kernel approximations for large-scale visual search

2019-12-12 | |  70 |   35 |   0

Abstract

We introduce an asymmetric sparse approximate embedding optimized for fast kernel comparison operations arising in large-scale visual search. In contrast to other methods that perform an explicit approximate embedding using kernel PCA followed by a distance compression technique in Rd , which loses information at both steps, our method utilizes the implicit kernel representation directly. In addition, we empirically demonstrate that our method needs no explicit training step and can operate with a dictionary of random exemplars from the dataset. We evaluateour method on three benchmark image retrieval datasets:SIFT1M, ImageNet, and 80M-TinyImages.

上一篇：Bayesian Active Contours with Affine-Invariant, Elastic Shape Prior

下一篇：Multipoint Filtering with Local Polynomial Approximation and Range Guidance

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...