1 / 25

Chapter 5

Chapter 5. Digital Image Processing Fundamentals. Learning Goals. The human visual system Digitizing images Display of Images. Trading an eye for an ear. An eye is a Multi-mega pixel camera. It has a lens (adjustable zoom) It has an automatic f-stop (iris 2-8 mm)

hubert
Download Presentation

Chapter 5

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Chapter 5 Digital Image Processing Fundamentals

  2. Learning Goals • The human visual system • Digitizing images • Display of Images

  3. Trading an eye for an ear

  4. An eye is a Multi-mega pixel camera • It has a lens (adjustable zoom) • It has an automatic f-stop (iris 2-8 mm) • It has a sensor plane (100 million pixels) • The sensor has a transfer function senstive to mesopic range; 380 to about 700 nm

  5. The eyes have a USB2 data rate! • 250,000 neurons in the optic nerve • variable voltage output on EACH nerve • 17.5 million neural samples per second • 12.8 bits per sample • 224 Mbps, per eye (a 1/2 G bps system!). • Compression using lateral inhibition between the retinal neurons

  6. Response curves • Eye has Gaussian response to light. • Gives rise to biologically motivated image processing

  7. Quantization of an Image • Computers use digital cameras -> quantization

  8. Sampling an Image

  9. Sampling=convolution w pulse train

  10. Quantization Error is visible

  11. Displays • Color Monitors are made for people

  12. Chapter 6-7 • Opening and Saving Images

  13. Chapter 8 Convolutionwith a kernel, g(x)

  14. Region of Support • The region of support is defined as that area of the .kernel which is non-zero • linear convolution:=signal has infinite extent but kernel has finite support • If function has finite region of support we have compact support

  15. Real images have finite region of support • But we treat them as periodic and infinite! • We repeat kernels so that they have the same period as the images. • We call this cyclic convolution.

  16. Convolution in 2D

  17. Avoid the Mod op

  18. What is wrong with avoiding the mod op? • How do I find the center of the kernel?

  19. Cyclic Convolution

  20. Implementing Convolution for(int y = 0; y < height; y++) { for(int x = 0; x < width; x++) { sum = 0.0; for(int v = -vc; v <= vc; v++) for(int u = -uc; u <= uc; u++) sum += f[cx(x-u) ][cy(y-v)] * k[ u+uc][v+vc]; if (sum < 0) sum = 0; if (sum > 255) sum = 255; h[x][y] = (short)sum; } }

  21. What happens to the image if you ignore the wrap?

  22. Cyclic Convolution keeps the edges

  23. Can you think of a better way to implement convolution? • Keep the edges! • Don’t use the mod operation. • How about growing the image by the size of the kernel*2?

  24. Convolution is slow, how can I speed it up? • JAI! • FFT!? • Other ideas?

More Related