# What are the advantages and disadvantages of the Ridgelet transform?

I used the continuous wavelet transform (CWT) to analyze the behavior of a 1-D smooth signal (extracting its modal property, damping and frequency components) in my research. Now someone asked:

Why the presented CWT algorithm is better than Ridgelet transform?

I thought it is better to ask in this forum about disadvantages of Ridgelets. For example:

• it is said that Wavelet can handle point discontinuities whereas Ridgelet is better to deal with line discontinuities. So, do we have any line discontinuities in a 1-D signal?
• what is computational complexity of Ridgelet in term of big $O$ i.e. (like $O(N)$), for both continuous (in scale) and discrete versions?

Because of their ability to better represent signals, Ridgelet transforms are preferred over Wavelet transforms in general. However, to be used in practice it has to be discretized. Now, the discretization of Ridglet transform is a challenging task on its own as it involves interpolation in polar coordinates which makes perfect reconstructions (inversions) difficult. For example, Minh N. Do and Martin Vetterli propose an orthonormal version of Ridgelet Transform to achieve better invertability [1].

Ridgelet transform enhances the idea of point-to-point mapping of singularities to point-to-line mappings, which is more effective in handling directions. Yet, even Ridgelets might be ineffective for certain applications such as image processing, where edges are curved rather than being straight lines. In such cases, better transforms such as Curvelets are already proposed and proven to be more powerful.

In this regard, the method of choice really depends on your application. As wiki quotes:

Continuous Wavelet Transform (CWT) is very efficient in determining the damping ratio of oscillating signals (e.g. identification of damping in dynamical systems). CWT is also very resistant to the noise in the signal.

If your problem is suitable to CWT, then you will be perfectly fine with using it. The Academia involves a lot of works in comparing and demonstrating the strengths of all of these transforms. Some of these would be [2,3,4].

Under the shade of the comments below, I now elaborate more on the theory.

First of all, singularity is simply the concept of point where the function or its derivative is not defined, the point of cusp, double point or any other simlar undefinedness, which I won't go into details here. You can check the wiki "Mathematical Singularity". A good measure of singularity strength would be Lipschitz exponent, which can well be characterized by Wavelet transforms. For more information on that take a look at [5].

But, as you ask, why are you interested in the singularities anyway? Well, because such irregularities basically play an important role in carrying the information that characterizes the signal [6].

Having explained the singularities a bit, I certainly agree that singular lines are a concern of multidimensional structures, more specifically $R^2$ ($L^2$ etc.). This is why transforms like Ridgelets and Curvelets are good at image denoising than Wavelets. Yet, this doesn't violate the fact that 2D Wavelets would also be useful in image analysis.

Regarding the computational complexity, even before analyzing the equations, you could rely on your knowledge that computation of the Ridgelet transform involves a Wavelet transform in the Radon domain. That is why it should definitely be heavier in terms of computational complexity, compared to a Wavelet transform.

. REFERENCES

• Thanks for the answer. As we know, CWT is better to deal with point singularities whereas Ridglet is better for line singularities. can I say, my application is analyzing a 1-D signal. so can I say my singularities wont be a line anyway[actually what does singularities means when dealing with a 1-D signal]? Also is there anything that said, Ridglet is computationally complex rather than CWT? @tbirdal – Electricman Sep 2 '14 at 4:34
• Just edited my answer. – Tolga Birdal Sep 3 '14 at 17:05
• Hi, I have 2 more questions, A)Can Radon be applied on a 1-D signal? as I saw the computational complexity of Radon for a N*N image is O(N^3) or O(N^2.logN) but I didnt find anything about 1-D signals.B)Can Ridgelet be applied on a 1-D signal? thanks a lot. @tbirdal – Electricman Sep 3 '14 at 17:52
• A and B ) Ridgelet transform is the application of several DWTs to the slices of the Radon transform, which expects integrable bivariate functions. Thus, to me, applying ridgelet transform in 1D makes no sense. In fact, as 1D Radon transform doesn't exist, I would interpret such a transform as a DWT/CWT on a single slice. – Tolga Birdal Sep 3 '14 at 20:52