Spectral Frame Analysis and Learning through Graph Structure
| dc.contributor.advisor | Okoudjou, Kasso A | en_US |
| dc.contributor.advisor | Czaja, Wojciech K | en_US |
| dc.contributor.author | Clark, Chae Almon | en_US |
| dc.contributor.department | Applied Mathematics and Scientific Computation | en_US |
| dc.contributor.publisher | Digital Repository at the University of Maryland | en_US |
| dc.contributor.publisher | University of Maryland (College Park, Md.) | en_US |
| dc.date.accessioned | 2016-06-22T06:08:16Z | |
| dc.date.available | 2016-06-22T06:08:16Z | |
| dc.date.issued | 2016 | en_US |
| dc.description.abstract | This dissertation investigates the connection between spectral analysis and frame theory. When considering the spectral properties of a frame, we present a few novel results relating to the spectral decomposition. We first show that scalable frames have the property that the inner product of the scaling coefficients and the eigenvectors must equal the inverse eigenvalues. From this, we prove a similar result when an approximate scaling is obtained. We then focus on the optimization problems inherent to the scalable frames by first showing that there is an equivalence between scaling a frame and optimization problems with a non-restrictive objective function. Various objective functions are considered, and an analysis of the solution type is presented. For linear objectives, we can encourage sparse scalings, and with barrier objective functions, we force dense solutions. We further consider frames in high dimensions, and derive various solution techniques. From here, we restrict ourselves to various frame classes, to add more specificity to the results. Using frames generated from distributions allows for the placement of probabilistic bounds on scalability. For discrete distributions (Bernoulli and Rademacher), we bound the probability of encountering an ONB, and for continuous symmetric distributions (Uniform and Gaussian), we show that symmetry is retained in the transformed domain. We also prove several hyperplane-separation results. With the theory developed, we discuss graph applications of the scalability framework. We make a connection with graph conditioning, and show the in-feasibility of the problem in the general case. After a modification, we show that any complete graph can be conditioned. We then present a modification of standard PCA (robust PCA) developed by Cand\`es, and give some background into Electron Energy-Loss Spectroscopy (EELS). We design a novel scheme for the processing of EELS through robust PCA and least-squares regression, and test this scheme on biological samples. Finally, we take the idea of robust PCA and apply the technique of kernel PCA to perform robust manifold learning. We derive the problem and present an algorithm for its solution. There is also discussion of the differences with RPCA that make theoretical guarantees difficult. | en_US |
| dc.identifier | https://doi.org/10.13016/M2R47H | |
| dc.identifier.uri | http://hdl.handle.net/1903/18340 | |
| dc.language.iso | en | en_US |
| dc.subject.pqcontrolled | Applied mathematics | en_US |
| dc.subject.pquncontrolled | EELS | en_US |
| dc.subject.pquncontrolled | Finite Frames | en_US |
| dc.subject.pquncontrolled | Graphs | en_US |
| dc.subject.pquncontrolled | Machine Learning | en_US |
| dc.subject.pquncontrolled | Optimization | en_US |
| dc.subject.pquncontrolled | Spectral Analysis | en_US |
| dc.title | Spectral Frame Analysis and Learning through Graph Structure | en_US |
| dc.type | Dissertation | en_US |
Files
Original bundle
1 - 1 of 1