Skip to main content

Blind Extraction of the Sparsest Component

  • Conference paper
Latent Variable Analysis and Signal Separation (LVA/ICA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6365))

Abstract

In this work, we present a discussion concerning some fundamental aspects of sparse component analysis (SCA), a methodology that has been increasingly employed to solve some challenging signal processing problems. In particular, we present some insights into the use of ℓ1 norm as a quantifier of sparseness and its application as a cost function to solve the blind source separation (BSS) problem. We also provide results on experiments in which source extraction was successfully made when we performed a search for sparse components in the mixtures of sparse signals. Finally, we make an analysis of the behavior of this approach on scenarios in which the source signals are not sparse.

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

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. Comon, P.: Independent component analysis, A new concept? Signal Processing 36, 287–314 (1994)

    Article  MATH  Google Scholar 

  2. Georgiev, P., Theis, F., Cichocki, A.: Sparse component analysis and blind source separation of underdetermined mixtures. IEEE Transactions on Neural Networks 16(4), 992–996 (2005)

    Article  Google Scholar 

  3. Bofill, P., Zibulevsky, M.: Blind separation of more sources than mixtures using sparsity of their short-time Fourier transform. In: Proceedings of the ICA 2000, pp. 87–92 (2000)

    Google Scholar 

  4. Rickard, S.: Sparse sources are separated sources. In: Proceedings of the 16th Annual European Signal Processing Conference, Florence, Italy (2006)

    Google Scholar 

  5. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, New York (2004)

    MATH  Google Scholar 

  6. de Castro, L.N., Timmis, J.: An artificial immune network for multimodal function optimization. In: Proc. of IEEE International Conference on Evolutionary Computation, Honolulu, USA, pp. 699–704 (2002)

    Google Scholar 

  7. Fevotte, C., Godsill, S.J.: A Bayesian Approach for Blind Separation of Sparse Sources. IEEE Trans. on Audio, Speech and Language Processing 14(6), 2174–2188 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nadalin, E.Z., Takahata, A.K., Duarte, L.T., Suyama, R., Attux, R. (2010). Blind Extraction of the Sparsest Component. In: Vigneron, V., Zarzoso, V., Moreau, E., Gribonval, R., Vincent, E. (eds) Latent Variable Analysis and Signal Separation. LVA/ICA 2010. Lecture Notes in Computer Science, vol 6365. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15995-4_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15995-4_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15994-7

  • Online ISBN: 978-3-642-15995-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics