To solve the constrained problems on the right-hand side we use the line search approach described in [1]}. We solve the primal form of the TV optimization problem (REF ) using the proxTV package [2]}, and of the TF optimization problem (REF ) using the Primal-Dual Active Set method in [3]}. Both of these methods can exploit warm starts, leading to major speedups after a good initial estimate is found. Empirically the TF optimization scales linearly with the movie length \(T\) ; since the scale of the TV problem is bounded (because we work in local spatial patches) we have not explored the scaling of the TV problem in depth.
