|
|||
NRAO Home > CASA > CASA Toolkit Reference Manual |
|
deconvolver.clarkclean - Function
3.1.2 Make a clean image using the Clark Clean a threshold
Description
In the Clark Clean algorithm, the cleaning is split into minor and major
cycles. In the minor cycles only the brightest points are cleaned, using a subset
of the point spread function. In the major cycle, the points thus found are
subtracted correctly by using an FFT-based convolution.
Arguments
Inputs |
| ||
niter |
| Number of iterations | |
| 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 0Jy |
|
displayprogress |
| Display the progress of the cleaning?
| |
| allowed: | bool | |
| Default: | false |
|
model |
| Name of images
| |
| allowed: | string |
|
| Default: |
| |
mask |
| Name of mask images used for CLEANing
| |
| allowed: | string |
|
| Default: |
| |
histbins |
| Number of bins in the pixel-flux histogram
| |
| allowed: | int |
|
| Default: | 500 |
|
psfpatchsize |
| Size of PSF for minor cycle
| |
| allowed: | intArray |
|
| Default: | 51 51 |
|
maxextpsf |
| maximum external sidelobe, used to set depth of minor
cycle clean
| |
| allowed: | double |
|
| Default: | 0.2 |
|
speedup |
| Cleaning speedup exponent
| |
| allowed: | double |
|
| Default: | 0.0 |
|
maxnumpix |
| Maximum number of pixels used in each minor cycle
| |
| allowed: | int |
|
| Default: | 10000 |
|
maxnummajcycles |
| Max number of major cycles; -1 = no restrictions
| |
| allowed: | int |
|
| Default: | -1 |
|
maxnumminoriter |
| Max number of minor iterations; -1 = no restrictions
| |
| allowed: | int |
|
| Default: | -1 |
|
bool
__________________________________________________________________
More information about CASA may be found at the
CASA web page
Copyright © 2016 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