Fig. 7
From: Fast ℓ 1-minimization algorithm for robust background subtraction
Comparison of recovered results with different ℓ 1-min algorithms. The recovered Lena image (above) and the error (below) by a GPSR [31], b SPGL1-Lasso [32], c OMP [33], d SP [34], e DGS [8], f the Bregman iterative algorithm [15], g l1-ls [35], and h the proposed approximative ℓ 1-min algorithm. The respective execution times of recovery are 180.9, 185.6, 10.3, 11.8, 12.0, 4.18, 163.9, and 0.08 s. The respective normalized errors of recovery at the pixel level are 0.0091, 0.0048, 0.0059, 0.0066, 0.0063, 0.0088, 0.0093, and 0.0204