Let now F be the image of E by A (the space of the 's,
spanning E), AE be the operator from E into F induced
by A, and
the projection of
onto F (see Fig. 14.7).
The vectors
minimizing q on E, the solutions of the problem,
are such that
. They are identical up to a vector
lying in the kernel of AE (by definition, the kernel of AE is the
space of vectors
such that
).
As
is orthogonal to F, the solutions
of the
problem are characterized by the property:
.
On denoting by A* the adjoint of A, this property can also be
written in the form:
Many different techniques can be used for solving the normal equation (or minimizing q on E). Some of these are certainly more efficient than others, but this is not a crucial choice.
REMARK 2: beams and maps.
The action of A*A involved in
is that of a
convolutor. As the two lists
and
are
disjoints, we have:
A*A = Ae*Ae + Ar*Ar. Thus, the corresponding
point-spread function, called the dusty beam, has two components:
the traditional dirty beam
and the regularization
beam. The latter corresponds to the action of Ar*Ar, the former
to that of Ae*Ae (see Fig. 14.5).
Likewise, according to the definition of the data vector,
is called the dusty map (as
opposed to the traditional dirty map
because
it is damped by the neat beam).
REMARK 3: construction of the object representation space.
With regard to the construction of the object representation
space E, CLEAN and WIPE are very similar: it
is defined through the choice of the (discrete) object support.
It is important to note that this space may be constructed, in a
global manner or step by step, interactively or automaticaly.
In the last version of WIPE implemented at IRAM,
the image reconstruction process is initialized with a few iterations
of CLEAN.
The support selected by CLEAN is refined throughout
the iterations of WIPE by conducting a matching pursuit
process at the level of the components of r in the interpolation
basis of Ho:
the current support is extended by adding the nodes of the object
grid
for which these coefficients are the
largest above a given threshold (half of the maximum value, for
example). The objective functional is then minimized on that
new support, and the global residue r updated accordingly.
The object representation space of the
reconstructed image is thus obtained step by step in a
natural manner.
The simulation presented on Fig.14.5-14.6 corresponds
to the conditions of Fig. 14.4. The Fourier data
were
blurred by adding a Gaussian noise:
for all
, the standard deviation
of
was set equal to
of the total
flux of the object (
).
The image reconstruction process was initialized with a few
iterations of CLEAN, and the construction of the final
support of the reconstructed image was made as indicated
in Remark 3. At the end of the reconstruction process, a final
smoothing of the current object support was performed. In this
classical operation of mathematical morphology, the effective support
of
,
, is of course used as a structuring
element. The boundaries of the effective support of the reconstructed
neat map are thus defined at the appropriate resolution.
In particular, the connected entities of size smaller than that
of
are eliminated.
![]()
|