Skip to main content

Efficient Separation of Convolutive Image Mixtures

  • Conference paper
Independent Component Analysis and Blind Signal Separation (ICA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3889))

Abstract

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 devise an efficient approach to solve these problems. Our method is fast, while achieving high quality image separation. 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.

This research has been supported in parts by the “Dvorah” Fund of the Technion and by the HASSIP Research Network Program HPRN-CT-2002-00285, sponsored by the European Commission. The research was carried out in the Ollendorff Minerva Center. Minerva is funded through the BMBF. Yoav Schechner is a Landau Fellow-supported by the Taub Foundation, and an Alon Fellow.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Schechner, Y.Y., Kiryati, N., Basri, R.: Separation of transparent layers using focus. Int. J. Computer Vision 89, 25–39 (2000)

    Article  Google Scholar 

  2. Macias-Garza, F., Bovik, A.C., Diller, K.R., Aggarwal, S.J., Aggarwal, J.K.: The missing cone problem and low-pass distortion in optical serial sectioning microscopy. In: Proc. ICASSP, vol. 2, pp. 890–893 (1988)

    Google Scholar 

  3. Schechner, Y.Y., Shamir, J., Kiryati, N.: Polarization and statistical analysis of scenes containing a semi-reflector. J. Opt. Soc. America A 17, 276–284 (2000)

    Article  Google Scholar 

  4. Bronstein, A.M., Bronstein, M.M., Zibulevsky, M., Zeevi, Y.Y.: Sparse ICA for blind separation of transmitted and reflected images. Intl. J. Imaging Science and Technology 15(1), 84–91 (2005)

    Article  Google Scholar 

  5. Castella, M., Pesquet, J.C.: An iterative blind source separation method for convolutive mixtures of images. In: Puntonet, C.G., Prieto, A.G. (eds.) ICA 2004. LNCS, vol. 3195, pp. 922–929. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Parra, L., Spence, C.: Convolutive blind separation of non-stationary sources. IEEE Trans. on Speech and Audio Processing 8, 320–327 (2000)

    Article  Google Scholar 

  7. Smaragdis, P.: Blind separation of convolved mixtures in the frequency domain. Neurocomputing 22, 21–34 (1998)

    Article  MATH  Google Scholar 

  8. Kasprzak, W., Okazaki, A.: Blind deconvolution of timely-correlated sources by homomorphic filtering in Fourier space. In: Proc. ICA 2003, pp. 1029–1034 (2003)

    Google Scholar 

  9. Hyvärinen, A., Karhunen, J., Oja, E.: Independent component analysis. John Wiley and Sons, NY (2001)

    Book  Google Scholar 

  10. Pham, D.T.: Contrast functions for blind source separation and deconvolution of sources. In: Proc. ICA 2001, pp. 37–42 (2001)

    Google Scholar 

  11. Zibulevsky, M., Pearlmutter, B.A.: Blind source separation by sparse decomposition in a signal dictionary. Neural Computations 13(4), 863–882 (2001)

    Article  MATH  Google Scholar 

  12. Simoncelli, E.P.: Statistical models for images: Compression, restoration and synthesis. In: Proc. IEEE Asilomar Conf. Sig. Sys. and Computers, pp. 673–678 (1997)

    Google Scholar 

  13. Pham, D.T., Garrat, P.: Blind separation of a mixture of independent sources through a quasi-maximum likelihood approach. IEEE Trans. Sig. Proc. 45(7), 1712–1725 (1997)

    Article  MATH  Google Scholar 

  14. Zibulevsky, M.: Blind source separation with relative newton method. In: Proc. ICA 2003, pp. 897–902 (2003)

    Google Scholar 

  15. Shwartz, S., Schechner, Y.Y., Zibulevsky, M.: Efficient blind separation of convolutive image mixtures. Technical report, CCIT No. 553, Dep. Elec. Eng., Technion Israel Inst.Tech. (2005)

    Google Scholar 

  16. Born, M., Wolf, E.: Principles of optics. Pergamon, Oxford (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shwartz, S., Schechner, Y.Y., Zibulevsky, M. (2006). Efficient Separation of Convolutive Image Mixtures. In: Rosca, J., Erdogmus, D., Príncipe, J.C., Haykin, S. (eds) Independent Component Analysis and Blind Signal Separation. ICA 2006. Lecture Notes in Computer Science, vol 3889. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11679363_31

Download citation

  • DOI: https://doi.org/10.1007/11679363_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32630-4

  • Online ISBN: 978-3-540-32631-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics