The CLEAN algorithm is a computational algorithm to perform a deconvolution on images created in radio astronomy. It was published by Jan Högbom in 1974[1] and several variations have been proposed since then.[2]

The algorithm assumes that the image consists of a number of point sources. It will iteratively find the highest value in the image and subtract a small gain of this point source convolved with the point spread function ("dirty beam") of the observation, until the highest value is smaller than some threshold.

Astronomer T. J. Cornwell writes, "The impact of CLEAN on radio astronomy has been immense", both directly in enabling greater speed and efficiency in observations, and indirectly by encouraging "a wave of innovation in synthesis processing that continues to this day."[3] It has also been applied in other areas of astronomy and many other fields of science.[3]

The CLEAN algorithm and its variations are still extensively used in radio astronomy, for example in the first imaging of the M87 central supermassive black hole by the Event Horizon Telescope.[4][5]

References

edit
  1. ^ Aperture Synthesis with a Non-Regular Distribution of Interferometer Baselines, original publication by Jan Högbom about CLEAN, in the Astronomy and Astrophysics Supplement, Vol. 15, p.417
  2. ^ The family of CLEAN algorithms, a chapter from the MAPPING software manual
  3. ^ a b Cornwell, T. J. (2009). "Hogbom's CLEAN algorithm. Impact on astronomy and beyond". Astronomy & Astrophysics. 500: 65–66. doi:10.1051/0004-6361/200912148.
  4. ^ The Event Horizon Telescope Collaboration (2019). "First M87 Event Horizon Telescope Results. I. The Shadow of the Supermassive Black Hole". The Astrophysical Journal Letters. 875 (1): L1. arXiv:1906.11238. Bibcode:2019ApJ...875L...1E. doi:10.3847/2041-8213/ab0ec7. S2CID 145906806.
  5. ^ The Event Horizon Telescope Collaboration (2019). "First M87 Event Horizon Telescope Results. IV. Imaging the Central Supermassive Black Hole". The Astrophysical Journal Letters. 875 (1): L4. arXiv:1906.11241. Bibcode:2019ApJ...875L...4E. doi:10.3847/2041-8213/ab0e85. S2CID 146068771.