Talk:Curvelet

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

It is requested that one or more mathematical diagrams be included in this article to improve its quality. Specific illustrations, plots, or diagrams can be requested at the Graphics Lab.
For more information, refer to discussion on this page and/or the listing at Wikipedia:Requested images.

Computational cost

Latest comment: 16 years ago3 comments3 people in discussion

The computational cost of a curvlet transform is approximately 10-20 times that of an FFT, and has the same $O(n^{2}log(n))$ dependence on the size of the image.

Isn't the cost of an FFT $O(nlog(n))$ ? 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

This page was redesigned at the edge.

Computational cost