22,643 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
Quantum resource estimates for computing elliptic curve discrete logarithms
We give precise quantum resource estimates for Shor's algorithm to compute
discrete logarithms on elliptic curves over prime fields. The estimates are
derived from a simulation of a Toffoli gate network for controlled elliptic
curve point addition, implemented within the framework of the quantum computing
software tool suite LIQ. We determine circuit implementations for
reversible modular arithmetic, including modular addition, multiplication and
inversion, as well as reversible elliptic curve point addition. We conclude
that elliptic curve discrete logarithms on an elliptic curve defined over an
-bit prime field can be computed on a quantum computer with at most qubits using a quantum circuit of at most Toffoli gates. We are able to classically simulate the
Toffoli networks corresponding to the controlled elliptic curve point addition
as the core piece of Shor's algorithm for the NIST standard curves P-192,
P-224, P-256, P-384 and P-521. Our approach allows gate-level comparisons to
recent resource estimates for Shor's factoring algorithm. The results also
support estimates given earlier by Proos and Zalka and indicate that, for
current parameters at comparable classical security levels, the number of
qubits required to tackle elliptic curves is less than for attacking RSA,
suggesting that indeed ECC is an easier target than RSA.Comment: 24 pages, 2 tables, 11 figures. v2: typos fixed and reference added.
ASIACRYPT 201
Discrete-Euclidean operations
International audienceIn this paper we study the relationship between the Euclidean and the discrete space. We study discrete operations based on Euclidean functions: the discrete smooth scaling and the discrete-continuous rotation. Conversely, we study Euclidean oper- ations based on discrete functions: the discrete based simplification, the Euclidean- discrete union and the Euclidean-discrete co-refinement. These operations operate partly in the discrete and partly in the continuous space. Especially for the discrete smooth scaling operation, we provide error bounds when different such operations are chained
Lorentzian and Euclidean Quantum Gravity - Analytical and Numerical Results
We review some recent attempts to extract information about the nature of
quantum gravity, with and without matter, by quantum field theoretical methods.
More specifically, we work within a covariant lattice approach where the
individual space-time geometries are constructed from fundamental simplicial
building blocks, and the path integral over geometries is approximated by
summing over a class of piece-wise linear geometries. This method of
``dynamical triangulations'' is very powerful in 2d, where the regularized
theory can be solved explicitly, and gives us more insights into the quantum
nature of 2d space-time than continuum methods are presently able to provide.
It also allows us to establish an explicit relation between the Lorentzian- and
Euclidean-signature quantum theories. Analogous regularized gravitational
models can be set up in higher dimensions. Some analytic tools exist to study
their state sums, but, unlike in 2d, no complete analytic solutions have yet
been constructed. However, a great advantage of our approach is the fact that
it is well-suited for numerical simulations. In the second part of this review
we describe the relevant Monte Carlo techniques, as well as some of the
physical results that have been obtained from the simulations of Euclidean
gravity. We also explain why the Lorentzian version of dynamical triangulations
is a promising candidate for a non-perturbative theory of quantum gravity.Comment: 69 pages, 16 figures, references adde
Mapping DSP algorithms to a reconfigurable architecture Adaptive Wireless Networking (AWGN)
This report will discuss the Adaptive Wireless Networking project. The vision of the Adaptive Wireless Networking project will be given. The strategy of the project will be the implementation of multiple communication systems in dynamically reconfigurable heterogeneous hardware. An overview of a wireless LAN communication system, namely HiperLAN/2, and a Bluetooth communication system will be given. Possible implementations of these systems in a dynamically reconfigurable architecture are discussed. Suggestions for future activities in the Adaptive Wireless Networking project are also given
Two discrete-continuous operations based on the scaling transform
International audienceIn this paper we study the relationship between the Euclidean and the discrete world thru two operations based on the Euclidean scaling function: the discrete smooth scaling and the discrete based geometrical simplification
Sparse image reconstruction on the sphere: analysis and synthesis
We develop techniques to solve ill-posed inverse problems on the sphere by
sparse regularisation, exploiting sparsity in both axisymmetric and directional
scale-discretised wavelet space. Denoising, inpainting, and deconvolution
problems, and combinations thereof, are considered as examples. Inverse
problems are solved in both the analysis and synthesis settings, with a number
of different sampling schemes. The most effective approach is that with the
most restricted solution-space, which depends on the interplay between the
adopted sampling scheme, the selection of the analysis/synthesis problem, and
any weighting of the l1 norm appearing in the regularisation problem. More
efficient sampling schemes on the sphere improve reconstruction fidelity by
restricting the solution-space and also by improving sparsity in wavelet space.
We apply the technique to denoise Planck 353 GHz observations, improving the
ability to extract the structure of Galactic dust emission, which is important
for studying Galactic magnetism.Comment: 11 pages, 6 Figure
- …