827 research outputs found
Grassmannian Frames with Applications to Coding and Communication
For a given class of uniform frames of fixed redundancy we define
a Grassmannian frame as one that minimizes the maximal correlation among all frames . We first analyze
finite-dimensional Grassmannian frames. Using links to packings in Grassmannian
spaces and antipodal spherical codes we derive bounds on the minimal achievable
correlation for Grassmannian frames. These bounds yield a simple condition
under which Grassmannian frames coincide with uniform tight frames. We exploit
connections to graph theory, equiangular line sets, and coding theory in order
to derive explicit constructions of Grassmannian frames. Our findings extend
recent results on uniform tight frames. We then introduce infinite-dimensional
Grassmannian frames and analyze their connection to uniform tight frames for
frames which are generated by group-like unitary systems. We derive an example
of a Grassmannian Gabor frame by using connections to sphere packing theory.
Finally we discuss the application of Grassmannian frames to wireless
communication and to multiple description coding.Comment: Submitted in June 2002 to Appl. Comp. Harm. Ana
Gröbner bases and wavelet design
AbstractIn this paper, we detail the use of symbolic methods in order to solve some advanced design problems arising in signal processing. Our interest lies especially in the construction of wavelet filters for which the usual spectral factorization approach (used for example to construct the well-known Daubechies filters) is not applicable. In these problems, we show how the design equations can be written as multivariate polynomial systems of equations and accordingly how Gröbner algorithms offer an effective way to obtain solutions in some of these cases
Minimum-energy wavelet frame on the interval with arbitrary integer dilation factor
AbstractIn this paper, we study minimum-energy frame Ψ={ψ1,ψ2,…,ψM} on the interval with arbitrary factor d for L2[0,1], Ψ corresponding to some refinable functions with compact support. We give the constructive proof as well as the necessary and sufficient conditions of minimum-energy frames for L2[0,1], present the decomposition and reconstruction formulas of minimum-energy frame on the interval [0,1], and some examples. The experimental results show that the proposed minimum-energy frame on the interval improves the performance in the application of image denoising significantly
Recommended from our members
Uses of Complex Wavelets in Deep Convolutional Neural Networks
Image understanding has long been a goal for computer vision. It has proved to be an exceptionally difficult task due to the large amounts of variability that are inherent to objects in a scene. Recent advances in supervised learning methods, particularly convolutional neural networks (CNNs), have pushed forth the frontier of what we have been able to train
computers to do.
Despite their successes, the mechanics of how these networks are able to recognize objects are little understood, and the networks themselves are often very difficult and time-consuming to train. It is very important that we improve our current approaches in every way possible.
A CNN is built from connecting many learned convolutional layers in series. These convolutional layers are fairly crude in terms of signal processing - they are arbitrary taps of a finite impulse response filter, learned through stochastic gradient descent from random initial conditions. We believe that if we reformulate the problem, we may achieve many insights and benefits in training CNNs. Noting that modern CNNs are mostly viewed from and analyzed in the spatial domain, this thesis aims to view the convolutional layers in the frequency domain (viewing things in the frequency domain has proved useful in the past for denoising, filter design, compression and many other tasks). In particular, we use complex wavelets (rather than the Fourier transform or the discrete wavelet transform) as basis functions to reformulate image understanding with deep networks.
In this thesis, we explore the most popular and well-developed form of using complex wavelets in deep learning, the ScatterNet from Stephane Mallat. We explore its current limitations by building a DeScatterNet and found that while it has many nice properties, it may not be sensitive to the most appropriate shapes for understanding natural images.
We then develop a locally invariant convolutional layer, a combination of a complex wavelet transform, a modulus operation, and a learned mixing. To do this, we derive backpropagation equations and allow gradients to flow back through the (previously fixed) ScatterNet front end. Connecting several such locally invariant layers allows us to build learnable ScatterNet, a more flexible and general form of the ScatterNet (while still maintaining its desired properties).
We show that the learnable ScatterNet can provide significant improvements over the regular ScatterNet when being used as a front end for a learning system. Additionally, we show that the locally invariant convolutional layer can directly replace convolutional layers in a deep CNN (and not just at the front-end). The locally invariant convolutional layers naturally downsample the input (because of the complex modulus) while increasing the channel dimension (because of the multiple wavelet orientations used). This is an operation that often happens in a CNN by a combination of a pooling and convolutional layer. It was at these locations in a CNN where the learnable ScatterNet performed best, implying it may
be useful as learnable pooling layer.
Finally, we develop a system to learn complex weights that act directly on the wavelet coefficients of signals, in place of a convolutional layer. We call this layer the wavelet gain layer and show it can be used alongside convolutional layers. The network designer may then choose to learn in the pixel or wavelet domains. This layer shows a lot of promise and affords more control over what regions of the frequency space we want our layer to learn from. Our experiments show that it can improve on learning in the pixel domain for early layers of a CNN
- …