Scribd Logo
Upload

Welcome to Scribd!

  • 37 views

    Filter 2

    Uploaded by

    gaurav_juneja_4
    Z

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd

    Filter 2

    Uploaded by

    gaurav_juneja_4
    37 views18 pages
    Z

    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?

    Z

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    37 views18 pages

    Filter 2

    Uploaded by

    gaurav_juneja_4
    Z

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 18

    Fourier Transform

    Analytic geometry gives a coordinate


    system for describing geometric objects.
    Fourier transform gives a coordinate system
    for functions.

    Decomposition of the image
    function
    The image can be decomposed into a weighted sum of
    sinusoids and cosinuoids of different frequency.


    Fourier transform gives us the weights
    Basis
    P=(x,y) means P = x(1,0)+y(0,1)
    Similarly:




    + + +
    + =
    ) 2 sin( ) 2 cos(
    ) sin( ) cos( ) (
    2 2 1 2
    2 1 1 1
    u u
    u u u
    a a
    a a f
    cosc a sin
    sin cos ) sin(
    : such that , ,
    2 1
    2 1
    2 1
    = =
    + = +
    -
    c a
    a a c
    a a c
    u u u
    Orthonormal Basis
    ||(1,0)||=||(0,1)||=1
    (1,0).(0,1)=0
    Similarly we use normal basis elements eg:



    While, eg:
    }
    =
    t
    u u u
    u
    u
    2
    0
    2
    cos ) cos(
    ) cos(
    ) cos(
    d
    }
    =
    t
    u u u
    2
    0
    0 sin cos d
    2D Example
    t i
    )e A(
    e e
    e
    t i
    e
    t i t e
    t i
    sin cos + = e
    e
    Sinusoids and cosinuoids are
    eigenfunctions of convolution
    Why are we interested in a decomposition of the
    signal into harmonic components?
    Thus we can understand what the system (e.g filter) does
    to the different components (frequencies) of the signal (image)
    Convolution Theorem
    G F T g f *
    1
    =
    F,G are transform of f,g ,T
    -1
    is inverse
    Fourier transform
    That is, F contains coefficients, when
    we write f as linear combinations of
    harmonic basis.
    Fourier transform
    (F) i (F)
    ) sin( ) , ( ) cos( ) , (
    ) , ( ) , (
    ) (
    + 9
    = + + +
    = =
    } } } }
    } }


    +
    dxdy vy ux y x f i dxdy vy ux y x f
    dxdy e y x f v u F
    vy ux i
    often described by magnitude ( )
    and phase ( )
    ) (
    1
    0
    1
    0
    N
    n l
    M
    m k
    i
    M
    k
    N
    l
    kl mn
    e f F
    +

    =
    t
    In the discrete case with values f
    kl
    of f(x,y) at points (kw,lh) for
    k= 1..M-1, l= 0..N-1
    ) ( ) (
    2 2
    F F + 9
    )
    ) (
    ) (
    arctan(
    F
    F
    9

    Remember Convolution
    1/9.(10x1 + 11x1 + 10x1 + 9x1 + 10x1 + 11x1 + 10x1 + 9x1 + 10x1) =
    1/9.( 90) = 10
    10
    11 10
    9
    10
    11
    10 9
    10
    1
    10
    10
    2
    9
    0
    9
    0
    9
    9
    9
    9
    0
    1
    99
    10
    10 11
    1 0
    1
    11
    11
    11
    11
    10 10
    I
    1
    1
    1
    1
    1
    1
    1
    1
    1
    F
    X
    X X
    X
    10
    X
    X
    X
    X
    X
    X
    X
    X
    X
    X
    X
    X
    X
    X
    X X
    1/9
    O
    Examples
    Transform of
    box filter is
    sinc.
    Transform of
    Gaussian is
    Gaussian.
    (Trucco and Verri)
    Implications
    Smoothing means removing high
    frequencies. This is one definition of scale.
    Sinc function explains artifacts.
    Need smoothing before subsampling to
    avoid aliasing.

    Example: Smoothing by
    Averaging
    Smoothing with a Gaussian
    Sampling
    Sampling and the Nyquist rate
    Aliasing can arise when you sample a continuous
    signal or image
    Demo applet
    http://www.cs.brown.edu/exploratories/freeSoftware/repository/edu/brown/cs/explo
    ratories/applets/nyquist/nyquist_limit_java_plugin.html
    occurs when your sampling rate is not high enough to
    capture the amount of detail in your image
    formally, the image contains structure at different scales
    called frequencies in the Fourier domain
    the sampling rate must be high enough to capture the
    highest frequency in the image
    To avoid aliasing:
    sampling rate > 2 * max frequency in the image
    i.e., need more than two samples per period
    This minimum sampling rate is called the Nyquist rate

    You might also like