About: CLEAN (algorithm)     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatAlgorithms, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FCLEAN_%28algorithm%29

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 then. 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.

AttributesValues
rdf:type
rdfs:label
  • CLEAN (algorithm) (en)
  • CLEAN (algoritmo) (pt)
rdfs:comment
  • O algoritmo CLEAN é um algoritmo computacional para executar uma deconvolução em imagens criadas em radioastronomia. Foi publicado por em 1974 e várias variações foram propostas desde então. O algoritmo assume que a imagem consiste em um número de fontes pontuais. Irá encontrar iterativamente o valor mais alto na imagem e subtrair um pequeno ganho dessa fonte pontual convolvido com a da observação, até que o valor mais alto seja menor que algum limite. O algoritmo CLEAN e suas variações ainda são amplamente utilizados na radioastronomia, por exemplo, na primeira imagem do buraco negro supermassivo central M87. (pt)
  • 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 then. 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. (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • 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 then. 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." It has also been applied in other areas of astronomy and many other fields of science. 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. (en)
  • O algoritmo CLEAN é um algoritmo computacional para executar uma deconvolução em imagens criadas em radioastronomia. Foi publicado por em 1974 e várias variações foram propostas desde então. O algoritmo assume que a imagem consiste em um número de fontes pontuais. Irá encontrar iterativamente o valor mais alto na imagem e subtrair um pequeno ganho dessa fonte pontual convolvido com a da observação, até que o valor mais alto seja menor que algum limite. O algoritmo CLEAN e suas variações ainda são amplamente utilizados na radioastronomia, por exemplo, na primeira imagem do buraco negro supermassivo central M87. (pt)
gold:hypernym
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is Wikipage disambiguates of
is known for of
is known for of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software