363 research outputs found
Inversion of noisy Radon transform by SVD based needlet
A linear method for inverting noisy observations of the Radon transform is
developed based on decomposition systems (needlets) with rapidly decaying
elements induced by the Radon transform SVD basis. Upper bounds of the risk of
the estimator are established in () norms for functions
with Besov space smoothness. A practical implementation of the method is given
and several examples are discussed
Real Analysis, Harmonic Analysis and Applications to PDE
There have been important developments in the last few years in the point-of-view and methods of harmonic analysis, and at the same time significant concurrent progress in the application of these to partial differential equations and related subjects. The conference brought together experts and young scientists working in these two directions, with the objective of furthering these important interactions
Computerized Tomography and Reproducing Kernels
The X-ray transform is one of the most fundamental integral operators in
image processing and reconstruction. In this article, we revisit its
mathematical formalism, and propose an innovative approach making use of
Reproducing Kernel Hilbert Spaces (RKHS). Within this framework, the X-ray
transform can be considered as a natural analogue of Euclidean projections. The
RKHS framework considerably simplifies projection image interpolation, and
leads to an analogue of the celebrated representer theorem for the problem of
tomographic reconstruction. It leads to methodology that is dimension-free and
stands apart from conventional filtered back-projection techniques, as it does
not hinge on the Fourier transform. It also allows us to establish sharp
stability results at a genuinely functional level, but in the realistic setting
where the data are discrete and noisy. The RKHS framework is amenable to any
reproducing kernel on a unit ball, affording a high level of generality. When
the kernel is chosen to be rotation-invariant, one can obtain explicit spectral
representations which elucidate the regularity structure of the associated
Hilbert spaces, and one can also solve the reconstruction problem at the same
computational cost as filtered back-projection.Comment: 40 pages, 7 figure
Signal processing with Fourier analysis, novel algorithms and applications
Fourier analysis is the study of the way general functions may be represented or approximated by sums of simpler trigonometric functions, also analogously known as sinusoidal modeling. The original idea of Fourier had a profound impact on mathematical analysis, physics and engineering because it diagonalizes time-invariant convolution operators. In the past signal processing was a topic that stayed almost exclusively in electrical engineering, where only the experts could cancel noise, compress and reconstruct signals. Nowadays it is almost ubiquitous, as everyone now deals with modern digital signals. Medical imaging, wireless communications and power systems of the future will experience more data processing conditions and wider range of applications requirements than the systems of today. Such systems will require more powerful, efficient and flexible signal processing algorithms that are well designed to handle such needs. No matter how advanced our hardware technology becomes we will still need intelligent and efficient algorithms to address the growing demands in signal processing. In this thesis, we investigate novel techniques to solve a suite of four fundamental problems in signal processing that have a wide range of applications. The relevant equations, literature of signal processing applications, analysis and final numerical algorithms/methods to solve them using Fourier analysis are discussed for different applications in the electrical engineering/computer science. The first four chapters cover the following topics of central importance in the field of signal processing: • Fast Phasor Estimation using Adaptive Signal Processing (Chapter 2) • Frequency Estimation from Nonuniform Samples (Chapter 3) • 2D Polar and 3D Spherical Polar Nonuniform Discrete Fourier Transform (Chapter 4) • Robust 3D registration using Spherical Polar Discrete Fourier Transform and Spherical Harmonics (Chapter 5) Even though each of these four methods discussed may seem completely disparate, the underlying motivation for more efficient processing by exploiting the Fourier domain signal structure remains the same. The main contribution of this thesis is the innovation in the analysis, synthesis, discretization of certain well known problems like phasor estimation, frequency estimation, computations of a particular non-uniform Fourier transform and signal registration on the transformed domain. We conduct propositions and evaluations of certain applications relevant algorithms such as, frequency estimation algorithm using non-uniform sampling, polar and spherical polar Fourier transform. The techniques proposed are also useful in the field of computer vision and medical imaging. From a practical perspective, the proposed algorithms are shown to improve the existing solutions in the respective fields where they are applied/evaluated. The formulation and final proposition is shown to have a variety of benefits. Future work with potentials in medical imaging, directional wavelets, volume rendering, video/3D object classifications, high dimensional registration are also discussed in the final chapter. Finally, in the spirit of reproducible research we release the implementation of these algorithms to the public using Github
- …