Skip to main content
Erschienen in: Neural Computing and Applications 11/2019

11.07.2018 | Original Article

A discriminant graph nonnegative matrix factorization approach to computer vision

verfasst von: Xiangguang Dai, Guo Chen, Chuandong Li

Erschienen in: Neural Computing and Applications | Ausgabe 11/2019

Einloggen

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

search-config
loading …

Abstract

This paper proposes a novel dimensional reduction method, called discriminant graph nonnegative matrix factorization (DGNMF), for image representation. Inspired by manifold learning and linear discrimination analysis, DGNMF provides a compact representation which can respect the original data space. In addition, In addition, the within-class distance of each class in the representation is very small. Based on these characteristics, our proposed method can be viewed as a supervised learning method, which outperforms some existing dimensional reduction methods, including PCA, LPP, LDA, NMF and GNMF. Experiments on image recognition have shown that our approach can provide a better representation than some classic methods.

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

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!

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+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!

Literatur
1.
Zurück zum Zitat Murase H, Nayar SK (1995) Visual learning and recognition of 3-D objects from appearance. Kluwer Academic Publishers, NorwellCrossRef Murase H, Nayar SK (1995) Visual learning and recognition of 3-D objects from appearance. Kluwer Academic Publishers, NorwellCrossRef
2.
Zurück zum Zitat Turk M, Pentland AP (1991) Face recognition using eigenface. IEEE Conf Comput Vis Pattern Recognit 118(5):586–591 Turk M, Pentland AP (1991) Face recognition using eigenface. IEEE Conf Comput Vis Pattern Recognit 118(5):586–591
3.
Zurück zum Zitat Batur AU, Hayes MH (2001) Linear subspaces for illumination robust face recognition. In: Proceedings of the 2001 IEEE computer society conference on computer vision and pattern recognition, 2001. CVPR 2001 Batur AU, Hayes MH (2001) Linear subspaces for illumination robust face recognition. In: Proceedings of the 2001 IEEE computer society conference on computer vision and pattern recognition, 2001. CVPR 2001
4.
Zurück zum Zitat Martnez AM, Kak AC (2009) PCA versus LDA. IEEE Trans Pattern Anal Mach Intell 23(2):228–233CrossRef Martnez AM, Kak AC (2009) PCA versus LDA. IEEE Trans Pattern Anal Mach Intell 23(2):228–233CrossRef
5.
Zurück zum Zitat Shakunaga T, Shigenari K (2001) Decomposed eigenface for face recognition under various lighting conditions. In: Proceedings of the 2001 IEEE computer society conference on computer vision and pattern recognition, 2001, vol 1, pp I-864–I-871. CVPR 2001 Shakunaga T, Shigenari K (2001) Decomposed eigenface for face recognition under various lighting conditions. In: Proceedings of the 2001 IEEE computer society conference on computer vision and pattern recognition, 2001, vol 1, pp I-864–I-871. CVPR 2001
6.
Zurück zum Zitat Belhumeur PN, Hespanha JP, Kriegman DJ (2002) Eigenfaces vs. fisherfaces: recognition using class specific linear projection. IEEE Trans Pattern Anal Mach Intell 19(7):711–720CrossRef Belhumeur PN, Hespanha JP, Kriegman DJ (2002) Eigenfaces vs. fisherfaces: recognition using class specific linear projection. IEEE Trans Pattern Anal Mach Intell 19(7):711–720CrossRef
7.
Zurück zum Zitat He X, Niyogi P (2003) Locality preserving projections. Adv Neural Inf Process Syst 16(1):186–197 He X, Niyogi P (2003) Locality preserving projections. Adv Neural Inf Process Syst 16(1):186–197
8.
Zurück zum Zitat Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788–791CrossRef Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788–791CrossRef
9.
Zurück zum Zitat Pauca VP, Shahnaz F, Berry MW, Plemmons RJ (2004) Text mining using non-negative matrix factorizations. In: SIAM international conference on data mining, Lake Buena Vista, Florida, USA, April, 2004 Pauca VP, Shahnaz F, Berry MW, Plemmons RJ (2004) Text mining using non-negative matrix factorizations. In: SIAM international conference on data mining, Lake Buena Vista, Florida, USA, April, 2004
10.
Zurück zum Zitat Cichocki A, Zdunek R, Amari S (2006) New algorithms for non-negative matrix factorization in applications to blind source separation. In: IEEE international conference on acoustics, speech and signal processing, 2006. ICASSP 2006 Proceedings, pp V–V Cichocki A, Zdunek R, Amari S (2006) New algorithms for non-negative matrix factorization in applications to blind source separation. In: IEEE international conference on acoustics, speech and signal processing, 2006. ICASSP 2006 Proceedings, pp V–V
11.
Zurück zum Zitat Hoyer PO (2002) Non-negative sparse coding. In: Proceedings of the 2002 12th IEEE workshop on neural networks for signal processing, 2002, pp 557–565. IEEE Hoyer PO (2002) Non-negative sparse coding. In: Proceedings of the 2002 12th IEEE workshop on neural networks for signal processing, 2002, pp 557–565. IEEE
12.
Zurück zum Zitat Tong M, Bu H, Zhao M, Xiand S, Li H (2017) Non-negative enhanced discriminant matrix factorization method with sparsity regularization. Neural Comput Appl 2:1–24 Tong M, Bu H, Zhao M, Xiand S, Li H (2017) Non-negative enhanced discriminant matrix factorization method with sparsity regularization. Neural Comput Appl 2:1–24
13.
Zurück zum Zitat Zhang Z, Shi Z (2013) Nonnegative matrix factorization-based hyperspectral and panchromatic image fusion. Neural Comput Appl 23(3–4):895–905CrossRef Zhang Z, Shi Z (2013) Nonnegative matrix factorization-based hyperspectral and panchromatic image fusion. Neural Comput Appl 23(3–4):895–905CrossRef
14.
Zurück zum Zitat Lin CJ (2007) Projected gradient methods for nonnegative matrix factorization. Neural Comput 19(10):2756–2779MathSciNetCrossRef Lin CJ (2007) Projected gradient methods for nonnegative matrix factorization. Neural Comput 19(10):2756–2779MathSciNetCrossRef
15.
Zurück zum Zitat Xu W, Liu X, Gong YH (2003) Document clustering based on non-negative matrix factorization. In: SIGIR 2003: proceedings of the international ACM SIGIR conference on research and development in information retrieval, July 28–August 1, 2003, Toronto, Canada, pp 267–273 Xu W, Liu X, Gong YH (2003) Document clustering based on non-negative matrix factorization. In: SIGIR 2003: proceedings of the international ACM SIGIR conference on research and development in information retrieval, July 28–August 1, 2003, Toronto, Canada, pp 267–273
16.
Zurück zum Zitat Yang S, Hou C, Zhang C, Wu Y (2013) Robust non-negative matrix factorization via joint sparse and graph regularization for transfer learning. Neural Comput Appl 23(2):541–559CrossRef Yang S, Hou C, Zhang C, Wu Y (2013) Robust non-negative matrix factorization via joint sparse and graph regularization for transfer learning. Neural Comput Appl 23(2):541–559CrossRef
17.
Zurück zum Zitat Cai D, He X, Han J, Huang TS (2011) Graph regularized nonnegative matrix factorization for data representation. IEEE Trans Pattern Anal Mach Intell 33(8):1548–1560CrossRef Cai D, He X, Han J, Huang TS (2011) Graph regularized nonnegative matrix factorization for data representation. IEEE Trans Pattern Anal Mach Intell 33(8):1548–1560CrossRef
18.
Zurück zum Zitat Chen WS, Zhao Y, Pan BB, Chen B (2016) Supervised kernel nonnegative matrix factorization for face recognition. Neurocomputing 205(C):165–181CrossRef Chen WS, Zhao Y, Pan BB, Chen B (2016) Supervised kernel nonnegative matrix factorization for face recognition. Neurocomputing 205(C):165–181CrossRef
19.
Zurück zum Zitat Liu H, Wu Z, Cai D, Huang TS (2012) Constrained nonnegative matrix factorization for image representation. IEEE Trans Pattern Anal Mach Intell 34(7):1299–1311CrossRef Liu H, Wu Z, Cai D, Huang TS (2012) Constrained nonnegative matrix factorization for image representation. IEEE Trans Pattern Anal Mach Intell 34(7):1299–1311CrossRef
20.
Zurück zum Zitat Pierre C (2007) Fast Newton-type methods for the least squares nonnegative matrix approximation problem. SIAM Int Conf Data Min 1(1):38–51 Pierre C (2007) Fast Newton-type methods for the least squares nonnegative matrix approximation problem. SIAM Int Conf Data Min 1(1):38–51
21.
Zurück zum Zitat Han L, Neumann M, Prasad U (2009) Alternating projected Barzilai–Borwein methods for nonnegative matrix factorization. Electron Trans Numer Anal 36:54–82MathSciNetMATH Han L, Neumann M, Prasad U (2009) Alternating projected Barzilai–Borwein methods for nonnegative matrix factorization. Electron Trans Numer Anal 36:54–82MathSciNetMATH
22.
Zurück zum Zitat Guan N, Tao D, Luo Z, Yuan B (2012) NeNMF: an optimal gradient method for nonnegative matrix factorization. IEEE Trans Signal Process 60(6):2882–2898MathSciNetCrossRef Guan N, Tao D, Luo Z, Yuan B (2012) NeNMF: an optimal gradient method for nonnegative matrix factorization. IEEE Trans Signal Process 60(6):2882–2898MathSciNetCrossRef
23.
Zurück zum Zitat Che H, Wang J (2018) A nonnegative matrix factorization algorithm based on a discrete-time projection neural network. Neural Netw 103:63–71CrossRef Che H, Wang J (2018) A nonnegative matrix factorization algorithm based on a discrete-time projection neural network. Neural Netw 103:63–71CrossRef
24.
Zurück zum Zitat Nesterov Y (1983) A method for unconstrained convex minimization problem with the rate of convergence \(O(1/k^2)\). Sov Math Dokl 27(2):372–376 Nesterov Y (1983) A method for unconstrained convex minimization problem with the rate of convergence \(O(1/k^2)\). Sov Math Dokl 27(2):372–376
25.
27.
Zurück zum Zitat Nesterov Yu (2007) Gradient methods for minimizing composite objective function. Core Discuss Pap 140(1):125–161MATH Nesterov Yu (2007) Gradient methods for minimizing composite objective function. Core Discuss Pap 140(1):125–161MATH
28.
Zurück zum Zitat Bertsekas DP (1999) Nonlinear programming. Athena Scientific, BelmontMATH Bertsekas DP (1999) Nonlinear programming. Athena Scientific, BelmontMATH
Metadaten
Titel
A discriminant graph nonnegative matrix factorization approach to computer vision
verfasst von
Xiangguang Dai
Guo Chen
Chuandong Li
Publikationsdatum
11.07.2018
Verlag
Springer London
Erschienen in
Neural Computing and Applications / Ausgabe 11/2019
Print ISSN: 0941-0643
Elektronische ISSN: 1433-3058
DOI
https://doi.org/10.1007/s00521-018-3608-9

Weitere Artikel der Ausgabe 11/2019

Neural Computing and Applications 11/2019 Zur Ausgabe