4.6 Article

An improved anchor neighborhood regression SR method based on low-rank constraint

期刊

VISUAL COMPUTER
卷 38, 期 2, 页码 405-418

出版社

SPRINGER
DOI: 10.1007/s00371-020-02022-0

关键词

Super-resolution; Sparse representation; Low-rank constraint; Anchor neighborhood regression

资金

  1. National Natural Science Foundation of China [61573182]
  2. Fundamental Research Funds for the Central Universities [NS2020025]

向作者/读者索取更多资源

This paper proposes an improved SR algorithm based on low-rank constraint, which achieves better image reconstruction quality and speed by introducing locally weighted regularization and constraints on reconstruction blocks.
At present, the image super-resolution (SR) method based on sparse representation has the problem that the reconstruction speed and quality are difficult to be achieved simultaneously. Therefore, this paper proposes an improved anchor neighborhood regression SR algorithm based on low-rank constraint. Firstly, considering the critical role of locality in nonlinear data learning, the locally weighted regularization weight is introduced in the calculation of the projection matrix, which can constrain the projection process according to the correlation between the anchor point and the atoms in the corresponding neighborhood. Then, in the reconstruction phase, based on the assumption of low-rank between similar blocks, further constraints are made on the reconstruction blocks to obtain better reconstruction image quality. Experiments show that our method can not only reconstruct more image details but also achieve better reconstruction speed. Compared with some state-of-the-art sparse representation method, it achieves better reconstruction results in objective evaluation criteria.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据