Practical ReProCS for separating sparse and low-dimensional signal sequences from their sum #x2014; Part 1

摘要

This paper designs and evaluates a practical algorithm, called Prac-ReProCS, for recovering a time sequence of sparse vectors St and a time sequence of dense vectors Lt from their sum, Mt := St + Lt, when any subsequence of the Lt's lies in a slowly changing low-dimensional subspace. A key application where this problem occurs is in video layering where the goal is to separate a video sequence into a slowly changing background sequence and a sparse foreground sequence that consists of one or more moving regions/objects. Prac-ReProCS is the practical analog of its theoretical counterpart that was studied in our recent work.