1 Lecture 12 Neighbourhood Operations (2) TK3813 DR MASRI AYOB.

Slides:



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

Lecture 2: Convolution and edge detection CS4670: Computer Vision Noah Snavely From Sandlot ScienceSandlot Science.
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
Image Filtering. Outline Outline Concept of image filter  Focus on spatial image filter Various types of image filter  Smoothing, noise reductions 
EDGE DETECTION ARCHANA IYER AADHAR AUTHENTICATION.
Sliding Window Filters and Edge Detection Longin Jan Latecki Computer Graphics and Image Processing CIS 601 – Fall 2004.
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
Face Recognition and Biometric Systems 2005/2006 Filters.
Multimedia communications EG 371Dr Matt Roach Multimedia Communications EG 371 and EE 348 Dr Matt Roach Lecture 6 Image processing (filters)
Rank filtering From noise image Rank filtering mask (7 x 7 ) rank 4.
Lecture 4 Linear Filters and Convolution
6/9/2015Digital Image Processing1. 2 Example Histogram.
Computer Vision Group Edge Detection Giacomo Boracchi 5/12/2007
Edge detection. Edge Detection in Images Finding the contour of objects in a scene.
Image processing. Image operations Operations on an image –Linear filtering –Non-linear filtering –Transformations –Noise removal –Segmentation.
EE663 Image Processing Edge Detection 2 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
Median Filter If the objective is to achieve noise reduction rather than blurring, an alternative approach is to use median filters. That is, the gray.
2007Theo Schouten1 Enhancements Techniques for editing an image such that it is more suitable for a specific application than the original image. Spatial.
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.
Lecture 2: Image filtering
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.
Computational Photography: Image Processing Jinxiang Chai.
Image Filtering. Problem! Noise is a problem, even in images! Gaussian NoiseSalt and Pepper Noise.
Chapter 3 (cont).  In this section several basic concepts are introduced underlying the use of spatial filters for image processing.  Mainly spatial.
Presentation Image Filters
Neighborhood Operations
Computer and Robot Vision I Chapter 7 Conditioning and Labeling Presented by: 傅楸善 & 呂建明 指導教授 : 傅楸善 博士.
Machine Vision ENT 273 Image Filters Hema C.R. Lecture 5.
Spatial Filtering: Basics
Digital Image Processing Image Enhancement Part IV.
Digital Image Processing
University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Image processing.
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.
Convolution and Filtering
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, 3rd ed. © 1992–2008 R. C. Gonzalez & R. E. Woods Gonzalez & Woods Chapter 3 Intensity Transformations.
Image Subtraction Mask mode radiography h(x,y) is the mask.
COMP322/S2000/L171 Robot Vision System Major Phases in Robot Vision Systems: A. Data (image) acquisition –Illumination, i.e. lighting consideration –Lenses,
CSC508 Convolution Operators. CSC508 Convolution Arguably the most fundamental operation of computer vision It’s a neighborhood operator –Similar to the.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Intelligent Vision Systems ENT 496 Image Filtering and Enhancement Hema C.R. Lecture 4.
Visual Computing Computer Vision 2 INFO410 & INFO350 S2 2015
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities May 2, 2005 Prof. Charlene Tsai.
Course 5 Edge Detection. Image Features: local, meaningful, detectable parts of an image. edge corner texture … Edges: Edges points, or simply edges,
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Lecture 10 Chapter 5: Image Restoration. Image restoration Image restoration is the process of recovering the original scene from the observed scene which.
Image Processing Lab Section 28/3/2016 Prepared by Mahmoud Abdelsatar Demonstrator at IT Dep. Faculty of computers and information Assuit University.
Spatial Filtering (Chapter 3) CS474/674 - Prof. Bebis.
Miguel Tavares Coimbra
Fundamentals of Spatial Filtering:
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Image Pre-Processing in the Spatial and Frequent Domain
ECE 692 – Advanced Topics in Computer Vision
Filtering – Part I Gokberk Cinbis Department of Computer Engineering
Spatial Filtering - Enhancement
Dr. Chang Shu COMP 4900C Winter 2008
Spatial operations and transformations
Linear Operations Using Masks
Image Filtering Readings: Ch 5: 5. 4, 5. 5, 5. 6, , 5
Image Enhancement in the Spatial Domain
Spatial operations and transformations
Presentation transcript:

