Image Acquisition Image Digitization Spatial domain Intensity domain Image Characteristics

Similar documents
What is an Image? Image Acquisition. Image Processing - Lesson 2. An image is a projection of a 3D scene into a 2D projection plane.

Image Acquisition + Histograms

IMAGING. Images are stored by capturing the binary data using some electronic devices (SENSORS)

1/12/2009. Image Elements (Pixels) Image Elements (Pixels) Digital Image. Digital Image =...

UNIT-2 IMAGE REPRESENTATION IMAGE REPRESENTATION IMAGE SENSORS IMAGE SENSORS- FLEX CIRCUIT ASSEMBLY

Sampling and Reconstruction

Computer Vision. The image formation process

In this lecture. Background. Background. Background. PAM3012 Digital Image Processing for Radiographers

Lecture 12 Color model and color image processing

Digital Image Fundamentals. Prof. George Wolberg Dept. of Computer Science City College of New York

Lecture 4 Image Enhancement in Spatial Domain

ELEC Dr Reji Mathew Electrical Engineering UNSW

Digital Image Processing

Lecture 4. Digital Image Enhancement. 1. Principle of image enhancement 2. Spatial domain transformation. Histogram processing

PSD2B Digital Image Processing. Unit I -V

Digital Image Processing COSC 6380/4393

IMAGE ENHANCEMENT IN THE SPATIAL DOMAIN

Introduction to color science

Schools of thoughts on texture

IMAGE ENHANCEMENT in SPATIAL DOMAIN by Intensity Transformations

Ulrik Söderström 17 Jan Image Processing. Introduction

Motivation. Gray Levels

Vivekananda. Collegee of Engineering & Technology. Question and Answers on 10CS762 /10IS762 UNIT- 5 : IMAGE ENHANCEMENT.

Minimizing Noise and Bias in 3D DIC. Correlated Solutions, Inc.

Physical Color. Color Theory - Center for Graphics and Geometric Computing, Technion 2

EEM 463 Introduction to Image Processing. Week 3: Intensity Transformations

Visible Color. 700 (red) 580 (yellow) 520 (green)

Estimating the wavelength composition of scene illumination from image data is an

Lecture 4: Spatial Domain Transformations

Motivation. Intensity Levels

Image Enhancement in Spatial Domain (Chapter 3)

Basic relations between pixels (Chapter 2)

Feature extraction. Bi-Histogram Binarization Entropy. What is texture Texture primitives. Filter banks 2D Fourier Transform Wavlet maxima points

Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)

Intensity Transformation and Spatial Filtering

Digital Image Analysis and Processing

Digital Image Fundamentals

Lecture 2 Image Processing and Filtering

Image Processing using LabVIEW. By, Sandip Nair sandipnair.hpage.com

EE795: Computer Vision and Intelligent Systems

Image Enhancement in Spatial Domain. By Dr. Rajeev Srivastava

Chapter 3: Intensity Transformations and Spatial Filtering

CS 548: Computer Vision and Image Processing Digital Image Basics. Spring 2016 Dr. Michael J. Reale

Lecture 1 Image Formation.

Introduction to Computer Vision. Human Eye Sampling

CS 111: Digital Image Processing Fall 2016 Midterm Exam: Nov 23, Pledge: I neither received nor gave any help from or to anyone in this exam.

Lecture 3 - Intensity transformation

CS4442/9542b Artificial Intelligence II prof. Olga Veksler

CS4442/9542b Artificial Intelligence II prof. Olga Veksler

The main goal of Computer Graphics is to generate 2D images 2D images are continuous 2D functions (or signals)

Chapter 2 - Fundamentals. Comunicação Visual Interactiva

Anti-aliasing. Images and Aliasing

Digital Image Processing

Digital Image Processing. Introduction

Intensity Transformations and Spatial Filtering

Motivation. The main goal of Computer Graphics is to generate 2D images. 2D images are continuous 2D functions (or signals)

Color Vision. Spectral Distributions Various Light Sources

Today. Anti-aliasing Surface Parametrization Soft Shadows Global Illumination. Exercise 2. Path Tracing Radiosity

CSE 167: Lecture #7: Color and Shading. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2011

Introduction to Digital Image Processing

Digital Image Processing. Prof. P.K. Biswas. Department of Electronics & Electrical Communication Engineering

Color and Shading. Color. Shapiro and Stockman, Chapter 6. Color and Machine Vision. Color and Perception

Image Processing. Bilkent University. CS554 Computer Vision Pinar Duygulu

Digital Image Processing

Processing of binary images

Color Image Processing

Image Processing Lecture 10

Prof. Fanny Ficuciello Robotics for Bioengineering Visual Servoing

CS4733 Class Notes, Computer Vision

Main topics in the Chapter 2. Chapter 2. Digital Image Representation. Bitmaps digitization. Three Types of Digital Image Creation CS 3570

Pop Quiz 1 [10 mins]

lecture 19 Shadows - ray tracing - shadow mapping - ambient occlusion Interreflections

Edge Detection. Announcements. Edge detection. Origin of Edges. Mailing list: you should have received messages

Introduction to Digital Image Processing

