Statistically driven sparse image approximation

Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NP-hard problem. In the case of a dictionary whose elements form an overcomplete basis, a recently developed method, based on alternating thresholding and projection operations, provides an appealing approximate solution. When applied to images, this method produces sparser results and requires less computation than current alternative methods. Motivated by recent developments in statistical image modeling, we develop an enhancement of this method based on a locally adaptive threshold operation, and demonstrate that the enhanced algorithm is capable of finding sparser approximations with a decrease in computational complexity.