1 Lecture 12 Neighbourhood Operations (2) TK3813 DR MASRI AYOB

2 Outlines Edge detection. Rank filtering.

3 Edge Detection One of the major applications for convolution is in edge detection.

4 Edge Detection Noise and other uninteresting image feature can also generate noise. Given a noisy image, edge detection techniques aim to locate the edge pixels most likely to have been generated by scene elements, rather than by noise. Typical 3 steps are: Noise reduction – try to suppress much noise as possible, without smoothing away the meaningful edges. Edge enhancement – apply some kind of filter (e.g. high pass filter) that responds strongly at edges and weakly elsewhere. Edge localisation – decide which of the local maxima output by the filter are meaningful edges and which are caused by noise.

5 A Simple Edge Detector The simplest detector performs minimal noise smoothing and fairly crude localisation. There are based on the estimation of grey level gradient at a pixel. The gradient can be approximated in the x and y directions by: g x (x,y)≈ f(x+1,y) – f(x-1,y); g y (x,y)≈ f(x,y+1) – f(x,y-1); (7.14) (7.15)

6 A Simple Edge Detector These are known as the Prewitt kernels.

7 Sobel Kernels A similar pair of kernels (Prewitt kernels) are Sobel kernels. These give more weight to on-axis pixels.

8 Sobel Kernels

9

10 Sobel Kernels

11 Localisation In localisation step, we must identify the meaningful edges from gradient magnitude data. Typical assumption is that meaningful edges give rise to the strongest gradients, so a simple approach is to threshold the gradient magnitudes computed using equation 7.18 or The threshold produces an ‘edge gap’- a binary image in which pixels set to 1 represent meaningful edges.

12 Localisation example

13 Sobel Example h y (-1)+0(-2)+ 50(-1)+50(0)+ 100(1)+50(2)+ 50(1)+0(0)+0(0)

14 Sobel Example h x

Upper Left: Original Image Upper Middle:Prewitt Filtered – X Upper Right: Prewitt Filtered - Y Left:Combined Upper Left: Original Image Upper Middle:Prewitt Filtered – X Upper Right: Prewitt Filtered - Y Left:Combined

Upper Left: Original Image Upper Middle:Sobel Filtered - X Upper Right: Sobel Filtered - Y Left:Combined Upper Left: Original Image Upper Middle:Sobel Filtered - X Upper Right: Sobel Filtered - Y Left:Combined

17 Rank Filters Rank filtering transforms images based on the rank of a pixels value within a local neighborhood. Sort all of the pixels in the local region by intensity value (this yields a “rank” for every pixel). Median: The value of the output pixel is the value of the “median” pixel. Minimum: The output pixel is the lowest-ranked input Maximum: The output pixel is the highest-ranked input Range: The output is the difference between high and low. Advantage: Not being a kernel-based, so there is no problem with filtering over a small neighbourhood at the corners and sides of the image.

18

19 Rank Filtering

20 Median Filter Example Original Image (impulse noise)Median Filtered Image (3x3) Median Filters are great at preserving edges and eliminating impulse noise.

21 Min/Max Filter Example

22 Median Filters replaces the value of a pixel by the median of the gray levels in the neighborhood of that pixel (the original value of the pixel is included in the computation of the median) impulse noise  salt and pepper noiseprovide excellent noise-reduction capabilitiesless blurring than linear smoothing filters of similar size. quite popular because for certain types of random noise (impulse noise  salt and pepper noise), they provide excellent noise-reduction capabilities, with considering less blurring than linear smoothing filters of similar size.

23 Median Filters forces the points with distinct gray levels to be more like their neighbors. isolated clusters of pixels that are light or dark with respect to their neighbors, and whose area is less than n 2 /2 (one-half the filter area), are eliminated by an n x n median filter. eliminated = forced to have the value equal the median intensity of the neighbors. larger clusters are affected considerably less.

24 Example : Median Filters

25 Thank you Q&A