Colour Reading: Chapter 6. Black body radiators

HISTOGRAMS OF ORIENTATIO N GRADIENTS

CS 4495 Computer Vision. Segmentation. Aaron Bobick (slides by Tucker Hermans) School of Interactive Computing. Segmentation

Sampling, Aliasing, & Mipmaps

Anno accademico 2006/2007. Davide Migliore

CS635 Spring Department of Computer Science Purdue University

EECS490: Digital Image Processing. Lecture #22

Sampling, Aliasing, & Mipmaps

Chapter - 2 : IMAGE ENHANCEMENT

Visualization Computer Graphics I Lecture 20

Image Enhancement: To improve the quality of images

Digital Image Processing (EI424)

One image is worth 1,000 words

Lecture 16: Computer Vision

Digital Image Processing

Lecture 16: Computer Vision

Colour computer vision: fundamentals, applications and challenges. Dr. Ignacio Molina-Conde Depto. Tecnología Electrónica Univ.

Computer Assisted Image Analysis TF 3p and MN1 5p Lecture 1, (GW 1, )

Digital Image Processing COSC 6380/4393. Lecture 19 Mar 26 th, 2019 Pranav Mantini

Color. making some recognition problems easy. is 400nm (blue) to 700 nm (red) more; ex. X-rays, infrared, radio waves. n Used heavily in human vision

3D graphics, raster and colors CS312 Fall 2010

Computer Vision. Image Segmentation. 10. Segmentation. Computer Engineering, Sejong University. Dongil Han

Range Imaging Through Triangulation. Range Imaging Through Triangulation. Range Imaging Through Triangulation. Range Imaging Through Triangulation

ECE 178: Introduction (contd.)

Introduction to Computer Vision. Introduction CMPSCI 591A/691A CMPSCI 570/670. Image Formation

Transcription:

Image Acquisition Image Digitization Spatial domain Intensity domain Image Characteristics 1

What is an Image? An image is a projection of a 3D scene into a 2D projection plane. An image can be defined as a 2 variable function f(x,y): R 2 R, where for each position (x,y) in the projection plane, f(x,y) defines the light intensity at this point. 2

Image as a function 3

Image Acquisition i(x,y) g(i,j) f(x,y)=i(x,y) r(x,y) r(x,y) pixel=picture element 4

Acquisition System World Camera Digitizer Digital Image CMOS sensor 5

Image Types Three types of images: Binary images g(x,y) {0, 1} Gray-scale images Color Images g(x,y) C typically c={0,,255} three channels: g R (x,y) C g G (x,y) C g B (x,y) C 6

Gray Scale Image y = 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 x = 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 210 209 204 202 197 247 143 71 64 80 84 54 54 57 58 206 196 203 197 195 210 207 56 63 58 53 53 61 62 51 201 207 192 201 198 213 156 69 65 57 55 52 53 60 50 216 206 211 193 202 207 208 57 69 60 55 77 49 62 61 221 206 211 194 196 197 220 56 63 60 55 46 97 58 106 209 214 224 199 194 193 204 173 64 60 59 51 62 56 48 204 212 213 208 191 190 191 214 60 62 66 76 51 49 55 214 215 215 207 208 180 172 188 69 72 55 49 56 52 56 209 205 214 205 204 196 187 196 86 62 66 87 57 60 48 208 209 205 203 202 186 174 185 149 71 63 55 55 45 56 207 210 211 199 217 194 183 177 209 90 62 64 52 93 52 208 205 209 209 197 194 183 187 187 239 58 68 61 51 56 204 206 203 209 195 203 188 185 183 221 75 61 58 60 60 200 203 199 236 188 197 183 190 183 196 122 63 58 64 66 205 210 202 203 199 197 196 181 173 186 105 62 57 64 63 7

Color Image 8

Notations Image Intensity - Light energy emitted from a unit area in the image Device dependence Image Brightness - The subjective appearance of a unit area in the image Context dependence Subjective Image Gray-Level - The relative intensity at each unit area Between the lowest intensity (Black value) and the highest intensity (White value) Device independent 9

Intensity vs. Brightness 10

Intensity vs. Brightness 11

Intensity vs. Brightness f 1 < f 2, f 1 = f 2 Intensity f 1 f1 f 2 f2 Equal intensity steps: Equal brightness steps: 12

Weber Law Describe the relationship between the physical magnitudes of stimuli and the perceived intensity of the stimuli. In general, f needed for just noticeable difference (JND) over background f was found to satisfy: f = f const Brightness log(f) 13

What about Color Space? JND in XYZ color space was measured by Wright and Pitt, and MacAdam in the thirties MacAdam ellipses: JND plotted at the CIE-xy diagram Conclusion: measuring perceptual distances in the cie-xyz space is not a good idea

Perceptually Uniform Color Space 100 50 v * 0-50 -100-150 -150-100 -50 0 50 100 150 200 u * MacAdam Ellipses of JND plotted in CIE- L * u * v * Coordinates:

Acquisition System World Camera Digitizer Digital Image CMOS sensor 16

