SSP: Supervised sparse projections for large-scale retrieval in high dimensions

Abstract

As “big data” transforms the way we solve computer vision problems, the question of how we can efficiently leverage large labelled databases becomes increasingly important. High-dimensional features, such as the convolutional neural network activations that drive many leading recognition frameworks, pose particular challenges for efficient retrieval. We present a novel method for learning compact binary codes in which the conventional dense projection matrix is replaced with a discriminatively-trained sparse projection matrix. The proposed method achieves two to three times faster encoding than modern dense binary encoding methods, while obtaining comparable retrieval accuracy, on SUN RGB-D, AwA, and ImageNet datasets. The method is also more accurate than unsupervised high-dimensional binary encoding methods at similar encoding speeds.