Kernelized Sparse Bayesian Matrix Factorization

doi:10.1109/TNNLS.2020.2978761

Kernelized Sparse Bayesian Matrix Factorization

2021-01-01

9

OA

AI

DOI：10.1109/TNNLS.2020.2978761

Original

Original request for help

Save

Abstract

En 中文

Extracting low-rank and/or sparse structures using matrix factorization techniques has been extensively studied in the machine learning community. Kernelized matrix factorization (KMF) is a powerful tool to incorporate side information into the low-rank approximation model, which has been applied to solve the problems of data mining, recommender systems, image restoration, and machine vision. However, most existing KMF models rely on specifying the rows and columns of the data matrix through a Gaussian process prior and have to tune manually the rank. There are also computational issues of existing models based on regularization or the Markov chain Monte Carlo. In this article, we develop a hierarchical kernelized sparse Bayesian matrix factorization (KSBMF) model to integrate side information. The KSBMF automatically infers the parameters and latent variables including the reduced rank using the variational Bayesian inference. In addition, the model simultaneously achieves low-rankness through sparse Bayesian learning and columnwise sparsity through an enforced constraint on latent factor matrices. We further connect the KSBMF with the nonlocal image processing framework to develop two algorithms for image denoising and inpainting. Experimental results demonstrate that KSBMF outperforms the state-of-the-art approaches for these image-restoration tasks under various levels of corruption.

Keywords:

Sparse matrices

Bayes methods

Matrix decomposition

Covariance matrices

Data models

Kernel

Computational modeling

Image restoration

low-rankness

matrix factorization

sparse Bayesian learning

variational Bayesian (VB) inference

Kernelized Sparse Bayesian Matrix Factorization

Abstract

Journal

Organization