Please use this identifier to cite or link to this item:
http://dspace.cityu.edu.hk/handle/2031/6806
Title: | Hashing with Cauchy Graph |
Authors: | Tao, Liang (陶亮) Ip, Horace Ho Shing |
Department: | Department of Computer Science |
Issue Date: | Dec-2012 |
Award: | Won the Best Paper Award (Machine Learning) at the 2012 Pacific-Rim Conference on Multimedia (PCM 2012) organized by Nanyang Technological University, Singapore and National University of Singapore. |
Supervisor: | Prof. Ip, Horace Ho-shing |
Subjects: | Image Retrieval Hashing and Machine Learning |
Type: | Article |
Abstract: | Approximate nearest neighbor search within large scale image datasets strongly demands efficient and effective algorithms. One promising strategy is to compute compact bits string via the hashing scheme as representation of data examples, which can dramatically reduce query time and storage requirements. In this paper, we propose a novel Cauchy graph-based hashing algorithm for the first time, which can capture more local topology semantics than Laplacian embedding. In particular, greater similarities are achieved through Cauchy embedding mapped from the pairs of smaller distance over the original data space. Then regularized kernel least-squares, with its closed form solution, is applied to efficiently learn hash functions. The experimental evaluations over several noted image retrieval benchmarks, MNIST, CIFAR-10 and USPS, demonstrate that performance of the proposed hashing algorithm is quite comparable with the state-of-the-art hashing techniques in searching semantic similar neighbors, especially in quite short length hash codes, such as those of only 4, 6, and 8 bits. |
Appears in Collections: | Student Works With External Awards |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
award_news.html | 148 B | HTML | View/Open | |
award_winning_work.html | 163 B | HTML | View/Open |
Items in Digital CityU Collections are protected by copyright, with all rights reserved, unless otherwise indicated.