Randomized Subspace Actions and Fusion Frames
Randomized Subspace Actions and Fusion Frames
复制标题
随机子空间动作和融合框架
DOI:
10.1007/s00365-015-9303-5
复制
发表时间:
2015
影响因子:
2.7
通讯作者:
A. Powell
中科院分区:
文献类型:
--
作者:
Xuemei Chen;A. Powell
A randomized subspace action algorithm is investigated for fusion frame signal recovery problems and for the problem of recovering a signal from projections onto random subspaces. It is noted that Kaczmarz bounds provide upper bounds on the algorithm’s error moments. The main question of which probability distributions on a random subspace lead to provably fast convergence is addressed. In particular, it is proved which distributions give minimal Kaczmarz bounds, and hence give best control on error moment upper bounds arising from Kaczmarz bounds. Uniqueness of the optimal distributions is also addressed.