activity
20082015
most citedA fast approach for overcomplete sparse decomposition based on smoothed L0 norm

1.1k citations · 1.3k across the 19 of their papers we have counts for

collaborators
Showing 2008Show all

5 papers · 1 filter

cs.CV2008★ 2 cited

Sparse Component Analysis (SCA) in Random-valued and Salt and Pepper Noise Removal

Hadi. Zayyani, Seyyedmajid Valiollahzadeh, Massoud. Babaie-Zadeh

In this paper, we propose a new method for impulse noise removal from images. It uses the sparsity of images in the Discrete Cosine Transform (DCT) domain. The zeros in this domain…

cs.MM2008

A New Trend in Optimization on Multi Overcomplete Dictionary toward Inpainting

SeyyedMajid Valiollahzadeh, Mohammad Nazari, Massoud Babaie-Zadeh +1

Recently, great attention was intended toward overcomplete dictionaries and the sparse representations they can provide. In a wide variety of signal processing problems, sparsity s…

cs.MM2008★ 5 cited

Approximate Sparse Decomposition Based on Smoothed L0-Norm

Hamed Firouzi, Masoud Farivar, Massoud Babaie-Zadeh +1

In this paper, we propose a method to address the problem of source estimation for Sparse Component Analysis (SCA) in the presence of additive noise. Our method is a generalization…

cs.MM2008

A First Step to Convolutive Sparse Representation

Hamed Firouzi, Massoud Babaie-Zadeh, Aria Ghasemian +1

In this paper an extension of the sparse decomposition problem is considered and an algorithm for solving it is presented. In this extension, it is known that one of the shifted ve…

cs.IT2008★ 1.1k cited

A fast approach for overcomplete sparse decomposition based on smoothed L0 norm

Hossein Mohimani, Massoud Babaie-Zadeh, Christian Jutten

In this paper, a fast algorithm for overcomplete sparse decomposition, called SL0, is proposed. The algorithm is essentially a method for obtaining sparse solutions of underdetermi…