240-373: Chapter 5: Image Filtering 1 Montri Karnjanadecha ac.th/~montri 240-373 Image Processing.

Slides:



Advertisements
Similar presentations
CSCE 643 Computer Vision: Template Matching, Image Pyramids and Denoising Jinxiang Chai.
Advertisements

November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Spatial Filtering (Chapter 3)
Image Processing Lecture 4
1Ellen L. Walker ImageJ Java image processing tool from NIH Reads / writes a large variety of images Many image processing operations.
E.G.M. PetrakisFiltering1 Linear Systems Many image processing (filtering) operations are modeled as a linear system Linear System δ(x,y) h(x,y)
Multimedia communications EG 371Dr Matt Roach Multimedia Communications EG 371 and EE 348 Dr Matt Roach Lecture 6 Image processing (filters)
Lecture 4 Linear Filters and Convolution
6/9/2015Digital Image Processing1. 2 Example Histogram.
1 Image filtering Hybrid Images, Oliva et al.,
Multimedia Data Introduction to Image Processing Dr Mike Spann Electronic, Electrical and Computer.
CHAPTER 4 Image Enhancement in Frequency Domain
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.
CS443: Digital Imaging and Multimedia Filters Spring 2008 Ahmed Elgammal Dept. of Computer Science Rutgers University Spring 2008 Ahmed Elgammal Dept.
CS 376b Introduction to Computer Vision 02 / 25 / 2008 Instructor: Michael Eckmann.
Image Enhancement.
1 Image filtering Images by Pawan SinhaPawan Sinha.
1 Image filtering
Image Analysis Preprocessing Arithmetic and Logic Operations Spatial Filters Image Quantization.
1 Image filtering Hybrid Images, Oliva et al.,
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean Hall 5409 T-R 10:30am – 11:50am.
Image Processing1 Image Filtering Filtering can be use to enhance some features and de- enhance others. Usually used as a pre-processing step.
CS 376b Introduction to Computer Vision 02 / 26 / 2008 Instructor: Michael Eckmann.
Spatial Filtering: Basics
: Chapter 12: Image Compression 1 Montri Karnjanadecha ac.th/~montri Image Processing.
Digital Image Processing Image Enhancement Part IV.
Multimedia Data Introduction to Image Processing Dr Sandra I. Woolley Electronic, Electrical.
Image Processing Xuejin Chen Ref:
Filtering and Enhancing Images. Major operations 1. Matching an image neighborhood with a pattern or mask 2. Convolution (FIR filtering)
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.
: Chapter 8: Edge Detection 1 Montri Karnjanadecha ac.th/~montri Image Processing.
Digital Image Processing CSC331 Image Enhancement 1.
Image processing Fourth lecture Image Restoration Image Restoration: Image restoration methods are used to improve the appearance of an image.
Chapter 5: Neighborhood Processing
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.
Autonomous Robots Vision © Manfred Huber 2014.
Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos VC 15/16 – TP7 Spatial Filters Miguel Tavares Coimbra.
3.7 Adaptive filtering Joonas Vanninen Antonio Palomino Alarcos.
Digital Image Processing Lecture 5: Neighborhood Processing: Spatial Filtering March 9, 2004 Prof. Charlene Tsai.
Sejong Univ. CH3. Area Processes Convolutions Blurring Sharpening Averaging vs. Median Filtering.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Filters– Chapter 6. Filter Difference between a Filter and a Point Operation is that a Filter utilizes a neighborhood of pixels from the input image to.
Spatial Filtering (Chapter 3) CS474/674 - Prof. Bebis.
Miguel Tavares Coimbra
Image Subtraction Mask mode radiography h(x,y) is the mask.
An Adept Edge Detection Algorithm for Human Knee Osteoarthritis Images
Image filtering Hybrid Images, Oliva et al.,
Image filtering Images by Pawan Sinha.
Image Processing, Lecture #8
Image filtering Images by Pawan Sinha.
Image filtering Images by Pawan Sinha.
Image Processing, Lecture #8
Spatial operations and transformations
: Chapter 8: Edge Detection
Digital Image Processing
Technique 6: General gray-level transformations
Digital Image Processing Week IV
Image filtering Images by Pawan Sinha.
Image filtering
Image filtering
Technique 6: General gray-level transformations
Comparing Images Using Hausdorff Distance
Intensity Transformation
Image Filtering Readings: Ch 5: 5. 4, 5. 5, 5. 6, , 5
Spatial operations and transformations
Presentation transcript:

: Chapter 5: Image Filtering 1 Montri Karnjanadecha ac.th/~montri Image Processing

: Chapter 5: Image Filtering 2 Chapter 5 Image Filtering

: Chapter 5: Image Filtering 3 Image Filtering Filtering can be use to enhance some features and de-enhance others. Usually used as a pre-processing step. 4 basic types of filters (1) Low-pass filter (2) High-pass filter (3) Band-pass filter (4) Band-stop filter Filter

: Chapter 5: Image Filtering 4 Multi-image averaging A series of poor images of the same scene can be used to find a better image. Averaging or filtering can be used to enhance the picture.

: Chapter 5: Image Filtering 5 Multi-image Averaging Techniques Multi-image modal filtering –Chose the most popular gray level for each corresponding pixel in a sequence of images Multi-image median filtering –Similar to modal filtering, except the middle value is chosen –sorting is needed Multi-image averaging filtering –Using a weighted averaging technique

