Professional Documents
Culture Documents
Filters
Code
11 de noviembre de 2016
logo
Content
1 Theory
Reason
Definition
2 Filters
Normalized Box Filter
Gaussian Filter
Median Filter
Bilateral Filter
3 Code
Libraries
Codes
logo
Content
1 Theory
Reason
Definition
2 Filters
Normalized Box Filter
Gaussian Filter
Median Filter
Bilateral Filter
3 Code
Libraries
Codes
logo
Content
1 Theory
Reason
Definition
2 Filters
Normalized Box Filter
Gaussian Filter
Median Filter
Bilateral Filter
3 Code
Libraries
Codes
logo
Theory
Reason
Smoothing, also called blurring, is a simple and frequently used
image processing operation. There are many reasons for smoothing.
In this tutorial we will focus on smoothing in order to reduce noise.
logo
h(i, j)is called the kernel, which is nothing more than the
coefficients of the filter.
logo
logo
Figura: kernel
Prof. Johan Agudelo Smoothing
Normalized Box Filter
Theory
Gaussian Filter
Filters
Median Filter
Code
Bilateral Filter
logo
Figura: kernel
Prof. Johan Agudelo Smoothing
Normalized Box Filter
Theory
Gaussian Filter
Filters
Median Filter
Code
Bilateral Filter
Gaussian Filter
Probably the most useful filter (although not the fastest).
Gaussian filtering is done by convolving each point in the
input array with a Gaussian kernel and then summing them all
to produce the output array.
Just to make the picture clearer, remember how a 1D
Gaussian kernel look like?
logo
Figura: gaussian
Prof. Johan Agudelo Smoothing
Normalized Box Filter
Theory
Gaussian Filter
Filters
Median Filter
Code
Bilateral Filter
Gaussian Filter
Probably the most useful filter (although not the fastest).
Gaussian filtering is done by convolving each point in the
input array with a Gaussian kernel and then summing them all
to produce the output array.
Just to make the picture clearer, remember how a 1D
Gaussian kernel look like?
logo
Figura: gaussian
Prof. Johan Agudelo Smoothing
Normalized Box Filter
Theory
Gaussian Filter
Filters
Median Filter
Code
Bilateral Filter
Gaussian Filter
Note
Assuming that an image is 1D, you can notice that the pixel
located in the middle would have the biggest weight. The weight of
its neighbors decreases as the spatial distance between them and
the center pixel increases.
Research
Indicate the fundamental equation of a two-dimensional Gaussian
filter and graph your answer with values of your choice.
logo
Gaussian Filter
Note
Assuming that an image is 1D, you can notice that the pixel
located in the middle would have the biggest weight. The weight of
its neighbors decreases as the spatial distance between them and
the center pixel increases.
Research
Indicate the fundamental equation of a two-dimensional Gaussian
filter and graph your answer with values of your choice.
logo
Median Filter
The median filter run through each element of the signal (in
this case the image) and replace each pixel with the median of
its neighboring pixels (located in a square neighborhood
around the evaluated pixel).
logo
Bilateral Filter
Bilateral Filter
Libraries
include opencv2/imgproc/imgproc.hpp
include opencv2/highgui/highgui.hpp
logo
Libraries
include opencv2/imgproc/imgproc.hpp
include opencv2/highgui/highgui.hpp
logo
Homogeneous blur
logo
Gaussian blur
logo
Median blur
logo
Bilateral Filter
logo
Research
Realice un codigo en OpenCV que le permita aplicar las diferentes
tecnicas de filtrado en una imagen de su elecci on, consigne el
desarrollo en un articulo y carguelo a la carpeta asignada on el
codigo en formato cpp. Tenga en cuenta que la explicacion al
detalle de cada uno de los filtros, la construccion en LATEX del
documento y la calidad en la redacci on seran tenidas en cuenta
para su evaluacion.
logo
Bibliography
1 http://docs.opencv.org/2.4/doc/tutorials/imgproc
logo