Matching pursuit
YFIT = wmpalg(MPALG,Y,MPDICT)
[YFIT,R]
= wmpalg(...)
[YFIT,R,COEFF]
= wmpalg(...)
[YFIT,R,COEFF,IOPT]
= wmpalg(...)
[YFIT,R,COEFF,IOPT,QUAL]
= wmpalg(...)
[YFIT,R,COEFF,IOPT,QUAL,X]
= wmpalg(...)
[YFIT,R,COEFF,IOPT,QUAL,X]
= wmpalg(...,Name,Value)
returns
an adaptive greedy approximation, YFIT
= wmpalg(MPALG
,Y
,MPDICT
)YFIT
, of the
input signal, Y
, in the dictionary, MPDICT
.
The adaptive greedy approximation uses the matching pursuit algorithm, MPALG
.
The dictionary, MPDICT
, is typically an overcomplete
set of vectors constructed using wmpdictionary
.
[
returns the residual, YFIT
,R
]
= wmpalg(...)R
,
which is the difference vector between Y
and YFIT
at
the termination of the matching pursuit.
[
returns the expansion coefficients, YFIT
,R
,COEFF
]
= wmpalg(...)COEFF
.
The number of expansion coefficients depends on the number of iterations
in the matching pursuit.
[
returns the column indices of the retained
atoms, YFIT
,R
,COEFF
,IOPT
]
= wmpalg(...)IOPT
. The length of IOPT
equals
the length of COEFF
and is determined by the
number of iterations in the matching pursuit.
[
returns the proportion of retained signal
energy, YFIT
,R
,COEFF
,IOPT
,QUAL
]
= wmpalg(...)QUAL
, for each iteration of the matching
pursuit. QUAL
is the ratio of the ℓ2 squared
norm of the expansion coefficient vector, COEFF
,
to the ℓ2 squared norm of the input
signal, Y
.
[
returns the normalized dictionary, YFIT
,R
,COEFF
,IOPT
,QUAL
,X
]
= wmpalg(...)X
. X
contains
the unit vectors in the ℓ2 norm
corresponding to the columns of MPDICT
.
[
returns an
adaptive greedy approximation with additional options specified by
one or more YFIT
,R
,COEFF
,IOPT
,QUAL
,X
]
= wmpalg(...,Name,Value
)Name,Value
pair arguments.
|
Matching pursuit algorithm as a character vector or string scalar. Valid entries are:
See Matching Pursuit Algorithms. Default: |
|
Matching pursuit dictionary. |
|
Signal for matching pursuit. |
Specify optional
comma-separated pairs of Name,Value
arguments. Name
is
the argument name and Value
is the corresponding value.
Name
must appear inside quotes. You can specify several name and value
pair arguments in any order as
Name1,Value1,...,NameN,ValueN
.
|
Positive integer fixing the maximum number of iterations of
the matching pursuit algorithm. If you do not specify a Default: |
|
A cell array of cell arrays with valid subdictionaries. This
name-value pair is only valid if you do not input a dictionary in
If you use the |
|
Cell array containing the name of the norm and the maximum relative
error in the norm expressed as a percentage. Valid norms are where R is the residual at each
iteration and Y is the input signal. For example, If you specify
|
|
Number of iterations between successive plots. |
|
Type of plot to produce during the progression of matching pursuit.
Valid entries for Default: |
|
Optimality factor for weak orthogonal matching pursuit. The
optimality factor is a real number in the interval (0,1]. This name-value
pair is only valid when Default: |
|
Adaptive greedy approximation of the input signal, |
|
Residual after matching pursuit terminates |
|
Expansion coefficients in the dictionary. The selected dictionary
atoms weighted by the expansion coefficients yield the approximated
signal, |
|
Column indices of the selected dictionary atoms. Using the column
indices in |
|
Proportion of retained signal energy for each iteration in the
matching pursuit. where αk is the vector of expansion coefficients after the k-th iteration. |
|
The normalized matching pursuit dictionary. |
[1] Cai, T.T. and Wang,L. “Orthogonal Matching Pursuit for Sparse Signal Recovery with Noise”. IEEE® Transactions on Information Theory, vol. 57, 7, 4680–4688, 2011.
[2] Donoho, D., Elad, M., and Temlyakov, V. “Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise”. IEEE Transactions on Information Theory. Vol. 52, 1, 6–18, 2004.
[3] Mallat, S. and Zhang, Z. “Matching Pursuits with Time-Frequency Dictionaries”. IEEE Transactions on Signal Processing, vol. 41, 12, 3397–3415, 1993
[4] Tropp, J.A. “Greed is good: Algorithmic results for sparse approximation”. IEEE Transactions on Information Theory, 50, pp. 2231–2242, 2004.