![]() |
ETNA - Electronic Transactions on Numerical Analysis
|
![]() |
Verlag der Österreichischen Akademie der Wissenschaften Austrian Academy of Sciences Press
A-1011 Wien, Dr. Ignaz Seipel-Platz 2
Tel. +43-1-515 81/DW 3420, Fax +43-1-515 81/DW 3400 https://verlag.oeaw.ac.at, e-mail: verlag@oeaw.ac.at |
|
||||||||||||||||||||
|
DATUM, UNTERSCHRIFT / DATE, SIGNATURE
BANK AUSTRIA CREDITANSTALT, WIEN (IBAN AT04 1100 0006 2280 0100, BIC BKAUATWW), DEUTSCHE BANK MÜNCHEN (IBAN DE16 7007 0024 0238 8270 00, BIC DEUTDEDBMUC)
|

ETNA - Electronic Transactions on Numerical Analysis, pp. 92-111, 2021/11/04
In this paper, we are interested in finding an approximate solution $ \hat{\mathcal{X}} $ of the tensor least-squares minimization problem$ \min_{\mathcal{X}}\left\|\mathcal{X}\times_1A^{(1)}\times_2A^{(2)}\times_3\cdots\times_NA^{(N)}-\mathcal{G}\right\|$, where $ \mathcal{G}\in \mathbb{R}^{J_1\times J_2\times \cdots \times J_N}$ and $ A^{(i)}\in \mathbb{R}^{J_i\times I_i} $ ($ i=1,\ldots,N $) are known and $ \mathcal{X}\in \mathbb{R}^{I_1\times I_2\times \cdots \times I_N} $ is the unknown tensor to be approximated. Our approach is based on two steps. Firstly, we apply the CP or HOSVD decomposition to the right-hand side tensor $ \mathcal{G} $. Secondly, we perform the well-known Golub-Kahan bidiagonalization for each coefficient matrix $ A^{(i)} $($ i=1,\ldots, N $) to obtain a reduced tensor least-squares minimization problem. This type of equations may appear in color image and video restorations as we described below. Some numerical tests are performed to show the effectiveness of our proposed method.
Keywords: HOSVD, CP decomposition, color image restoration, video restoration, LSQR