Paper Info
Title
Approximation-free running SVD and its application to motion detection
Abstract
In different tasks such as adaptive background modelling, the Singular Value Decomposition (SVD) has to be applied in running fashion. Typically, this happens when the SVD is used in a sliding spatial or temporal data window. Each time the window moves on, the SVD should be calculated in the batch mode from scratch, or re-calculated using the previous solution. When the data matrix is relatively small, the batch mode is fast enough. When the matrix is large, the batch mode is prohibitive and fast re-calculation is needed. In background modelling for video surveillance, the data matrix is formed by consecutive frames and can be fairly large. The existing PCA or SVD based approaches use approximate solutions and divide the frame into small blocks to speed up the re-calculation. We present a fast approximation-free solution for running SVD and apply it to moving object detection in video. Photometric invariants are used for dynamic background with frequent shading. The proposed approach is compared on challenging sequences to the Multiple Gaussian Method which is a standard in adaptive background modelling.
Year
DOI
Venue
2010
10.1016/j.patrec.2009.12.031
Pattern Recognition Letters
Keywords
Field
DocType
video processing,previous solution,batch mode,dynamic background,photometric invariants,motion detection,fast re-calculation,fast approximation-free solution,approximate solution,adaptive background modelling,svd,temporal data window,data matrix,small block,singular value decomposition,temporal data
Computer vision,Object detection,Singular value decomposition,Video processing,Motion detection,Matrix (mathematics),Computer science,Batch processing,Artificial intelligence,Gaussian elimination,Speedup
Journal
Volume
Issue
ISSN
31
9
Pattern Recognition Letters
Citations 
PageRank 
References 
7
0.70
10
Authors
2
Name
Order
Citations
PageRank
Chetverikov, D.195699.89
Attila Axt270.70