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.

Abstract: This paper presents a new parallel structured lookahead multidimensional sorting algorithm. Our algorithm can be based on any sequential sorting algorithm. The amount of parallelism can be ...