Blind separation of convolutive image mixtures

نویسندگان

  • Sarit Shwartz
  • Yoav Y. Schechner
  • Michael Zibulevsky
چکیده

Convolutive mixtures of images are common in photography of semi-reflections. They also occur in microscopy and tomography. Their formation process involves focusing on an object layer, over which defocused layers are superimposed. We seek blind source separation (BSS) of such mixtures. However, achieving this by direct optimization of mutual information is very complex and suffers from local minima. Thus, we devise an efficient approach to solve these problems. While achieving high quality image separation, we take steps that make the problem significantly simpler than a direct formulation of convolutive image mixtures. These steps make the problem practically convex, yielding a unique global solution to which convergence can be fast. The convolutive BSS problem is converted into a set of instantaneous (pointwise) problems, using a short time Fourier transform (STFT). Standard BSS solutions for instantaneous problems suffer, however, from scale and permutation ambiguities. We overcome these ambiguities by exploiting a parametric model of the defocus point spread function. Moreover, we enhance the efficiency of the approach by exploiting the sparsity of the STFT representation as a prior. We apply our algorithm to semi-reflections, and demonstrate it in experiments. r 2008 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Separation of Convolutive Image Mixtures

Convolutive mixtures of images are common in photography of semi-reflections. They also occur in microscopy and tomography. Their formation process involves focusing on an object layer, over which defocused layers are superimposed. Blind source separation (BSS) of convolutive image mixtures by direct optimization of mutual information is very complex and suffers from local minima. Thus, we devi...

متن کامل

Blind Separating Convolutive Post Non-linear Mixtures

This paper addresses blind source separation in convolutive post nonlinear (CPNL) mixtures. In these mixtures, the sources are mixed convolutively, and then measured by nonlinear (e.g. saturated) sensors. The algorithm is based on minimizing the mutual information by using multivariate score functions.

متن کامل

Blind Source Separation of Convolutive Mixtures of Speech in Frequency Domain

This paper overviews a total solution for frequencydomain blind source separation (BSS) of convolutive mixtures of audio signals, especially speech. Frequency-domain BSS performs independent component analysis (ICA) in each frequency bin, and this is more efficient than time-domain BSS. We describe a sophisticated total solution for frequency-domain BSS, including permutation, scaling, circular...

متن کامل

Blind separation of convolutive mixtures of cyclostationary sources using an extended natural gradient method

An on-line adaptive blind source separation algorithm for the separation of convolutive mixtures of cyclostationary source signals is proposed. The algorithm is derived by a p plying natural gradient iterative learning to the novel cost function which is delined according to the wide sense cyclostationarity of signals. The efficiency of the algorithm is supported by simulations, which show that...

متن کامل

Blind Source Separation of Convolutive Audio Using an Adaptive Stereo Basis

We consider the problem of convolutive blind source separation of audio mixtures. We propose an Adaptive Stereo Basis (ASB) method based on learning a set of basis vectors pairs from the time-domain stereo mixtures. The basis vector pairs are clustered using estimated directions of arrival (DOAs) such that each basis vector pair is associated with one source. The ASB method is compared with the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Neurocomputing

دوره 71  شماره 

صفحات  -

تاریخ انتشار 2008