Low-rank tensor recovery (LRTR) is a natural extension of low-rank matrix recovery (LRMR) to high-dimensional arrays, which aims to reconstruct an underlying tensor <inline-formula><tex-math notation="LaTeX">$\boldsymbol{\mathcal {X}}$</tex-math><alternatives><mml:math><mml:mi mathvariant="script">X</mml:mi></mml:math><inline-graphic xlink:href="wang-ieq1-3063527.gif"/></alternatives></inline-formula> from incomplete linear measurements <inline-formula><tex-math notation="LaTeX">$\mathfrak {M}(\boldsymbol{\mathcal {X}})$</tex-math><alternatives><mml:math><mml:mrow><mml:mi mathvariant="fraktur">M</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="script">X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="wang-ieq2-3063527.gif"/></alternatives></inline-formula>. However, LRTR ignores the error caused by quantization, limiting its application when the quantization is low-level. In this work, we take into account the impact of extreme quantization and suppose the quantizer degrades into a comparator that only acquires the signs of <inline-formula><tex-math notation="LaTeX">$\mathfrak {M}(\boldsymbol{\mathcal {X}})$</tex-math><alternatives><mml:math><mml:mrow><mml:mi mathvariant="fraktur">M</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="script">X</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="wang-ieq3-3063527.gif"/></alternatives></inline-formula>. We still hope to recover <inline-formula><tex-math notation="LaTeX">$\boldsymbol{\mathcal {X}}$</tex-math><alternatives><mml:math><mml:mi mathvariant="script">X</mml:mi></mml:math><inline-graphic xlink:href="wang-ieq4-3063527.gif"/></alternatives></inline-formula> from these binary measurements. Under the tensor Singular Value Decomposition (t-SVD) framework, two recovery methods are proposed—the first is a tensor hard singular tube thresholding method; the second is a constrained tensor nuclear norm minimization method. These methods can recover a real <inline-formula><tex-math notation="LaTeX">$n_1\times n_2\times n_3$</tex-math><alternatives><mml:math><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math><inline-graphic xlink:href="wang-ieq5-3063527.gif"/></alternatives></inline-formula> tensor <inline-formula><tex-math notation="LaTeX">$\boldsymbol{\mathcal {X}}$</tex-math><alternatives><mml:math><mml:mi mathvariant="script">X</mml:mi></mml:math><inline-graphic xlink:href="wang-ieq6-3063527.gif"/></alternatives></inline-formula> with tubal rank <inline-formula><tex-math notation="LaTeX">$r$</tex-math><alternatives><mml:math><mml:mi>r</mml:mi></mml:math><inline-graphic xlink:href="wang-ieq7-3063527.gif"/></alternatives></inline-formula> from <inline-formula><tex-math notation="LaTeX">$m$</tex-math><alternatives><mml:math><mml:mi>m</mml:mi></mml:math><inline-graphic xlink:href="wang-ieq8-3063527.gif"/></alternatives></inline-formula> random Gaussian binary measurements with errors decaying at a polynomial speed of the oversampling factor <inline-formula><tex-math notation="LaTeX">$\lambda :=m/((n_1+n_2)n_3r)$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>λ</mml:mi><mml:mo>:</mml:mo><mml:mo>=</mml:mo><mml:mi>m</mml:mi><mml:mo>/</mml:mo><mml:mo>(</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>)</mml:mo></mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mi>r</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="wang-ieq9-3063527.gif"/></alternatives></inline-formula>. To improve the convergence rate, we develop a new quantization scheme under which the convergence rate can be accelerated to an exponential function of <inline-formula><tex-math notation="LaTeX">$\lambda$</tex-math><alternatives><mml:math><mml:mi>λ</mml:mi></mml:math><inline-graphic xlink:href="wang-ieq10-3063527.gif"/></alternatives></inline-formula>. Numerical experiments verify our results, and the applications to real-world data demonstrate the promising performance of the proposed methods.
Paper
Full text
Robust Low-Tubal-Rank Tensor Recovery From Binary Measurements
Semantic Scholar · Engineering · 2021
Abstract
Low-rank tensor recovery (LRTR) is a natural extension of low-rank matrix recovery (LRMR) to high-dimensional arrays, which aims to reconstruct an underlying tensor <inline-formula><tex-math notation="LaTeX">$\boldsymbol{\mathcal {X}}$</tex-math><alternatives>mml:math<mml:mi mathvariant="script">X</mml:mi></mml:math><inline-graphic xlink:href="wang-ieq1-3063527.gif"/></alternatives></inline-formula> from incomplete linear measurements <inline-formula><tex-math notation="LaTeX">$\mathfrak {M}(\boldsymbol{\mathcal {X}})$</tex-math><alternatives>mml:mathmml:mrow<mml:mi mathvariant="fraktur">M</mml:mi>mml:mo(</mml:mo><mml:mi mathvariant="script">X</mml:mi>mml:mo)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="wang-ieq2-3063527.gif"/></alternatives></inline-formula>. However, LRTR ignores the error caused by quantization, limiting its application when the quantization is low-level. In this work, we take into account the impact of extreme quantization and suppose the quantizer degrades into a comparator that only acquires the signs of <inline-formula><tex-math notation="LaTeX">$\mathfrak {M}(\boldsymbol{\mathcal {X}})$</tex-math><alternatives>mml:mathmml:mrow<mml:mi mathvariant="fraktur">M</mml:mi>mml:mo(</mml:mo><mml:mi mathvariant="script">X</mml:mi>mml:mo)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="wang-ieq3-3063527.gif"/></alternatives></inline-formula>. We still hope to recover <inline-formula><tex-math notation="LaTeX">$\boldsymbol{\mathcal {X}}$</tex-math><alternatives>mml:math<mml:mi mathvariant="script">X</mml:mi></mml:math><inline-graphic xlink:href="wang-ieq4-3063527.gif"/></alternatives></inline-formula> from these binary measurements. Under the tensor Singular Value Decomposition (t-SVD) framework, two recovery methods are proposed—the first is a tensor hard singular tube thresholding method; the second is a constrained tensor nuclear norm minimization method. These methods can recover a real <inline-formula><tex-math notation="LaTeX">$n_1\times n_2\times n_3$</tex-math><alternatives>mml:mathmml:mrowmml:msubmml:min</mml:mi>mml:mn1</mml:mn></mml:msub>mml:mo×</mml:mo>mml:msubmml:min</mml:mi>mml:mn2</mml:mn></mml:msub>mml:mo×</mml:mo>mml:msubmml:min</mml:mi>mml:mn3</mml:mn></mml:msub></mml:mrow></mml:math><inline-graphic xlink:href="wang-ieq5-3063527.gif"/></alternatives></inline-formula> tensor <inline-formula><tex-math notation="LaTeX">$\boldsymbol{\mathcal {X}}$</tex-math><alternatives>mml:math<mml:mi mathvariant="script">X</mml:mi></mml:math><inline-graphic xlink:href="wang-ieq6-3063527.gif"/></alternatives></inline-formula> with tubal rank <inline-formula><tex-math notation="LaTeX">$r$</tex-math><alternatives>mml:mathmml:mir</mml:mi></mml:math><inline-graphic xlink:href="wang-ieq7-3063527.gif"/></alternatives></inline-formula> from <inline-formula><tex-math notation="LaTeX">$m$</tex-math><alternatives>mml:mathmml:mim</mml:mi></mml:math><inline-graphic xlink:href="wang-ieq8-3063527.gif"/></alternatives></inline-formula> random Gaussian binary measurements with errors decaying at a polynomial speed of the oversampling factor <inline-formula><tex-math notation="LaTeX">$\lambda :=m/((n_1+n_2)n_3r)$</tex-math><alternatives>mml:mathmml:mrowmml:miλ</mml:mi>mml:mo:</mml:mo>mml:mo=</mml:mo>mml:mim</mml:mi>mml:mo/</mml:mo>mml:mo(</mml:mo>mml:mrowmml:mo(</mml:mo>mml:msubmml:min</mml:mi>mml:mn1</mml:mn></mml:msub>mml:mo+</mml:mo>mml:msubmml:min</mml:mi>mml:mn2</mml:mn></mml:msub>mml:mo)</mml:mo></mml:mrow>mml:msubmml:min</mml:mi>mml:mn3</mml:mn></mml:msub>mml:mir</mml:mi>mml:mo)</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="wang-ieq9-3063527.gif"/></alternatives></inline-formula>. To improve the convergence rate, we develop a new quantization scheme under which the convergence rate can be accelerated to an exponential function of <inline-formula><tex-math notation="LaTeX">$\lambda$</tex-math><alternatives>mml:mathmml:miλ</mml:mi></mml:math><inline-graphic xlink:href="wang-ieq10-3063527.gif"/></alternatives></inline-formula>. Numerical experiments verify our results, and the applications to real-world data demonstrate the promising performance of the proposed methods.