ترغب بنشر مسار تعليمي؟ اضغط هنا

A fast and portable Re-Implementation of Piskunov and Valentis Optimal-Extraction Algorithm with improved Cosmic-Ray Removal and Optimal Sky Subtraction

42   0   0.0 ( 0 )
 نشر من قبل Andreas Ritter
 تاريخ النشر 2013
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

We present a fast and portable re-implementation of Piskunov and Valentis optimal-extraction algorithm (Piskunov & Valenti, 2002} in C/C++ together with full uncertainty propagation, improved cosmic-ray removal, and an optimal background-subtraction algorithm. This re-implementation can be used with IRAF and most existing data-reduction packages and leads to signal-to-noise ratios close to the Poisson limit. The algorithm is very stable, operates on spectra from a wide range of instruments (slit spectra and fibre feeds), and has been extensively tested for VLT/UVES, ESO/CES, ESO/FEROS, NTT/EMMI, NOT/ALFOSC, STELLA/SES, SSO/WiFeS, and finally, P60/SEDM-IFU data.

قيم البحث

اقرأ أيضاً

164 - Junyi Li , Bin Gu , Heng Huang 2020
Due to the hierarchical structure of many machine learning problems, bilevel programming is becoming more and more important recently, however, the complicated correlation between the inner and outer problem makes it extremely challenging to solve. A lthough several intuitive algorithms based on the automatic differentiation have been proposed and obtained success in some applications, not much attention has been paid to finding the optimal formulation of the bilevel model. Whether there exists a better formulation is still an open problem. In this paper, we propose an improved bilevel model which converges faster and better compared to the current formulation. We provide theoretical guarantee and evaluation results over two tasks: Data Hyper-Cleaning and Hyper Representation Learning. The empirical results show that our model outperforms the current bilevel model with a great margin. emph{This is a concurrent work with citet{liu2020generic} and we submitted to ICML 2020. Now we put it on the arxiv for record.}
79 - M. Zechmeister 2013
Optimal extraction is a key step in processing the raw images of spectra as registered by two-dimensional detector arrays to a one-dimensional format. Previously reported algorithms reconstruct models for a mean one-dimensional spatial profile to ass ist a properly weighted extraction. We outline a simple optimal extraction algorithm including error propagation, which is very suitable for stabilised, fibre-fed spectrographs and does not model the spatial profile shape. A high signal-to-noise, master-flat image serves as reference image and is directly used as an extraction profile mask. Each extracted spectral value is the scaling factor relative to the cross-section of the unnormalised master-flat which contains all information about the spatial profile as well as pixel-to-pixel variations, fringing, and blaze. The extracted spectrum is measured relative to the flat spectrum. Using echelle spectra of the HARPS spectrograph we demonstrate a competitive extraction performance in terms of signal-to-noise and show that extracted spectra can be used for high precision radial velocity measurement. Pre- or post-flat-fielding of the data is not necessary, since all spectrograph inefficiencies inherent to the extraction mask are automatically accounted for. Also the reconstruction of the mean spatial profile by models is not needed, thereby reducing the number of operations to extract spectra. Flat-relative optimal extraction is a simple, efficient, and robust method that can be applied easily to stabilised, fibre-fed spectrographs.
101 - R. Ansari 2009
We present a semi-analytical method to investigate the systematic effects and statistical uncertainties of the calculated angular power spectrum when incomplete spherical maps are used. The computed power spectrum suffers in particular a loss of angu lar frequency resolution, which can be written as delta_l ~ pi/gamma_max, where gamma_max is the effective maximum extent of the partial spherical maps. We propose a correction algorithm to reduce systematic effects on the estimated C_l, as obtained from the partial map projection on the spherical harmonic Ylm(l,m) basis. We have derived near optimal bands and weighting functions in l-space for power spectrum calculation using small maps, and a correction algorithm for partially masked spherical maps that contain information on the angular correlations on all scales.
We describe a procedure for background subtracting Sloan Digital Sky Survey (SDSS) imaging that improves the resulting detection and photometry of large galaxies on the sky. Within each SDSS drift scan run, we mask out detected sources and then fit a smooth function to the variation of the sky background. This procedure has been applied to all SDSS-III Data Release 8 images, and the results are available as part of that data set. We have tested the effect of our background subtraction on the photometry of large galaxies by inserting fake galaxies into the raw pixels, reanalyzing the data, and measuring them after background subtraction. Our technique results in no size-dependent bias in galaxy fluxes up to half-light radii of 100 arcsec; in contrast, for galaxies of that size the standard SDSS photometric catalog underestimates fluxes by about 1.5 mag. Our results represent a substantial improvement over the standard SDSS catalog results and should form the basis of any analysis of nearby galaxies using the SDSS imaging data.
Difference imaging is a technique for obtaining precise relative photometry of variable sources in crowded stellar fields and, as such, constitutes a crucial part of the data reduction pipeline in surveys for microlensing events or transiting extraso lar planets. The Optimal Image Subtraction (OIS) algorithm permits the accurate differencing of images by determining convolution kernels which, when applied to reference images of particularly good quality, provide excellent matches to the point-spread functions (PSF) in other images of the time series to be analysed. The convolution kernels are built as linear combinations of a set of basis functions, conventionally bivariate Gaussians modulated by polynomials. The kernel parameters must be supplied by the user and should ideally be matched to the PSF, pixel-sampling, and S/N of the data to be analysed. We have studied the outcome of the reduction as a function of the kernel parameters using our implementation of OIS within the TRIPP package. From the analysis of noise-free PSF simulations as well as test images from the ISIS OIS package, we derive qualitative and quantitative relations between the kernel parameters and the success of the subtraction as a function of the PSF sizes and sampling in reference and data images and compare the results to those of implementations in the literature. On this basis, we provide recommended parameters for data sets with different S/N and sampling.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا