Efficient Adjoint Computation for Wavelet and Convolution Operators

DOI10.1109/MSP.2016.2594277arXiv1707.02018MaRDI QIDQ6288729FDOQ6288729

Publication date: 6 July 2017

Abstract: 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.

This page was built for publication: Efficient Adjoint Computation for Wavelet and Convolution Operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6288729)