Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 114 for “"Low-rank approximation"”.
-
Matrix Low Rank Approximation at Sublinear Cost
… modern machines. Typically, such matrices admit Low Rank Approximation (LRA) that can be stored and processed at sublinear cost. Can we compute LRA at sublinear cost? Our counter example presented in Appendix C shows that no sublinear cost algorithm can compute accurate LRA for arbitrary input. …
-
Dynamic speech imaging with low-rank approximation
… However, conventional MRI suffers from low spatiotemporal resolution, which limits its applica-tion in dynamic speech imaging. This thesis presents a novel model-based dynamic MR imaging method to capture speech dynamics in high spatiotemporal resolution. Specifically, high …
-
Scalable Data Mining via Constrained Low Rank Approximation
Matrix and tensor approximation methods are recognised as foundational tools for modern data analytics. Their strength lies in their long history of rigorous and principled theoretical foundations, judicious formulations via various constraints, along with the availability of fast computer …
-
Speeding up nonnegative low-rank approximation: Parallelism and Randomization
… efficient, randomized algorithms for NMF which allow us to down sample data in a principled way. These randomized methods achieve up to 7× speed up over nonrandomized methods and preserve solution quality in terms of relative error and downstream graph clustering tasks. We scale out by designing …
-
Robust algorithms on low-rank approximation and their applications
Low-rank approximation models have been widely developed in computer vision, image analysis, signal processing, web data analysis, bioinformatics, etc. Generally, we assume that the intrinsic data lies in a low-dimensional subspace, and we need to extract the low-rank representation given …
-
RANDOMIZED ALGORITHMS FOR LEAST SQUARES AND LOW RANK APPROXIMATION PROBLEMS
… in scientific computing - least squares (LS) and low rank approximation (LR) problems. By studying the properties of a random sketching matrix, we derive theorems composed of sufficient conditions for a general random matrix to produce a sketch that solves the two problems within the …
-
Weighted Low-Rank Approximation of Matrices:Some Analytical and Numerical Aspects
… and numerical aspects of a problem of weighted low-rank approximation of matrices. We propose and solve two different versions of weighted low-rank approximation problems. We demonstrate, in addition, how these formulations can be efficiently used to solve some classic problems in computer …
-
Applications of low-rank approximation: complex networks and inverse problems
The use of low-rank approximation is crucial when one is interested in solving problems of large dimension. In this case, the matrix with reduced rank can be obtained starting from the singular value decomposition considering only the largest components. This thesis describes how the use of the …
-
Seismic modeling and imaging in complex media using low-rank approximation
… methods, which in turn involve finite-difference approximation of spatial or temporal derivatives. These approximations may lead to dispersion artifacts as well as numerical instability, therefore imposing a strict limit on the sampling intervals in space or time. This dissertation aims at …
-
Diagonal plus low rank approximation of matrices for solving modal frequency response problems
… response problem substantially. Even if the rank of the contribution to the finite element structural damping matrix from the second material is very low, the matrix becomes fully populated when transformed to the modal representation. As a result, the complex-valued modal matrix that …
-
Outlier detection and subspace learning via structured low rank approximation with applications to omic data
… with data with very high dimensionality and low number of samples. This is the case with genomic data where sequencing many genes is much easier than gathering many different samples. The main problem with high-dimensional data is that statistical inference and traditional pattern recognition …
-
Algorithms for Data Fusion, Representation Learning, and Scalable Clustering based on Constrained Low-Rank Approximation
… modern data analysis through novel Constrained Low-Rank Approximation (CLRA) algorithms. Contemporary datasets often exhibit complex characteristics: multi-type heterogeneity with interconnected entities, information from diverse sources, inherent sparsity, and massive scale. Traditional methods …
-
An orientation-aware grid-based method to remedy hazards of low-rank approximation methods for electromagnetics
… method of moments is commonly accelerated by the low-rank approximation (LRA) of impedance matrix subblocks, either through direct compression or indirectly via sampling grids. While LRA methods can reduce computation times and memory requirements, they suffer from high compression errors when …
-
Exploring sparsity, self-similarity, and low rank approximation in action recognition, motion retrieval, and action spotting
… systems, and show that by using a new optimized rank-1 tensor approximation of Joint SSV one can obtain compact low-dimensional descriptors that very accurately preserve the dynamics of the original system, e.g. an action video sequence; (ii) The descriptor vectors derived from the optimized …
-
Large scale urban patterns in NYC: traffic prediction and analysis via clustering and low rank approximation
… prediction and analysis via clustering and low rank approximation. Our work consists of several dependent, large-scale optimization problems in order to estimate the number of taxi passengers who travel from a certain origin node to a certain destination node at any given time of day. A …
-
Robust Estimation of Motion Parameters and Scene Geometry : Minimal Solvers and Convexification of Regularisers for Low-Rank Approximation
… this thesis, we develop a bilinear framework for low-rank regularisation, with global optimality guarantees under certain conditions. We also show equivalence between the linear and the bilinear framework, in the sense that the objectives are equal. This enables users of alternating direction …
-
Real-Time Detection of GPS Spoofing Attack with Hankel Matrix and Unwrapped Phase Angle Data
… two attacks. Previous researchers exploited low-rank approximation of Hankel Matrix to differentiate between FDIA and physical events. We have demonstrated that, together with angle unwrapping algorithm, low-rank approximation of Hankel Matrix can help us separating GPS-spoofing attack with …
-
Analytical and Numerical Study of Lindblad Equations
… more explicit scaling for parameters when the approximations are made. Moreover, we derive a classical master equation based on the Lindbladian formalism.</p><p>In Chp. 3, we consider numerical aspects of Lindblad equations. Motivated by the dynamical low-rank approximation method for matrix …
-
Scalable and distributed constrained low rank approximations
Low rank approximation is the problem of finding two low rank factors W and H such that the rank(WH) << rank(A) and A ≈ WH. These low rank factors W and H can be constrained for meaningful physical interpretation and referred as Constrained Low Rank Approximation (CLRA). Like most of the …
-
Singular value decay for solutions of Sylvester equations
… is that if $C$ has low rank, then $A$ and $B$ satisfying certain conditions imply $X$ has a low rank approximation. Another set of conditions was given by Beckermann and Townsend in 2019, \cite{beckermann2019bounds}, where they impose the conditions that $A$ and $B$ …
Page 1 of 6