This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Spatial Filtering Spatial Filtering CS 450: Introduction to Digital Signal and Image Processing Bryan Morse BYU Computer Science Spatial Filtering Introduction Neighborhood Operations I Output is a function of a pixels value and its neighbors I Example (8-connected neighbors): g ( x , y ) = Op @ f ( x- 1 , y- 1 ) , f ( x , y- 1 ) , f ( x + 1 , y- 1 ) , f ( x- 1 , y ) , f ( x , y ) , f ( x + 1 , y ) , f ( x- 1 , y + 1 ) , f ( x , y + 1 ) , f ( x + 1 , y + 1 ) 1 A I Possible operations: sum, weighted sum, average, weighted average, min, max, median, ... Spatial Filtering Introduction Spatial Filtering I The most common neighborhood operation is to multiply each of the pixels in the neighborhood by a weight and add them together. I The local weights are sometimes called a mask or kernel . Local Neighborhood Mask f(x-1,y-1) f(x,y-1) f(x+1,y-1) f(x-1,y) f(x,y) f(x+1,y) f(x-1,y+1) f(x,y+1) f(x+1,y+1) w(-1,-1) w(0,-1) w(1,-1) w(-1,0) w(0,0) w(1,0) w(-1,1) w(0,1) w(1,1) g ( x , y ) = 1 X s =...
View Full Document
This document was uploaded on 03/15/2012.
- Fall '09
- Image processing