|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM265601517 |
| 003 |
DE-627 |
| 005 |
20231224212636.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2017 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TIP.2016.2619262
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0885.xml
|
| 035 |
|
|
|a (DE-627)NLM265601517
|
| 035 |
|
|
|a (NLM)27775517
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Liu, Li
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Sequential Discrete Hashing for Scalable Cross-Modality Similarity Retrieval
|
| 264 |
|
1 |
|c 2017
|
| 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 30.07.2018
|
| 500 |
|
|
|a Date Revised 30.07.2018
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a With the dramatic development of the Internet, how to exploit large-scale retrieval techniques for multimodal web data has become one of the most popular but challenging problems in computer vision and multimedia. Recently, hashing methods are used for fast nearest neighbor search in large-scale data spaces, by embedding high-dimensional feature descriptors into a similarity preserving Hamming space with a low dimension. Inspired by this, in this paper, we introduce a novel supervised cross-modality hashing framework, which can generate unified binary codes for instances represented in different modalities. Particularly, in the learning phase, each bit of a code can be sequentially learned with a discrete optimization scheme that jointly minimizes its empirical loss based on a boosting strategy. In a bitwise manner, hash functions are then learned for each modality, mapping the corresponding representations into unified hash codes. We regard this approach as cross-modality sequential discrete hashing (CSDH), which can effectively reduce the quantization errors arisen in the oversimplified rounding-off step and thus lead to high-quality binary codes. In the test phase, a simple fusion scheme is utilized to generate a unified hash code for final retrieval by merging the predicted hashing results of an unseen instance from different modalities. The proposed CSDH has been systematically evaluated on three standard data sets: Wiki, MIRFlickr, and NUS-WIDE, and the results show that our method significantly outperforms the state-of-the-art multimodality hashing techniques
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Lin, Zijia
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Shao, Ling
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Shen, Fumin
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Ding, Guiguang
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Han, Jungong
|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 26(2017), 1 vom: 24. Jan., Seite 107-118
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:26
|g year:2017
|g number:1
|g day:24
|g month:01
|g pages:107-118
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2016.2619262
|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 26
|j 2017
|e 1
|b 24
|c 01
|h 107-118
|