In this paper, the Homotopy method, originally proposed by Osborne et al. and Efron et al., is applied to the underdetermined lscr1-minimization problem min parxpar1 subject to y=Ax, and is shown to run much more rapidly than general-purpose LP solvers when sufficient sparsity is present.Expand

This paper presents a new method for automatic segmentation of moving objects in image sequences for VOP extraction using graph labeling, based on motion information.Expand

The minimum -norm solution to an underdetermined system of linear equations is often, remarkably, also the sparsest solution to that system. This sparsity-seeking property is of interest in signal… Expand

We quantify the 'sufficient sparsity' condition, defining an equivalence breakdown point (EBP): the degree of sparsity of α required to guarantee equivalence to hold; this threshold depends on the matrix.Expand

We show that the problem of finding optimal filters for a general, unknown, "black-box" coder can be written as a separable least squares problem in two sets of variables and solve this problem using the Variable Projection method.Expand