|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM27650884X |
| 003 |
DE-627 |
| 005 |
20231225012151.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2018 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TIP.2017.2759250
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0921.xml
|
| 035 |
|
|
|a (DE-627)NLM27650884X
|
| 035 |
|
|
|a (NLM)28981415
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Yameng Huang
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Binary Multidimensional Scaling for Hashing
|
| 264 |
|
1 |
|c 2018
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 11.12.2018
|
| 500 |
|
|
|a Date Revised 11.12.2018
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Hashing is a useful technique for fast nearest neighbor search due to its low storage cost and fast query speed. Unsupervised hashing aims at learning binary hash codes for the original features so that the pairwise distances can be best preserved. While several works have targeted on this task, the results are not satisfactory mainly due to the over-simplified model. In this paper, we propose a unified and concise unsupervised hashing framework, called binary multidimensional scaling, which is able to learn the hash code for distance preservation in both batch and online mode. In the batch mode, unlike most existing hashing methods, we do not need to simplify the model by predefining the form of hash map. Instead, we learn the binary codes directly based on the pairwise distances among the normalized original features by alternating minimization. This enables a stronger expressive power of the hash map. In the online mode, we consider the holistic distance relationship between current query example and those we have already learned, rather than only focusing on current data chunk. It is useful when the data come in a streaming fashion. Empirical results show that while being efficient for training, our algorithm outperforms state-of-the-art methods by a large margin in terms of distance preservation, which is practical for real-world applications
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Zhouchen Lin
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|d 1992
|g 27(2018), 1 vom: 05. Jan., Seite 406-418
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:27
|g year:2018
|g number:1
|g day:05
|g month:01
|g pages:406-418
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2017.2759250
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 27
|j 2018
|e 1
|b 05
|c 01
|h 406-418
|