Skip to main content

Overcomplete Dictionary Pair for Music Super-Resolution

  • Conference paper
  • First Online:
Advances in Neural Networks – ISNN 2018 (ISNN 2018)

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

Included in the following conference series:

  • 3791 Accesses

Abstract

With the development of society, people are going to pursue high quality music (HM). However, the Internet is filled with more generic music (GM) rather than HM. In this paper, we propose a novel algorithm called overcomplete dictionary pairs (ODP) algorithm. The ODP algorithm is able to recover HM from GM. The basic idea is to determine a set of elementary functions, called atoms, that efficiently capture music signal characteristics. There are mainly two steps. First, we employ K-SVD algorithm to jointly learn the overcomplete dictionary pairs of HM and GM frames. Then, we recovery HM via sharing the sparse representations of HM and GM. In order to validate the effectiveness of the ODP algorithm, the segment Signal-to-Noise Ratio performance and another objective parameter, perceptual objective listening quality assessment, which is introduced by the ITU are concerned. Experimental results show that the proposed algorithm is much better than conventional reconstruction method like shape-preserving piecewise cubic interpolation.

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 EPUB and 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

References

  1. Cho, N., Kuo, C.C.J.: Sparse music representation with source-specific dictionaries and its application to signal separation. IEEE Trans. Audio Speech Lang. Process. 19(2), 326–337 (2011)

    Article  Google Scholar 

  2. Guichaoua, C.: Dictionary learning for audio inpainting. HAL Robotics [cs. RO] (2012)

    Google Scholar 

  3. Le Roux, J., Kameoka, H., Ono, N., De Cheveigne, A., Sagayama, S.: Computational auditory induction as a missing-data model-fitting problem with Bregman divergence. Speech Commun. 53(5), 658–676 (2011)

    Article  Google Scholar 

  4. Yang, J., Wright, J., Huang, T.S., Ma, Y.: Image super-resolution via sparse representation. IEEE Trans. Image Process. 19(11), 2861–2873 (2010)

    Article  MathSciNet  Google Scholar 

  5. Petrovsky, A., Herasimovich, V., Petrovsky, A.: Bio-inspired sparse representation of speech and audio using psychoacoustic adaptive matching pursuit. In: Ronzhin, A., Potapova, R., Németh, G. (eds.) SPECOM 2016. LNCS (LNAI), vol. 9811, pp. 156–164. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-43958-7_18

    Chapter  Google Scholar 

  6. Xie, Y., Huang, J., He, Y.: One dictionary vs. two dictionaries in sparse coding based denoising. Chin. J. Electron. 26(2), 367–371 (2017)

    Article  Google Scholar 

  7. Dighe, P., Asaei, A., Bourlard, H.: Sparse modeling of neural network posterior probabilities for exemplar-based speech recognition. Speech Commun. 76, 230–244 (2016)

    Article  Google Scholar 

  8. Zong, Y., Zheng, W., Cui, Z., Li, Q.: Double sparse learning model for speech emotion recognition. Electron. Lett. 52(16), 1410–1412 (2016)

    Article  Google Scholar 

  9. Vaizman, Y., McFee, B., Lanckriet, G.: Codebook-based audio feature representation for music information retrieval. IEEE/ACM Trans. Audio Speech Lang. Process. 22(10), 1483–1493 (2014)

    Article  Google Scholar 

  10. Adler, A., Emiya, V., Jafari, M.G., Elad, M., Gribonval, R., Plumbley, M.D.: Audio inpainting. IEEE Trans. Audio Speech Lang. Process. 20(3), 922–932 (2012)

    Article  Google Scholar 

  11. Aharon, M., Elad, M., Bruckstein, A.: K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process. 54(11), 4311–4322 (2006)

    Article  Google Scholar 

  12. Beerends, J.G., Schmidmer, C., Berger, J., Obermann, M., Ullmann, R., Pomy, J., Keyhl, M.: Perceptual objective listening quality assessment (POLQA), the third generation ITU-T standard for end-to-end speech quality measurement part I - temporal alignment. J. Audio Eng. Soc. 61(6), 366–384 (2013)

    Google Scholar 

  13. Beerends, J.G., Schmidmer, C., Berger, J., Obermann, M., Ullmann, R., Pomy, J., Keyhl, M.: Perceptual objective listening quality assessment (POLQA), the third generation ITU-T standard for end-to-end speech quality measurement part II - perceptual model. J. Audio Eng. Soc. 61(6), 385–402 (2013)

    Google Scholar 

Download references

Acknowledgments

This work is supported by the National Key Research Project of China under Grant No. 2017YFF0210903 and the National Natural Science Foundation of China under Grant Nos. 61371147 and 11433002.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jie Zhu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, L., Zhu, J. (2018). Overcomplete Dictionary Pair for Music Super-Resolution. In: Huang, T., Lv, J., Sun, C., Tuzikov, A. (eds) Advances in Neural Networks – ISNN 2018. ISNN 2018. Lecture Notes in Computer Science(), vol 10878. Springer, Cham. https://doi.org/10.1007/978-3-319-92537-0_67

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-92537-0_67

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-92536-3

  • Online ISBN: 978-3-319-92537-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics