اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFast GPU Implementation of Sparse Signal Recovery from Random Projections
112
0
0.0
(
0
)
تأليف
M. Andrecut
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider the problem of sparse signal recovery from a small number of random projections (measurements). This is a well known NP-hard to solve combinatorial optimization problem. A frequently used approach is based on greedy iterative procedures, such as the Matching Pursuit (MP) algorithm. Here, we discuss a fast GPU implementation of the MP algorithm, based on the recently released NVIDIA CUDA API and CUBLAS library. The results show that the GPU version is substantially faster (up to 31 times) than the highly optimized CPU version based on CBLAS (GNU Scientific Library).
قيم البحث
اقرأ أيضاً
The routine atomic-resolution structure determination of single particles is expected to have profound implications for probing the structure-function relationship in systems ranging from energy materials to biological molecules. Extremely-bright, ul
trashort-pulse X-ray sources---X-ray Free Electron Lasers (XFELs)---provide X-rays that can be used to probe ensembles of nearly identical nano-scale particles. When combined with coherent diffractive imaging, these objects can be imaged; however, as the resolution of the images approaches the atomic scale, the measured data are increasingly difficult to obtain and, during an X-ray pulse, the number of photons incident on the two-dimensional detector is much smaller than the number of pixels. This latter concern, the signal sparsity, materially impedes the application of the method. We demonstrate an experimental analog using a synchrotron X-ray source that yields signal levels comparable to those expected from single biomolecules illuminated by focused XFEL pulses. The analog experiment provides an invaluable cross-check on the fidelity of the reconstructed data that is not available during XFEL experiments. We establish---using this experimental data---that a sparsity of order $1.3times10^{-3}$ photons per pixel per frame can be overcome, lending vital insight to the solution of the atomic-resolution XFEL single particle imaging problem by experimentally demonstrating 3D coherent diffractive imaging from photon-sparse random projections.
Principal component analysis (PCA) is a key statistical technique for multivariate data analysis. For large data sets the common approach to PCA computation is based on the standard NIPALS-PCA algorithm, which unfortunately suffers from loss of ortho
gonality, and therefore its applicability is usually limited to the estimation of the first few components. Here we present an algorithm based on Gram-Schmidt orthogonalization (called GS-PCA), which eliminates this shortcoming of NIPALS-PCA. Also, we discuss the GPU (Graphics Processing Unit) parallel implementation of both NIPALS-PCA and GS-PCA algorithms. The numerical results show that the GPU parallel optimize
We use an artificial neural network to analyze asymmetric noisy random telegraph signals (RTSs), and extract underlying transition rates. We demonstrate that a long short-term memory neural network can vastly outperform conventional methods, particul
arly for noisy signals. Our technique gives reliable results as the signal-to-noise ratio approaches one, and over a wide range of underlying transition rates. We apply our method to random telegraph signals generated by a superconducting double dot based photon detector, allowing us to extend our measurement of quasiparticle dynamics to new temperature regimes.
The simulation of complex stochastic network dynamics arising, for instance, from models of coupled biomolecular processes remains computationally challenging. Often, the necessity to scan a models dynamics over a large parameter space renders full-f
ledged stochastic simulations impractical, motivating approximation schemes. Here we propose an approximation scheme which improves upon the standard linear noise approximation while retaining similar computational complexity. The underlying idea is to minimize, at each time step, the Kullback-Leibler divergence between the true time evolved probability distribution and a Gaussian approximation (entropic matching). This condition leads to ordinary differential equations for the mean and the covariance matrix of the Gaussian. For cases of weak nonlinearity, the method is more accurate than the linear method when both are compared to stochastic simulations.
From the spectral plot of the (normalized) graph Laplacian, the essential qualitative properties of a network can be simultaneously deduced. Given a class of empirical networks, reconstruction schemes for elucidating the evolutionary dynamics leading
to those particular data can then be developed. This method is exemplified for protein-protein interaction networks. Traces of their evolutionary history of duplication and divergence processes are identified. In particular, we can identify typical specific features that robustly distinguish protein-protein interaction networks from other classes of networks, in spite of possible statistical fluctuations of the underlying data.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
