by S Husain, M Bober
Abstract:
This paper addresses the problem of aggregating local binary descriptors for large scale image retrieval in mobile scenarios. Binary descriptors are becoming increasingly popular, especially in mobile applications, as they deliver high matching speed, have a small memory footprint and are fast to extract. However, little research has been done on how to efficiently aggregate binary descriptors. Direct application of methods developed for conventional descriptors, such as SIFT, results in unsatisfactory performance. In this paper we introduce and evaluate several algorithms to compress high-dimensional binary local descriptors, for efficient retrieval in large databases. In addition, we propose a robust global image representation; Binary Robust Visual Descriptor (B-RVD), with rank-based multi-assignment of local descriptors and direction-based aggregation, achieved by the use of L1-norm on residual vectors. The performance of the B-RVD is further improved by balancing the variances of residual vector directions in order to maximize the discriminatory power of the aggregated vectors. Standard datasets and measures have been used for evaluation showing significant improvement of around 4\% mean Average Precision as compared to the state-of-the-art.
Reference:
S Husain, M Bober, "ON AGGREGATION OF LOCAL BINARY DESCRIPTORS", In 3rd IEEE International Workshop on Mobile Multimedia Computing (MMC 2016), 2016.
Bibtex Entry:
@inproceedings{surrey811329,
booktitle = {3rd IEEE International Workshop on Mobile Multimedia Computing (MMC 2016)},
title = {ON AGGREGATION OF LOCAL BINARY DESCRIPTORS},
author = {S Husain and M Bober},
year = {2016},
journal = {ICME MMC 2016 Proceedings},
keywords = {visual search, binary descriptors, global descriptor, image retrieval},
url = {http://epubs.surrey.ac.uk/811329/},
abstract = {This paper addresses the problem of aggregating local binary descriptors for large scale image retrieval in mobile scenarios. Binary descriptors are becoming increasingly popular, especially in mobile applications, as they deliver high matching speed, have a small memory footprint and are fast to extract. However, little research has been done on how to efficiently aggregate binary descriptors. Direct application of methods developed for conventional descriptors, such as SIFT, results in unsatisfactory performance. In this paper we introduce and evaluate several algorithms to compress high-dimensional binary local descriptors, for efficient retrieval in large databases. In addition, we propose a robust global image representation; Binary Robust Visual Descriptor (B-RVD), with rank-based multi-assignment of local descriptors and direction-based aggregation, achieved by the use of L1-norm on residual vectors. The performance of the B-RVD is further improved by balancing the variances of residual vector directions in order to maximize the discriminatory power of the aggregated vectors. Standard datasets and measures have been used for evaluation showing significant improvement of around 4\% mean Average Precision as compared to the state-of-the-art.}
}