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

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on image processing Ročník 26; číslo 11; s. 5367 - 5380
Hlavní autori:	Liu, Xianglong, He, Junfeng, Chang, Shih-Fu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States IEEE 01.11.2017
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!