![]()
|
|||
|
|
|||
| NRAO Home > CASA > CasaRef |
|
||
2.3.1 Calculate a deconvolved image with selected clean algorithm
Description
Makes a clean image using either the Hogbom, Clark, multi-scale or multi-field
algorithms. The Clark algorithm is the default. The clean is performed on the
residual image calculated from the visibility data currently selected. Hence the
first step performed in clean is to transform the current model or models
(optionally including a componentlist) to fill in the MODEL_DATA column,
and then inverse transform the residual visibilities to get a residual image.
This residual image is then cleaned using the corresponding point spread
function. This means that the initial model is used as the starting point for
the deconvolution. Thus if you want to restart a clean, simply set the model to
the model that was previously produced by clean.
Rather than explicit CLEAN boxes, mask images are used to constrain the region that is to be deconvolved. To make mask images, use either boxmask (to define a mask via the corner locations blc and trc) or mask (to define a mask via thresholding an existing image) or regionmask (to make masks via regions using the regionmanager or interactively through the viewer) . The default mask is the inner quarter of the image.
The CLEAN deconvolution is joint in whatever Stokes parameters are present.
Thus it searchs for peaks in either I or I + |V | or I +
, the
rationale for the latter two forms being to be biased towards finding strongly
polarized pixels first (these forms are also the maximum eigenvalue of the
coherency matrix). The PSF is constrained to be the same in all polarizations
(a feature of this implementation, not of the Hamaker-Bregman-Sault
formalism). But the option of searching peaks in the stokes planes
independently is available via the clarkstokes parameter
The clean algorithms possible are:
The multi-field clean should be used if either of two conditions hold:
Note that for the single pointing algorithms, only a quarter of the image may be cleaned. If no mask is set, then the cleaned region defaults to the inner quarter. If a mask larger than a quarter of the image is set, then only the inner quarter part of that mask is used. However, for the wide-field and multi-field imaging (including the Cotton-Schwab algorithm), the entire field may be imaged because the major cycles either do an exact subtraction from the visibilities or because PSF extent is more than twice the extent of the primary beam support.
Before clean can be run, you must run selectvis and defineimage. Before clean can be run with a multi-field algorithm (especially for mosaic), you should run setvp. You may want to run setmfcontrol before running clean with a multi-field or wide-field algorithm, though the default control values may be acceptable. Before clean can be run with a multi-scale algorithm, setscales must be run.
Interactive cleaning/masking: If the user wants to see what the clean image looks like after npercycle iteration and mask or modify the mask each time, he/she should set interactive=True and give npercycle to a fraction of niter. A viewer with the last residual image along with an overlayed mask appear after every npercycle iteration. The user can add or delete regions (by clicking on the appropriate button) to the mask using the region button and drawing regions and double clicking inside the region. When satisfied and ready to continue cleaning press ’DONE with masking’ (if the user want to terminate the cleaning process use the ’STOP’ button). The button ’No more mask changes’ should be used if the user want clean to proceed without any further interruption. Even if interactive=False, and if the parameter ’mask’ is non-empty, it is still used in limiting the search area for clean components. If the parameter ’masktemplate’ is not empty this means that the user want to use an apriori image to make the mask the first time (e.g a previously cleaned image)
Arguments
| Inputs |
| ||
| algorithm |
| Algorithm to use
| |
| allowed: | string |
|
| Default: | clark clarkstokes hogbom multiscale mfclark mfclarkstokes csclean csfast mfhogbom mfmultiscale wfclark wfhogbom clark |
|
| niter |
| Number of Iterations, set to zero for no CLEANing
| |
| allowed: | int | |
| Default: | 1000 |
|
| gain |
| Loop Gain for CLEANing
| |
| allowed: | double | |
| Default: | 0.1 |
|
| threshold |
| Flux level at which to stop CLEANing
| |
| allowed: | any |
|
| Default: | variant 0.0Jy |
|
| displayprogress |
| Display the progress of the cleaning?
| |
| allowed: | bool | |
| Default: | false |
|
| model |
| Names of clean model images
| |
| allowed: | stringArray |
|
| Default: |
| |
| keepfixed |
| Keep one or more models fixed
| |
| allowed: | boolArray |
|
| Default: | false | |
| complist |
| Name of component list
| |
| allowed: | string |
|
| Default: |
|
|
| mask |
| Names of mask images used for CLEANing
| |
| allowed: | stringArray |
|
| Default: |
|
|
| image |
| Names of restored images
| |
| allowed: | stringArray |
|
| Default: |
|
|
| residual |
| Names of residual images
| |
| allowed: | stringArray |
|
| Default: |
|
|
| psfimage |
| Names of psfs if they are needed
| |
| allowed: | stringArray |
|
| Default: |
|
|
| interactive |
| whether to stop clean and interactively mask
| |
| allowed: | bool |
|
| Default: | false |
|
| npercycle |
| If interactive is ’T’, then no of iter of clean before
stopping, usually a fraction of niter
| |
| allowed: | int |
|
| Default: | 100 |
|
| masktemplate |
| If non empty then will use this image to make the mask
the first time
| |
| allowed: | string |
|
| Default: |
|
|
| async |
| Run asynchronously in the background?
| |
| allowed: | bool |
|
| Default: | false |
|
Example
A few points should be noted in this example:
Please send any comments or questions about CASA or AIPS++ to aips2-requests@nrao.edu
Copyright © 2008 Associated Universities Inc., Washington, D.C.
This code is available under the terms of the GNU General Public Lincense
Home |
Contact Us |
Directories |
Site Map |
Help |
Privacy Policy |
Search
Updated daily during alpha development.