Presentation is loading. Please wait.

Presentation is loading. Please wait.

FREQUENTLY USED 3x3 CONVOLUTION KERNELS

Published byCarina Ekström Modified over 4 years ago

Similar presentations

Presentation on theme: "FREQUENTLY USED 3x3 CONVOLUTION KERNELS"— Presentation transcript:

1 FREQUENTLY USED 3x3 CONVOLUTION KERNELS
Averaging Sobel Templates Vertical Edges Horizontal Edges September 15, 1998 Laplacian

2 APPLICATION OF AVERAGING CONVOLUTION TEMPLATE
Original Image 3x3 5x5 7x7 21 x 21 September 15, 1998

3 APPLICATION OF EDGE CONVOLUTION TEMPLATE
Pepper Image Edge Image Tree Image Edge Image September 15, 1998

4 APPLICATION OF LAPLACIAN CONVOLUTION TEMPLATE
Tree Image Edge Image September 15, 1998

Download ppt "FREQUENTLY USED 3x3 CONVOLUTION KERNELS"

Similar presentations

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

Lecture 2: Convolution and edge detection CS4670: Computer Vision Noah Snavely From Sandlot ScienceSandlot Science.
Spatial Filtering (Chapter 3)

Spatial Filtering (Chapter 3)
Topic 6 - Image Filtering - I DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.

Topic 6 - Image Filtering - I DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Motion illusion, rotating snakes. Slide credit Fei Fei Li.

Motion illusion, rotating snakes. Slide credit Fei Fei Li.
October 2, 2014Computer Vision Lecture 8: Edge Detection I 1 Edge Detection.

October 2, 2014Computer Vision Lecture 8: Edge Detection I 1 Edge Detection.
Multimedia communications EG 371Dr Matt Roach Multimedia Communications EG 371 and EE 348 Dr Matt Roach Lecture 6 Image processing (filters)

Multimedia communications EG 371Dr Matt Roach Multimedia Communications EG 371 and EE 348 Dr Matt Roach Lecture 6 Image processing (filters)
Convolution. Spatial Filtering Operations g(x,y) = 1/M  f(n,m) (n,m) in  S Example 3 x 3 5 x 5.

Convolution. Spatial Filtering Operations g(x,y) = 1/M  f(n,m) (n,m) in  S Example 3 x 3 5 x 5.
1 Image filtering Hybrid Images, Oliva et al.,

1 Image filtering Hybrid Images, Oliva et al.,
Original Tree: 9876543210 2000011001000 1000001100100 1700010101010 1200001111000 5231000001011 4000110010000 3500101011110 8441101001100 7751100000111.

Original Tree:
Lappeenranta University of Technology (Finland)

Lappeenranta University of Technology (Finland)
Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering

Edge Detection Phil Mlsna, Ph.D. Dept. of Electrical Engineering
Lecture 1: Images and image filtering

Lecture 1: Images and image filtering
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 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 Image filtering

1 Image filtering
Gholamreza Anbarjafari, PhD Video Lecturers on Digital Image Processing Digital Image Processing Spatial Domain Filtering: Part II.

Gholamreza Anbarjafari, PhD Video Lecturers on Digital Image Processing Digital Image Processing Spatial Domain Filtering: Part II.
Chapter 3 Image Enhancement in the Spatial Domain.

Chapter 3 Image Enhancement in the Spatial Domain.
Image Filtering. Problem! Noise is a problem, even in images! Gaussian NoiseSalt and Pepper Noise.

Image Filtering. Problem! Noise is a problem, even in images! Gaussian NoiseSalt and Pepper Noise.
CHAPTER 7 Template Filters IMAGE ANALYSIS A. Dermanis.

CHAPTER 7 Template Filters IMAGE ANALYSIS A. Dermanis.
2D Image Fourier Spectrum.

2D Image Fourier Spectrum.
Neighborhood Operations

Neighborhood Operations

Similar presentations

Ads by Google