Scribd Logo
Upload

Welcome to Scribd!

  • Very Fast Curve

    Uploaded by

    Sivam Malar
    27 views9 pages
    The document summarizes the fast curvelet transform algorithm. It first takes the FFT of an image, divides it into coronization segments, wraps each segment around the origin, and takes the inverse FFT. It then describes optimization strategies used like converting to single precision, unrolling loops, and using SIMD instructions. Performance results show the optimized C version is faster than the original C and Matlab versions.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document summarizes the fast curvelet transform algorithm. It first takes the FFT of an image, divides it into coronization segments, wraps each segment around the origin, and takes the inverse FFT. It then describes optimization strategies used like converting to single precision, unrolling loops, and using SIMD instructions. Performance results show the optimized C version is faster than the original C and Matlab versions.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    27 views9 pages

    Very Fast Curve

    Uploaded by

    Sivam Malar
    The document summarizes the fast curvelet transform algorithm. It first takes the FFT of an image, divides it into coronization segments, wraps each segment around the origin, and takes the inverse FFT. It then describes optimization strategies used like converting to single precision, unrolling loops, and using SIMD instructions. Performance results show the optimized C version is faster than the original C and Matlab versions.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 9

    y F a s t

    Ve r
    The Fast Curvelet Transform

    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


    •Divide into
    coronization
    segments
    Algorithm Construction

    •For each segment, wrap around the origin


    •Take Inverse FFT
    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
    Optimization Costs
    •Larger Code
    •Original = 874 lines
    •Optimized = 2660 lines
    •Time
    •Double to Single Precision Error
    Results

    Total transform (forward+inverse) time in seconds:

    Matlab Original C SSE/MMX


    Version Version C Version
    7.551 5.691 3.201

    You might also like