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 21 for “"rank minimization"”.
-
Enabling large-scale seismic data acquisition, processing and waveform-inversion via rank-minimization
… For interpolation and source separation using rank-minimization, I propose three main ingredients, namely a rank-revealing transform domain, a subsampling scheme that increases the rank in the transform domain, and a practical large-scale data-consistent rank-minimization framework, which …
-
LARGE SCALE HIGH-FREQUENCY SEISMIC WAVEFIELD RECONSTRUCTION, ACQUISITION VIA RANK MINIMIZATION AND SPARSITY-PROMOTING SOURCE ESTIMATION
… on the Compressive Sensing (CS) paradigm, low-rank matrix factorization based seismic data reconstruction methods are computationally cheaper and scalable to large datasets in comparison to sparsity-promotion based methods. The sparsity-promotion based methods are based on transformation in …
-
ANALYSIS OF LARGE SCALE URBAN TRANSPORTATION NETWORK USING URBAN TRAFFIC DATA
… and recognition of heterogeneous patterns. A low-rank minimization technique is first proposed to impute missing traffic data by considering the non-linear spatial and temporal correlations. The time-dependent traffic volume and vehicle fleet composition in a grid network are inferred with …
-
Large scale optimization methods for metric and kernel learning
… in particular, leads to the problem of matrix rank minimization over polyhedral sets, which is a problem of immense interest in numerous fields including optimization, machine learning, computer vision, and control theory. We propose a novel online learning based optimization method for the …
-
Modeling, learning, and inference of high-dimensional asynchronous event data
… information diffusions. We then develop the low-rank Hawkes process to describe the recurrent temporal interactions among different types of entities. We also build a link between the recurrent neural network and the temporal point process to learn a general representation of the influence from …
-
Robustness in Deep Learning: Single Image Denoising using Untrained Networks
… of over-parameterization, regularisation, low-rank minimization and discuss recent untrained networks approach for single image denoising, which is fundamental towards understanding why the current state-of-art methods are still not able to provide a generalized approach for stabilized image …
-
Learning structured matrices in high dimensions: Low rank estimation and structured graphical models
… this area include matrix factorization, matrix rank minimization, and graphical model estimation. These problems arise in many applications including collaborative filtering, system identification, and learning gene-regulatory networks. The focus of this thesis is on the algorithmic and …
-
Low rank representations of matrices using nuclear norm heuristics
… in many instances to the finding the lowest rank matrix among a parameterized family of matrices. In its most general setting, this problem is NP-hard. Different heuristics have been introduced for approaching the problem. Among them is the nuclear norm heuristic for rank minimization. One …
-
Dimensionality reduction for solving large scale inverse problems with PDE constraints through simultaneous source method
… the data and fills the missing entries by the rank minimization technique. The second subproblem minimizes over the model parameter and uses SS method to reduce the number of PDE solves into a more manageable size. We test our method in the context of a full-waveform inversion (FWI) problem and …
-
High-dimensional Statistical Inference: from Vector to Matrix
Statistical inference for sparse signals or low-rank matrices in high-dimensional settings is of significant interest in a range of contemporary applications. It has attracted significant recent attention in many fields including statistics, applied mathematics and electrical engineering. In this …
-
Simultaneous-source seismic data acquisition and processing with compressive sensing
… We conclude by comparing sparsity-promoting and rank-minimization recovery techniques for marine simultaneous-source separation, and demonstrate that recoveries are comparable; however, the latter approach readily scales to large-scale seismic data and is computationally faster.
-
A Riemannian perspective on matrix recovery and constrained optimization
… paradigm in which specific classes of high-rank matrices can be recovered from an underdetermined linear system of measurements. In particular, we consider matrices whose columns, seen as data points, belong to an algebraic variety, namely, a set defined by finitely many polynomial …
-
LOW RANK AND SPARSE MODELING FOR DATA ANALYSIS
… many machine learning and data mining tasks. Low-rank and sparse modeling are emerging mathematical tools dealing with uncertainties of real-world data. Leveraging on the underlying structure of data, low-rank and sparse modeling approaches have achieved impressive performance in many data …
-
Interference Alignment in Cellular Networks: Theory, Algorithms, and System Design
… for interference alignment are formulated as a rank minimization problem and insights from compressive sensing are used to develop algorithms that can efficiently solve this problem. The proposed algorithms are shown to be more effective in designing aligned beamformers for interference …
-
Essays On Referral Programs And Preference Estimation
… mechanism that builds on recent advances in rank minimization and machine learning. We evaluate the empirical performance of the low-dimension learning model using both simulation experiments and field choice-based conjoint data sets. We find that the low-dimension learning model overall …
-
Tensorial Data Low-Rank Decomposition on Multi-dimensional Image Data Processing
… processing. The characteristics of tensor low-rank decomposition in recent years demonstrate the importance of capturing the tensor structure adequately which usually yields efficacious approaches. In this dissertation, we first aim to explore the tensor singular value decomposition (t-SVD) …
-
Convex relaxation for the planted clique, biclique, and clustering problems
… given size in a graph is equivalent to finding a rank one matrix satisfying a particular set of linear constraints. These problems can be formulated as rank minimization problems and relaxed to convex programming by replacing rank with its convex envelope, the nuclear norm. Both problems are …
-
Matrix Completion Models with Fixed Basis Coefficients and Rank Regularized Problems with Hard Constraints
The problems with embedded low-rank structures arise in diverse areas such as engineering, statistics, quantum information, finance and graph theory. This thesis is devoted to dealing with the low-rank structure via techniques beyond the widely-used nuclear norm for achieving better performance. In …
-
Robust Subspace Estimation Using Low-rank Optimization. Theory And Applications In Scene Reconstruction, Video Denoising, And Activity Recognition.
… of robust linear subspace estimation using low-rank optimization and propose three formulations of it. We demonstrate how these formulations can be used to solve fundamental computer vision problems, and provide superior performance in terms of accuracy and running time. Consider a set of …
-
Efficient and guaranteed algorithms for sparse inverse problems
… unfavorable but practically significant case of rank defect or ill-conditioning. This situation arises with a limited number of measurement vectors, or with highly correlated signal components. In this case, MUSIC fails and, in practice, none of the existing methods can consistently approach the …
Page 1 of 2