Hash Bit Selection for Nearest Neighbor Search

To overcome the barrier of storage and computation when dealing with gigantic-scale data sets, compact hashing has been studied extensively to approximate the nearest neighbor search. Despite the recent advances, critical design issues remain open in how to select the right features, hashing algorit...

Full description

Bibliographic Details

Published in:	IEEE transactions on image processing Vol. 26; no. 11; pp. 5367 - 5380
Main Authors:	Liu, Xianglong, He, Junfeng, Chang, Shih-Fu
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.11.2017
Subjects:	Algorithm design and analysis Binary codes bit complementarity bit reliability Dynamic programming hash bit selection Heuristic algorithms locality-sensitive hashing Nearest neighbor search Nearest neighbor searches normalized dominant set Optimization Reliability
ISSN:	1057-7149, 1941-0042, 1941-0042
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!