Presentation 2011-06-07
Duplicate Registration of Data in Approximate Nearest Neighbor
Masakazu IWAMURA, Tomoyuki MUTOH, Koichi KISE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We propose a new method based on duplicate registration of data in approximate nearest neighbor problem. In the experiment, the proposed method achieved the same accuracy as a conventional method, LSH, with 18% of computational cost and 90% of memory usage needed for LSH. In addition, we consider the phenomenon based on the criterion ρ of efficiency of LSH appeared in [1].
Keyword(in Japanese) (See Japanese page)
Keyword(in English) approximate nearest neighbor / locality sensitive hashing / efficiency in retrieval
Paper # DE2011-20,PRMU2011-51
Date of Issue

Conference Information
Committee PRMU
Conference Date 2011/5/30(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Pattern Recognition and Media Understanding (PRMU)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Duplicate Registration of Data in Approximate Nearest Neighbor
Sub Title (in English)
Keyword(1) approximate nearest neighbor
Keyword(2) locality sensitive hashing
Keyword(3) efficiency in retrieval
1st Author's Name Masakazu IWAMURA
1st Author's Affiliation Graduate School of Engineering, Osaka Prefecture University()
2nd Author's Name Tomoyuki MUTOH
2nd Author's Affiliation Graduate School of Engineering, Osaka Prefecture University
3rd Author's Name Koichi KISE
3rd Author's Affiliation Graduate School of Engineering, Osaka Prefecture University
Date 2011-06-07
Paper # DE2011-20,PRMU2011-51
Volume (vol) vol.111
Number (no) 77
Page pp.pp.-
#Pages 6
Date of Issue