Low rank matrix approximation (LRMA) has drawn increasing attention in recent years, due to its wide range of applications in computer vision and machine learning. However, LRMA, achieved by nuclear norm minimization (NNM), tends to over-shrink the rank components with the same threshold and ignore the differences between rank components. To address this problem, we propose a flexible and precise model named multi-band weighted $l_p$ norm minimization (MBWPNM). The proposed MBWPNM not only gives more accurate approximation with a Schatten $p$-norm, but also considers the prior knowledge where different rank components have different importance. We analyze the solution of MBWPNM and prove that MBWPNM is equivalent to a non-convex $l_p$ norm subproblems under certain weight condition, whose global optimum can be solved by a generalized soft-thresholding algorithm. We then adopt the MBWPNM algorithm to color and multispectral image denoising. Extensive experiments on additive white Gaussian noise removal and realistic noise removal demonstrate that the proposed MBWPNM achieves a better performance than several state-of-art algorithms.
翻译:近年来,低级矩阵近似值(LRMA)因其在计算机视觉和机器学习方面的广泛应用而日益引起人们的注意,然而,通过核规范最小化(NNM)实现的LRMA往往以同一阈值过度削减等级组成部分,忽视等级组成部分之间的差别。为解决这一问题,我们提议了一个灵活而精确的模型,名为多波段加权值$l_p美元标准最小化(MBWPNM )。拟议的MBWPNM不仅以Schatten $p$-norm 提供更准确的近似值,而且还考虑到以前不同等级组成部分具有不同重要性的知识。我们分析了MBWPNM的解决方案,并证明MBWPNM在某些重量条件下相当于非编码值$l_p$的规范子问题,其全球最佳性可以通过普遍软持有算法来解决。我们随后采用MBWPNM算法进行色和多光谱图像淡化。关于添加白高音的大规模实验和现实的噪音清除试验表明,拟议的MBMMWPMMWP比几个状态的算法效果要好。