: Chapter 5: Image Filtering 6 Recursive Filtering Technique 9: Recursive filtering USE: To improve a sequence of still images--reducing noise by producing new images that correspond to weighted averages of previous images. OPERATION: It is assumed that newly collected images are available from a frame store with a fixed delay between each image.

: Chapter 5: Image Filtering 7 Recursive Filtering (cont’d) 1. Setting up: –copy an image into a separate frame store, dividing all the gray levels by an integer, n. Add to that image n-1 subsequent images, the gray levels of which are also divided by n. You should now have the average of the first n images in the frame store. 2. Recursion: For every new image, multiply the contents of the frame store by (n-1)/n and the new image by 1/n, add them together and put the result back into the frame store.

: Chapter 5: Image Filtering 8 Recursive Filtering (cont’d) THEORY: At setup the frame store contains Then after many images the following steady state is created:

: Chapter 5: Image Filtering 9 Recursive Filtering cont’d n=10n=5n=2 new one last one last but last but last but last but last but last but last but last but last but and so on

: Chapter 5: Image Filtering 10 Median Filtering USE: Noise removal while preserving edges in an image. OPERATION: Median filter is a low-pass filter that attempts to remove noisy pixels while keeping the edges intact. The value of the pixels in the window are sorted and the median--the middle value in the sorted list--is chosen.

: Chapter 5: Image Filtering 11 Median Filtering Example Example: Noise removal with a 3x3 median filter Image Output

: Chapter 5: Image Filtering 12 Median Filtering Example Modal filter: similar to median filter except that the most popular value from the set of nine is chosen.

: Chapter 5: Image Filtering 13 k-closest averaging USE: To preserve the actual values of the pixels without letting the noise get through to the final image OPERATION: –All pixels in the window are sorted –k pixels values closest to the target pixel (center pixel in the window) are averaged. If the target pixel is included, the effect is similar to a low-pass filter –k is constant that is smaller than the area of the window –To avoid pairs or triples of noisy pixels, an extension of this technique can be as follow: k values nearest to the target, but not including q values closest to and including the target.

: Chapter 5: Image Filtering 14 Template and convolution Template operations are very useful as elementary image filters. They can be used to: –enhance certain features, de-enhance others –identifying edge –smooth out noise –discover known shapes in an image

: Chapter 5: Image Filtering 15 Convolution USE: widely used in many operations OPERATION: A template is an array of values. It is placed step by step over the image. At each step, creating a new window in the image the same size as the template

: Chapter 5: Image Filtering 16 Convolution (cont’d) OPERATION: Associating with each element in the template a corresponding pixel in the image Typically, the template element is multiplied by the corresponding image pixel gray level. The sum of these results, across the whole template, is recorded as a pixel gray level in a new image. This ‘shift, add, multiply’ operation is called the ‘CONVOLUTION’ of the template with the image.

: Chapter 5: Image Filtering 17 Convolution (cont’d) If T(x,y) is the template (n x m) and I(X,Y) is the image (N x M), then the convolving of T with I is written as

: Chapter 5: Image Filtering 18 Convolution (cont’d) Often the template is not allowed to shift off the edge of the image, so the resulting image will be smaller than the original image. For example TemplateImageResult * * * * * * * * * = no value

: Chapter 5: Image Filtering 19 Convolution (cont’d) From the example, the 2x2 template is operating on a 4x5 image, giving a 3x4 result. The value 5 in the result is obtained from (1x1) + (0x3) + (0x1) + (1x4)

: Chapter 5: Image Filtering 20 Common templates Low-pass filter (removing noise, blurring) –template –template 2 (weighting with half of result is from the center pixel)

: Chapter 5: Image Filtering 21 Common templates High-pass filter (remove gradual change, enhance sudden changes) –Laplacian template (the sample sums to zero)

: Chapter 5: Image Filtering 22 Example of low pass and high pass filtering ImageAfter high passafter low pass

: Chapter 5: Image Filtering 23 Storing the convolution results Convolution results normally need examination and transformation before storage. In most applications, images are held as one array of bytes (or three arrays of bytes for color images). Each byte hold unsigned integer. The results of an operation must be transformed to within the range. Scaling can be done to adjust the result range. Other method is to use a floating point variable to hold each pixel value. This needs more memory, scaling and rounding.

: Chapter 5: Image Filtering 24 Interest Points Interest points are identified by algorithms that can be applied first to images containing a known object, and then to images where recognition of the object is required

: Chapter 5: Image Filtering 25 Moravec operator Technique 6: Moravec operator USE: To identify a set of points on an image by which the image may be classified or compared OPERATION: –Computing variance where

: Chapter 5: Image Filtering 26 Moravec operator –Passing a 3x3 window and saving minimum –Passing a 3x3 window and setting to zero the center pixel when its value is not maximum in the window –Simplified formula

: Chapter 5: Image Filtering 27 Example Image Variances After step 1 After step 2

: Chapter 5: Image Filtering 28 Correlation Technique 7: Correlation USE: To find where a template matches a window in an image, To determine the existence of a known shape in an image. THEORY: If N x M image is addressed by I(X,Y) and n x m template is addressed by t(i,j) then

: Chapter 5: Image Filtering 29 Correlation 1 2 3

: Chapter 5: Image Filtering 30 Correlation 1: is constant across the image, so can be ignored 2: is t convolved with I 3: is constant only if average light from image is constant across image (often approximately true)

: Chapter 5: Image Filtering 31 Some comments on correlation technique If overall light intensity across the whole image is fairly constant, it is safe to use convolution instead of correlation. The object may have any orientation. The object may have any size.