Scribd Logo
Upload

Welcome to Scribd!

  • Idm 2

    Uploaded by

    Xosé Estévez Leret
    8 views1 page
    Padding is used in image filtering to facilitate convolving kernels beyond the image size. There are three main padding techniques: full padding adds rows and columns equal to the kernel size minus one; same padding keeps the same size; and valid padding starts convolution at the first pixel plus the kernel size. Padding is not used in fast Fourier transforms, so windowing is applied instead to reduce border effects.

    Original Description:

    Original Title

    idm2

    Copyright

    © © All Rights Reserved

    Available Formats

    ODT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Padding is used in image filtering to facilitate convolving kernels beyond the image size. There are three main padding techniques: full padding adds rows and columns equal to the kernel size minus one; same padding keeps the same size; and valid padding starts convolution at the first pixel plus the kernel size. Padding is not used in fast Fourier transforms, so windowing is applied instead to reduce border effects.

    Copyright:

    © All Rights Reserved
    Download as ODT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    8 views1 page

    Idm 2

    Uploaded by

    Xosé Estévez Leret
    Padding is used in image filtering to facilitate convolving kernels beyond the image size. There are three main padding techniques: full padding adds rows and columns equal to the kernel size minus one; same padding keeps the same size; and valid padding starts convolution at the first pixel plus the kernel size. Padding is not used in fast Fourier transforms, so windowing is applied instead to reduce border effects.

    Copyright:

    © All Rights Reserved
    Download as ODT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Padding in filtering is used to to facilitate the image filtering according the different kernels sizes to

    convolute beyond the image size. There are 3 main variations of the technique:

    Full: Add a N numbers of rows and columns in each direction where N = Kernel size – 1. Then for an
    image of 1024 * 740 with a kernel of 3*3 we would have an image of 1028 * 744. these new rows or
    columns are filled with a value. For example in zero padding are filled with 0.

    Same: Keep the numbers of rows and columns.

    Valid: Start the comvolution in the first pixel + kernel size.

    Padding in FFT sont work, so for there reason are used windowing to remove the influence of the
    borders.

    You might also like