1 數位影像處理基本原理 2.1 視覺構成 2.2 光與電磁頻譜 2.3 影像感測與擷取...

Click here to load reader

download 1 數位影像處理基本原理 2.1 視覺構成 2.2 光與電磁頻譜 2.3 影像感測與擷取 2.4 影像取樣與量化 2.5 影像元素間之基本關係 2.6 線性與非線性運算.

of 24

  • date post

    22-Dec-2015
  • Category

    Documents

  • view

    272
  • download

    1

Transcript of 1 數位影像處理基本原理 2.1 視覺構成 2.2 光與電磁頻譜 2.3 影像感測與擷取...

  • Slide 1
  • 1 2.1 2.2 2.3 2.4 2.5 2.6
  • Slide 2
  • 2 2.1 2.1.1 1. (1) (Cornea and Sclera outer cover) (2) (Choroid) (3) (Retina) 2. (Pupil) - (Iris Diaphragm) 3. (Lens) - 60-70% , 6% , 4. (Light receptors) (1)Cones - (6-7 millions) Photopic or Bright-light Vision (2)Rods - (75-150 millions) Scotopic or Dim-light Vision
  • Slide 3
  • 3 2.1.2 Fovea (Light receptor)
  • Slide 4
  • 4 2.2 1.
  • Slide 5
  • 5 2. = c/ c = 2.998 x 108 m/s E=hv Plancks constant h = 6.626196 x 10-34 J-s
  • Slide 6
  • 6 3. ~0.43m (violet)0.79 m (red) (Chromatic and Achromatic) (Radiance) - Energy, (W) (Luminance) - Observed energy, (Lm) (Brightness) Subjective light perception
  • Slide 7
  • 7 2.3 (Photodiode) Microdensitometers CAT, MRI, PET
  • Slide 8
  • 8 (Image) - f(x,y) 0 < f(x,y) < f(x,y) f(x,y) = i(x,y) r(x,y) i(x,y) (Illumination) 0 < i(x,y) < r(x,y) (Reflectance) 0 < r(x,y) < 1
  • Slide 9
  • 9 r(x,y) i(x,y) i 90,000 lm/m2 i 10,000 lm/m2 i 0.1 lm/m2 i 1000 lm/m2 r 0.01 r 0.65 r 0.90 r 0.93
  • Slide 10
  • 10 f (x0,y0) (Gray Level, l) l = f(x0,y0) Lmin < l < Lmax Lmin = imin rmin, Lmax = imax rmax, [Lmin, Lmax] (Gray Scale) [0,L] 0 L
  • Slide 11
  • 11 2.4
  • Slide 12
  • 12 (Sampling).. (Quantization)..
  • Slide 13
  • 13
  • Slide 14
  • 14 b = k N M
  • Slide 15
  • 15
  • Slide 16
  • 16 (Nearest neighbor interpolation) (Bilinear interpolation) v(x,y) = ax+by+cxy+d
  • Slide 17
  • 17 2.5 (Neighbors) 1. f(x,y) p q S 2. N4(p) (4-neighbors of p) (x+1, y) (x-1, y) (x, y+1) (x, y-1) 3. ND (p) (4- diagonal neighbors of p) (x+1, y+1) (x-1, y-1) (x-1, y+1) (x+1, y-1) 4. N8(p) (8-neighbors of p) N8(p) = N4(p) ND(p)
  • Slide 18
  • 18 (Adjacent) 1. (4-adjacency) q N4(p) p q p q 2. (8-adjacency) q N8(p) p q p q 3.m (m-adjacency) p q (1).q N4(p) (2).q ND(p) N4(p)N4(q)
  • Slide 19
  • 19 1. S1,S2 S1 S2 2. p q (Path) (x0, y0), (x1, y1),..., (xn, yn), p q n (Length) 3. S p,q p q (Connected)
  • Slide 20
  • 20 (Distance measures) 1. (Distance function) p, q, z (x,y), (s,t), (u,v) (1). D(p,q) 0 ( D(p,q) = 0 iff p = q ) (2). D(p,q) D(q,p), and (3). D(p,z) D(p,q) + D(q,z) 2. (Euclidean distance) De(p,q) = [ (x - s)2 + (y - t)2 ]1/2 3.D4 (D4 distance) D4 = x - s + y - t 4.D8 (D8 distance) D8 = max(x - s,y - t)
  • Slide 21
  • 21 5. D4 D8 m-
  • Slide 22
  • 22 1. p + q, p - q, p * q, p q 2. AND: p AND q OR: p OR q COMPLEMENT: NOT q EXCLUSIVE OR: XOR q 3. (1). (Pixel-by-pixel operation) (2). (Neighborhood oriented operation) 4. (Mask operation)
  • Slide 23
  • 23
  • Slide 24
  • 24 2.6 H H H (Linear Operator) H (Nonlinear Operator) H(a f + b g) = a H(f) + b H(g) f g