|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM262714299 |
| 003 |
DE-627 |
| 005 |
20231224202342.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2016 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TIP.2016.2592800
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0875.xml
|
| 035 |
|
|
|a (DE-627)NLM262714299
|
| 035 |
|
|
|a (NLM)27448355
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Wang, Di
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Multimodal Discriminative Binary Embedding for Large-Scale Cross-Modal Retrieval
|
| 264 |
|
1 |
|c 2016
|
| 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 23.05.2017
|
| 500 |
|
|
|a Date Revised 23.05.2017
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Multimodal hashing, which conducts effective and efficient nearest neighbor search across heterogeneous data on large-scale multimedia databases, has been attracting increasing interest, given the explosive growth of multimedia content on the Internet. Recent multimodal hashing research mainly aims at learning the compact binary codes to preserve semantic information given by labels. The overwhelming majority of these methods are similarity preserving approaches which approximate pairwise similarity matrix with Hamming distances between the to-be-learnt binary hash codes. However, these methods ignore the discriminative property in hash learning process, which results in hash codes from different classes undistinguished, and therefore reduces the accuracy and robustness for the nearest neighbor search. To this end, we present a novel multimodal hashing method, named multimodal discriminative binary embedding (MDBE), which focuses on learning discriminative hash codes. First, the proposed method formulates the hash function learning in terms of classification, where the binary codes generated by the learned hash functions are expected to be discriminative. And then, it exploits the label information to discover the shared structures inside heterogeneous data. Finally, the learned structures are preserved for hash codes to produce similar binary codes in the same class. Hence, the proposed MDBE can preserve both discriminability and similarity for hash codes, and will enhance retrieval accuracy. Thorough experiments on benchmark data sets demonstrate that the proposed method achieves excellent accuracy and competitive computational efficiency compared with the state-of-the-art methods for large-scale cross-modal retrieval task
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Gao, Xinbo
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Wang, Xiumei
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a He, Lihuo
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Yuan, Bo
|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 25(2016), 10 vom: 02. Okt., Seite 4540-54
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:25
|g year:2016
|g number:10
|g day:02
|g month:10
|g pages:4540-54
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2016.2592800
|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 25
|j 2016
|e 10
|b 02
|c 10
|h 4540-54
|