اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAUTO-MULTITHRESH: A General Purpose Automasking Algorithm
47
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Producing images from interferometer data requires accurate modeling of the sources in the field of view, which is typically done using the CLEAN algorithm. Given the large number of degrees of freedom in interferometeric images, one constrains the possible model solutions for CLEAN by masking regions that contain emission. Traditionally this process has largely been done by hand. This approach is not possible with todays large data volumes which require automated imaging pipelines. This paper describes an automated masking algorithm that operates within CLEAN called AUTO-MULTITHRESH. This algorithm was developed and validated using a set of ~1000 ALMA images chosen to span a range of intrinsic morphology and data characteristics. It takes a top-down approach to producing masks: it uses the residual images to identify significant peaks and then expands the mask to include emission associated with these peaks down to lower signal-to-noise noise. The AUTO-MULTITHRESH algorithm has been implemented in CASA and has been used in production as part of the ALMA Imaging Pipeline starting with Cycle 5. It has been shown to be able to mask a wide range of emission ranging from simple point sources to complex extended emission with minimal tuning of the parameters based on the point spread function of the data. Although the algorithm was developed for ALMA, it is general enough to have been used successfully with data from other interferometers with appropriate parameter tuning. Integrating the algorithm more deeply within the minor cycle could lead to future performance improvements.
قيم البحث
اقرأ أيضاً
We developed a code that estimates distances to stars using measured spectroscopic and photometric quantities. We employ a Bayesian approach to build the probability distribution function over stellar evolutionary models given these data, delivering
estimates of model parameters for each star individually. The code was first tested on simulations, successfully recovering input distances to mock stars with <1% bias.The method-intrinsic random distance uncertainties for typical spectroscopic survey measurements amount to around 10% for dwarf stars and 20% for giants, and are most sensitive to the quality of $log g$ measurements. The code was validated by comparing our distance estimates to parallax measurements from the Hipparcos mission for nearby stars (< 300 pc), to asteroseismic distances of CoRoT red giant stars, and to known distances of well-studied open and globular clusters. The external comparisons confirm that our distances are subject to very small systematic biases with respect to the fundamental Hipparcos scale (+0.4 % for dwarfs, and +1.6% for giants). The typical random distance scatter is 18% for dwarfs, and 26% for giants. For the CoRoT-APOGEE sample, the typical random distance scatter is ~15%, both for the nearby and farther data. Our distances are systematically larger than the CoRoT ones by about +9%, which can mostly be attributed to the different choice of priors. The comparison to known distances of star clusters from SEGUE and APOGEE has led to significant systematic differences for many cluster stars, but with opposite signs, and with substantial scatter. Finally, we tested our distances against those previously determined for a high-quality sample of giant stars from the RAVE survey, again finding a small systematic trend of +5% and an rms scatter of 30%.
We present the second generation BLASTbus electronics. The primary purposes of this system are detector readout, attitude control, and cryogenic housekeeping, for balloon-borne telescopes. Readout of neutron transmutation doped germanium (NTD-Ge) bol
ometers requires low noise and parallel acquisition of hundreds of analog signals. Controlling a telescopes attitude requires the capability to interface to a wide variety of sensors and motors, and to use them together in a fast, closed loop. To achieve these different goals, the BLASTbus system employs a flexible motherboard-daughterboard architecture. The programmable motherboard features a digital signal processor (DSP) and field-programmable gate array (FPGA), as well as slots for three daughterboards. The daughterboards provide the interface to the outside world, wi
SpeechBrain is an open-source and all-in-one speech toolkit. It is designed to facilitate the research and development of neural speech processing technologies by being simple, flexible, user-friendly, and well-documented. This paper describes the co
re architecture designed to support several tasks of common interest, allowing users to naturally conceive, compare and share novel speech processing pipelines. SpeechBrain achieves competitive or state-of-the-art performance in a wide range of speech benchmarks. It also provides training recipes, pretrained models, and inference scripts for popular speech datasets, as well as tutorials which allow anyone with basic Python proficiency to familiarize themselves with speech technologies.
We describe a general purpose algorithm for counting simple cycles and simple paths of any length $ell$ on a (weighted di)graph on $N$ vertices and $M$ edges, achieving a time complexity of $Oleft(N+M+big(ell^omega+ellDeltabig) |S_ell|right)$. In thi
s expression, $|S_ell|$ is the number of (weakly) connected induced subgraphs of $G$ on at most $ell$ vertices, $Delta$ is the maximum degree of any vertex and $omega$ is the exponent of matrix multiplication. We compare the algorithm complexity both theoretically and experimentally with most of the existing algorithms for the same task. These comparisons show that the algorithm described here is the best general purpose algorithm for the class of graphs where $(ell^{omega-1}Delta^{-1}+1) |S_ell|leq |text{Cycle}_ell|$, with $|text{Cycle}_ell|$ the total number of simple cycles of length at most $ell$, including backtracks and self-loops. On ErdH{o}s-Renyi random graphs, we find empirically that this happens when the edge probability is larger than circa $4/N$. In addition, we show that some real-world networks also belong to this class. Finally, the algorithm permits the enumeration of simple cycles and simple paths on networks where vertices are labeled from an alphabet on $n$ letters with a time complexity of $Oleft(N+M+big(n^ellell^omega+ellDeltabig) |S_ell|right)$. A Matlab implementation of the algorithm proposed here is available for download.
There is currently an increasing demand for cryptoasset analysis tools among cryptoasset service providers, the financial industry in general, as well as across academic fields. At the moment, one can choose between commercial services or low-level o
pen-source tools providing programmatic access. In this paper, we present the design and implementation of another option: the GraphSense Cryptoasset Analytics Platform, which can be used for interactive investigations of monetary flows and, more importantly, for executing advanced analytics tasks using a standard data science tool stack. By providing a growing set of open-source components, GraphSense could ultimately become an instrument for scientific investigations in academia and a possible response to emerging compliance and regulation challenges for businesses and organizations dealing with cryptoassets.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
