An efficient first-order method for l

摘要

We consider the problem of lossy compression of images using sparse representations from overcomplete dictionaries. This problem is in principle easy to solve using standard algorithms for convex programming, but often the large dimensions render such an approach intractable. We present a highly efficient method based on recently developed first-order methods, which enables us to compute sparse approximations of entire images with modest time and memory consumption.