arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1707.02018math.OC
收藏

小波和卷积算子的有效伴随计算

Efficient Adjoint Computation for Wavelet and Convolution Operators

James Folberth, Stephen Becker

摘要:

一阶优化算法,通常是大问题的首选,需要目标函数中可微项的梯度。这些梯度通常涉及线性算子及其伴随,必须迅速应用。我们考虑两个例子的问题,并得出快速评估所需的伴随算子的方法。第一个例子是一个图像去模糊问题,我们必须有效地计算伴随的多级小波重构。我们制定的伴随工程的各种边界条件,这使得制定推广到更大的一类问题。第二个例子是从优化文献中得到的盲信道估计问题,其中我们必须计算两个信号的卷积的伴随。在每个例子中,我们展示了如何在利用现有软件的同时有效地应用伴随算子。

英文摘要:

First-order optimization algorithms, often preferred for large problems, require the gradient of the differentiable terms in the objective function. These gradients often involve linear operators and their adjoints, which must be applied rapidly. We consider two example problems and derive methods for quickly evaluating the required adjoint operator. The first example is an image deblurring problem, where we must compute efficiently the adjoint of multi-stage wavelet reconstruction. Our formulation of the adjoint works for a variety of boundary conditions, which allows the formulation to generalize to a larger class of problems. The second example is a blind channel estimation problem taken from the optimization literature where we must compute the adjoint of the convolution of two signals. In each example, we show how the adjoint operator can be applied efficiently while leveraging existing software.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