Low-rank tensor completion is a recent method for estimating the values of the missing elements in tensor data by minimizing the tensor rank. However, with only the low rank prior, the local piecewise smooth structure that is important for visual data is not used effectively. To address this problem, we define a new spatial regularization S-norm for tensor completion in order to exploit the local spatial smoothness structure of visual data. More specifically, we introduce the S-norm to the tensor completion model based on a non-convex LogDet function. The S-norm helps to drive the neighborhood elements towards similar values. We utilize the Alternating Direction Method of Multiplier (ADMM) to optimize the proposed model. Experimental result...
Abstract. Higher-order low-rank tensors naturally arise in many applications including hyperspectral...
Many restoration methods use the low-rank constraint of high-dimensional image signals to recover co...
Most tensor problems are NP-hard, and low-rank tensor completion is much more difficult than low-ran...
To alleviate the bias generated by the $\ell_1$-norm in the low-rank tensor completion problem, nonc...
To alleviate the bias generated by the $\ell_1$-norm in the low-rank tensor completion problem, nonc...
In this paper we propose an algorithm to estimate miss-ing values in tensors of visual data. The val...
To alleviate the bias generated by the $\ell_1$-norm in the low-rank tensor completion problem, nonc...
One of the popular approaches for low-rank tensor completion is to use the latent trace norm regular...
The multi-channel image or the video clip has the natural form of tensor. The values of the tensor c...
Tensor completion aims to recover missing entries from partial observations for multi-dimensional da...
With the advance of acquisition techniques, plentiful higherorder tensor data sets are built up in a...
In tensor completion tasks, the traditional low-rank tensor decomposition models suffer from the lab...
AbstractThe tensor completion problem is to recover a low-n-rank tensor from a subset of its entries...
Matrix and tensor completion arise in many different real-world applications related to the inferenc...
Video completion is a computer vision technique to recover the missing values in video sequences by ...
Abstract. Higher-order low-rank tensors naturally arise in many applications including hyperspectral...
Many restoration methods use the low-rank constraint of high-dimensional image signals to recover co...
Most tensor problems are NP-hard, and low-rank tensor completion is much more difficult than low-ran...
To alleviate the bias generated by the $\ell_1$-norm in the low-rank tensor completion problem, nonc...
To alleviate the bias generated by the $\ell_1$-norm in the low-rank tensor completion problem, nonc...
In this paper we propose an algorithm to estimate miss-ing values in tensors of visual data. The val...
To alleviate the bias generated by the $\ell_1$-norm in the low-rank tensor completion problem, nonc...
One of the popular approaches for low-rank tensor completion is to use the latent trace norm regular...
The multi-channel image or the video clip has the natural form of tensor. The values of the tensor c...
Tensor completion aims to recover missing entries from partial observations for multi-dimensional da...
With the advance of acquisition techniques, plentiful higherorder tensor data sets are built up in a...
In tensor completion tasks, the traditional low-rank tensor decomposition models suffer from the lab...
AbstractThe tensor completion problem is to recover a low-n-rank tensor from a subset of its entries...
Matrix and tensor completion arise in many different real-world applications related to the inferenc...
Video completion is a computer vision technique to recover the missing values in video sequences by ...
Abstract. Higher-order low-rank tensors naturally arise in many applications including hyperspectral...
Many restoration methods use the low-rank constraint of high-dimensional image signals to recover co...
Most tensor problems are NP-hard, and low-rank tensor completion is much more difficult than low-ran...