8,779 research outputs found
Left-invariant evolutions of wavelet transforms on the Similitude Group
Enhancement of multiple-scale elongated structures in noisy image data is
relevant for many biomedical applications but commonly used PDE-based
enhancement techniques often fail at crossings in an image. To get an overview
of how an image is composed of local multiple-scale elongated structures we
construct a multiple scale orientation score, which is a continuous wavelet
transform on the similitude group, SIM(2). Our unitary transform maps the space
of images onto a reproducing kernel space defined on SIM(2), allowing us to
robustly relate Euclidean (and scaling) invariant operators on images to
left-invariant operators on the corresponding continuous wavelet transform.
Rather than often used wavelet (soft-)thresholding techniques, we employ the
group structure in the wavelet domain to arrive at left-invariant evolutions
and flows (diffusion), for contextual crossing preserving enhancement of
multiple scale elongated structures in noisy images. We present experiments
that display benefits of our work compared to recent PDE techniques acting
directly on the images and to our previous work on left-invariant diffusions on
orientation scores defined on Euclidean motion group.Comment: 40 page
Comparative power spectral analysis of simultaneous elecroencephalographic and magnetoencephalographic recordings in humans suggests non-resistive extracellular media
The resistive or non-resistive nature of the extracellular space in the brain
is still debated, and is an important issue for correctly modeling
extracellular potentials. Here, we first show theoretically that if the medium
is resistive, the frequency scaling should be the same for electroencephalogram
(EEG) and magnetoencephalogram (MEG) signals at low frequencies (<10 Hz). To
test this prediction, we analyzed the spectrum of simultaneous EEG and MEG
measurements in four human subjects. The frequency scaling of EEG displays
coherent variations across the brain, in general between 1/f and 1/f^2, and
tends to be smaller in parietal/temporal regions. In a given region, although
the variability of the frequency scaling exponent was higher for MEG compared
to EEG, both signals consistently scale with a different exponent. In some
cases, the scaling was similar, but only when the signal-to-noise ratio of the
MEG was low. Several methods of noise correction for environmental and
instrumental noise were tested, and they all increased the difference between
EEG and MEG scaling. In conclusion, there is a significant difference in
frequency scaling between EEG and MEG, which can be explained if the
extracellular medium (including other layers such as dura matter and skull) is
globally non-resistive.Comment: Submitted to Journal of Computational Neuroscienc
Shapes From Pixels
Continuous-domain visual signals are usually captured as discrete (digital)
images. This operation is not invertible in general, in the sense that the
continuous-domain signal cannot be exactly reconstructed based on the discrete
image, unless it satisfies certain constraints (\emph{e.g.}, bandlimitedness).
In this paper, we study the problem of recovering shape images with smooth
boundaries from a set of samples. Thus, the reconstructed image is constrained
to regenerate the same samples (consistency), as well as forming a shape
(bilevel) image. We initially formulate the reconstruction technique by
minimizing the shape perimeter over the set of consistent binary shapes. Next,
we relax the non-convex shape constraint to transform the problem into
minimizing the total variation over consistent non-negative-valued images. We
also introduce a requirement (called reducibility) that guarantees equivalence
between the two problems. We illustrate that the reducibility property
effectively sets a requirement on the minimum sampling density. One can draw
analogy between the reducibility property and the so-called restricted isometry
property (RIP) in compressed sensing which establishes the equivalence of the
minimization with the relaxed minimization. We also evaluate
the performance of the relaxed alternative in various numerical experiments.Comment: 13 pages, 14 figure
Ellipse-preserving Hermite interpolation and subdivision
We introduce a family of piecewise-exponential functions that have the
Hermite interpolation property. Our design is motivated by the search for an
effective scheme for the joint interpolation of points and associated tangents
on a curve with the ability to perfectly reproduce ellipses. We prove that the
proposed Hermite functions form a Riesz basis and that they reproduce
prescribed exponential polynomials. We present a method based on Green's
functions to unravel their multi-resolution and approximation-theoretic
properties. Finally, we derive the corresponding vector and scalar subdivision
schemes, which lend themselves to a fast implementation. The proposed vector
scheme is interpolatory and level-dependent, but its asymptotic behaviour is
the same as the classical cubic Hermite spline algorithm. The same convergence
properties---i.e., fourth order of approximation---are hence ensured
Learning Output Kernels for Multi-Task Problems
Simultaneously solving multiple related learning tasks is beneficial under a
variety of circumstances, but the prior knowledge necessary to correctly model
task relationships is rarely available in practice. In this paper, we develop a
novel kernel-based multi-task learning technique that automatically reveals
structural inter-task relationships. Building over the framework of output
kernel learning (OKL), we introduce a method that jointly learns multiple
functions and a low-rank multi-task kernel by solving a non-convex
regularization problem. Optimization is carried out via a block coordinate
descent strategy, where each subproblem is solved using suitable conjugate
gradient (CG) type iterative methods for linear operator equations. The
effectiveness of the proposed approach is demonstrated on pharmacological and
collaborative filtering data
Image interpolation using Shearlet based iterative refinement
This paper proposes an image interpolation algorithm exploiting sparse
representation for natural images. It involves three main steps: (a) obtaining
an initial estimate of the high resolution image using linear methods like FIR
filtering, (b) promoting sparsity in a selected dictionary through iterative
thresholding, and (c) extracting high frequency information from the
approximation to refine the initial estimate. For the sparse modeling, a
shearlet dictionary is chosen to yield a multiscale directional representation.
The proposed algorithm is compared to several state-of-the-art methods to
assess its objective as well as subjective performance. Compared to the cubic
spline interpolation method, an average PSNR gain of around 0.8 dB is observed
over a dataset of 200 images
- …