|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM27457389X |
| 003 |
DE-627 |
| 005 |
20231225003758.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2017 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TIP.2017.2735184
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0915.xml
|
| 035 |
|
|
|a (DE-627)NLM27457389X
|
| 035 |
|
|
|a (NLM)28783633
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Rongrong Ji
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Toward Optimal Manifold Hashing via Discrete Locally Linear Embedding
|
| 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 Binary code learning, also known as hashing, has received increasing attention in large-scale visual search. By transforming high-dimensional features to binary codes, the original Euclidean distance is approximated via Hamming distance. More recently, it is advocated that it is the manifold distance, rather than the Euclidean distance, that should be preserved in the Hamming space. However, it retains as an open problem to directly preserve the manifold structure by hashing. In particular, it first needs to build the local linear embedding in the original feature space, and then quantize such embedding to binary codes. Such a two-step coding is problematic and less optimized. Besides, the off-line learning is extremely time and memory consuming, which needs to calculate the similarity matrix of the original data. In this paper, we propose a novel hashing algorithm, termed discrete locality linear embedding hashing (DLLH), which well addresses the above challenges. The DLLH directly reconstructs the manifold structure in the Hamming space, which learns optimal hash codes to maintain the local linear relationship of data points. To learn discrete locally linear embeddingcodes, we further propose a discrete optimization algorithm with an iterative parameters updating scheme. Moreover, an anchor-based acceleration scheme, termed Anchor-DLLH, is further introduced, which approximates the large similarity matrix by the product of two low-rank matrices. Experimental results on three widely used benchmark data sets, i.e., CIFAR10, NUS-WIDE, and YouTube Face, have shown superior performance of the proposed DLLH over the state-of-the-art approaches
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Hong Liu
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Liujuan Cao
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Di Liu
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Yongjian Wu
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Feiyue Huang
|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), 11 vom: 01. Nov., Seite 5411-5420
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:26
|g year:2017
|g number:11
|g day:01
|g month:11
|g pages:5411-5420
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2017.2735184
|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 11
|b 01
|c 11
|h 5411-5420
|