Machine Vision ENT 273 Image Filters Hema C.R. Lecture 5.

Slides:



Advertisements
Similar presentations
Linear Filtering – Part I Selim Aksoy Department of Computer Engineering Bilkent University
Advertisements

Spatial Filtering (Chapter 3)
Topic 6 - Image Filtering - I DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Image Processing Lecture 4
Chapter 3 Image Enhancement in the Spatial Domain.
CS 4487/9587 Algorithms for Image Analysis
E.G.M. PetrakisFiltering1 Linear Systems Many image processing (filtering) operations are modeled as a linear system Linear System δ(x,y) h(x,y)
Digital Image Processing In The Name Of God Digital Image Processing Lecture3: Image enhancement M. Ghelich Oghli By: M. Ghelich Oghli
Rank filtering From noise image Rank filtering mask (7 x 7 ) rank 4.
Lecture 4 Linear Filters and Convolution
Image Filtering CS485/685 Computer Vision Prof. George Bebis.
Multimedia Data Introduction to Image Processing Dr Mike Spann Electronic, Electrical and Computer.
Image processing. Image operations Operations on an image –Linear filtering –Non-linear filtering –Transformations –Noise removal –Segmentation.
Processing Digital Images. Filtering Analysis –Recognition Transmission.
MSU CSE 803 Stockman Linear Operations Using Masks Masks are patterns used to define the weights used in averaging the neighbors of a pixel to compute.
1 Image Filtering Readings: Ch 5: 5.4, 5.5, 5.6,5.7.3, 5.8 (This lecture does not follow the book.) Images by Pawan SinhaPawan Sinha formal terminology.
1 Lecture 12 Neighbourhood Operations (2) TK3813 DR MASRI AYOB.
Image Enhancement.
1 Image filtering Images by Pawan SinhaPawan Sinha.
Image Analysis Preprocessing Arithmetic and Logic Operations Spatial Filters Image Quantization.
MSU CSE 803 Linear Operations Using Masks Masks are patterns used to define the weights used in averaging the neighbors of a pixel to compute some result.
Linear Filtering About modifying pixels based on neighborhood. Local methods simplest. Linear means linear combination of neighbors. Linear methods simplest.
Chapter 3 (cont).  In this section several basic concepts are introduced underlying the use of spatial filters for image processing.  Mainly spatial.
CSCE 441: Computer Graphics Image Filtering Jinxiang Chai.
CS 376b Introduction to Computer Vision 02 / 26 / 2008 Instructor: Michael Eckmann.
Spatial-based Enhancements Lecture 3 prepared by R. Lathrop 10/99 updated 10/03 ERDAS Field Guide 6th Ed. Ch 5: ;
Spatial Filtering: Basics
Digital Image Processing
HCI/ComS 575X: Computational Perception Instructor: Alexander Stoytchev
Multimedia Data Introduction to Image Processing Dr Sandra I. Woolley Electronic, Electrical.
Linear Filtering – Part I Selim Aksoy Department of Computer Engineering Bilkent University
EE663 Image Processing Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
Digital Image Processing Lecture 5: Neighborhood Processing: Spatial Filtering Prof. Charlene Tsai.
Lecture 03 Area Based Image Processing Lecture 03 Area Based Image Processing Mata kuliah: T Computer Vision Tahun: 2010.
AdeptSight Image Processing Tools Lee Haney January 21, 2010.
Image processing Fourth lecture Image Restoration Image Restoration: Image restoration methods are used to improve the appearance of an image.
Digital Image Processing Lecture 10: Image Restoration March 28, 2005 Prof. Charlene Tsai.
Linear filtering. Motivation: Noise reduction Given a camera and a still scene, how can you reduce noise? Take lots of images and average them! What’s.
Lecture 5 Mask/Filter Transformation 1.The concept of mask/filters 2.Mathematical model of filtering Correlation, convolution 3.Smoother filters 4.Filter.
Machine Vision ENT 273 Image Filters Hema C.R. Lecture 5.
Digital Image Processing Lecture 10: Image Restoration
Ch5 Image Restoration CS446 Instructor: Nada ALZaben.
Image Subtraction Mask mode radiography h(x,y) is the mask.
Course 2 Image Filtering. Image filtering is often required prior any other vision processes to remove image noise, overcome image corruption and change.
Autonomous Robots Vision © Manfred Huber 2014.
Intelligent Vision Systems ENT 496 Image Filtering and Enhancement Hema C.R. Lecture 4.
Digital Image Processing Lecture 5: Neighborhood Processing: Spatial Filtering March 9, 2004 Prof. Charlene Tsai.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Digital Image Processing Image Enhancement in Spatial Domain
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
CSE 185 Introduction to Computer Vision Image Filtering: Spatial Domain.
Image Enhancement Band Ratio Linear Contrast Enhancement
Spatial Filtering (Chapter 3) CS474/674 - Prof. Bebis.
HCI/ComS 575X: Computational Perception Instructor: Alexander Stoytchev
Image Subtraction Mask mode radiography h(x,y) is the mask.
Digital Image Processing Lecture 10: Image Restoration
Filtering – Part I Gokberk Cinbis Department of Computer Engineering
- photometric aspects of image formation gray level images
Image Enhancement in the Spatial Domain
Image filtering Images by Pawan Sinha.
HCI / CprE / ComS 575: Computational Perception
CSC 381/481 Quarter: Fall 03/04 Daniela Stan Raicu
Image filtering Images by Pawan Sinha.
Linear Operations Using Masks
Department of Computer Engineering
Lecture 2: Image filtering
Image Filtering Readings: Ch 5: 5. 4, 5. 5, 5. 6, , 5
Lecture 7 Spatial filtering.
Image Enhancement in the Spatial Domain
Presentation transcript:

