On the theoretical lower bound of the multiplicative complexity for DCT.
Yuk-Hee ChanWan-Chi SiuPublished in: ISCAS (1993)
Keyphrases
- lower bound
- worst case
- upper bound
- complexity analysis
- objective function
- branch and bound algorithm
- average case complexity
- discrete cosine transform
- image compression
- theoretical analysis
- decision problems
- computational complexity
- optimal solution
- np hard
- lower and upper bounds
- neural network
- average case
- dct coefficients
- multiscale