Conference paper
Motion video analysis using planar parallax
Harpreet S. Sawhney
IS&T/SPIE Electronic Imaging 1994
Paper
The multiplicative complexity of discrete cosine transforms
Abstract
We obtain the multiplicative complexity of discrete cosine transforms in all cases. It is given as a function of the multiplicative complexity of discrete Fourier transforms. The latter have all been determined previously. © 1992.
Related
Nimrod Megiddo
Journal of Symbolic Computation
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Guillaume Buthmann, Tomoya Sakai, et al.
ICASSP 2025