dc.contributor.advisor Priebe, Carey E. en_US dc.creator Zheng, Fang en_US dc.date.accessioned 2014-12-23T04:37:29Z dc.date.available 2014-12-23T04:37:29Z dc.date.created 2014-05 en_US dc.date.issued 2014-02-28 en_US dc.date.submitted May 2014 en_US dc.identifier.uri http://jhir.library.jhu.edu/handle/1774.2/36986 dc.description.abstract Wavelets have been a powerful tool in data representation and had a growing impact on various signal processing applications. As multi-dimensional (multi-D) wavelets are needed in multi-D data representation, the construction methods of multi-D wavelets are of great interest. Tensor product has been the most prevailing method in multi-D wavelet construction, however, there are many limitations of tensor product that make it insufficient in some cases. In this dissertation, we provide three non-tensor-based methods to construct multi-D wavelets. The first method is an alternative to tensor product, called coset sum, to construct multi-D wavelets from a pair of \$1\$-D biorthogonal refinement masks. Coset sum shares many important features of tensor product. It is associated with fast algorithms, which in certain cases, are faster than the tensor product fast algorithms. Moreover, it shows great potentials in image processing applications. The second method is a generalization of coset sum to non-dyadic dilation cases. In particular, we deal with the situations when the dilation matrix is \$\dil=p{\tt I}_\dm\$, where \$p\$ is a prime number and \${\tt I}_\dm\$ is the \$\dm\$-D identity matrix, thus we call it the prime coset sum method. Prime coset sum inherits many advantages from coset sum including that it is also associated with fast algorithms. The third method is a relatively more general recipe to construct multi-D wavelets. Different from the first two methods, we attempt to solve the wavelet construction problem as a matrix equation problem. By employing the Quillen-Suslin Theorem in Algebraic Geometry, we are able to build \$\dm\$-D wavelets from a single \$\dm\$-D refinement mask. This method is more general in the sense that it works for any dilation matrix and does not assume additional constraints on the refinement masks. This dissertation also includes one appendix on the topic of constructing directional wavelet filter banks. en_US dc.format.mimetype application/pdf en_US dc.language en dc.publisher Johns Hopkins University dc.subject Wavelets en_US dc.subject Multi-dimension en_US dc.title Algebraic Approaches for Constructing Multi-D Wavelets en_US dc.type Thesis en_US thesis.degree.discipline Applied Mathematics & Statistics en_US thesis.degree.grantor Johns Hopkins University en_US thesis.degree.grantor Whiting School of Engineering en_US thesis.degree.level Doctoral en_US thesis.degree.name Ph.D. en_US dc.type.material text en_US thesis.degree.department Applied Mathematics and Statistics en_US dc.contributor.committeeMember Hur, Youngmi en_US dc.contributor.committeeMember Tran, Trac Duy en_US dc.contributor.committeeMember Chin, Sang P. en_US
﻿