A computationally efficient sparse coding algorithm is derived by limiting the number of times that a new support set of dictionary atoms is computed, exploiting the smoothness of the signal.