Getting Started | Documentation | Glish | Learn More | Programming | Contact Us |
Version 1.9 Build 1367 |
|
Calibration involves solving for the possibly unknown feed-based matrices such as Gi, Di from calibration observations2. Imaging means estimating from data corrected for the calibration matrices. Note that parametrization of the free variables is probably wise. For calibration, this means that, for example, Gi is diagonal with parameters ap, aq, and describing the amplitude and phase of the gain in the two polarization channels. For imaging, the parameters could be the pixels of an image or the parameters of a number of Gaussian components.
If the image parameters are known for some subset of the measurements, then one can solve for the calibration parameters and thus calibrate. Then from another subset one can solve for image parameters of another object.
Suppose that we have a number of measurements of the visibility function, and that furthermore we have estimates of the visibility function that would be measured in the absence of visibility-based calibration effects. We can then estimate the calibration matrices by a least squares fit whereby the matrices are adjusted to fit the data in a least-squares sense. Define an error norm :
where the residual is given by:
and denotes an estimate:
and Wij is a (4 by 4) weight matrix. For natural weighting, W will usually be diagonal with elements given by the inverse of the corresponding variance. However, it is more strictly the inverse of the covariance matrix of the errors. For uniform weighting, the usual correction for the local density of samples will be applied.
Choosing the calibration matrices that minimize is a non-linear least squares problem. To solve it, we will need the first and second derivatives of with respect to the calibration matrices. Since this gets quite complicated, I've deferred complete exposition to another memo. For the moment, I say only that to check these formulas, I generated the scalar update equation for the case where only the gain matrix need be calculated. I do indeed obtain the update formula used in the usual feed-based gain solution algorithms.
This is all good as far as it goes, but we probably will prefer to parametrize the calibration matrices by a small number of parameters. We will then require derivatives with respect to these parameters, instead of the elements of the matrices directly. By applying the chain rule, this is quite straightforward, if tedious.
Having solved for the calibration matrices, we can now correct for them:
The other calibration matrices, Ei , Pi , Fi , cannot be corrected in the visibility domain. Instead, it is necessary to make an image. This I describe next.