Skip to main content

2018 | OriginalPaper | Buchkapitel

ODD: An Algorithm of Online Directional Dictionary Learning for Sparse Representation

verfasst von : Dan Xu, Xinwei Gao, Xiaopeng Fan, Debin Zhao, Wen Gao

Erschienen in: Advances in Multimedia Information Processing – PCM 2017

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Recently, some sparse representation based image reconstruction methods have demonstrated with a learnt dictionary. In this paper, we propose a block-based image sparse representation approach with an online directional dictionary (ODD). Unlike the conventional dictionary learning approaches for image sparse representation aims at learning some signal patterns from a large set of training image patches, the proposed joint dictionary for each patch is composed by an original offline or online trained sub-dictionary from a training set and an novel adaptive directional sub-dictionary estimated from the reconstructed nearby pixels of the patch itself. A joint dictionary with ODD has two main advantages compared with the conventional dictionaries. First, for each patch to be sparse represented, not only the most general contents, but also the most possible directional textures of the image patch are considered to improve the reconstruction performance. Second, in order to save storage costs, only the original trained sub-dictionary should be stored, the proposed ODD can be obtained consistently. Experimental results show that the reconstruction performance of the proposed approach exceeds other competitive dictionary learning based image sparse representation methods, validating the superiority of our approach.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Wallace, G.K.: The JPEG still picture compression standard. Commun. ACM 34(4), 607–609 (1991)CrossRef Wallace, G.K.: The JPEG still picture compression standard. Commun. ACM 34(4), 607–609 (1991)CrossRef
2.
Zurück zum Zitat Taubman, D., Marcellin, M.: JPEG 2000: Image Compression Fundamentals, Standards and Practice, 1st edn. Kluwer Academic, Boston (2001) Taubman, D., Marcellin, M.: JPEG 2000: Image Compression Fundamentals, Standards and Practice, 1st edn. Kluwer Academic, Boston (2001)
3.
Zurück zum Zitat Marcellin, M.W., Gormish, M.J., Bilgin, A., Boliek, M.P.: An overview of JPEG-2000. In: Proceedings of Data Compression Conference, pp. 523–541 (2000) Marcellin, M.W., Gormish, M.J., Bilgin, A., Boliek, M.P.: An overview of JPEG-2000. In: Proceedings of Data Compression Conference, pp. 523–541 (2000)
4.
Zurück zum Zitat Rubinstein, R., Bruckstein, A., Elad, M.: Dictionaries for sparse representation modeling. Proc. IEEE 98(6), 1045–1057 (2010)CrossRef Rubinstein, R., Bruckstein, A., Elad, M.: Dictionaries for sparse representation modeling. Proc. IEEE 98(6), 1045–1057 (2010)CrossRef
5.
Zurück zum Zitat Olshausen, B., Field, D.: Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature 381(13), 607–609 (1996)CrossRef Olshausen, B., Field, D.: Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature 381(13), 607–609 (1996)CrossRef
6.
Zurück zum Zitat Wright, J., Ma, M.Y., Mairal, J., Sapiro, G., Huang, T., Shuicheng, Y.: Sparse representation for computer vision and pattern recognition. Proc. IEEE 98(6), 1031–1044 (2010)CrossRef Wright, J., Ma, M.Y., Mairal, J., Sapiro, G., Huang, T., Shuicheng, Y.: Sparse representation for computer vision and pattern recognition. Proc. IEEE 98(6), 1031–1044 (2010)CrossRef
7.
Zurück zum Zitat Aharon, M., Elad, M., Bruckstein, A.: K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Sig. Process. 54(11), 4311–4322 (2006)CrossRef Aharon, M., Elad, M., Bruckstein, A.: K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Sig. Process. 54(11), 4311–4322 (2006)CrossRef
8.
Zurück zum Zitat Lee, H., Battle, A., Raina, R., Ng, A.Y.: Efficient sparse coding algorithms. In: Advances in Neural Information Processing Systems (NIPS), pp. 801–808 (2007) Lee, H., Battle, A., Raina, R., Ng, A.Y.: Efficient sparse coding algorithms. In: Advances in Neural Information Processing Systems (NIPS), pp. 801–808 (2007)
9.
Zurück zum Zitat Mairal, J., Bach, F.: Online learning for matrix factorization and sparse coding. J. Mach. Learn. Res. 11, 19–60 (2010)MathSciNetMATH Mairal, J., Bach, F.: Online learning for matrix factorization and sparse coding. J. Mach. Learn. Res. 11, 19–60 (2010)MathSciNetMATH
10.
Zurück zum Zitat Skretting, K., Engan, K.: Recursive least squares dictionary learning algorithm. IEEE Trans, Sig. Process. 58(4), 2121–2130 (2010)MathSciNetCrossRef Skretting, K., Engan, K.: Recursive least squares dictionary learning algorithm. IEEE Trans, Sig. Process. 58(4), 2121–2130 (2010)MathSciNetCrossRef
11.
Zurück zum Zitat Sun, Y., et al.: Dictionary learning for image coding based on multisample sparse representation. Circ. Syst. Video Technol. IEEE Trans. 24(11), 2004–2010 (2014)CrossRef Sun, Y., et al.: Dictionary learning for image coding based on multisample sparse representation. Circ. Syst. Video Technol. IEEE Trans. 24(11), 2004–2010 (2014)CrossRef
12.
Zurück zum Zitat Pati, Y., Rezaiifar, R.: Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In: Conference Record of the Twenty-Seventh Asilomar Conference on Signals, Systems and Computers, vol. 1, pp. 40–44 (1993) Pati, Y., Rezaiifar, R.: Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition. In: Conference Record of the Twenty-Seventh Asilomar Conference on Signals, Systems and Computers, vol. 1, pp. 40–44 (1993)
13.
Zurück zum Zitat Lainema, J., et al.: Intra coding of the HEVC standard. IEEE Trans. Circ. Syst. Video Technol. 22(12), 1792–1801 (2012)CrossRef Lainema, J., et al.: Intra coding of the HEVC standard. IEEE Trans. Circ. Syst. Video Technol. 22(12), 1792–1801 (2012)CrossRef
14.
Zurück zum Zitat Engan, K., Skretting, K., Husy, J.H.: Family of iterative LS-based dictionary learning algorithms, ILS-DLA, for sparse signal representation. Digit. Sig. Process. 17(1), 32–49 (2007)CrossRef Engan, K., Skretting, K., Husy, J.H.: Family of iterative LS-based dictionary learning algorithms, ILS-DLA, for sparse signal representation. Digit. Sig. Process. 17(1), 32–49 (2007)CrossRef
Metadaten
Titel
ODD: An Algorithm of Online Directional Dictionary Learning for Sparse Representation
verfasst von
Dan Xu
Xinwei Gao
Xiaopeng Fan
Debin Zhao
Wen Gao
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-77383-4_92

Neuer Inhalt