Skip to main content
Erschienen in: Machine Vision and Applications 5/2014

01.07.2014 | Special Issue Paper

pROST: a smoothed \(\ell _p\)-norm robust online subspace tracking method for background subtraction in video

verfasst von: Florian Seidel, Clemens Hage, Martin Kleinsteuber

Erschienen in: Machine Vision and Applications | Ausgabe 5/2014

Einloggen

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

search-config
loading …

Abstract

An increasing number of methods for background subtraction use Robust PCA to identify sparse foreground objects. While many algorithms use the \(\ell _1\)-norm as a convex relaxation of the ideal sparsifying function, we approach the problem with a smoothed \(\ell _p\)-quasi-norm and present pROST, a method for robust online subspace tracking. The algorithm is based on alternating minimization on manifolds. Implemented on a graphics processing unit, it achieves realtime performance at a resolution of \(160 \times 120\). Experimental results on a state-of-the-art benchmark for background subtraction on real-world video data indicate that the method succeeds at a broad variety of background subtraction scenarios, and it outperforms competing approaches when video quality is deteriorated by camera jitter.

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

Literatur
1.
Zurück zum Zitat Absil, P.A., Mahony, R., Sepulchre, R.: Optimization algorithms on matrix manifolds. Princeton University Press, Princeton (2008)MATH Absil, P.A., Mahony, R., Sepulchre, R.: Optimization algorithms on matrix manifolds. Princeton University Press, Princeton (2008)MATH
2.
Zurück zum Zitat Balzano, L., Nowak, R., Recht, B.: Online identification and tracking of subspaces from highly incomplete information. In: Allerton Conference on Communication, Control, and, Computing, pp. 704–711 (2010) Balzano, L., Nowak, R., Recht, B.: Online identification and tracking of subspaces from highly incomplete information. In: Allerton Conference on Communication, Control, and, Computing, pp. 704–711 (2010)
3.
Zurück zum Zitat Boumal, N., Absil, P.A.: RTRMC: A Riemannian trust-region method for low-rank matrix completion. In: Advances in Neural Information Processing Systems, pp. 406–414 (2011) Boumal, N., Absil, P.A.: RTRMC: A Riemannian trust-region method for low-rank matrix completion. In: Advances in Neural Information Processing Systems, pp. 406–414 (2011)
4.
Zurück zum Zitat Bouwmans, T.: Subspace learning for background modeling: a survey. RPCS 2(3), 223–234 (2009)CrossRef Bouwmans, T.: Subspace learning for background modeling: a survey. RPCS 2(3), 223–234 (2009)CrossRef
5.
Zurück zum Zitat Bouwmans, T.: Recent advanced statistical background modeling for foreground detection: A systematic survey. RPCS 4(3), 147–176 (2011)CrossRef Bouwmans, T.: Recent advanced statistical background modeling for foreground detection: A systematic survey. RPCS 4(3), 147–176 (2011)CrossRef
6.
Zurück zum Zitat Brutzer, S., Höferlin, B., Heidemann, G.: Evaluation of background subtraction techniques for video surveillance. In: Computer Vision and Pattern Recognition, pp. 1937–1944. IEEE (2011) Brutzer, S., Höferlin, B., Heidemann, G.: Evaluation of background subtraction techniques for video surveillance. In: Computer Vision and Pattern Recognition, pp. 1937–1944. IEEE (2011)
7.
Zurück zum Zitat Candès, E., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J ACM 58(3), 1–37 (2011)CrossRef Candès, E., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J ACM 58(3), 1–37 (2011)CrossRef
8.
Zurück zum Zitat Cristani, M., Farenzena, M., Bloisi, D., Murino, V.: Background subtraction for automated multisensor surveillance: a comprehensive review. EURASIP J. Adv. Signal Process 43(1–43), 24 (2010) Cristani, M., Farenzena, M., Bloisi, D., Murino, V.: Background subtraction for automated multisensor surveillance: a comprehensive review. EURASIP J. Adv. Signal Process 43(1–43), 24 (2010)
9.
Zurück zum Zitat Edelman, A., Arias, T.A., Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20(2), 303–353 (1998)CrossRefMATHMathSciNet Edelman, A., Arias, T.A., Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20(2), 303–353 (1998)CrossRefMATHMathSciNet
10.
Zurück zum Zitat Elhabian, S.Y., El-Sayed, K.M., Ahmed, S.H.: Moving object detection in spatial domain using background removal techniques: state-of-art. RPCS 1, 32–34 (2008)CrossRef Elhabian, S.Y., El-Sayed, K.M., Ahmed, S.H.: Moving object detection in spatial domain using background removal techniques: state-of-art. RPCS 1, 32–34 (2008)CrossRef
11.
Zurück zum Zitat Gasso, G., Rakotomamonjy, A., Canu, S.: Recovering sparse signals with a certain family of nonconvex penalties and DC programming. Trans Signal Process 57(12), 4686–4698 (2009)CrossRefMathSciNet Gasso, G., Rakotomamonjy, A., Canu, S.: Recovering sparse signals with a certain family of nonconvex penalties and DC programming. Trans Signal Process 57(12), 4686–4698 (2009)CrossRefMathSciNet
12.
Zurück zum Zitat Goyette, N., Jodoin, P., Porikli, F., Konrad, J., Ishwar, P.: Changedetection.net: a new change detection benchmark dataset. In: Computer vision and pattern recognition workshops, pp. 1–8 (2012) Goyette, N., Jodoin, P., Porikli, F., Konrad, J., Ishwar, P.: Changedetection.net: a new change detection benchmark dataset. In: Computer vision and pattern recognition workshops, pp. 1–8 (2012)
13.
Zurück zum Zitat Guyon, C., Bouwmans, T., Zahzah, E.: Robust principal component analysis for background subtraction: systematic evaluation and comparative analysis. In: Principal component analysis, chap. 12, pp. 223–238. INTECH (2012) Guyon, C., Bouwmans, T., Zahzah, E.: Robust principal component analysis for background subtraction: systematic evaluation and comparative analysis. In: Principal component analysis, chap. 12, pp. 223–238. INTECH (2012)
14.
16.
Zurück zum Zitat Hassanpour, H., Sedighi, M., Manashty, A.R.: Video frame’s background modeling: reviewing the techniques. J. Signal Inf. Process. 2(2), 72–78 (2011) Hassanpour, H., Sedighi, M., Manashty, A.R.: Video frame’s background modeling: reviewing the techniques. J. Signal Inf. Process. 2(2), 72–78 (2011)
17.
Zurück zum Zitat He, J., Balzano, L., Szlam, A.: Incremental gradient on the Grassmannian for online foreground and background separation in subsampled video. In: Computer vision and, pattern recognition, pp. 1568–1575 (2012) He, J., Balzano, L., Szlam, A.: Incremental gradient on the Grassmannian for online foreground and background separation in subsampled video. In: Computer vision and, pattern recognition, pp. 1568–1575 (2012)
18.
Zurück zum Zitat Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bureau Stand. 49, 409–436 (1952)CrossRefMATHMathSciNet Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bureau Stand. 49, 409–436 (1952)CrossRefMATHMathSciNet
19.
Zurück zum Zitat Huang, J., Huang, X., Metaxas, D.: Learning with dynamic group sparsity. In: ICCV, pp. 64–71 (2009) Huang, J., Huang, X., Metaxas, D.: Learning with dynamic group sparsity. In: ICCV, pp. 64–71 (2009)
20.
Zurück zum Zitat Keshavan, R.H., Montanari, A.: Matrix completion from noisy entries. J. Mach. Learn. Res. 11, 2057–2078 (2010)MATHMathSciNet Keshavan, R.H., Montanari, A.: Matrix completion from noisy entries. J. Mach. Learn. Res. 11, 2057–2078 (2010)MATHMathSciNet
21.
Zurück zum Zitat Leahy, R.M., Jeffs, B.D.: On the design of maximally sparse beamforming arrays. Antennas Propag. IEEE Trans. 39(8), 1178–1187 (1991)CrossRef Leahy, R.M., Jeffs, B.D.: On the design of maximally sparse beamforming arrays. Antennas Propag. IEEE Trans. 39(8), 1178–1187 (1991)CrossRef
22.
Zurück zum Zitat Li, L., Huang, W., Gu, I.Y.H., Tian, Q.: Statistical modeling of complex backgrounds for foreground object detection. Trans. Image Process. 13(11), 1459–1472 (2004)CrossRef Li, L., Huang, W., Gu, I.Y.H., Tian, Q.: Statistical modeling of complex backgrounds for foreground object detection. Trans. Image Process. 13(11), 1459–1472 (2004)CrossRef
23.
Zurück zum Zitat Li, Y.: On incremental and robust subspace learning. Pattern Recognit. 37, 1509–1518 (2004)CrossRefMATH Li, Y.: On incremental and robust subspace learning. Pattern Recognit. 37, 1509–1518 (2004)CrossRefMATH
24.
Zurück zum Zitat Oliver, N., Rosario, B., Pentland, A.: A bayesian computer vision system for modeling human interactions. Trans. Pattern Anal. Mach. Intell. 22(8), 831–843 (2000)CrossRef Oliver, N., Rosario, B., Pentland, A.: A bayesian computer vision system for modeling human interactions. Trans. Pattern Anal. Mach. Intell. 22(8), 831–843 (2000)CrossRef
25.
Zurück zum Zitat Pearson, K.: On lines and planes of closest fit to systems of points in space. Philos. Mag. 2(6), 559–572 (1901)CrossRef Pearson, K.: On lines and planes of closest fit to systems of points in space. Philos. Mag. 2(6), 559–572 (1901)CrossRef
26.
Zurück zum Zitat Toyama, K., Krumm, J., Brumitt, B., Meyers, B.: Wallflower: principles and practice of background maintenance. Int. Conf. Comput. Vis. 1, 255–261 (1999) Toyama, K., Krumm, J., Brumitt, B., Meyers, B.: Wallflower: principles and practice of background maintenance. Int. Conf. Comput. Vis. 1, 255–261 (1999)
27.
Zurück zum Zitat Waters, A., Sankaranarayanan, A.C., Baraniuk, R.G.: SpaRCS: Recovering Low-Rank and Sparse Matrices from Compressive Measurements. In: Proceedings of Advances in Neural Information Processing Systems (2011) Waters, A., Sankaranarayanan, A.C., Baraniuk, R.G.: SpaRCS: Recovering Low-Rank and Sparse Matrices from Compressive Measurements. In: Proceedings of Advances in Neural Information Processing Systems (2011)
28.
Zurück zum Zitat Xu, Z., Shi, P., Gu, I.Y.H.: An eigenbackground subtraction method using recursive error compensation. In: Zhuang, Y., Yang,S., Rui Y., He, Q (eds.) PCM, Lecture notes in computer science, vol. 4261, pp. 779–787. Springer, Heidelberg (2006) Xu, Z., Shi, P., Gu, I.Y.H.: An eigenbackground subtraction method using recursive error compensation. In: Zhuang, Y., Yang,S., Rui Y., He, Q (eds.) PCM, Lecture notes in computer science, vol. 4261, pp. 779–787. Springer, Heidelberg (2006)
29.
Zurück zum Zitat Zhou, T., Tao, D.: GoDec: Randomized low-rank & sparse matrix decomposition in noisy case. In: International Conference on Machine Learning, pp. 33–40 (2011) Zhou, T., Tao, D.: GoDec: Randomized low-rank & sparse matrix decomposition in noisy case. In: International Conference on Machine Learning, pp. 33–40 (2011)
Metadaten
Titel
pROST: a smoothed -norm robust online subspace tracking method for background subtraction in video
verfasst von
Florian Seidel
Clemens Hage
Martin Kleinsteuber
Publikationsdatum
01.07.2014
Verlag
Springer Berlin Heidelberg
Erschienen in
Machine Vision and Applications / Ausgabe 5/2014
Print ISSN: 0932-8092
Elektronische ISSN: 1432-1769
DOI
https://doi.org/10.1007/s00138-013-0555-4

Weitere Artikel der Ausgabe 5/2014

Machine Vision and Applications 5/2014 Zur Ausgabe

Premium Partner