Digitization Two stages in the digitization process: Spatial sampling: Spatial domain Quantization: Gray level f x 1 2 3 4 5 j 1 100 100 100 100 100 y Continuous Image f(x,y) x,y R f(x,y) R i 2 3 4 5 100 0 0 0 100 100 0 0 0 100 100 0 0 0 100 100 100 100 100 100 Digital Image g(i,j) C g(i,j) in finite set of values i,j = 1,2,3,...,c 17

Spatial Sampling When a continuous scene is imaged on the sensor, the continuous image is divided into discrete elements - picture elements (pixels)

Spatial Sampling Two principles: coverage of the image plane uniform sampling (pixels are same size and shape)

Spatial Sampling N = 4 N = 8 N = 16 N = 32 N = 64 N = 128

Sampling - Image Resolution The density of the sampling denotes the separation capability of the resulting image Image resolution defines the finest details that are still visible by the image Cyclic patterns test separation capability of an image Frequency = Wavelength number of cycles unit length = 1 frequency 0 x

Sampling Rate

Nyquist Frequency Nyquist Rule: To observe details at frequency f (wavelength d) one must sample at frequency > 2f (sampling intervals < d/2) The Frequency 2f is the Nyquist Frequency. Aliasing: If the pattern wavelength is less than 2d erroneous patterns may be produced. 1D Example: 0

Aliasing - Moiré Patterns

Aliasing - Moiré Patterns +

Temporal Aliasing

Temporal Aliasing Example

Image De-mosaicing Can we do better than Nyquist?

Image De-mosaicing Basic idea: use correlations between color bands A joint Histogram of r x v.s. g x 500 450 400 Green derivative 350 300 250 200 150 100 50 100 200 300 400 500 Red derivative

Non Uniform Sampling 0 120 121 63 64 122 63 62 2 3

Quantization Choose number of gray levels (according to number of assigned bits) Divide continuous range of intensity values

Quantization Number of Gray Levels

Quantization Low freq. areas are more sensitive to quantization 8 bits image 4 bits image

How should we quantize an image? Simplest approach: uniform quantization 10 Z i+ 1 q Z i i = Z Z k Z K + Z 2 i 1 i = + 0 Gray-Level 8 6 4 2 0 0 10 20 30 40 50 60 70 80 90 100 Sensor Voltage q 0 q 1 q 2 q 3........ q k-1 Z 0 Z 1 Z 2 Z 3 Z 4.... Z k-1 Z k quantization level sensor voltage

Non-uniform Quantization Quantize according to visual sensitivity (Weber s Law) q 0 q 1 q 2 q 3 q 4 q 5 q 6 Z 0 Z 1 Z 2 Z 3 Z 4 Z 5 Z 6 Z 7 High Visual Sensitivity Low Visual Sensitivity

Non-uniform Quantization Non uniform sensor voltage distribution sensor voltage Z 0 q 1 q 2 q 3 q 4 q 5 Z k quantization level

Optimal Quantization (Lloyd-Max) Content dependant Minimize quantization error q 0 q 1 q 2 q 3 quantization level sensor voltage Z 0 Z 1 Z 2 Z 3 Z 4

Optimal Quantization (Lloyd-Max) Also known as Loyd-Max quantizer Denote P(z) the probability of sensor voltage The quantization error is : E = k 1 i= 0 z i+ 1 z i P ( )( ) 2 z z q dz i Solution: demo q i = z i+ 1 z z i i+ 1 z i zp P ( z) ( z) dz dz z i q + q 2 i 1 i = Iterate until convergence (but optimal minimum is not guaranteed).

Example 8 bits image 4 bits image Uniform quantization 4 bits image Optimal quantization

Color Quantization Typically 256 levels for each Red, Greed, Blue channels, or 256 3 = 16777216 colors. How can an image be displayed with fewer colors than it contains? Select a subset of colors (the colormap or pallet) and map the rest of the colors to them. 24 bit 4 bit (16 colors) from: Daniel Cohen-Or

Digital Grayscale Image Digitization: Sampling Quantization y = 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 x = 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 210 209 204 202 197 247 143 71 64 80 84 54 54 57 58 206 196 203 197 195 210 207 56 63 58 53 53 61 62 51 201 207 192 201 198 213 156 69 65 57 55 52 53 60 50 216 206 211 193 202 207 208 57 69 60 55 77 49 62 61 221 206 211 194 196 197 220 56 63 60 55 46 97 58 106 209 214 224 199 194 193 204 173 64 60 59 51 62 56 48 204 212 213 208 191 190 191 214 60 62 66 76 51 49 55 214 215 215 207 208 180 172 188 69 72 55 49 56 52 56 209 205 214 205 204 196 187 196 86 62 66 87 57 60 48 208 209 205 203 202 186 174 185 149 71 63 55 55 45 56 207 210 211 199 217 194 183 177 209 90 62 64 52 93 52 208 205 209 209 197 194 183 187 187 239 58 68 61 51 56 204 206 203 209 195 203 188 185 183 221 75 61 58 60 60 200 203 199 236 188 197 183 190 183 196 122 63 58 64 66 205 210 202 203 199 197 196 181 173 186 105 62 57 64 63