Self-Calibration and Bilinear Inverse Problems via Linear Least Squares
From MaRDI portal
Publication:4686916
DOI10.1137/16M1103634zbMath1398.15012arXiv1611.04196OpenAlexW2619514009MaRDI QIDQ4686916
Publication date: 10 October 2018
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.04196
image processingsignal processingblind deconvolutionself-calibrationlinear least squaresbilinear inverse problems
Image analysis in multivariate analysis (62H35) Convex programming (90C25) Computing methodologies for image processing (68U10) Inverse problems in linear algebra (15A29) Iterative numerical methods for linear systems (65F10)
Related Items
Reconstruction Methods in THz Single-Pixel Imaging, Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent, Hyperbolic Wavelet Frames and Multiresolution in the Weighted Bergman Spaces, Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness, A scalable estimator of sets of integral operators
Uses Software
Cites Work
- Unnamed Item
- A mathematical introduction to compressive sensing
- Von Neumann entropy penalization and low-rank matrix estimation
- User-friendly tail bounds for sums of random matrices
- The perturbation of consistent least squares problems
- Weak convergence and empirical processes. With applications to statistics
- Eigenstructure methods for direction finding with sensor gain and phase uncertainties
- Orientation Determination of Cryo-EM Images Using Least Unsquared Deviations
- Identifiability in Blind Deconvolution With Subspace or Sparsity Constraints
- Blind Deconvolution Using Convex Programming
- Blind Recovery of Sparse Signals From Subsampled Convolution
- Blind Calibration of Networks of Sensors: Theory and Algorithms
- Lifting for Blind Deconvolution in Random Mask Imaging: Identifiability and Convex Relaxation
- Self-calibration and biconvex compressive sensing
- Convex Optimization Approaches for Blind Sensor Calibration Using Sparsity
- Optimal Sample Complexity for Blind Gain and Phase Calibration
- Spectral efficiency of CDMA with random spreading
- Blind channel identification based on second-order statistics: a frequency-domain approach
- Capacity Pre-Log of Noncoherent SIMO Channels Via Hironaka's Theorem
- Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems
- Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
- Leveraging Diversity and Sparsity in Blind Deconvolution
- Perturbation bounds in connection with singular value decomposition
- Phase Retrieval via Matrix Completion
- Blind Image Deconvolution