<< Chapter < Page | Chapter >> Page > |
There are at least two descriptions of the problem. We may want a single expansion system to handle several different classes of signals, each ofwhich are well-represented by a particular basis system or we may have a single class of signals, but the elements of that class are linearcombinations of members of the well-represented classes. In either case, there are several criteria that have been identified as important [link] , [link] :
These criteria are often in conflict with each other, and various compromises will be made in the algorithms and problem formulations for anacceptable balance.
This section uses the material in Chapter: Bases, Orthogonal Bases, Biorthogonal Bases, Frames, Right Frames, and unconditional Bases on bases and frames. One goal is to represent a signal using a “dictionary" ofexpansion functions that could include the Fourier basis, wavelet basis, Gabor basis, etc. We formulate a finite dimensional version of thisproblem as
for and . This can be written in matrix form as
where is a vector with elements being the signal values , the matrix is the columns of which are made up of all the functions in the dictionaryand is a vector of the expansion coefficients . The matrix operator has the basis signals as its columns so that the matrix multiplication [link] is simply the signal expansion [link] .
For a given signal representation problem, one has two decisions: what dictionary to use (i.e., choice of the ) and how to represent the signal in terms of this dictionary (i.e., choice of ). Since the dictionary is overcomplete, there are several possible choices of and typically one uses prior knowledge or one or more of the desired properties we saw earlier to calculatethe .
Consider a simple two-dimensional system with orthogonal basis vectors
which gives the matrix operator with and as columns
Notification Switch
Would you like to follow the 'Wavelets and wavelet transforms' conversation and receive update notifications?