Fast computation of convolution operations via low-rank approximation

DOI10.1016/J.APNUM.2013.06.002MaRDI QIDQ2448383zbMATH OpenOpenAlexFDO

Authors Tristan A. Hearn, Lothar Reichel

Publication date 30 April 2014

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apnum.2013.06.002

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Fast multidimensional convolution in low-rank tensor formats via cross approximation
• Matrix-free Krylov iteration for implicit convolution of numerically low-rank data
• Fast low rank approximations of matrices and tensors
• Publication:4721527
• Application of the fast Fourier transform to calculating pruned convolution

Cites work

• scientific article; zbMATH DE number 193053 (Why is no real title available?)
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• A comparison of the spectral and the discrete singular convolution schemes for the KdV-type equations
• A new approach to edge detection
• Almost automorphy of the convolution operator and applications to differential and functional differential equations
• An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
• Blind MIMO channel identification from second order statistics using rank deficient channel convolution matrix
• Deblurring Images
• Kronecker product and SVD approximations in image restoration
• New algorithms for digital convolution
• Restarted block Lanczos bidiagonalization methods
• The application of the fast Fourier transform algorithm to the estimation of spectra and cross-spectra
• The use of generalized functions and distributions in general relativity

Cited in

(8)

• Derivation and analysis of fast bilinear algorithms for convolution
• Accurate pairwise convolutions of non-negative vectors via FFT
• An efficient method for performing discrete convolution using Kronecker products
• On-line computation of convolutions
• Computing rank-convolutions with a mask
• Matrix-free Krylov iteration for implicit convolution of numerically low-rank data
• Scalable Matrix-Free Adaptive Product-Convolution Approximation for Locally Translation-Invariant Operators
• Fast multidimensional convolution in low-rank tensor formats via cross approximation

Describes a project that uses

Uses Software

• na26

This page was built for publication: Fast computation of convolution operations via low-rank approximation

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