Fig. 1From: Fast ℓ 1-minimization algorithm for robust background subtractionDiagram of the proposed approximative ℓ 1-min algorithm. An example to express the core intuition of the proposed approximative ℓ 1-min algorithm. As shown in the left part, the sparse solutions of the basis vectors e m are defined as the children sparse vectors β m which will be employed to accelerate the proposed algorithm. For an input, it can also be separated into the similar patterns which have a linear relation γ with the base patterns. The sparse solution of the input is boiled down to the linear combination of the children sparse vectorsBack to article page