Hostname: page-component-77c89778f8-vsgnj Total loading time: 0 Render date: 2024-07-20T05:26:35.017Z Has data issue: false hasContentIssue false

The Introduction of A Priori Knowledge in Certain Processing Algorithms

Published online by Cambridge University Press:  12 April 2016

J.A. Högbom*
Affiliation:
Stockholm Observatory

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A common problem in radio synthesis work is that of determining the brightness at N grid points in the map domain when there are only n<N independent interferometer measurements available. The missing (N-n) equations can in principle be replaced by an equivalent amount of information in the form of a priori knowledge about the brightness distribution. One way of doing this is to add an equation of the form

i.e. some function of the brightness distribution is maximized subject to the condition that the map be compatible with the n measurements. This automatically gives (N-n) new equations, leaving us in the pleasant situation of having as many equations as there are unknowns.

Type
Part V: Maximum Entropy Image Reconstruction
Copyright
Copyright © Reidel 1979

References

Ables, J.G.: 1974, “Astron. Astrophys. Suppl.” 15, p. 383.Google Scholar
Gull, S.F., Daniell, G.J.: 1978, “Nature” 272, p. 686.Google Scholar