Sparse Representations for Image Decompositions

Davi Geiger, Tyng-Luh Liu, Michael J. Donahue

Abstract: We are given an image I and a library of templates \({\mathcal{L}}\) , such that \({\mathcal{L}}\) is an overcomplete basis for I. The templates can represent objects, faces, features, analytical functions, or be single pixel templates (canonical templates). There are infinitely many ways to decompose I as a linear combination of the library templates. Each decomposition defines a representation for the image I, given \({\mathcal{L}}\) .