Christopher Heil
Georgia Institute of Technology
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Christopher Heil.
Siam Review | 1989
Christopher Heil; David F. Walnut
This paper is an expository survey of results on integral representations and discrete sum expansions of functions in
IEEE Transactions on Image Processing | 1999
Vasily Strela; Peter Niels Heller; Gilbert Strang; Pankaj Topiwala; Christopher Heil
L^2 ({\bf R})
Archive | 2011
Christopher Heil
in terms of coherent states. Two types of coherent states are considered: Weyl–Heisenberg coherent states, which arise from translations and modulations of a single function, and affine coherent states, called ’wavelets,’ which arise as translations and dilations of a single function. In each case it is shown how to represent any function in
Journal of Fourier Analysis and Applications | 2006
Radu Balan; Peter G. Casazza; Christopher Heil; Zeph Landau
L^2 ({\bf R})
SIAM Journal on Matrix Analysis and Applications | 1994
David Colella; Christopher Heil
as a sum or integral of these states. Most of the paper is a survey of literature, most notably the work of I. Daubechies, A. Grossmann, and J. Morlet. A few results of the authors are included.
Electronic Research Announcements of The American Mathematical Society | 2006
Radu Balan; Peter G. Casazza; Christopher Heil; Zeph Landau
Multiwavelets are a new addition to the body of wavelet theory. Realizable as matrix-valued filterbanks leading to wavelet bases, multiwavelets offer simultaneous orthogonality, symmetry, and short support, which is not possible with scalar two-channel wavelet systems. After reviewing this theory, we examine the use of multiwavelets in a filterbank setting for discrete-time signal and image processing. Multiwavelets differ from scalar wavelet systems in requiring two or more input streams to the multiwavelet filterbank. We describe two methods (repeated row and approximation/deapproximation) for obtaining such a vector input stream from a one-dimensional (1-D) signal. Algorithms for symmetric extension of signals at boundaries are then developed, and naturally integrated with approximation-based preprocessing. We describe an additional algorithm for multiwavelet processing of two-dimensional (2-D) signals, two rows at a time, and develop a new family of multiwavelets (the constrained pairs) that is well-suited to this approach. This suite of novel techniques is then applied to two basic signal processing problems, denoising via wavelet-shrinkage, and data compression. After developing the approach via model problems in one dimension, we apply multiwavelet processing to images, frequently obtaining performance superior to the comparable scalar wavelet transform.
Memoirs of the American Mathematical Society | 2004
Carlos Cabrelli; Christopher Heil; Ursula Molter
ANHA Series Preface.- Preface.- General Notation.- Part I. A Primer on Functional Analysis .- Banach Spaces and Operator Theory.- Functional Analysis.- Part II. Bases and Frames.- Unconditional Convergence of Series in Banach and Hilbert Spaces.- Bases in Banach Spaces.- Biorthogonality, Minimality, and More About Bases.- Unconditional Bases in Banach Spaces.- Bessel Sequences and Bases in Hilbert Spaces.- Frames in Hilbert Spaces.- Part III. Bases and Frames in Applied Harmonic Analysis.- The Fourier Transform on the Real Line.- Sampling, Weighted Exponentials, and Translations.- Gabor Bases and Frames.- Wavelet Bases and Frames.- Part IV. Fourier Series.- Fourier Series.- Basic Properties of Fourier Series.- Part V. Appendices.- Lebesgue Measure and Integration.- Compact and Hilbert-Schmidt Operators.- Hints for Exercises.- Index of Symbols.- References.- Index.
Advances in Computational Mathematics | 2003
Radu Balan; Peter G. Casazza; Christopher Heil; Zeph Landau
AbstractFrames have applications in numerous fields of mathematics and engineering. The fundamental property of frames which makes them so useful is their overcompleteness. In most applications, it is this overcompleteness that is exploited to yield a decomposition that is more stable, more robust, or more compact than is possible using nonredundant systems. This work presents a quantitative framework for describing the overcompleteness of frames. It introduces notions of localization and approximation between two frames
Archive | 1998
John J. Benedetto; Christopher Heil; David F. Walnut
{\frak F} = \{f_i\}_{i\in I}
Proceedings of the American Mathematical Society | 1996
Christopher Heil; Jayakumar Ramanathan; Pankaj Topiwala
and