Robust Kernelized Bayesian Matrix Factorization for Video Background/Foreground Separation

3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Development of effective and efficient techniques for video analysis is an important research area in machine learning and computer vision. Matrix factorization (MF) is a powerful tool to perform such tasks. In this contribution, we present a hierarchical robust kernelized Bayesian matrix factorization (RKBMF) model to decompose a data set into low rank and sparse components. The RKBMF model automatically infers the parameters and latent variables including the reduced rank using variational Bayesian inference. Moreover, the model integrates the side information of similarity between frames to improve information extraction from the video. We employ RKBMF to extract background and foreground information from a traffic video. Experimental results demonstrate that RKBMF outperforms state-of-the-art approaches for background/foreground separation, particularly where the video is contaminated.

Cite

CITATION STYLE

APA

Xie, H. B., Li, C., Xu, R. Y. D., & Mengersen, K. (2019). Robust Kernelized Bayesian Matrix Factorization for Video Background/Foreground Separation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11943 LNCS, pp. 484–495). Springer. https://doi.org/10.1007/978-3-030-37599-7_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free