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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on image processing Jg. 26; H. 11; S. 5367 - 5380
Hauptverfasser:	Liu, Xianglong, He, Junfeng, Chang, Shih-Fu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	United States IEEE 01.11.2017
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!