arrow
Return

A novel patch-based nonlinear matrix completion algorithm for image analysis through convolutional neural network

delete2020-05-01
delete10
PRE
AI
M
Mingming Yang
S
Songhua Xu *
DOI:10.1016/j.neucom.2020.01.037delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

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.
Keywords:
Nonlinear matrix completion
Laplace distribution
Patch-based completion algorithm
Deep convolutional neural network
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Neurocomputing cover
Neurocomputing
IF:
6.5
Papers:
2.5W
Citations:
6.5W

Organization

X
xi'an jiaotong university
Scholars:
9.3W
Papers: 6.7W
Citations: 75
Cited Papers

Cited Papers

err
IF0
err
err0
PREAI
err
errShare
errSave
Image completion with multi-image based on entropy reduction
err2015-07-01
err32
PREAI
errWu, Hao; Miao, Zhenjiang; Wang, Yi; Chen, Jingyue; Ma, Cong; Zhou, Tianyu
errShare
errSave
errShare
errSave
Comparison of Baseline Neuropsychological Testing in Amateur Versus Professional Boxers
err2015-06-19
err0
PREAI
errMassimiliano Bianco; Matteo Ferri; Carmela Fabiano; Anna Scardigno; Sofia Tavella; Anna Caccia; Umberto Manili; Marcello Faina; Maurizo Casasco; Paolo Zeppilli
errShare
errSave
Gradient-based learning applied to document recognition
err1998-01-01
err3.8W
PREAI
errLecun, Y; Bottou, L; Bengio, Y; Haffner, P
errShare
errSave
A fast tri-factorization method for low-rank matrix recovery and completion
err2013-01-01
err65
PREAI
errLiu, Yuanyuan; Jiao, L. C.; Shang, Fanhua
errShare
errSave
researcher View more