CLEAN (algorithm)

CLEAN (algorithm)

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 and several variations have been proposed since.

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.


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • CLEAN — may refer to: * Component Validator for Environmentally Friendly Aero Engine * CLEAN Energy Act * CLEAN (algorithm), a computational algorithm used in astronomy to perform a deconvolution on dirty images …   Wikipedia

  • Viterbi algorithm — The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states ndash; called the Viterbi path ndash; that results in a sequence of observed events, especially in the context of Markov information… …   Wikipedia

  • Page replacement algorithm — This article is about algorithms specific to paging. For outline of general cache algorithms (e.g. processor, disk, database, web), see Cache algorithms. In a computer operating system that uses paging for virtual memory management, page… …   Wikipedia

  • Hungarian algorithm — The Hungarian method is a combinatorial optimization algorithm which solves the assignment problem in polynomial time and which anticipated later primal dual methods. It was developed and published by Harold Kuhn in 1955, who gave the name… …   Wikipedia

  • COmponent Detection Algorithm — For other uses, see Coda. The COmponent Detection Algorithm (CODA) is a name for a type of LC MS[1][2] and chemometrics[3] software algorithm focused on detecting peaks in noisy chromatograms (TIC) often obtained using the electospray ionization… …   Wikipedia

  • Deconvolution — In mathematics, deconvolution is an algorithm based process used to reverse the effects of convolution on recorded data.[1] The concept of deconvolution is widely used in the techniques of signal processing and image processing. Because these… …   Wikipedia

  • David L. Fried — is a scientist, best known for his contributions to optics. Fried described what has come to be known as Fried s seeing diameter, or r0 (usually pronounced r naught). The seeing diameter is effectively a limiting aperture due to atmospheric… …   Wikipedia

  • Primatte chromakey technology — Primatte is a high end chroma key technology used in motion picture, television and photographic host applications to remove solid colored backgrounds (greenscreen or bluescreen usually) and replace them with transparency to facilitate… …   Wikipedia

  • Nitrox — Typical Nitrox cylinder marking Nitrox refers to any gas mixture composed (excluding trace gases) of nitrogen and oxygen; this includes normal air which is approximately 78% nitrogen, 21% oxygen, and 1% other gases, primarily argon.[1][2] …   Wikipedia

  • Busy beaver — In computability theory, a busy beaver (from the colloquial expression for an industrious person) is a Turing machine that attains the maximum operational busyness (such as measured by the number of steps performed, or the number of nonblank… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”