137 research outputs found
Filters and Matrix Factorization
We give a number of explicit matrix-algorithms for analysis/synthesis
in multi-phase filtering; i.e., the operation on discrete-time signals which
allow a separation into frequency-band components, one for each of the
ranges of bands, say N , starting with low-pass, and then corresponding
filtering in the other band-ranges. If there are N bands, the individual
filters will be combined into a single matrix action; so a representation of
the combined operation on all N bands by an N x N matrix, where the
corresponding matrix-entries are periodic functions; or their extensions to
functions of a complex variable. Hence our setting entails a fixed N x N
matrix over a prescribed algebra of functions of a complex variable. In the
case of polynomial filters, the factorizations will always be finite. A novelty
here is that we allow for a wide family of non-polynomial filter-banks.
Working modulo N in the time domain, our approach also allows for
a natural matrix-representation of both down-sampling and up-sampling.
The implementation encompasses the combined operation on input, filtering,
down-sampling, transmission, up-sampling, an action by dual filters,
and synthesis, merges into a single matrix operation. Hence our matrixfactorizations
break down the global filtering-process into elementary steps.
To accomplish this, we offer a number of adapted matrix factorizationalgorithms,
such that each factor in our product representation implements
in a succession of steps the filtering across pairs of frequency-bands; and so
it is of practical significance in implementing signal processing, including
filtering of digitized images. Our matrix-factorizations are especially useful
in the case of the processing a fixed, but large, number of bands
The Construction of Nonseparable Wavelet Bi-Frames and Associated Approximation Schemes
Wavelet analysis and its fast algorithms are widely used in many fields of applied mathematics such as in signal and image processing. In the present thesis, we circumvent the restrictions of orthogonal and biorthogonal wavelet bases by constructing wavelet frames. They still allow for a stable decomposition, and so-called wavelet bi-frames provide a series expansion very similar to those of pairs of biorthogonal wavelet bases. Contrary to biorthogonal bases, primal and dual wavelets are no longer supposed to satisfy any geometrical conditions, and the frame setting allows for redundancy. This provides more flexibility in their construction. Finally, we construct families of optimal wavelet bi-frames in arbitrary dimensions with arbitrarily high smoothness. Then we verify that the n-term approximation can be described by Besov spaces and we apply the theoretical findings to image denoising
Highly Symmetric Multiple Bi-Frames for Curve and Surface Multiresolution Processing
Wavelets and wavelet frames are important and useful mathematical tools in numerous applications, such as signal and image processing, and numerical analysis. Recently, the theory of wavelet frames plays an essential role in signal processing, image processing, sampling theory, and harmonic analysis. However, multiwavelets and multiple frames are more flexible and have more freedom in their construction which can provide more desired properties than the scalar case, such as short compact support, orthogonality, high approximation order, and symmetry. These properties are useful in several applications, such as curve and surface noise-removing as studied in this dissertation. Thus, the study of multiwavelets and multiple frames construction has more advantages for many applications.
Recently, the construction of highly symmetric bi-frames for curve and surface multiresolution processing has been investigated. The 6-fold symmetric bi-frames, which lead to highly symmetric analysis and synthesis bi-frame algorithms, have been introduced. Moreover, these multiple bi-frame algorithms play an important role on curve and surface multiresolution processing. This dissertation is an extension of the study of construction of univariate biorthogonal wavelet frames (bi-frames for short) or dual wavelet frames with each framelet being symmetric in the scalar case. We will expand the study of biorthogonal wavelets and bi-frames construction from the scalar case to the vector case to construct biorthogonal multiwavelets and multiple bi-frames in one-dimension. In addition, we will extend the study of highly symmetric bi-frames for triangle surface multiresolution processing from the scalar case to the vector case.
More precisely, the objective of this research is to construct highly symmetric biorthogonal multiwavelets and multiple bi-frames in one and two dimensions for curve and surface multiresolution processing. It runs in parallel with the scalar case. We mainly present the methods of constructing biorthogonal multiwavelets and multiple bi-frames in both dimensions by using the idea of lifting scheme. On the whole, we discuss several topics include a brief introduction and discussion of multiwavelets theory, multiresolution analysis, scalar wavelet frames, multiple frames, and the lifting scheme. Then, we present and discuss some results of one-dimensional biorthogonal multiwavelets and multiple bi-frames for curve multiresolution processing with uniform symmetry: type I and type II along with biorthogonality, sum rule orders, vanishing moments, and uniform symmetry for both types. In addition, we present and discuss some results of two-dimensional biorthogonal multiwavelets and multiple bi-frames and the multiresolution algorithms for surface multiresolution processing. Finally, we show experimental results on curve and surface noise-removing by applying our multiple bi-frame algorithms
Algorithms and Architectures for Secure Embedded Multimedia Systems
Embedded multimedia systems provide real-time video support for applications in entertainment (mobile phones, internet video websites), defense (video-surveillance and tracking) and public-domain (tele-medicine, remote and distant learning, traffic monitoring and management). With the widespread deployment of such real-time embedded systems, there has been an increasing concern over the security and authentication of concerned multimedia data.
While several (software) algorithms and hardware architectures have been proposed in the research literature to support multimedia security, these fail to address embedded applications whose performance specifications have tighter constraints on computational power and available hardware resources.
The goals of this dissertation research are two fold:
1. To develop novel algorithms for joint video compression and encryption. The proposed algorithms reduce the computational requirements of multimedia encryption algorithms. We propose an approach that uses the compression parameters instead of compressed bitstream for video encryption.
2. Hardware acceleration of proposed algorithms over reconfigurable computing platforms such as FPGA and
over VLSI circuits. We use signal processing knowledge to make the algorithms suitable for hardware optimizations and try to reduce the critical path of circuits using hardware-specific optimizations.
The proposed algorithms ensures a considerable level of security for low-power embedded systems such as portable video players and surveillance cameras. These schemes have zero or little compression losses and preserve the desired properties of compressed bitstream in encrypted bitstream to ensure secure
and scalable transmission of videos over heterogeneous networks.
They also support indexing, search and retrieval in secure multimedia digital libraries. This property is crucial not only for police and armed forces to retrieve information about a suspect from a large video database of surveillance feeds, but extremely helpful for data centers (such as those used by youtube, aol and metacafe) in reducing the computation cost in search and retrieval of desired videos
Recommended from our members
Learning Theory and Approximation
The main goal of this workshop – the third one of this type at the MFO – has been to blend mathematical results from statistical learning theory and approximation theory to strengthen both disciplines and use synergistic effects to work on current research questions. Learning theory aims at modeling unknown function relations and data structures from samples in an automatic manner. Approximation theory is naturally used for the advancement and closely connected to the further development of learning theory, in particular for the exploration of new useful algorithms, and for the theoretical understanding of existing methods. Conversely, the study of learning theory also gives rise to interesting theoretical problems for approximation theory such as the approximation and sparse representation of functions or the construction of rich kernel reproducing Hilbert spaces on general metric spaces. This workshop has concentrated on the following recent topics: Pitchfork bifurcation of dynamical systems arising from mathematical foundations of cell development; regularized kernel based learning in the Big Data situation; deep learning; convergence rates of learning and online learning algorithms; numerical refinement algorithms to learning; statistical robustness of regularized kernel based learning
- …