Efficient least-squares basket-weaving
arXiv:1210.4005 · doi:10.1051/0004-6361/201220305
Abstract
We report on a novel method to solve the basket-weaving problem. Basket-weaving is a technique that is used to remove scan-line patterns from single-dish radio maps. The new approach applies linear least-squares and works on gridded maps from arbitrarily sampled data, which greatly improves computational efficiency and robustness. It also allows masking of bad data, which is useful for cases where radio frequency interference is present in the data. We evaluate the algorithms using simulations and real data obtained with the Effelsberg 100-m telescope.
11 pages, 11 figures, accepted by A&A
References in corpus (3)
Cited by in corpus (4)
- The Effelsberg-Bonn HI Survey: Milky Way gas. First data release
- A global view on star formation: The GLOSTAR Galactic Plane Survey. I. Overview and first results for the Galactic longitude range 28° < l < 36°
- Sardinia Radio Telescope wide-band spectral-polarimetric observations of the galaxy cluster 3C 129
- Skynet Algorithm for Single-Dish Radio Mapping I: Contaminant-Cleaning, Mapping, and Photometering Small-Scale Structures