首页> 外文会议>International Conference on Multimedia Big Data >LR2-SR: Laplacian Regularized Low-Rank Sparse Representation for Single Image Super-Resolution
【24h】

LR2-SR: Laplacian Regularized Low-Rank Sparse Representation for Single Image Super-Resolution

机译:LR 2 -SR:单图像超分辨率的拉普拉斯正则化低秩稀疏表示

获取原文

摘要

In this paper, we propose a single image super-resolution (SR) method based on Laplacian regularized low-rank sparse representation (LR2-SR). Low-rank strategy assumes that similar features should have similar sparse codes in SR. However, it does not make full use of the similarity between features. To overcome this defect, we construct a Laplacian matrix and incorporate a Laplacian regularization into the low-rank sparse representation for SR. The Laplacian matrix measures the similarity between features, and is used to constrain the sparse codes. Thus, we preserve the consistency between features and sparse codes. Furthermore, we utilize the Inexact Augmented Lagrange Multiplier (IALM) and gradient descent algorithm to solve the problem. Extensive experiments demonstrate the effectiveness of the proposed method both quantitatively and qualitatively compared with state-of-the-art sparse-coding based methods.
机译:本文提出了一种基于拉普拉斯正则化低秩稀疏表示(LR)的单图像超分辨率(SR)方法 2 -SR)。低等级策略假设SR中相似的功能应具有相似的稀疏代码。但是,它没有充分利用特征之间的相似性。为了克服此缺陷,我们构造了一个Laplacian矩阵并将一个Laplacian正则化合并到SR的低秩稀疏表示中。拉普拉斯矩阵测量特征之间的相似度,并用于约束稀疏代码。因此,我们保留了特征和稀疏代码之间的一致性。此外,我们利用不精确增强拉格朗日乘数(IALM)和梯度下降算法来解决该问题。大量实验证明了与基于稀疏编码技术的最新方法相比,该方法在定量和定性方面的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号