Recovery of Missing Samples Using Sparse Approximation via a Convex Similarity Measure

2017-06-28 · Amirhossein Javaheri, Hadi Zayyani, Farokh Marvasti

In this paper, we study the missing sample recovery problem using methods based on sparse approximation. In this regard, we investigate the algorithms used for solving the inverse problem associated with the restoration of missed samples of image signal. This problem is also known as inpainting in the context of image processing and for this purpose, we suggest an iterative sparse recovery algorithm based on constrained $l_1$-norm minimization with a new fidelity metric. The proposed metric called Convex SIMilarity (CSIM) index, is a simplified version of the Structural SIMilarity (SSIM) index, which is convex and error-sensitive. The optimization problem incorporating this criterion, is then solved via Alternating Direction Method of Multipliers (ADMM). Simulation results show the efficiency of the proposed method for missing sample recovery of 1D patch vectors and inpainting of 2D image signals.

📄 PDF Abstract BibTeX arXiv:1706.09395

Code (0)

등록된 구현이 없습니다.

Tasks

SSIM

A Convex Similarity Index for Sparse Recovery of Missing Image Samples

2017-01-25 · Amirhossein Javaheri, Hadi Zayyani, Farokh Marvasti

This paper investigates the problem of recovering missing samples using methods based on sparse representation adapted especially for image signals. Instead of $l_2$-norm or Mean Square Error (MSE), a new perceptual qual…

SSIM

The Convex Landscape of Neural Networks: Characterizing Global Optima and Stationary Points via Lasso Models

2023-12-19 · Tolga Ergen, Mert Pilanci

Due to the non-convex nature of training Deep Neural Network (DNN) models, their effectiveness relies on the use of non-convex optimization heuristics. Traditional methods for training DNNs often require costly empirical…

Robust Principal Component Analysis on Graphs

2015-04-23 · ICCV 2015 12 · Nauman Shahid, Vassilis Kalofolias, Xavier Bresson, Michael Bronstein 외

Principal Component Analysis (PCA) is the most widely used tool for linear dimensionality reduction and clustering. Still it is highly sensitive to outliers and does not scale well with respect to the number of data samp…

Clustering Dimensionality Reduction Missing Values

Tensor completion and low-n-rank tensor recovery via convex optimization

2011-02-24 · IOPScience 2011 2 · Silvia Gandy, Benjamin Recht and Isao Yamada

In this paper we consider sparsity on a tensor level, as given by the n-rank of a tensor. In the important sparse-vector approximation problem (compressed sensing) and the low-rank matrix recovery problem, using a conv…

compressed sensing

Comparison of Several Sparse Recovery Methods for Low Rank Matrices with Random Samples

2016-06-12 · Ashkan Esmaeili, Farokh Marvasti

In this paper, we will investigate the efficacy of IMAT (Iterative Method of Adaptive Thresholding) in recovering the sparse signal (parameters) for linear models with missing data. Sparse recovery rises in compressed se…

BIG-bench Machine Learning compressed sensing