6/4/2016© 2009 Raymond P. Jefferis III Lect 06 - 1 Geographic Information Processing Attribute Plotting Extracting data features Calculating derivatives.

Slides:



Advertisements
Similar presentations
Lecture 2: Convolution and edge detection CS4670: Computer Vision Noah Snavely From Sandlot ScienceSandlot Science.
Advertisements

Spatial Filtering (Chapter 3)
Topic 6 - Image Filtering - I DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Spatial Filtering.
Image Filtering. Outline Outline Concept of image filter  Focus on spatial image filter Various types of image filter  Smoothing, noise reductions 
Regional Processing Convolutional filters. Smoothing  Convolution can be used to achieve a variety of effects depending on the kernel.  Smoothing, or.
Image processing (spatial &frequency domain) Image processing (spatial &frequency domain) College of Science Computer Science Department
October 2, 2014Computer Vision Lecture 8: Edge Detection I 1 Edge Detection.
5/12/2015© 2009 Raymond P. Jefferis III Lect Geographic Information Processing Data Analysis Watersheds Gradient path - Valleys - Ridges Flow analysis.
Digital Image Processing In The Name Of God Digital Image Processing Lecture3: Image enhancement M. Ghelich Oghli By: M. Ghelich Oghli
5/24/2015© 2009 Raymond P. Jefferis III Lect Geographic Image Processing Data Transformation and Filtering Noise in data Arrays Digital filtering.
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded.
Announcements Mailing list: –you should have received messages Project 1 out today (due in two weeks)
Edges and Scale Today’s reading Cipolla & Gee on edge detection (available online)Cipolla & Gee on edge detection Szeliski – From Sandlot ScienceSandlot.
Edge Detection Today’s reading Forsyth, chapters 8, 15.1
2-D, 2nd Order Derivatives for Image Enhancement
1 Image filtering
Lecture 2: Image filtering
Edge Detection Today’s readings Cipolla and Gee –supplemental: Forsyth, chapter 9Forsyth Watt, From Sandlot ScienceSandlot Science.
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded.
Image Filtering. Problem! Noise is a problem, even in images! Gaussian NoiseSalt and Pepper Noise.
8/23/2015© 2009 Raymond P. Jefferis III Lect Geographic Information Processing Spatial Interpolation Freed, et al, Magnetometer field readings of.
Presentation Image Filters
CS559: Computer Graphics Lecture 3: Digital Image Representation Li Zhang Spring 2008.
Spatial Filtering: Basics
Discrete Images (Chapter 7) Fourier Transform on discrete and bounded domains. Given an image: 1.Zero boundary condition 2.Periodic boundary condition.
University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Image processing.
Introduction to Image Processing Grass Sky Tree ? ? Sharpening Spatial Filters.
Image Processing Edge detection Filtering: Noise suppresion.
Lecture 3: Edge detection CS4670/5670: Computer Vision Kavita Bala From Sandlot ScienceSandlot Science.
Edges. Edge detection schemes can be grouped in three classes: –Gradient operators: Robert, Sobel, Prewitt, and Laplacian (3x3 and 5x5 masks) –Surface.
Introduction to Image Processing
Edge Detection Today’s reading Cipolla & Gee on edge detection (available online)Cipolla & Gee on edge detection From Sandlot ScienceSandlot Science.
Edge Detection Today’s reading Cipolla & Gee on edge detection (available online)Cipolla & Gee on edge detection Szeliski, Ch 4.1.2, From Sandlot.
CS654: Digital Image Analysis Lecture 24: Introduction to Image Segmentation: Edge Detection Slide credits: Derek Hoiem, Lana Lazebnik, Steve Seitz, David.
Edge detection Goal: Identify sudden changes (discontinuities) in an image Intuitively, most semantic and shape information from the image can be encoded.
EE 4780 Edge Detection.
Many slides from Steve Seitz and Larry Zitnick
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.
Edge Detection and Geometric Primitive Extraction Jinxiang Chai.
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.
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.
Announcements Project 0 due tomorrow night. Edge Detection Today’s readings Cipolla and Gee (handout) –supplemental: Forsyth, chapter 9Forsyth For Friday.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Edge Segmentation in Computer Images CSE350/ Sep 03.
Lecture 8: Edges and Feature Detection
Last Lecture photomatix.com. Today Image Processing: from basic concepts to latest techniques Filtering Edge detection Re-sampling and aliasing Image.
Digital Image Processing Week V Thurdsak LEAUHATONG.
Grauman Today: Image Filters Smooth/Sharpen Images... Find edges... Find waldo…
September 26, 2013Computer Vision Lecture 8: Edge Detection II 1Gradient In the one-dimensional case, a step edge corresponds to a local peak in the first.
1 Edge Operators a kind of filtering that leads to useful features.
Spatial Filtering (Chapter 3) CS474/674 - Prof. Bebis.
Image Enhancement in the Spatial Domain.
Miguel Tavares Coimbra
Edge Detection slides taken and adapted from public websites:
ECE 692 – Advanced Topics in Computer Vision
Fourier Transform: Real-World Images
Lecture 2: Edge detection
Dr. Chang Shu COMP 4900C Winter 2008
Lecture 10 Image sharpening.
Edge Detection Today’s reading
a kind of filtering that leads to useful features
a kind of filtering that leads to useful features
Edge Detection Today’s reading
9.5 Least-Squares Digital Filters
Edge Detection Today’s reading
Edge Detection Today’s readings Cipolla and Gee Watt,
Image Filtering with GLSL
IT472 Digital Image Processing
Presentation transcript:

