A Kaczmarz Method for Low Rank Matrix Recovery
نویسندگان
چکیده
The Kaczmarz method [1], [2], [3] was initially proposed as a row-based technique for reconstructing signals by finding the solutions to overdetermined linear systems. Its usefulness has seen wide application in irregular sampling and tomography [4], [5], [6]. In recent years, several modifications to the Kaczmarz update iterations have improved the recovery capabilities [7], [8], [9], [10], [11]. In particular, signal sparsity was exploited in [12], [13] and low-rankness in [14] to improve the rate of convergence in the overdetermined case while also enabling recovery from underdetermined linear systems. Consider the linear system of equations b = A(X), where X ∈ Rm×n is a rank r matrix of size m × n with r min{m,n}, A : Rm×n → p is a linear operator that samples p measurements from X, and b ∈ R is a measurement vector. The linear system above can be written in vector form as b = Ax, where x ∈ R is a vectorization of X, and A = [a1a2 . . .ap] : R → R is the corresponding measurement matrix with rows ai for i ∈ {1 . . . p}. Given an estimate xt of the signal x at iteration t, the Kaczmarz method proceeds by projecting xt orthogonally onto the solution space defined by row i of A, i.e.,
منابع مشابه
Linear convergence of the Randomized Sparse Kaczmarz Method
The randomized version of the Kaczmarz method for the solution of linear systems is known to converge linearly in expectation. In this work we extend this result and show that the recently proposed Randomized Sparse Kaczmarz method for recovery of sparse solutions, as well as many variants, also converges linearly in expectation. The result is achieved in the framework of split feasibility prob...
متن کاملRandomized Block Kaczmarz Method with Projection for Solving Least Squares
The Kaczmarz method is an iterative method for solving overcomplete linear systems of equations Ax = b. The randomized version of the Kaczmarz method put forth by Strohmer and Vershynin iteratively projects onto a randomly chosen solution space given by a single row of the matrix A and converges exponentially in expectation to the solution of a consistent system. In this paper we analyze two bl...
متن کاملA Sparsity-Constrained Preconditioned Kaczmarz Reconstruction Method for Fluorescence Molecular Tomography
Fluorescence molecular tomography (FMT) is an imaging technique that can localize and quantify fluorescent markers to resolve biological processes at molecular and cellular levels. Owing to a limited number of measurements and a large number of unknowns as well as the diffusive transport of photons in biological tissues, the inverse problem in FMT is usually highly ill-posed. In this work, a sp...
متن کاملGuarantees of Riemannian Optimization for Low Rank Matrix Recovery
We establish theoretical recovery guarantees of a family of Riemannian optimization algorithms for low rank matrix recovery, which is about recovering an m × n rank r matrix from p < mn number of linear measurements. The algorithms are first interpreted as the iterative hard thresholding algorithms with subspace projections. Then based on this connection, we prove that if the restricted isometr...
متن کاملThe detection of 11th of March 2011 Tohoku's TEC seismo-ionospheric anomalies using the Singular Value Thresholding (SVT) method
The Total Electron Content (TEC) measured by the Global Positioning System (GPS) is useful for registering the pre-earthquake ionospheric anomalies appearing before a large earthquake. In this paper the TEC value was predicted using the singular value thresholding (SVT) method. Also, the anomaly is detected utilizing this predicted value and the definition of the threshold value, leading to the...
متن کامل