Simultaneous Blind Demixing and Super-resolution via Vectorized Hankel Lift
CoRR(2024)
Abstract
In this work, we investigate the problem of simultaneous blind demixing and
super-resolution. Leveraging the subspace assumption regarding unknown point
spread functions, this problem can be reformulated as a low-rank matrix
demixing problem. We propose a convex recovery approach that utilizes the
low-rank structure of each vectorized Hankel matrix associated with the target
matrix. Our analysis reveals that for achieving exact recovery, the number of
samples needs to satisfy the condition n≳ Ksr log (sn). Empirical
evaluations demonstrate the recovery capabilities and the computational
efficiency of the convex method.
MoreTranslated text
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined