Scalable Image Retrieval by Sparse Product Quantization

Fast Approximate Nearest Neighbor (ANN) search technique for high-dimensional feature indexing and retrieval is the crux of large-scale image retrieval. A recent promising technique is Product Quantization, which attempts to index high-dimensional image features by decomposing the feature space into a Cartesian product of low dimensional subspaces and quantizing each of them separately. Despite the promising results reported, their quantization approach follows the typical hard assignment of traditional quantization methods, which may result in large quantization errors and thus inferior search performance. Unlike the existing approaches, in this paper, we propose a novel approach called Sparse Product Quantization (SPQ) to encoding the high-dimensional feature vectors into sparse representation. We optimize the sparse representations of the feature vectors by minimizing their quantization errors, making the resulting representation is essentially close to the original data in practice. Experiments show that the proposed SPQ technique is not only able to compress data, but also an effective encoding technique. We obtain state-of-the-art results for ANN search on four public image datasets and the promising results of content-based image retrieval further validate the efficacy of our proposed method.Comment: 12 page

Advanced Quantizer Designs for FDD-Based FD-MIMO Systems Using Uniform Planar Arrays

Massive multiple-input multiple-output (MIMO) systems, which utilize a large number of antennas at the base station, are expected to enhance network throughput by enabling improved multiuser MIMO techniques. To deploy many antennas in reasonable form factors, base stations are expected to employ antenna arrays in both horizontal and vertical dimensions, which is known as full-dimension (FD) MIMO. The most popular two-dimensional array is the uniform planar array (UPA), where antennas are placed in a grid pattern. To exploit the full benefit of massive MIMO in frequency division duplexing (FDD), the downlink channel state information (CSI) should be estimated, quantized, and fed back from the receiver to the transmitter. However, it is difficult to accurately quantize the channel in a computationally efficient manner due to the high dimensionality of the massive MIMO channel. In this paper, we develop both narrowband and wideband CSI quantizers for FD-MIMO taking the properties of realistic channels and the UPA into consideration. To improve quantization quality, we focus on not only quantizing dominant radio paths in the channel, but also combining the quantized beams. We also develop a hierarchical beam search approach, which scans both vertical and horizontal domains jointly with moderate computational complexity. Numerical simulations verify that the performance of the proposed quantizers is better than that of previous CSI quantization techniques.Comment: 15 pages, 6 figure