[hal-00813969, v1] Morphological Diversity and Sparsity for Multichannel Data Restoration
نویسندگان
چکیده
Over the last decade, overcomplete dictionaries and the very sparse signal representations they make possible, have raised an intense interest from signal processing theory. In a wide range of signal processing problems, sparsity has been a crucial property leading to high performance. As multichannel data are of growing interest, it seems essential to devise sparsity-based tools accounting for such specific multichannel data. Sparsity has proved its efficiency in a wide range of inverse problems. Hereafter, we address some multichannel inverse problems issues such as multichannel morphological component separation and inpainting from the perspective of sparse representation. In this paper, we introduce a new sparsity-based multichannel analysis tool coined multichannel Morphological Component Analysis (mMCA). This new framework focuses on multichannel morphological diversity to better represent multichannel data. This paper presents conditions under which the mMCA converges and recovers the sparse multichannel representation. Several experiments are presented to demonstrate the applicability of our approach on a set of multichannel inverse problems such as morphological component decomposition and inpainting. Introduction This paper addresses several multichannel data recovery problems such as multichannel morphological component decomposition and inpainting. We first need to define with care what multichannel data are. Such data are often physically composed of m observations (a colour layer in colour images, an observation at a fixed frequency for multispectral data and so on). One classical example of such multichannel data are the hyperspectral data provided by satellite observations; a fixed geographic area is observed at m different frequencies. More formally, we assume that each observation is made of t samples. We will write each observation as a 1 × t row vector {xi}i=1,··· ,m. For convenience, those m vectors are stacked in a m × t matrix X = [ x1 · · ·x T m ]T . In a wide range of applications, the data X are often degraded by the acquisition system (convolution, missing ha l-0 08 13 96 9, v er si on 1 16 A pr 2 01 3 Author manuscript, published in "Journal of Mathematical Imaging and Vision 33, 2 (2009) 149-168" DOI : 10.1007/s10851-008-0065-6
منابع مشابه
Blind Source Separation: the Sparsity Revolution
Over the last few years, the development of multi-channel sensors motivated interest in methods for the coherent processing of multivariate data. Some specific issues have already been addressed as testified by the wide literature on the so-called blind source separation (BSS) problem. In this context, as clearly emphasized by previous work, it is fundamental that the sources to be retrieved pr...
متن کاملDiversity priors for learning early visual features
This paper investigates how utilizing diversity priors can discover early visual features that resemble their biological counterparts. The study is mainly motivated by the sparsity and selectivity of activations of visual neurons in area V1. Most previous work on computational modeling emphasizes selectivity or sparsity independently. However, we argue that selectivity and sparsity are just two...
متن کاملMorphological Diversity and Sparsity in Blind Source Separation
This paper describes a new blind source separation method for instantaneous linear mixtures. This new method coined GMCA (Generalized Morphological Component Analysis) relies on morphological diversity. It provides new insights on the use of sparsity for blind source separation in a noisy environment. GMCA takes advantage of the sparse representation of structured data in large overcomplete sig...
متن کاملA NOVEL FUZZY-BASED SIMILARITY MEASURE FOR COLLABORATIVE FILTERING TO ALLEVIATE THE SPARSITY PROBLEM
Memory-based collaborative filtering is the most popular approach to build recommender systems. Despite its success in many applications, it still suffers from several major limitations, including data sparsity. Sparse data affect the quality of the user similarity measurement and consequently the quality of the recommender system. In this paper, we propose a novel user similarity measure based...
متن کاملJoint Enhancement of Multichannel SAR Data
In this paper we consider the problem of joint enhancement of multichannel Synthetic Aperture Radar (SAR) data. Previous work by Cetin and Karl introduced nonquadratic regularization methods for image enhancement using sparsity enforcing penalty terms. For multichannel data, independent enhancement of each channel is shown to degrade the relative phase information across channels that is useful...
متن کامل