|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM335070272 |
| 003 |
DE-627 |
| 005 |
20231225225027.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2022 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TIP.2021.3138325
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n1116.xml
|
| 035 |
|
|
|a (DE-627)NLM335070272
|
| 035 |
|
|
|a (NLM)34971534
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Zhao, Xi-Le
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Tensor Completion via Complementary Global, Local, and Nonlocal Priors
|
| 264 |
|
1 |
|c 2022
|
| 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 Revised 11.01.2022
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Completing missing entries in multidimensional visual data is a typical ill-posed problem that requires appropriate exploitation of prior information of the underlying data. Commonly used priors can be roughly categorized into three classes: global tensor low-rankness, local properties, and nonlocal self-similarity (NSS); most existing works utilize one or two of them to implement completion. Naturally, there arises an interesting question: can one concurrently make use of multiple priors in a unified way, such that they can collaborate with each other to achieve better performance? This work gives a positive answer by formulating a novel tensor completion framework which can simultaneously take advantage of the global-local-nonlocal priors. In the proposed framework, the tensor train (TT) rank is adopted to characterize the global correlation; meanwhile, two Plug-and-Play (PnP) denoisers, including a convolutional neural network (CNN) denoiser and the color block-matching and 3 D filtering (CBM3D) denoiser, are incorporated to preserve local details and exploit NSS, respectively. Then, we design a proximal alternating minimization algorithm to efficiently solve this model under the PnP framework. Under mild conditions, we establish the convergence guarantee of the proposed algorithm. Extensive experiments show that these priors organically benefit from each other to achieve state-of-the-art performance both quantitatively and qualitatively
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Yang, Jing-Hua
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Ma, Tian-Hui
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Jiang, Tai-Xiang
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Ng, Michael K
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Huang, Ting-Zhu
|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 31(2022) vom: 12., Seite 984-999
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
| 773 |
1 |
8 |
|g volume:31
|g year:2022
|g day:12
|g pages:984-999
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2021.3138325
|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 31
|j 2022
|b 12
|h 984-999
|