Clean Algorithm



The task for Clean is to determine what set of point sources could have produced the dirty map obtained from the back projection routine given the instrument PSF. The Clean algorithm first finds the pixel with the highest flux in the dirty map. It assigns a point source at the same location in a new map of Clean components with a fixed fraction (known as the “loop gain”) of that flux. It then subtracts that same fractional flux from the dirty map but spread out according to the PSF centered on the same pixel. This process is repeated by taking the pixel with highest flux in the new dirty map, the so-called residual map. Cycling through this process can be continued a specified number of times or until the peak absolute flux in the residual map is negative.

bulletCLEAN Tutorial (simulated data)
- Säm Krucker (March 2002)

bulletCLEAN Tutorial (real data)
- Säm Krucker (March 2002)

bulletCHI squared test in CLEAN
- Säm Krucker (January 2002)

bulletPolar CLEAN Strategies
- Ed Schmahl (January 2000)

bulletBack Projection with or without Clean
- C. M. Johns-Krull (March 2003)

bulletRHESSI Data Object Parameters: Clean Algorithm Parameters
- Kim Tolbert
bulletImportant Changes to Back Projection and Clean   (doc)   (pdf)
- Gordon Hurford and Richard Schwartz (November 2004)




Responsible NASA Official:
Brian Dennis
Web Design:
Merrick Berg

Solar Physics Laboratory, Goddard Space Flight Center

Space Science Laboratory, University of California Berkeley
Responsible Berkeley Official:
Hugh Hudson
Systems Admin:
Jon Loran

This page last updated: June 27, 2011