next up previous contents
Next: 17.4 A CLEAN-based algorithm Up: 17. Mosaicing Previous: 17.2 Image formation in   Contents

17.3 Mosaicing in practice



Observation and calibration

The observation of a mosaic with the Plateau de Bure interferometer and the calibration of the data do not present any specific difficulties. We just mention here a few practical remarks:



Mosaic reconstruction

The point is now to reconstruct a mosaic from the observations of each field, in an optimal way in terms of signal-to-noise ratio. For the time being, let's forget the effects of the convolution by the dirty beam. Each field $ i$ can then be written: $ F_i = B_i \times I + N_i$, where $ B_i$ is the primary beam of the interferometer, centered in a different direction for each observation $ i$, and $ N_i$ is the corresponding noise distribution. In practice, the same phase center (i.e. the same coordinate system) is used for all the fields.

Hence, the mosaic observations can be described as several measurements of the same unknown quantity $ I$, each one being affected by a weighting factor $ B_i$. This is a classical mathematical problem: the best estimate $ J$ of $ I$, in the least-square sense, is given by:

$\displaystyle J = \frac{\displaystyle \sum\nolimits_i \frac{B_i}{\sigma_i^2}  F_i}{\displaystyle \sum\nolimits_i \frac{B_i^2}{\sigma_i^2}}$ (17.9)

where the sum includes all the observed fields and $ \sigma_i$ is the rms of the noise distribution $ N_i$. (Note that in Eq. 17.9 as well as in the following equations, $ \sigma_i$ is a number while other letters denote two-dimensional distributions).



Linear vs. non-linear mosaicing

The problem which remains to be address is the deconvolution of the mosaic. This is actually the main difficulty of mosaic interferometric observations. Two different approaches have been proposed (e.g. [Cornwell 1993]):

$ \circ$
Linear mosaicing: each field is deconvolved using classical techniques, and a mosaic is reconstructed afterwards with the clean images, using Eq. 17.9.

$ \circ$
Non-linear mosaicing: a joint deconvolution of all the fields is performed, i.e. the deconvolution is performed after the mosaic reconstruction.

The deconvolution algorithms are highly non-linear, and the two methods are therefore not equivalent. The first one is straightforward to implement, but the non-linear mosaicing algorithms give much better results. Indeed, the combination of the adjacent fields in a mosaic allows to estimate visibilities which were not observed (see previous paragraph), it allows to remove sidelobes in the whole mapped area, and it increases the sensitivity in the (large) overlapping regions: these effects make the deconvolution much more efficient.

Non-linear deconvolution methods based on the Maximum Entropy Method (MEM) have been proposed by [Cornwell 1988] and [Sault et al 1996]. As CLEAN deconvolutions are usually applied on Plateau de Bure data, a CLEAN-based method adapted to the case of the mosaics has been developed. The initial idea was proposed by F. Viallefond (DEMIRM, Paris) and S. Guilloteau (IRAM), and the algorithm is now implemented in the MAPPING software.


next up previous contents
Next: 17.4 A CLEAN-based algorithm Up: 17. Mosaicing Previous: 17.2 Image formation in   Contents
Anne Dutrey