Machine Vision ENT 273 Image Filters Hema C.R. Lecture 5

Why Filters are needed? Image processing converts an input image into an enhanced image from which information about the image can be retrieved. To enhance images any unwanted information or distortions called noise has to be removed. Filtering is the process which removes noise from an image [which also includes lightening darker regions to enhance quality of the image or suppresses unwanted information /region] Original Image Image with Noise Hema ENT 273 Lecture 5

Image Noise Images are formed by light falling on a sensor Noises are introduced due to Quantization – which reduces the light levels to 256 Imperfect sensors Imperfect lighting conditions during acquisition Compression formats Hema ENT 273 Lecture 5

Features of Filter Reduce the size of the data on which we want to build our inferences Reduction should retain most informative pieces Edges and Corners Texture Mathematically/computationally Hema ENT 273 Lecture 5

Hema ENT 273 Lecture 5

Types of Noise Salt and Pepper Gaussian Noise Uniform Noise Original Image Types of Noise Salt and Pepper In salt and pepper noise pixels in the image are vastly different in color from their surrounding pixels. The color of a noisy pixel bears no relation to the color of surrounding pixels. Generally this type of noise will only affect a small number of image pixels. When viewed, the image contains dark and white dots, hence the term salt and pepper noise. . Gaussian Noise In Gaussian noise (dependent noise), an amount of noise is added to every part of the picture. Each pixel in the image will be changed from its original value by a (usually) small amount. Taking a plot of the amount of distortion of a pixel against the frequency with which it occurs produces a Gaussian distribution of noise Uniform Noise Pixel values are usually close to their true values. Average value is equal to the real one Salt and Pepper Noise Gaussian Noise Uniform Noise Hema ENT 273 Lecture 5

Noise Removal Most Noise removal processes are called filters Applied to each point in an image [convolution] Use information in the small local windows of a pixel Noise removal Filters Linear Filters Non-Linear Filters Gaussian filters Mean Filter Median Filter Hema ENT 273 Lecture 5

Output impulse response Linear Systems Space Invariant System A system whose response remains the same irrespective of the position of the input pulse Output impulse response Linear Space Invariant System Input impulse Hema ENT 273 Lecture 5

Linear Space Invariant Systems In LSI systems the output h(x,y) is a convolution of f(x,y) with impulse response g(x,y) Linear Space Invariant System g(x,y) Input Image Output Image Hema ENT 273 Lecture 5

Convolution Convolution A neighborhood operation in which each output pixel is a weighted sum of neighboring input pixels. The weights are defined by the convolution kernel. Image processing operations implemented with convolution include smoothing, sharpening, and edge enhancement. Convolution is a spatially invariant operation Hema ENT 273 Lecture 5

Convolution (cont.) One of the most important processes on images. Actually a class of operations allowing much variety. Used in almost all Computer Vision programs as a starting point. Used in many Computer Graphics processes. Hema ENT 273 Lecture 5

Example: horizontal differencing as convolution Hema ENT 273 Lecture 5

a combination of multiplication and addition Hema ENT 273 Lecture 5

Example: Image after convolution Hema ENT 273 Lecture 5

Convolution Mask A B C D E F G H I h [i,j] P1 P2 P3 P4 P5 P6 P7 P8 P9 Hema ENT 273 Lecture 5

Hema ENT 273 Lecture 5

Mask The mask can contain any numbers. E.g. the mask below amounts to averaging adjacent pixels and so produces a smoothing effect on the image. The mask can be vertically oriented instead of horizontally. The differencing mask will then be sensitive to horizontal edges. Hema ENT 273 Lecture 5

The example below also combines smoothing and differencing, and is The mask can be 2-dimensional—in fact, just like a small piece of image. The example below also combines smoothing and differencing, and is Hema ENT 273 Lecture 5

