资源论文Approximate Gaussian Mixtures for Large Scale Vocabularies

Approximate Gaussian Mixtures for Large Scale Vocabularies

2020-04-02 | |  62 |   48 |   0

Abstract

We introduce a clustering method that combines the flexibil- ity of Gaussian mixtures with the scaling properties needed to construct visual vocabularies for image retrieval. It is a variant of expectation- maximization that can converge rapidly while dynamically estimating the number of components. We employ approximate nearest neighbor search to speed-up the E-step and exploit its iterative nature to make search incremental, boosting both speed and precision. We achieve supe- rior performance in large scale retrieval, being as fast as the best known approximate k-means.

上一篇:Patch Based Synthesis for Single Depth Image Super-Resolution

下一篇:Reconstructing 3D Human Pose from 2D Image Landmarks

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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