6/4/2016© 2009 Raymond P. Jefferis III Lect Geographic Information Processing Attribute Plotting Extracting data features Calculating derivatives Edge sharpening Nearest neighbor analysis Gradient calculations Laplacian filtering Chester County, PA W076N40 - USGS DTED Data

6/4/2016© 2009 Raymond P. Jefferis III Lect Data Feature Extraction Spatial derivatives Edges Gradients Curvatures

6/4/2016© 2009 Raymond P. Jefferis III Lect Spatial Derivatives Calculate spatial derivative of attribute(s) Can be one- or two-dimensional Result, because of high-pass nature, will have data noise enhanced Convolution is most rapid computation method

6/4/2016© 2009 Raymond P. Jefferis III Lect Definition A spatial derivative is the rate of change of a function of space, f(x,y), with respect to distance in that space. Since geographical images are 2-dimensional, we can define derivatives in both the x-direction and the y-direction independently.

6/4/2016© 2009 Raymond P. Jefferis III Lect Mathematical Representation

6/4/2016© 2009 Raymond P. Jefferis III Lect Image Derivatives Images are not infinitely divisible They are composed of discrete pixels The value of the spatially varying attribute is known only at these pixels. Continuous derivatives must be approximated by discrete derivatives.

6/4/2016© 2009 Raymond P. Jefferis III Lect Discrete Derivatives

6/4/2016© 2009 Raymond P. Jefferis III Lect Problems Data values may be missing Data may contain noise (corrupted attribute values), derivatives accentuate this noise The accuracy of the derivative calculations may depend upon the spatial frequencies of the image. [High rates of change between pixels will cause errors in the derivatives.]

6/4/2016© 2009 Raymond P. Jefferis III Lect Solutions Filter the data, to reduce noise, before taking derivatives. Curve-fit the data [for example using a spline surface] and take derivatives of the resulting smooth curve. Use Savitsky & Golay derivative convolutes (based on curve fitting method) to calculate derivatives with specified smoothing.

6/4/2016© 2009 Raymond P. Jefferis III Lect Savitsky and Golay Reference Abraham Savitsky and Marcel J. E. Golay, “Smoothing and Differentiation of Data by Simplified Least Squares Procedures,” Analytical Chemistry, 36 (8), (July, 1964).

6/4/2016© 2009 Raymond P. Jefferis III Lect D Derivative by Convolution c = {{0, 0, -2, 0, 0}, {0, 0, -1, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 1, 0, 0}, {0,0, 2, 0, 0}}; g = {{205, 205, 205, 205, 205, 205, 205}, {205, 205, 205, 204, 205, 205, 205}, {205, 205, 205, 203, 205, 205, 205}, {205, 205, 205, 202, 205, 205, 205}, {205, 205, 205, 201, 205, 205, 205}, {205, 205, 205, 200, 205, 205, 205}, {205, 205, 205, 199, 205, 205, 205}}; h = ListConvolve[c/10, g] output = {{0, 1, 0}, {0, 1, 0}, {0, 1, 0}} c = convolute g = data h = program step to filter data

