Unsupervised Local Feature Hashing for Image Similarity Search [PDF]

Oct 10, 2017 - Abstract. The potential value of hashing techniques has led to it becoming one of the most active researc

10 downloads 13 Views 39KB Size

Recommend Stories


Unsupervised Deep Feature Learning for Remote Sens. Image Retrieval
Life isn't about getting and having, it's about giving and being. Kevin Kruse

Semi-Supervised Hashing for Scalable Image Retrieval
Come let us be friends for once. Let us make life easy on us. Let us be loved ones and lovers. The earth

Complementary Hashing for Approximate Nearest Neighbor Search
Learn to light a candle in the darkest moments of someone’s life. Be the light that helps others see; i

Deep Supervised Hashing for Fast Image Retrieval
In the end only three things matter: how much you loved, how gently you lived, and how gracefully you

Progressive Generative Hashing for Image Retrieval
Your task is not to seek for love, but merely to seek and find all the barriers within yourself that

Unsupervised feature selection for multi-cluster data
It always seems impossible until it is done. Nelson Mandela

Unsupervised Generative Adversarial Cross-Modal Hashing
You often feel tired, not because you've done too much, but because you've done too little of what sparks

Unsupervised Deep Video Hashing with Balanced Rotation
If your life's work can be accomplished in your lifetime, you're not thinking big enough. Wes Jacks

FEATURE GENERATION FOR QUANTIFICATION OF VISUAL SIMILARITY
Love only grows by sharing. You can only have more for yourself by giving it away to others. Brian

Multiscale Quantization for Fast Similarity Search
Almost everything will work again if you unplug it for a few minutes, including you. Anne Lamott

Idea Transcript


Unsupervised Local Feature Hashing for Image Similarity Search

Tools Liu, Li, Yu, Mengyang and Shao, Ling (2016) Unsupervised Local Feature Hashing for Image Similarity Search. IEEE Transactions on Cybernetics, 46 (11). pp. 2548-2558. ISSN 2168-2267

PDF (Published manuscript) - Published Version Available under License Creative Commons Attribution. Download (1263kB) | Preview Abstract The potential value of hashing techniques has led to it becoming one of the most active research areas in computer vision and multimedia. However, most existing hashing methods for image search and retrieval are based on global feature representations, which are susceptible to image variations such as viewpoint changes and background cluttering. Traditional global representations gather local features directly to output a single vector without the analysis of the intrinsic geometric property of local features. In this paper, we propose a novel unsupervised hashing method called unsupervised bilinear local hashing (UBLH) for projecting local feature descriptors from a high-dimensional feature space to a lower-dimensional Hamming space via compact bilinear projections rather than a single large projection matrix. UBLH takes the matrix expression of local features as input and preserves the feature-to-feature and image-to-image structures of local features simultaneously. Experimental results on challenging data sets including Caltech-256, SUN397, and Flickr 1M demonstrate the superiority of UBLH compared with state-of-the-art hashing methods.

Item Type:

Article Uncontrolled Keywords: hashing,image similarity search,local feature,unsupervised learning Faculty \ School:

Faculty of Science > School of Computing Sciences

Related URLs: Depositing User:

http://ieeexplore.ieee.org/document/7297... Pure Connector

Date Deposited:

31 Jan 2017 02:18

Last Modified:

10 Oct 2017 00:25

URI:

https://ueaeprints.uea.ac.uk/id/eprint/62235

DOI:

10.1109/TCYB.2015.2480966

Actions (login required)

View Item © UEA 2009. All rights reserved. University of East Anglia, Norwich, NR4 7TJ, UK. Telephone: +44 (0) 1603 456161

Smile Life

When life gives you a hundred reasons to cry, show life that you have a thousand reasons to smile

Get in touch

© Copyright 2015 - 2024 PDFFOX.COM - All rights reserved.