The mask can be 2-dimensional—in fact, just like a small piece of image. The example below also combines smoothing and differencing, and is used in practical applications. (It is referred to as a Sobel operator.) Hema ENT 273 Lecture 5

Example of 2-D convolution Hema ENT 273 Lecture 5

Some special masks Horizontal differences Vertical differences Diagonal differences Hema ENT 273 Lecture 5

Differencing masks may be more complex e.g. a horizontal bar mask An arbitrary mask can be given this property by computing the mean of its weights, and subtracting the mean from each weight in turn to get a newweight. Hema ENT 273 Lecture 5

A simple smoothing mask This takes the average of each 3x3 region of the image. The simple smoothing mask is not particularly good, because its point-spread function has sharp edges. Hema ENT 273 Lecture 5

The Gaussian smoothing mask A more effective smoothing mask falls off gently at the edges. One of the bestis the Gaussian mask. Its width is described by a parameter called (sigma). Hema ENT 273 Lecture 5

Example on the effect of progressively increasing Example on the effect of progressively increasing . Its values are 1, 2 and 4 in the 3 smoothed images. Hema ENT 273 Lecture 5

Feature of Linear Filter About modifying pixels based on neighborhood. Linear means linear combination of neighbors. Linear methods simplest Can combine linear methods in any order to achieve same result Maybe easier to undo “Filter Banks” Hema ENT 273 Lecture 5

Mean Filter Implemented by a local averaging operation where the value of each pixel is replaced by the average of all the values in the local neighborhood: where M is the total number of pixels in the neighborhood N Hema ENT 273 Lecture 5

3x3 neighborhood about [i,j] Hema ENT 273 Lecture 5

Mean Filter The mean filter is a simple sliding-window spatial filter that replaces the center value in the window with the average (mean) of all the pixel values in the window. The window, or kernel, is usually square but can be any shape. An example of mean filtering of a single 3x3 window of values is shown 5 3 7 2 6 4 8 1 9 * 5 Hema ENT 273 Lecture 5

Example of mean filter using 3x3 neighborhood Hema ENT 273 Lecture 5

Another example of mean filter Hema ENT 273 Lecture 5

Median Filter The median filter is also a sliding-window spatial filter, but it replaces the center value in the window with the median of all the pixel values in the window. As for the mean filter, the kernel is usually square but can be any shape. An example of median filtering of a single 3x3 window of values is shown Median filter remove 'impulse' noise (outlying values, either high or low). The median filter is also widely claimed to be 'edge-preserving' since it theoretically preserves step edges without blurring. However, in the presence of noise it does blur edges in images slightly. 3 57 7 2 5 6 18 4 9 2,3,4,5,6,7,9,18,57 * 6 Hema ENT 273 Lecture 5

Example of median filter using 3x3 neighborhood Hema ENT 273 Lecture 5

Gaussian Filter Gaussian filters removes noise by smoothing but also blurs the image, The degree of smoothing is determined by the standard deviation of the Gaussian. (Larger standard deviation Gaussians, of course, require larger convolution masks in order to be accurately represented.) The Gaussian outputs a `weighted average' of each pixel's neighborhood, with the average weighted more towards the value of the central pixels. This is in contrast to the mean filter's uniformly weighted average. Gaussian provides gentler smoothing and preserves edges better than a similarly sized mean filter Hema ENT 273 Lecture 5

Hema ENT 273 Lecture 5

2D Gaussian function Hema ENT 273 Lecture 5

Gaussian Filter Can be constructed using binomial expansion Example Hema ENT 273 Lecture 5

We need to get the Gaussian mask, where c is a normalizing constant By rewriting and choosing a value of the variance , we can find the nxn mask Hema ENT 273 Lecture 5

Example of Gaussian distribution for Hema ENT 273 Lecture 5

By choosingthe bottom right corner as the value of one Hema ENT 273 Lecture 5

To normalize the mask to ensure uniform intensity Thus the convolution is Hema ENT 273 Lecture 5

Histogram Equalization Histogram equalization is a common technique for enhancing the appearance of images. Suppose we have an image which is predominantly dark. Then its histogram would be skewed towards the lower end of the grey scale and all the image detail is compressed into the dark end of the histogram. If we could `stretch out' the grey levels at the dark end to produce a more uniformly distributed histogram then the image would become much clearer. Hema ENT 273 Lecture 5

Hema ENT 273 Lecture 5

Hema ENT 273 Lecture 5

Hema ENT 273 Lecture 5

Histogram Modification Histogram equalization Is a method for stretching contrast of unevenly distributed gray values by uniformly redistributing the gray values Hema ENT 273 Lecture 5

References Computer Vision – Linda G Shapiro & George Stockman http://en.wikipedia.org/wiki/Image_noise Mat lab reference notes Hema ENT 273 Lecture 5

Machine Vision End of Lecture 5