通过Karcher平均方法平均复杂子空间
Averaging Complex Subspaces via a Karcher Mean Approach
摘要:
我们提出了一个共轭梯度型优化技术的计算的Karcher平均值的一组复杂的线性子空间的固定尺寸,由所谓的格拉斯曼建模。识别的格拉斯曼厄米投影矩阵允许一个访问的介绍所需的几何概念的内在共轭梯度法。特别是,适当的定义测地线,平行运输,和黎曼梯度的Karcher平均函数。我们提供了一个有效的步长选择的特殊情况下,一维复杂的子空间,并说明如何可以采用该方法通过数值实验进行盲识别。
英文摘要:
We propose a conjugate gradient type optimization technique for the computation of the Karcher mean on the set of complex linear subspaces of fixed dimension, modeled by the so-called Grassmannian. The identification of the Grassmannian with Hermitian projection matrices allows an accessible introduction of the geometric concepts required for an intrinsic conjugate gradient method. In particular, proper definitions of geodesics, parallel transport, and the Riemannian gradient of the Karcher mean function are presented. We provide an efficient step-size selection for the special case of one dimensional complex subspaces and illustrate how the method can be employed for blind identification via numerical experiments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。