6/4/2016© 2009 Raymond P. Jefferis III Lect Detecting Edges Derivatives –Act as high-pass spatial filters –Increase noise - results need smoothing Convolution –Derivative kernel (arbitrary size) –Sobel kernels (3 x 3 arrays) One for x-direction One for y-direction

6/4/2016© 2009 Raymond P. Jefferis III Lect Two-Dimensional Derivatives For data field, f(x,y), the derivative vector is defined as: Where,

6/4/2016© 2009 Raymond P. Jefferis III Lect Notes G x is convolution giving x-gradient G y is convolution giving y-gradient Actual gradient is vector sum of these (See next slide for polar coordinate vector)

6/4/2016© 2009 Raymond P. Jefferis III Lect Derivative Magnitude and Direction Can produce gradient vector at each point.

6/4/2016© 2009 Raymond P. Jefferis III Lect Computing Gradients Nearest neighbor differencing –Follows the previous definition –Amplifies data noise (no smoothing) Convolution –Uses special kernels –Can do smoothing simultaneously –Rapid computations (parallel processing)

6/4/2016© 2009 Raymond P. Jefferis III Lect Sobel Convolutes Kernel for generating G y (Sobel gradient template for y-direction) Kernel for generating G x (Sobel gradient template for x-direction)

6/4/2016© 2009 Raymond P. Jefferis III Lect Malvern Calculation Examples Malvern quadrangle Raw elevations pixels 7.5"x7.5" no filtering

6/4/2016© 2009 Raymond P. Jefferis III Lect Sobel Edge Sharpening - x-dir Malvern quadrangle Sobel convolute 3 x 3 array x-direction No prefiltering Accentuates features with steep gradient in x-direction

6/4/2016© 2009 Raymond P. Jefferis III Lect Sobel Edge Sharpening - y-dir Malvern quadrangle Sobel convolute 3 x 3 array y-direction No prefiltering Note edges of Great Valley are accentuated

6/4/2016© 2009 Raymond P. Jefferis III Lect Gradient Vectors (Sobel) Surface gradients calculated from 3x3 Sobel convolutes

6/4/2016© 2009 Raymond P. Jefferis III Lect Savitsky & Golay Convolutes Ref: Analytical Chemistry, 36(8), (1964) 1st derivative convolutes with quadratic smoothing for 7-point computation: h(i)={ -3, -2, -1, 0, 1, 2, 3 } Performs some noise reduction, due to quadratic curve fitting process. Convolution kernel arrays follow:

6/4/2016© 2009 Raymond P. Jefferis III Lect Savitsky & Golay Arrays Kernel for generating G y (quadratic smoothing) Kernel for generating G x (quadratic smoothing)

6/4/2016© 2009 Raymond P. Jefferis III Lect Malvern Quadrangle (Sav./ Gol.) Surface gradient directions calculated by 7-point Savitsky & Golay convolutes

6/4/2016© 2009 Raymond P. Jefferis III Lect Comparison Sobel convolutes –Small arrays (3 x 3) –Some noise remains Savitsky & Golay convolutes –Can use larger arrays (7 x 7 and larger) –More noise reduction

6/4/2016© 2009 Raymond P. Jefferis III Lect Spatial Curvature Second derivative Laplacian operator ( ) on image, I(x,y) Must be (Gaussian) filtered to remove noise caused by high-pass characteristics

6/4/2016© 2009 Raymond P. Jefferis III Lect Laplace-of-Gaussian Filter

6/4/2016© 2009 Raymond P. Jefferis III Lect Laplacian Convolution Kernel

6/4/2016© 2009 Raymond P. Jefferis III Lect Laplacian Image Processing Comments: Peaks accentuated Hills steeper Valleys more pronounced

6/4/2016© 2009 Raymond P. Jefferis III Lect Accentuated Surface Features

6/4/2016© 2009 Raymond P. Jefferis III Lect Comparison NormalLaplacian Note: Laplacian filtered image has more accentuated surface features.

6/4/2016© 2009 Raymond P. Jefferis III Lect Discussion