.png){kind=icon}
返回
A novel patch-based nonlinear matrix completion algorithm for image analysis through convolutional neural network
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2020.01.037.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Matrix completion is extensively studied due to its wide applications in science and technology. In this paper, we concentrate our study on the matrix completion problem for image analysis tasks due to their immense importance and pervasive use in many fields. A rich collection of models has been proposed to capture both linear and nonlinear relationships latent in a matrix. Even though nonlinear models possess more powerful matrix completion capabilities than their linear counterparts, these models generally carry higher model complexity and tuning difficulties. To take advantage of the superior discriminative power offered by nonlinear models while curbing its deployment overheads, this paper proposes a novel nonlinear matrix completion model utilizing a deep learning-based approach. In contrast to existing nonlinear models, the new model carefully explores and exploits spatial locality among adjacent matrix elements exhibited in patches of various sizes and locations in a target matrix. Building upon this idea, a new patch-based nonlinear matrix completion algorithm is designed. The algorithm leverages a convolutional neural network to learn the predictive relationship between a matrix element and its surrounding elements through an end-to-end trainable fashion, leading to a capable and easy-to-deploy nonlinear matrix completion solution. To identify an optimal patch size suited for tackling a given matrix completion task without exhaustively enumerating all candidate patch sizes, the new algorithm is coupled with a fast stochastic search procedure, yielding a good trade-off between computational efficiency and accuracy. Extensive experiments are conducted to validate the effectiveness and advantages of the proposed algorithm for nonlinear matrix completion problem in comparison with a series of state-of-the-art algorithms. Experimental results consistently demonstrate the superiority of the new algorithm in completing images with a variety of random and textual noises. (C) 2020 Published by Elsevier B.V.
Keyword:
Nonlinear matrix completion
Laplace distribution
Patch-based completion algorithm
Deep convolutional neural network
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Rank adaptive atomic decomposition for low-rank matrix completion and its application on image recovery.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏
Gradient-based learning applied to document recognition基于梯度的学习在文档识别中的应用PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏A fast tri-factorization method for low-rank matrix recovery and completionPATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
查看更多内容