Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Tensor Recovery Based on A Novel Non-convex Function Minimax Logarithmic Concave Penalty Function (2206.13506v1)

Published 25 Jun 2022 in eess.IV, cs.CV, and cs.LG

Abstract: Non-convex relaxation methods have been widely used in tensor recovery problems, and compared with convex relaxation methods, can achieve better recovery results. In this paper, a new non-convex function, Minimax Logarithmic Concave Penalty (MLCP) function, is proposed, and some of its intrinsic properties are analyzed, among which it is interesting to find that the Logarithmic function is an upper bound of the MLCP function. The proposed function is generalized to tensor cases, yielding tensor MLCP and weighted tensor $L\gamma$-norm. Consider that its explicit solution cannot be obtained when applying it directly to the tensor recovery problem. Therefore, the corresponding equivalence theorems to solve such problem are given, namely, tensor equivalent MLCP theorem and equivalent weighted tensor $L\gamma$-norm theorem. In addition, we propose two EMLCP-based models for classic tensor recovery problems, namely low-rank tensor completion (LRTC) and tensor robust principal component analysis (TRPCA), and design proximal alternate linearization minimization (PALM) algorithms to solve them individually. Furthermore, based on the Kurdyka-{\L}ojasiwicz property, it is proved that the solution sequence of the proposed algorithm has finite length and converges to the critical point globally. Finally, Extensive experiments show that proposed algorithm achieve good results, and it is confirmed that the MLCP function is indeed better than the Logarithmic function in the minimization problem, which is consistent with the analysis of theoretical properties.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (52)
  1. Y.-M. Huang, H.-Y. Yan, Y.-W. Wen, and X. Yang, “Rank minimization with applications to image noise removal,” Information Sciences, vol. 429, pp. 147–163, 2018.
  2. B. Madathil and S. N. George, “Twist tensor total variation regularized-reweighted nuclear norm based tensor completion for video missing area recovery,” Information Sciences, vol. 423, pp. 376–397, 2018.
  3. Y. Wang, D. Meng, and M. Yuan, “Sparse recovery: from vectors to tensors,” National Science Review, vol. 5, no. 5, pp. 756–767, 2018.
  4. X.-L. Zhao, W.-H. Xu, T.-X. Jiang, Y. Wang, and M. K. Ng, “Deep plug-and-play prior for low-rank tensor completion,” Neurocomputing, vol. 400, pp. 137–149, 2020.
  5. S. Li, R. Dian, L. Fang, and J. M. Bioucas-Dias, “Fusing hyperspectral and multispectral images via coupled sparse tensor factorization,” IEEE Transactions on Image Processing, vol. 27, no. 8, pp. 4118–4130, 2018.
  6. X. Fu, W.-K. Ma, J. M. Bioucas-Dias, and T.-H. Chan, “Semiblind hyperspectral unmixing in the presence of spectral library mismatches,” IEEE Transactions on Geoscience and Remote Sensing, vol. 54, no. 9, pp. 5171–5184, 2016.
  7. J. Xue, Y. Zhao, W. Liao, and J. C.-W. Chan, “Nonlocal low-rank regularized tensor decomposition for hyperspectral image denoising,” IEEE Transactions on Geoscience and Remote Sensing, vol. 57, no. 7, pp. 5174–5189, 2019.
  8. J. Xue, Y. Zhao, W. Liao, J. C.-W. Chan, and S. G. Kong, “Enhanced sparsity prior model for low-rank tensor completion,” IEEE Transactions on Neural Networks and Learning Systems, vol. 31, no. 11, pp. 4567–4581, 2020.
  9. H. Zhang, X. Liu, H. Fan, Y. Li, and Y. Ye, “Fast and accurate low-rank tensor completion methods based on qr decomposition and l⁢_𝑙_l\_italic_l _{2,1212,12 , 1} norm minimization,” arXiv preprint arXiv:2108.03002, 2021.
  10. J.-H. Yang, X.-L. Zhao, T.-Y. Ji, T.-H. Ma, and T.-Z. Huang, “Low-rank tensor train for tensor robust principal component analysis,” Applied Mathematics and Computation, vol. 367, p. 124783, 2020.
  11. T.-X. Jiang, T.-Z. Huang, X.-L. Zhao, T.-Y. Ji, and L.-J. Deng, “Matrix factorization for low-rank tensor completion using framelet prior,” Information Sciences, vol. 436, pp. 403–417, 2018.
  12. M. Ding, T.-Z. Huang, T.-Y. Ji, X.-L. Zhao, and J.-H. Yang, “Low-rank tensor completion using matrix factorization based on tensor train rank and total variation,” Journal of Scientific Computing, vol. 81, no. 2, pp. 941–964, 2019.
  13. J. Xue, Y. Zhao, W. Liao, and J. Cheung-Wai Chan, “Nonconvex tensor rank minimization and its applications to tensor recovery,” Information Sciences, vol. 503, pp. 109–128, 2019.
  14. J. Xue, Y. Zhao, W. Liao, and J. Cheung-Wai Chan, “Total variation and rank-1 constraint rpca for background subtraction,” IEEE Access, vol. 6, pp. 49 955–49 966, 2018.
  15. I. Kajo, N. Kamel, Y. Ruichek, and A. S. Malik, “Svd-based tensor-completion technique for background initialization,” IEEE Transactions on Image Processing, vol. 27, no. 6, pp. 3114–3126, 2018.
  16. W. Cao, Y. Wang, J. Sun, D. Meng, C. Yang, A. Cichocki, and Z. Xu, “Total variation regularized tensor rpca for background subtraction from compressive measurements,” IEEE Transactions on Image Processing, vol. 25, no. 9, pp. 4075–4090, 2016.
  17. W. Wei, L. Yi, Q. Xie, Q. Zhao, D. Meng, and Z. Xu, “Should we encode rain streaks in video as deterministic or stochastic?” in 2017 IEEE International Conference on Computer Vision (ICCV), 2017, pp. 2535–2544.
  18. M. Li, Q. Xie, Q. Zhao, W. Wei, S. Gu, J. Tao, and D. Meng, “Video rain streak removal by multiscale convolutional sparse coding,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2018, pp. 6644–6653.
  19. Q. Zhao, L. Zhang, and A. Cichocki, “Bayesian cp factorization of incomplete tensors with automatic rank determination,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 9, pp. 1751–1763, 2015.
  20. T. Yokota, N. Lee, and A. Cichocki, “Robust multilinear tensor rank estimation using higher order singular value decomposition and information criteria,” IEEE Transactions on Signal Processing, vol. 65, no. 5, pp. 1196–1206, 2017.
  21. H. A. Kiers, “Towards a standardized notation and terminology in multiway analysis,” Journal of Chemometrics: A Journal of the Chemometrics Society, vol. 14, no. 3, pp. 105–122, 2000.
  22. C. J. Hillar and L.-H. Lim, “Most tensor problems are np-hard,” Journal of the ACM (JACM), vol. 60, no. 6, pp. 1–39, 2013.
  23. L. R. Tucker, “Some mathematical notes on three-mode factor analysis,” Psychometrika, vol. 31, no. 3, pp. 279–311, 1966.
  24. J. Liu, P. Musialski, P. Wonka, and J. Ye, “Tensor completion for estimating missing values in visual data,” IEEE transactions on pattern analysis and machine intelligence, vol. 35, no. 1, pp. 208–220, 2012.
  25. B. Romera-Paredes and M. Pontil, “A new convex relaxation for tensor completion,” Advances in neural information processing systems, vol. 26, 2013.
  26. M. E. Kilmer and C. D. Martin, “Factorization strategies for third-order tensors,” Linear Algebra and its Applications, vol. 435, no. 3, pp. 641–658, 2011.
  27. Z. Zhang and S. Aeron, “Exact tensor completion using t-svd,” IEEE Transactions on Signal Processing, vol. 65, no. 6, pp. 1511–1526, 2017.
  28. Y.-B. Zheng, T.-Z. Huang, X.-L. Zhao, T.-X. Jiang, T.-Y. Ji, and T.-H. Ma, “Tensor n-tubal rank and its convex relaxation for low-rank tensor recovery,” Information Sciences, vol. 532, pp. 170–189, 2020.
  29. H. Kong, X. Xie, and Z. Lin, “t-schatten-p𝑝pitalic_p norm for low-rank tensor recovery,” IEEE Journal of Selected Topics in Signal Processing, vol. 12, no. 6, pp. 1405–1419, 2018.
  30. W.-H. Xu, X.-L. Zhao, T.-Y. Ji, J.-Q. Miao, T.-H. Ma, S. Wang, and T.-Z. Huang, “Laplace function based nonconvex surrogate for low-rank tensor completion,” Signal Processing: Image Communication, vol. 73, pp. 62–69, 2019.
  31. P. Gong, C. Zhang, Z. Lu, J. Huang, and J. Ye, “A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems,” in international conference on machine learning.   PMLR, 2013, pp. 37–45.
  32. J. You, Y. Jiao, X. Lu, and T. Zeng, “A nonconvex model with minimax concave penalty for image restoration,” Journal of Scientific Computing, vol. 78, no. 2, pp. 1063–1086, 2019.
  33. C.-H. Zhang, “Nearly unbiased variable selection under minimax concave penalty,” The Annals of statistics, vol. 38, no. 2, pp. 894–942, 2010.
  34. P. K. Pokala, R. V. Hemadri, and C. S. Seelamantula, “Iteratively reweighted minimax-concave penalty minimization for accurate low-rank plus sparse matrix decomposition,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021.
  35. J. Fan and R. Li, “Variable selection via nonconcave penalized likelihood and its oracle properties,” Journal of the American statistical Association, vol. 96, no. 456, pp. 1348–1360, 2001.
  36. D. Qiu, M. Bai, M. K. Ng, and X. Zhang, “Nonlocal robust tensor recovery with nonconvex regularization,” Inverse Problems, vol. 37, no. 3, p. 035001, 2021.
  37. X. Zhang, “A nonconvex relaxation approach to low-rank tensor completion,” IEEE transactions on neural networks and learning systems, vol. 30, no. 6, pp. 1659–1671, 2018.
  38. X. Zhang, M. Bai, and M. K. Ng, “Nonconvex-tv based image restoration with impulse noise removal,” SIAM Journal on Imaging Sciences, vol. 10, no. 3, pp. 1627–1667, 2017.
  39. P. Ochs, A. Dosovitskiy, T. Brox, and T. Pock, “On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision,” SIAM Journal on Imaging Sciences, vol. 8, no. 1, pp. 331–372, 2015.
  40. J. Bolte, S. Sabach, and M. Teboulle, “Proximal alternating linearized minimization for nonconvex and nonsmooth problems,” Mathematical Programming, vol. 146, no. 1, pp. 459–494, 2014.
  41. C. Lu, J. Feng, Y. Chen, W. Liu, Z. Lin, and S. Yan, “Tensor robust principal component analysis with a new tensor nuclear norm,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 42, no. 4, pp. 925–938, 2020.
  42. Z. Zhang, G. Ely, S. Aeron, N. Hao, and M. Kilmer, “Novel methods for multilinear data completion and de-noising based on tensor-svd,” 2014 IEEE Conference on Computer Vision and Pattern Recognition, pp. 3842–3849, 2014.
  43. R. Tibshirani, “Regression shrinkage and selection via the lasso: a retrospective,” Journal of the Royal Statistical Society: Series B (Statistical Methodology), vol. 73, no. 3, pp. 273–282, 2011.
  44. Z. Wang, A. Bovik, H. Sheikh, and E. Simoncelli, “Image quality assessment: from error visibility to structural similarity,” IEEE Transactions on Image Processing, vol. 13, no. 4, pp. 600–612, 2004.
  45. L. Zhang, L. Zhang, X. Mou, and D. Zhang, “Fsim: A feature similarity index for image quality assessment,” IEEE Transactions on Image Processing, vol. 20, no. 8, pp. 2378–2386, 2011.
  46. J. Liu, P. Musialski, P. Wonka, and J. Ye, “Tensor completion for estimating missing values in visual data,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 1, pp. 208–220, 2013.
  47. X. Li, Y. Ye, and X. Xu, “Low-rank tensor completion with total variation for visual data inpainting,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 31, no. 1, 2017.
  48. T.-X. Jiang, T.-Z. Huang, X.-L. Zhao, and L.-J. Deng, “Multi-dimensional imaging data recovery via minimizing the partial sum of tubal nuclear norm,” Journal of Computational and Applied Mathematics, vol. 372, p. 112680, 2020.
  49. T.-X. Jiang, M. K. Ng, X.-L. Zhao, and T.-Z. Huang, “Framelet representation of tensor nuclear norm for third-order tensor completion,” IEEE Transactions on Image Processing, vol. 29, pp. 7233–7244, 2020.
  50. Y.-B. Zheng, T.-Z. Huang, X.-L. Zhao, T.-X. Jiang, T.-H. Ma, and T.-Y. Ji, “Mixed noise removal in hyperspectral image via low-fibered-rank regularization,” IEEE Transactions on Geoscience and Remote Sensing, vol. 58, no. 1, pp. 734–749, 2019.
  51. W. Cao, Y. Wang, C. Yang, X. Chang, Z. Han, and Z. Xu, “Folded-concave penalization approaches to tensor completion,” Neurocomputing, vol. 152, pp. 261–273, 2015.
  52. D. Goldfarb and Z. Qin, “Robust low-rank tensor recovery: Models and algorithms,” SIAM Journal on Matrix Analysis and Applications, vol. 35, no. 1, pp. 225–253, 2014.
Citations (6)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now