|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM287686868 |
| 003 |
DE-627 |
| 005 |
20231225054554.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2019 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TIP.2018.2865837
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0958.xml
|
| 035 |
|
|
|a (DE-627)NLM287686868
|
| 035 |
|
|
|a (NLM)30130190
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Li, Baohua
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Tensor Completion From One-Bit Observations
|
| 264 |
|
1 |
|c 2019
|
| 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 24.09.2018
|
| 500 |
|
|
|a Date Revised 24.09.2018
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a The tensor completion issues have obtained a great deal of attention in the past few years. However, the data fidelity part minimizes a squared loss function, which may be inappropriate for the case of noisy one-bit observations. In this paper, we alleviate the mentioned difficulty by drawing on the experience of matrix scenarios. Based on the convex relation to $\ell _{1}$ norm of the tensor multi-rank, we propose a novel optimization model trying to recover the underlying tensor in case of one-bit observations. The feasibility of this model is proved by theoretical derivations. Furthermore, an alternating direction method of multipliers based algorithm is designed to find the solution. The numerical experiments demonstrate the effectiveness of our method
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Zhang, Xiaoning
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Li, Xiaoli
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Lu, Huchuan
|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 28(2019), 1 vom: 16. Jan., Seite 170-180
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:28
|g year:2019
|g number:1
|g day:16
|g month:01
|g pages:170-180
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2018.2865837
|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 28
|j 2019
|e 1
|b 16
|c 01
|h 170-180
|