4,745 research outputs found
Adaptive Langevin Sampler for Separation of t-Distribution Modelled Astrophysical Maps
We propose to model the image differentials of astrophysical source maps by
Student's t-distribution and to use them in the Bayesian source separation
method as priors. We introduce an efficient Markov Chain Monte Carlo (MCMC)
sampling scheme to unmix the astrophysical sources and describe the derivation
details. In this scheme, we use the Langevin stochastic equation for
transitions, which enables parallel drawing of random samples from the
posterior, and reduces the computation time significantly (by two orders of
magnitude). In addition, Student's t-distribution parameters are updated
throughout the iterations. The results on astrophysical source separation are
assessed with two performance criteria defined in the pixel and the frequency
domains.Comment: 12 pages, 6 figure
Graph Signal Processing: Overview, Challenges and Applications
Research in Graph Signal Processing (GSP) aims to develop tools for
processing data defined on irregular graph domains. In this paper we first
provide an overview of core ideas in GSP and their connection to conventional
digital signal processing. We then summarize recent developments in developing
basic GSP tools, including methods for sampling, filtering or graph learning.
Next, we review progress in several application areas using GSP, including
processing and analysis of sensor network data, biological data, and
applications to image processing and machine learning. We finish by providing a
brief historical perspective to highlight how concepts recently developed in
GSP build on top of prior research in other areas.Comment: To appear, Proceedings of the IEE
Positive Definite Kernels in Machine Learning
This survey is an introduction to positive definite kernels and the set of
methods they have inspired in the machine learning literature, namely kernel
methods. We first discuss some properties of positive definite kernels as well
as reproducing kernel Hibert spaces, the natural extension of the set of
functions associated with a kernel defined
on a space . We discuss at length the construction of kernel
functions that take advantage of well-known statistical models. We provide an
overview of numerous data-analysis methods which take advantage of reproducing
kernel Hilbert spaces and discuss the idea of combining several kernels to
improve the performance on certain tasks. We also provide a short cookbook of
different kernels which are particularly useful for certain data-types such as
images, graphs or speech segments.Comment: draft. corrected a typo in figure
Fast Fiber Orientation Estimation in Diffusion MRI from kq-Space Sampling and Anatomical Priors
High spatio-angular resolution diffusion MRI (dMRI) has been shown to provide
accurate identification of complex fiber configurations, albeit at the cost of
long acquisition times. We propose a method to recover intra-voxel fiber
configurations at high spatio-angular resolution relying on a kq-space
under-sampling scheme to enable accelerated acquisitions. The inverse problem
for reconstruction of the fiber orientation distribution (FOD) is regularized
by a structured sparsity prior promoting simultaneously voxelwise sparsity and
spatial smoothness of fiber orientation. Prior knowledge of the spatial
distribution of white matter, gray matter and cerebrospinal fluid is also
assumed. A minimization problem is formulated and solved via a forward-backward
convex optimization algorithmic structure. Simulations and real data analysis
suggest that accurate FOD mapping can be achieved from severe kq-space
under-sampling regimes, potentially enabling high spatio-angular dMRI in the
clinical setting.Comment: 10 pages, 5 figures, Supplementary Material
- …