Computer Vision for Robots - Robot Vision and Preception - Lecture Slides, Slides of Computer Science

These are the Lecture Slides of Robot Vision and Preception which includes Transforms, Derived, Fast Fourier, Discrete Fourier Transform, Fast Cosine, Discrete Cosine Transform, Radon Transform, Slant, Karczmarz etc. Key important points are: Computer Vision For Robots, Image Processing, Convolution-Based, Robot Vision, Filters, Convolution Application, Binary Image Creation, Industrial Robotics, Popularly, Pixels Averaging

Typology: Slides

2012/2013

Uploaded on 03/24/2013

dhuha
dhuha ๐Ÿ‡ฎ๐Ÿ‡ณ

4.3

(15)

134 documents

1 / 68

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Image Processing
and Computer
Vision for Robots
Docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31
pf32
pf33
pf34
pf35
pf36
pf37
pf38
pf39
pf3a
pf3b
pf3c
pf3d
pf3e
pf3f
pf40
pf41
pf42
pf43
pf44

Partial preview of the text

Download Computer Vision for Robots - Robot Vision and Preception - Lecture Slides and more Slides Computer Science in PDF only on Docsity!

Image Processing

and Computer

Vision for Robots

Convolution Application

in Robot Vision

  • What is convolution
    • Different filters formed with Convolution
  • Convolution application examples

First few examples what can be

achieved with convolution

Binary Image Creation Popularly used in industrial robotics Docsity.com

Bit per Pixel

Convolution Kernel

  • New Pixel Value Computed

from Neighboring Pixel

Values

  • Convolution of an N x N

Matrix (Kernel) with the

Image

Convolution kernel

  • W
i
  • F (f(x,y))
  • Function of one variable F can be nonlinear, realized in a lookup

table

  • F(f(x

,y

), f(x

,y

),โ€ฆ,f(x

,y

) ) can be highly

complicated and nonlinear function

Example of a More general Convolution

m i,j is individual mask elements

p

ij

is individual image elements in row i and column j

m1,1 m2,1 m3,
m1,2 m2,2 m3,
m1,3 m2,1 m3,

Original Image Mask p1,1 p1,2 p1,3 p1,4 p1,5 p1, p2,1 p2,2 p2,3 p2,4 p2,5 p2, p3,1 p3,2 p3,3 p3,4 p3,5 p (^3) , 6 p4,1 p4,2 p4,3 p4,4 p4,5 p4, p5,1 p5,2 p5,3 p5,4 p5,5 p5, p6,1 p6,2 p6,3 p6,4 p6,5 p6,

More general Convolution (continued) At the heart of convolution operation is the convolution mask or kernel , shown as M(ask) or W(indow) in next figures The quotient is known as the weight of the mask โˆ‘ โˆ‘ โˆ‘ โˆ‘ = = = = ร— = n j ij m i n j ij ij m i m p m Cxy 1 1 1 1 Example of a More general Convolution

Requires

division, too

bad

Filtering by convolution Algorithm

**1. Reads the DN of each pixel in array

  1. Multiplies DN by appropriate weight
  2. Sums the products of (DN x weight) for the nine pixels, and divides sum by 9
  3. Derived value applied to center cell of** **array
  4. Filter moves one pixel to right, and operation is repeated, pixel by pixel, line by line**
No. 3 Docsity.com