基于 I-散度近似的离散时间正信号同步去自卷积算法
Synchronous deautoconvolution algorithm for discrete-time positive signals via I-divergence approximation
AI总结:
研究用非负信号的标量自卷积最优逼近给定非负信号的问题,采用 $\mathcal{I}$-散度为准则,推导出基于提升空间与松弛技术的交替最小化迭代下降算法,并证明其极限点为 Kuhn-Tucker 点。
摘要:
我们提出以下问题:用非负信号 $x_t$ 的标量自卷积 $(x*x)_t$ 来最优逼近给定的非负信号 $y_t$,其中 $x_t$ 和 $y_t$ 是等长信号。采用 $\mathcal{I}$-散度作为最优性准则,因为它非常适合纳入非负性约束。为了寻找最小化子,我们推导了一种交替最小化类型的迭代下降算法。该算法基于将原问题提升到更大空间,这是 Csiszár 和 Tusnády 在 [Statistics \\& Decisions (S1) (1984), 205--237] 中开发的一种松弛技术,在当前背景下,它需要求解一个困难的偏最小化问题。我们利用偏最小化问题的最优性性质研究了算法的渐近行为,并证明(除其他结果外)其极限点是原最小化问题的 Kuhn-Tucker 点。数值实验说明了这些结果。
英文摘要:
We pose the problem of the optimal approximation of a given nonnegative signal $y_t$ with the scalar autoconvolution $(x*x)_t$ of a nonnegative signal $x_t$, where $x_t$ and $y_t$ are signals of equal length. The $\mathcal{I}$-divergence has been adopted as optimality criterion, being well suited to incorporate nonnegativity constraints. To find a minimizer we derive an iterative descent algorithm of the alternating minimization type. The algorithm is based on the lifting of the original problem to a larger space, a relaxation technique developed by Csiszár and Tusnády in [Statistics \& Decisions (S1) (1984), 205--237] which, in the present context, requires the solution of a hard partial minimization problem. We study the asymptotic behavior of the algorithm exploiting the optimality properties of the partial minimization problems and prove, among other results, that its limit points are Kuhn-Tucker points of the original minimization problem. Numerical experiments illustrate the results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。