Lancaster EPrints

Robust Quantization for General Similarity Search

Guo, Yuchen and Ding, Guiguang and Han, Jungong (2018) Robust Quantization for General Similarity Search. IEEE Transactions on Image Processing, 27 (2). pp. 949-963. ISSN 1057-7149

[img]
Preview
PDF (TIP-GUO-FINAL) - Submitted Version
Available under License Creative Commons Attribution-NonCommercial.

Download (570Kb) | Preview

    Abstract

    The recent years have witnessed the emerging of vector quantization (VQ) techniques for efficient similarity search. VQ partitions the feature space into a set of codewords and encodes data points as integer indices using the codewords. Then the distance between data points can be efficiently approximated by simple memory lookup operations. By the compact quantization, the storage cost and searching complexity are significantly reduced, thereby facilitating efficient large-scale similarity search. However, the performance of several celebrated VQ approaches degrades significantly when dealing with noisy data. Additionally, it can barely facilitate a wide range of applications as the distortion measurement only limits to ℓ2 norm. To address the shortcomings of the squared Euclidean (ℓ2,2 norm) loss function employed by the VQ approaches, in this paper, we propose a novel robust and general VQ framework, named RGVQ, to enhance both robustness and generalization of VQ approaches. Specifically, a ℓp,q-norm loss function is proposed to conduct the ℓp-norm similarity search, rather than the ℓ2 norm search, and the q-th order loss is used to enhance the robustness. Despite the fact that changing the loss function to ℓp,q norm makes VQ approaches more robust and generic, it brings us a challenge that a non-smooth and non-convex orthogonality constrained ℓp,q- norm function has to be minimized. To solve this problem, we propose a novel and efficient optimization scheme and specify it to VQ approaches and theoretically prove its convergence. Extensive experiments on benchmark datasets demonstrate that the proposed RGVQ is better than the original VQ for several approaches, especially when searching similarity in noisy data.

    Item Type: Journal Article
    Journal or Publication Title: IEEE Transactions on Image Processing
    Additional Information: ©2017 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
    Subjects:
    Departments: Faculty of Science and Technology > School of Computing & Communications
    ID Code: 88377
    Deposited By: ep_importer_pure
    Deposited On: 23 Oct 2017 13:30
    Refereed?: Yes
    Published?: Published
    Last Modified: 24 Sep 2018 01:09
    Identification Number:
    URI: http://eprints.lancs.ac.uk/id/eprint/88377

    Actions (login required)

    View Item