Skip to main content

Simultaneous Sparse Representations with Partially Varying Support

  • Conference paper
  • First Online:
Distributed Computing and Optimization Techniques

Abstract

The idea of sparse representations approximates a signal as a linear combination of a few atoms from a redundant over complete dictionary. Orthogonal Matching Pursuit (OMP) is a greedy algorithm used for the computation of sparse representations. The idea of simultaneous sparse representations is to jointly compute the sparse representations of a group of signals with a common support for their corresponding sparse representations. The OMP algorithm was later extended to Simultaneous-OMP (SOMP) for computing simultaneous sparse representations of a group of signals. The strict constraint on the support of non-zero coefficients makes SOMP unusable in many situations. In this work, an extension of the SOMP algorithm for computing simultaneous sparse representations with a partially varying support is proposed. The experiments demonstrate that the proposed algorithm achieves superior performance over SOMP, when the support of the non-zero sparse representation coefficients is not exactly same for all the sparse representations.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Elad M (2012) Sparse and redundant representation modelling–what next. IEEE Signal Process Lett 19(12):922–928

    Article  Google Scholar 

  2. Elad M (2010) Sparse and Redundant Representations–From Theory to Applications in Signal and Image Processing. Springer, New York. https://doi.org/10.1007/978-1-4419-7011-4

  3. Baraniuk RG, Candes E, Elad M, Ma Y (2010) Applications of sparse representation and compressive sensing [Scanning the Issue]. Proc IEEE 98(6):906–909

    Article  Google Scholar 

  4. Zhang Z, Xu Y, Yang J, Li X, Zhang D (2005) A survey of sparse representation: algorithms and applications. IEEE Access 3:490–530

    Article  Google Scholar 

  5. Elad M, Aharon M (2006) Image denoising via sparse and redundant representations over learned dictionaries. IEEE Trans Image Process 15:3736–3745

    Article  MathSciNet  Google Scholar 

  6. Sadeghi M, Babaie-Zadeh M, Jutten C (2013) Dictionary learning for sparse representation: a novel approach. IEEE Signal Process Lett 20(12):1195–1198

    Article  Google Scholar 

  7. Thangavel SK, Rudra S (2020) A sparse representation based learning algorithm for denoising in images. https://doi.org/10.1007/978-3-030-37218-7-89

  8. Ravishankar S, Reddy CN, Tripathi S, Murthy KVV (2011) Image super resolution using sparse image and singular values as priors. In: Real P, Diaz-Pernil D, Molina-Abril H, Berciano A, Kropatsch W (eds.) Computer Analysis of Images and Patterns. CAIP 2011. LNCS, vol 6855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23678-5_45

  9. AswathiVarsha KTK, Lalitha S (2017) Stress recognition using sparse representation of speech signal for deception detection applications in Indian context. In: IEEE International Conference on Computational Intelligence and Computing Research (ICCIC), pp 1–7

    Google Scholar 

  10. Menon R, Nair SS, Srindhya K, Kaimal MR (2013) Sparsity-based representation for categorical data. In: IEEE Recent Advances in Intelligent Computational Systems (RAICS), pp 74–79

    Google Scholar 

  11. Pati YC, Rezaiifar R, Krishnaprasad PS (2005) Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In: Proceedings of 27th Asilomar Conference on Signals, Systems and Computers, vol 1, pp 40–44. Pacific Grove, CA, USA

    Google Scholar 

  12. Eldar YC, Mishali M (2009) Robust recovery of signals from a structured union of subspaces. IEEE Trans Inf Theory 55(11):5302–5316

    Article  MathSciNet  Google Scholar 

  13. Tropp JA, Gilbert AC, Strauss MJ (2003) Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit. Signal Process 86(3)

    Google Scholar 

  14. Tropp JA, Gilbert AC, Strauss MJ (2003) Algorithms for simultaneous sparse approximation. Part II: Greedy pursuit. Signal Process 86(3)

    Google Scholar 

  15. Li Q, Wang W, Chen G, Zhao D (2021) Medical image fusion using segment graph filter and sparse representation. Comput Biol Med 131

    Google Scholar 

  16. Singh S, Anand RS (2020) Multimodal medical image sensor fusion model using sparse K-SVD dictionary learning in nonsubsampled shearlet domain. IEEE Trans Instrum Meas 69(2):593–607

    Article  Google Scholar 

  17. Gao X, Wang X, Zhou J (2020) A robust orthogonal matching pursuit based on L1 norm. In: Chinese Control And Decision Conference (CCDC), pp 3735–3740

    Google Scholar 

  18. Liu H, Zhang J, Mou C (2021) Image denoising based on correlation adaptive sparse modeling. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sathi, L.M., Juluri, V., Tangudu, S., Sreeram, S., Kuzhithara Sajan, K., Palakkattillam, S. (2022). Simultaneous Sparse Representations with Partially Varying Support. In: Majhi, S., Prado, R.P.d., Dasanapura Nanjundaiah, C. (eds) Distributed Computing and Optimization Techniques. Lecture Notes in Electrical Engineering, vol 903. Springer, Singapore. https://doi.org/10.1007/978-981-19-2281-7_72

Download citation

  • DOI: https://doi.org/10.1007/978-981-19-2281-7_72

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-19-2280-0

  • Online ISBN: 978-981-19-2281-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics