CHAPTER 7 IMAGE ANALYSIS Template Filters A. Dermanis.

Slides:



Advertisements
Similar presentations
Spatial Filtering (Chapter 3)
Advertisements

Sliding Window Filters and Edge Detection Longin Jan Latecki Computer Graphics and Image Processing CIS 601 – Fall 2004.
E.G.M. PetrakisFiltering1 Linear Systems Many image processing (filtering) operations are modeled as a linear system Linear System δ(x,y) h(x,y)
Histogram Manipulation
Image Filtering CS485/685 Computer Vision Prof. George Bebis.
MSU CSE 803 Stockman Fall 2009 Vectors [and more on masks] Vector space theory applies directly to several image processing/representation problems.
7. Neighbourhood operations A single pixel considered in isolation conveys information on the intensity and colour at a single location in an image, but.
2-D, 2nd Order Derivatives for Image Enhancement
Enhancing Images Ch 5:Shapiro, Ch 3:Gonzales. Gray level Mapping Brightness Transform: 1. Position Dependent f(i,j)= g(i,j). e(i,j) g:Clean image e:position.
1 MSU CSE 803 Fall 2014 Vectors [and more on masks] Vector space theory applies directly to several image processing/representation problems.
Chapter 3 Image Enhancement in the Spatial Domain.
CHAPTER 8 Fourier Filters IMAGE ANALYSIS A. Dermanis.
CHAPTER 7 Template Filters IMAGE ANALYSIS A. Dermanis.
Linear Algebra and Image Processing
Chapter 3 (cont).  In this section several basic concepts are introduced underlying the use of spatial filters for image processing.  Mainly spatial.
Radiometric Correction and Image Enhancement
Neighborhood Operations
Spatial-based Enhancements Lecture 3 prepared by R. Lathrop 10/99 updated 10/03 ERDAS Field Guide 6th Ed. Ch 5: ;
Chapter 3 Image Enhancement in the Spatial Domain.
Image Processing Xuejin Chen Ref:
Introduction to Image Processing Grass Sky Tree ? ? Sharpening Spatial Filters.
Technion, CS department, SIPC Spring 2014 Tutorials 12,13 discrete signals and systems 1/39.
Chapter 5: Neighborhood Processing
Spatial Filtering (Applying filters directly on Image) By Engr. Muhammad Saqib.
Digital Image Processing, 3rd ed. © 1992–2008 R. C. Gonzalez & R. E. Woods Gonzalez & Woods Chapter 3 Intensity Transformations.
COMP322/S2000/L171 Robot Vision System Major Phases in Robot Vision Systems: A. Data (image) acquisition –Illumination, i.e. lighting consideration –Lenses,
Chapter 4 Image Enhancement in the Frequency Domain.
CS654: Digital Image Analysis
İmage enhancement Prepare image for further processing steps for specific applications.
CSE 6367 Computer Vision Image Operations and Filtering “You cannot teach a man anything, you can only help him find it within himself.” ― Galileo GalileiGalileo.
Image Enhancement (Frequency Domain)
2D Fourier Transform.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Digital Image Processing, 2nd ed. www. imageprocessingbook.com © 2001 R. C. Gonzalez & R. E. Woods 1 Review: Linear Systems Some Definitions With reference.
Digital Filters. What are they?  Local operation (neighborhood operation in GIS terminology) by mask, window, or kernel (different words for the same.
Image Enhancement by Spatial Domain Filtering
Sliding Window Filters Longin Jan Latecki October 9, 2002.
Spatial Filtering (Chapter 3) CS474/674 - Prof. Bebis.
Image Enhancement in the Spatial Domain.
Miguel Tavares Coimbra
Jean Baptiste Joseph Fourier
Do Now: Evaluate each expression.
- photometric aspects of image formation gray level images
Fundamentals of Spatial Filtering:
Spatial Filtering - Enhancement
Digital Image Processing
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F() is the spectrum of the function.
Image Processing - in short
Use Part 1 of the Fundamental Theorem of Calculus to find the derivative of the function. {image}
Linear system Convolution Linear Filter
Edge Detection Prof. B.A.Khivsara.
Fundamentals of Image Processing A Seminar on By Alok K. Watve
Contourlet Transforms For Feature Detection
2D Fourier transform is separable
Lecture 10 Image sharpening.
Lecture 3 (2.5.07) Image Enhancement in Spatial Domain
9th Lecture - Image Filters
Spatial operations and transformations
Digital Image Processing Week IV
Feature Detection .
Enhancement.
Edge Detection in Computer Vision
Edge Detection Today’s readings Cipolla and Gee Watt,
Lecture 2: Image filtering
Linear Systems Review Objective
Chapter 3 Sampling.
Digital Filters.
Review and Importance CS 111.
Spatial operations and transformations
FREQUENTLY USED 3x3 CONVOLUTION KERNELS
Presentation transcript:

CHAPTER 7 IMAGE ANALYSIS Template Filters A. Dermanis

Moving templates for image filtering gij = fi–1,j–1 h–1,–1 + fi–1,j h–1,0 + fi–1,j+1 h–1,1 + + fi,j–1 h0,–1 + fi,j h0,0 + fi,j+1 h0,1 + + fi+1,j–1 h1,–1 + fi+1,j h1,0 + fi+1,j+1 h1,1 The discrete convolution process in template filtering A. Dermanis

Typical template dimensions Non-square templates viewed as special cases of square ones A. Dermanis

      gij = hi,j;k,m fkm hi,j;k,m = hk–i,m–j gij = hk–i,m–j fkm Template filters = Localized position-invariant linear transformations of an image linear gij = hi,j;k,m fkm   k m position-invariant hi,j;k,m = hk–i,m–j gij = hk–i,m–j fkm   k m localized gij = hi,j;k,m fkm   k=i–p m=j–p i+p j+p Using a (p+1)(p+1) template A. Dermanis

      gij = hk–i,m–j fkm gij = hk,m fi+k,j+m g00 = hk,m fk,m Template filters = Localized position-invariant linear transformations of an image Combination of all properties gij = hk–i,m–j fkm   k=i–p m=j–p i+p j+p k = k – i m = m – j gij = hk,m fi+k,j+m   k = –p m = –p p p renamed (i = 0, j = 0, k = k, m = m) g00 = hk,m fk,m   k = –p m = –p p p A. Dermanis

Template filters = Localized position-invariant linear transformations of an image j–1 j j+1 i+1 i i–1 renamed hij g00 = hk,m fk,m   k = –p m = –p p p fij g00 = h–1,–1 f–1,–1 + h –1,0 f–1,+1 + h –1,1 f–1,+1 + + h0,–1 f0,–1 + h0,0 f0,0 + h0,+1 f0,+1 + + h+1,–1 f+1,–1 + h+1,0 f+1,0 + h+1,+1 f+1,+1 A. Dermanis

        hk,m = 1 hk,m = 0 g00 = hk,m C = C g00 = hk,m C = 0 Low-pass filters High-pass filters hk,m = 1   k = –p m = –p p p hk,m = 0   k = –p m = –p p p homogeneous (low frequency) areas preserve their value fkm = C  g00 = hk,m C = C   k = –p m = –p p p homogeneous areas are set to zero high values emphasize high frequencies fkm = C  g00 = hk,m C = 0   k = –p m = –p p p Examples 1 25 9 Examples 1 -1 1 -2 8 4 A. Dermanis

An example of low pass filters: The original band 3 of a TM image is undergoing low pass filtering by moving mean templates with dimensions 33 and 55 Original Moving mean 33 Moving mean 55 A. Dermanis

An example of a high pass filter: The original image is undergoing high pass filtering with a 33 template, which enhances edges, best viewed as black lines in its negative Original high pass filtering 33 high pass filtering 33 (negative) A. Dermanis

Templates expressing linear operators Local interpolation and template formulation fkm interpolation f(x, y) hkm fkm  k, m A evaluation gij g(x, y) g(0, 0) A. Dermanis

2 2 A =  = + x2 y2 The Laplacian operator 2 2 x2 y2 A =  = + Examples of Laplacian filters with varying template sizes Original (TM band 4) Laplacian 99 Laplacian 1313 Laplacian 1717 A. Dermanis

Examples of Laplacian filters with varying template sizes Original (TM band 4) Laplacian 55 Original + Laplacian 55 A. Dermanis

The Roberts and Sobel filters for edge detection Roberts filter Sobel filter X 2+Y 2 X 2+Y 2 X Y X Y 1 -1 1 -1 -1 1 -2 2 -1 -2 1 2 Original (TM band 4) Roberts Sobel A. Dermanis