A fast computational method for minimum square error transform

DOI10.1016/0167-8655(88)90091-8MaRDI QIDQ3806685zbMATH OpenOpenAlexFDO

Authors

Publication date 1988

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8655(88)90091-8

zbMATH Keywords

algorithmleast square error transformpoint pattern matching

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Pattern recognition, speech recognition (68T10)

Recommendations

• A New Error Estimate of the Fast Gauss Transform
• On a fast and accurate method for computing Fourier transforms
• scientific article; zbMATH DE number 4106249
• A fast computational algorithm for the Legendre-Fenchel transform
• A novel approach to fast discrete Fourier transform
• Computation of the Fast Walsh-Fourier Transform
• Optimized Least-Square Nonuniform Fast Fourier Transform
• scientific article; zbMATH DE number 3942981
• Fast algorithms for computing the discrete cosine transform
• On a fast algorithm for computing the Fourier transform

This page was built for publication: A fast computational method for minimum square error transform

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