1,688 research outputs found
BLADE: Filter Learning for General Purpose Computational Photography
The Rapid and Accurate Image Super Resolution (RAISR) method of Romano,
Isidoro, and Milanfar is a computationally efficient image upscaling method
using a trained set of filters. We describe a generalization of RAISR, which we
name Best Linear Adaptive Enhancement (BLADE). This approach is a trainable
edge-adaptive filtering framework that is general, simple, computationally
efficient, and useful for a wide range of problems in computational
photography. We show applications to operations which may appear in a camera
pipeline including denoising, demosaicing, and stylization
Sparse wavelet-based solutions for the M/EEG inverse problem
This paper is concerned with variational and Bayesian approaches to
neuro-electromagnetic inverse problems (EEG and MEG). The strong indeterminacy
of these problems is tackled by introducing sparsity inducing
regularization/priors in a transformed domain, namely a spatial wavelet domain.
Sparsity in the wavelet domain allows to reach ''data compression'' in the
cortical sources domain. Spatial wavelets defined on the mesh graph of the
triangulated cortical surface are used, in combination with sparse regression
techniques, namely LASSO regression or sparse Bayesian learning, to provide
localized and compressed estimates for brain activity from sensor data.
Numerical results on simulated and real MEG data are provided, which outline
the performances of the proposed approach in terms of localization
(k,q)-Compressed Sensing for dMRI with Joint Spatial-Angular Sparsity Prior
Advanced diffusion magnetic resonance imaging (dMRI) techniques, like
diffusion spectrum imaging (DSI) and high angular resolution diffusion imaging
(HARDI), remain underutilized compared to diffusion tensor imaging because the
scan times needed to produce accurate estimations of fiber orientation are
significantly longer. To accelerate DSI and HARDI, recent methods from
compressed sensing (CS) exploit a sparse underlying representation of the data
in the spatial and angular domains to undersample in the respective k- and
q-spaces. State-of-the-art frameworks, however, impose sparsity in the spatial
and angular domains separately and involve the sum of the corresponding sparse
regularizers. In contrast, we propose a unified (k,q)-CS formulation which
imposes sparsity jointly in the spatial-angular domain to further increase
sparsity of dMRI signals and reduce the required subsampling rate. To
efficiently solve this large-scale global reconstruction problem, we introduce
a novel adaptation of the FISTA algorithm that exploits dictionary
separability. We show on phantom and real HARDI data that our approach achieves
significantly more accurate signal reconstructions than the state of the art
while sampling only 2-4% of the (k,q)-space, allowing for the potential of new
levels of dMRI acceleration.Comment: To be published in the 2017 Computational Diffusion MRI Workshop of
MICCA
Non-parametric PSF estimation from celestial transit solar images using blind deconvolution
Context: Characterization of instrumental effects in astronomical imaging is
important in order to extract accurate physical information from the
observations. The measured image in a real optical instrument is usually
represented by the convolution of an ideal image with a Point Spread Function
(PSF). Additionally, the image acquisition process is also contaminated by
other sources of noise (read-out, photon-counting). The problem of estimating
both the PSF and a denoised image is called blind deconvolution and is
ill-posed.
Aims: We propose a blind deconvolution scheme that relies on image
regularization. Contrarily to most methods presented in the literature, our
method does not assume a parametric model of the PSF and can thus be applied to
any telescope.
Methods: Our scheme uses a wavelet analysis prior model on the image and weak
assumptions on the PSF. We use observations from a celestial transit, where the
occulting body can be assumed to be a black disk. These constraints allow us to
retain meaningful solutions for the filter and the image, eliminating trivial,
translated and interchanged solutions. Under an additive Gaussian noise
assumption, they also enforce noise canceling and avoid reconstruction
artifacts by promoting the whiteness of the residual between the blurred
observations and the cleaned data.
Results: Our method is applied to synthetic and experimental data. The PSF is
estimated for the SECCHI/EUVI instrument using the 2007 Lunar transit, and for
SDO/AIA using the 2012 Venus transit. Results show that the proposed
non-parametric blind deconvolution method is able to estimate the core of the
PSF with a similar quality to parametric methods proposed in the literature. We
also show that, if these parametric estimations are incorporated in the
acquisition model, the resulting PSF outperforms both the parametric and
non-parametric methods.Comment: 31 pages, 47 figure
Proceedings of the second "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'14)
The implicit objective of the biennial "international - Traveling Workshop on
Interactions between Sparse models and Technology" (iTWIST) is to foster
collaboration between international scientific teams by disseminating ideas
through both specific oral/poster presentations and free discussions. For its
second edition, the iTWIST workshop took place in the medieval and picturesque
town of Namur in Belgium, from Wednesday August 27th till Friday August 29th,
2014. The workshop was conveniently located in "The Arsenal" building within
walking distance of both hotels and town center. iTWIST'14 has gathered about
70 international participants and has featured 9 invited talks, 10 oral
presentations, and 14 posters on the following themes, all related to the
theory, application and generalization of the "sparsity paradigm":
Sparsity-driven data sensing and processing; Union of low dimensional
subspaces; Beyond linear and convex inverse problem; Matrix/manifold/graph
sensing/processing; Blind inverse problems and dictionary learning; Sparsity
and computational neuroscience; Information theory, geometry and randomness;
Complexity/accuracy tradeoffs in numerical methods; Sparsity? What's next?;
Sparse machine learning and inference.Comment: 69 pages, 24 extended abstracts, iTWIST'14 website:
http://sites.google.com/site/itwist1
- …