Talk:Curvelet

Latest comment: 14 years ago by Holmansf in topic Computational cost

Computational cost

edit

The computational cost of a curvlet transform is approximately 10-20 times that of an FFT, and has the same   dependence on the size of the image.

Isn't the cost of an FFT  ? c.f. Fft --128.8.120.139 (talk) 20:26, 23 March 2010 (UTC) IBBReply

That's right. I just added the "dubious" tag to that. —Ben FrantzDale (talk) 23:04, 23 March 2010 (UTC)Reply
The problem is the definition of n. In Fast Fourier transform N is the product of the dimensions of the array to be processed, while in the estimate on this page it is an nxn array that is being processed. Thus they are the same at least in this 2d case. Holmansf (talk) 13:48, 10 May 2010 (UTC)Reply