Name
Abstract | ||
|---|---|---|
Video background recovery is a very important task in computer vision applications. Recent research offers robust principal component analysis RPCA as a promising approach for solving video background recovery. RPCA works by decomposing a data matrix into a low-rank matrix and a sparse matrix. Our previous work shows that when the desired rank of the low-rank matrix is known, fixing the rank in the algorithm called FrALM fixed-rank ALM yields more robust and accurate results than existing RPCA algorithms. However, application of RPCA to video background recovery requires that each frame in the video is encoded as a column in the data matrix. This is impractical in real applications because the videos can be easily larger than the amount of memory in a computer. This paper presents an algorithm called iFrALM incremental fixed-rank ALM that computes fixed-rank RPCA incrementally by splitting the video frames into an initial batch and an incremental batch. Comprehensive tests show that iFrALM uses less memory and time compared to FrALM. Moreover, the initial batch size and batch quality can be carefully selected to ensure that iFrALM reduces memory and time complexity without sacrificing accuracy. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-23117-4_56 | CAIP |
Keywords | Field | DocType |
Background recovery, Incremental SVD, Fixed-rank robust PCA | Pattern recognition,Matrix (mathematics),Computer science,Robust principal component analysis,Artificial intelligence,Time complexity,Sparse matrix | Conference |
Volume | ISSN | Citations |
9257 | 0302-9743 | 2 |
PageRank | References | Authors |
0.36 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian Lai | 1 | 2 | 1.04 |
| Wee Kheng Leow | 2 | 705 | 75.92 |
| Terence Sim | 3 | 2562 | 169.42 |