| Authors: | J. Bobin, J.-L. Starck, J. M. Fadili, Y. Moudden, D. L. Donoho |
| Journal: | IEEE |
| Year: | 2007 |
| Download: | ADS |
Abstract
In a recent paper, a method called morphological component analysis (MCA) has been proposed to separate the texture from the natural part in images. MCA relies on an iterative thresholding algorithm, using a threshold which decreases linearly towards zero along the iterations. This paper shows how the MCA convergence can be drastically improved using the mutual incoherence of the dictionaries associated to the different components. This modified MCA algorithm is then compared to basis pursuit, and experiments show that MCA and BP solutions are similar in terms of sparsity, as measured by the 1 norm, but MCA is much faster and gives us the possibility of handling large scale data sets.
