Highly Nonlinear Approximations for Sparse Signal Representation
Oblique Matching Pursuit (OBMP)
The criterion we use for the forward recursive selection of the set yielding the right signal separation is in line with the consistency principle introduced in [2] and extended in [3]. Furthermore, it happens to coincide with the Optimize Orthogonal Matching Pursuit (OOMP) [12] approach applied to find the sparse representation of the projected signal using the dictionaryBy fixing , at iteration we select the index such that is minimized.
Proposition 8
Let us denote by the set of indices
Given
,
the index
corresponding to the atom
for which
is minimal
is to be determined as
with and the set of indices that have been previously chosen to determine .
with and the set of indices that have been previously chosen to determine .
Proof.
It readily follows since
and hence
Because
and
are
fixed,
is minimized if
is maximal over all
.
The original OBMP selection criterion
proposed in [11]
selects the index
as the maximizer over
of
In order to cancel this error, the new approximation is constructed accounting for the concomitant measurement vector.
Proof.
Since for all vector
given in
(19)
and
we have
Hence, maximization of
over
is equivalent to (25).
It is clear at this point that the forward selection of
indices prescribed by proposition (25) is equivalent to
selecting the indices by applying OOMP [12] on the projected signal
using the dictionary
.
The routine for implementing the pursuit strategy for
subspace selection according to criterion (25) is
OBMP.m.
An example of application is given in .