Image Compression through Sparse Approximation - Main

View Resource

No Strings Attached

Author:

Genaro Picazo, Ian Wells

Subject:

Science and Technology

Institution Name:

Connexions

Collection:

Connexions

Grade Level:

Post-secondary

Abstract:

Sparse approximation, defined as the practice of representing a given signal as a summation of elements from a dictionary of elementary signals, has traditionally only involved one basis - the canonical basis in which we perceive the world, the Fourier basis that is the foundation of the frequency domain, or the dct basis that is behind the modern JPEG image format. However, recent thought has suggested that more accurate, faster methods for sparse approximation may instead be derived from a "combinational" basis, ie, a basis that consists of two or more bases concatenated onto each other. This resultant basis is often called an "overcomplete" or "redundant" basis, as there are always more vectors in the basis than the magnitude of the dimension of the space they span. Since they are redundant in this effect, the immediate problem would seem to be that there are then an infinite number of representations for any vector, or signal, in a space. Modern theory suggests that there are ideal algorithms for determining these transformations, in terms of number of computations and sparsity of the resultant representation; the two most prevalent being Basis Pursuit (BP) and Orthogonal Matching Pursuit (OMP).

Course Type:

Learning Module

Languages:

English

Material Type:

Readings, Syllabi

Media Format:

Text/HTML

Conditions of Use:

Creative Commons Attribution 1.0