1 / 9

The Fast Curvelet Transform

The Fast Curvelet Transform. Very Fast. Brian Eriksson. Curvelet Transform. Coefficient Value = 0. Zero. Curvelet Transform. Coefficient Value << 1. Very Small. Curvelet Transform. Coefficient Value >> 1. Very Large. Algorithm Construction. Take FFT of image

latoya
Télécharger la présentation

The Fast Curvelet Transform

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The Fast Curvelet Transform Very Fast Brian Eriksson

  2. Curvelet Transform Coefficient Value = 0 Zero

  3. Curvelet Transform Coefficient Value << 1 Very Small

  4. Curvelet Transform Coefficient Value >> 1 Very Large

  5. Algorithm Construction • Take FFT of image • Divide into coronization segments

  6. Algorithm Construction • For each segment, wrap around the origin • Take Inverse FFT

  7. Optimization Strategies • Double Precision to Single Precision • Loop Unrolling • Subword Parallel Instructions • Integer Instructions – MMX Intrinsics • Wrapping Indices • Floating Point Instructions – SSE1 Intrinsics • Corona Filtering • Normalization

  8. Optimization Costs • Larger Code • Original = 874 lines • Optimized = 2660 lines • Time • Double to Single Precision Error

  9. Results Total transform (forward+inverse) time in seconds:

More Related