• Tidak ada hasil yang ditemukan

Introduction to Computer Vision

N/A
N/A
Protected

Academic year: 2025

Membagikan "Introduction to Computer Vision"

Copied!
35
0
0

Teks penuh

(1)

Introduction to Computer Vision

Lecture 4

Pixel-wise operations and Histograms

(2)

Pixel-wise operations

I[i,j] : gray-value at pixel (i,j)

0 50 61 22 11 11

0 1 2 3 4 5

0 2 200 6 8 10

0 3 250 9 12 15

21 4 8 12 101 20

10 5 10 15 20 25

i

j

(3)

Pixel-wise operations

I[i,j] : gray-value at pixel (i,j)

0 50 61 22 11 11

0 1 2 3 4 5

0 2 200 6 8 10

0 3 250 9 12 15

21 4 8 12 101 20

10 5 10 15 20 25

i

I[i,j]=I[2,4]= 8

j

(4)

Pixel-wise operations

Pixel-wise operations I -> J

J[i,j] = I[i,j] + 10 for all i,j

0 50 61 22 11 11

0 1 2 3 4 5

0 2 200 6 8 10

0 3 250 9 12 15

21 4 8 12 101 20

10 5 10 15 20 25

i

j

(5)

Pixel-wise operations

Pixel-wise operations I -> J

J[i,j] = I[i,j] + 10 for all i,j J[i,j] = I[i,j] * 2 for all i,j

0 50 61 22 11 11

0 1 2 3 4 5

0 2 200 6 8 10

0 3 250 9 12 15

21 4 8 12 101 20

10 5 10 15 20 25

i

j

(6)

Pixel-wise operations

Pixel-wise operations I -> J

J[i,j] = I[i,j] + 10 for all i,j J[i,j] = I[i,j] * 2 for all i,j J[i,j] = I[i,j] / 2 + 10

0 50 61 22 11 11

0 1 2 3 4 5

0 2 200 6 8 10

0 3 250 9 12 15

21 4 8 12 101 20

10 5 10 15 20 25

i

j

(7)

Pixel-wise operations

Pixel-wise operations I -> J

J[i,j] = I[i,j] + 10 for all i,j J[i,j] = I[i,j] * 2 for all i,j J[i,j] = I[i,j] / 2 + 10

J[i,j] = log(I(i,j)) for all i,j

0 50 61 22 11 11

0 1 2 3 4 5

0 2 200 6 8 10

0 3 250 9 12 15

21 4 8 12 101 20

10 5 10 15 20 25

i

j

(8)

Pixel-wise operations

Pixel-wise operations I -> J

J[i,j] = I[i,j] + 10 for all i,j J[i,j] = I[i,j] * 2 for all i,j J[i,j] = I[i,j] / 2 + 10

J[i,j] = log(I(i,j)) for all i,j

0 50 61 22 11 11

0 1 2 3 4 5

0 2 200 6 8 10

0 3 250 9 12 15

21 4 8 12 101 20

10 5 10 15 20 25

i

j

(9)

Pixel-wise operations

Pixel-wise operations I -> J

J[i,j] = f(I[i,j]) for all i,j

0 50 61 22 11 11

0 1 2 3 4 5

0 2 200 6 8 10

0 3 250 9 12 15

21 4 8 12 101 20

10 5 10 15 20 25

i

j

(10)

Image Histograms

(11)

Image Histograms

0 5 6 2 1 1

0 1 2 3 4 7

0 2 2 6 8 6

0 3 2 7 2 6

1 4 8 2 1 2

0 5 1 5 2 2

Consider a 3-bit image:

I[i,j] {0,1,2,3,4,5,6,7}

histogram:

[ ?, ?, ?, ?, ?, ?, ?, ?]

0 1 2 3 4 5 6 7

(12)

Image Histograms

0 5 6 2 1 1

0 1 2 0 4 7

0 2 2 6 8 6

0 3 2 7 2 0

1 4 8 2 1 2

4 5 1 5 2 2

Consider a 3-bit image:

I[i,j] {0,1,2,3,4,5,6,7}

histogram:

[ ?, ?, ?, ?, ?, ?, ?, ?]

0 1 2 3 4 5 6 7

(13)

Image Histograms

0 5 6 2 1 1

0 1 2 0 4 7

0 2 2 6 8 6

0 3 2 7 2 0

1 4 8 2 1 2

4 5 1 5 2 2

Consider a 3-bit image:

I[i,j] {0,1,2,3,4,5,6,7}

histogram:

[6, ?, ?, ?, ?, ?, ?, ?]

0 1 2 3 4 5 6 7

(14)

Image Histograms

0 5 6 2 1 1

0 1 2 0 4 7

0 2 2 6 6 6

0 3 2 7 2 0

1 4 7 2 1 2

4 5 1 5 2 2

Consider a 3-bit image:

I[i,j] {0,1,2,3,4,5,6,7}

histogram:

[6, 6,10, 1, 3, 3, 4, 3]

0 1 2 3 4 5 6 7

(15)

Image Histograms

0 5 6 2 1 1

0 1 2 0 4 7

0 2 2 6 6 6

0 3 2 7 2 0

1 4 7 2 1 2

4 5 1 5 2 2

Consider a 3-bit image:

I[i,j] {0,1,2,3,4,5,6,7}

histogram:

[6, 6,10, 1, 3, 3, 4, 3]

0 1 2 3 4 5 6 7

hist = [6, 6,10, 1, 3, 3, 4, 3]

hist[v] =

|

{(i,j) | I[i,j] = v}

|

(16)

Image Histograms

0 5 6 2 1 1

0 1 2 0 4 7

0 2 2 6 6 6

0 3 2 7 2 0

1 4 7 2 1 2

4 5 1 5 2 2

[6, 6,10, 1, 3, 3, 4, 3]

0 1 2 3 4 5 6 7

10 9 8 7 6 5 4 3 2 1

(17)

Image Histograms

0 5 6 2 1 1

0 1 2 0 4 7

0 2 2 6 6 6

0 3 2 7 2 0

1 4 7 2 1 2

4 5 1 5 2 2

[6, 6,10, 1, 3, 3, 4, 3]

0 1 2 3 4 5 6 7

10 9 8 7 6 5 4 3 2 1

Area under histogram = ?

(18)

Image Histograms

0 5 6 2 1 1

0 1 2 0 4 7

0 2 2 6 6 6

0 3 2 7 2 0

1 4 7 2 1 2

4 5 1 5 2 2

[6, 6,10, 1, 3, 3, 4, 3]

0 1 2 3 4 5 6 7

10 9 8 7 6 5 4 3 2 1

Area under histogram = # of pixels

(19)

Algorithms

(20)

Normalized Histogram

hist[v] = | {(i,j) | I[i,j] = v} |

norm_hist[v] = | {(i,j) | I[i,j] = v} | / (#pixels)

(21)

Normalized Histogram

hist[v] = | {(i,j) | I[i,j] = v} |

norm_hist[v] = | {(i,j) | I[i,j] = v} | / (#pixels)

= | {(i,j) | I[i,j] = v} | / (area-under-histogram)

(22)

Normalized Histogram

hist[v] = | {(i,j) | I[i,j] = v} |

norm_hist[v] = | {(i,j) | I[i,j] = v} | / (#pixels)

= | {(i,j) | I[i,j] = v} | / (area-under-histogram)

● Area under normalized-histogram?

(23)

Cumulative Histograms

hist[v] = | {(i,j) | I[i,j] = v} |

cumhist[v] = | {(i,j) | I[i,j] ≤ v} |

(24)

Cumulative Histograms

hist[v] = | {(i,j) | I[i,j] = v} |

cumhist[v] = | {(i,j) | I[i,j] ≤ v} |

hist = [6, 6,10, 1, 3, 3, 4, 3]

cumhist = ?

(25)

Cumulative Histograms

hist[v] = | {(i,j) | I[i,j] = v} |

cumhist[v] = | {(i,j) | I[i,j] ≤ v} |

hist = [6, 6,10, 1, 3, 3, 4, 3]

cumhist = [6,12,22,23,26,29,33,36]

(26)

Information inferred

Dynamic range

Underexposed and Overexposed (saturated) images

(27)

Brightness

(28)

Properties

Pixel Location?

(29)

Contrast

(30)

Over-exposed images

(31)

Intensity Windowing

(32)

Histogram Equalization

(33)

Binning

(34)

Color Histograms

(35)

References

CS 545/ECE 545 Digital Image Processing, Spring Semester 2014, Prof Emmanuel Agu

Digital Image Processing: Bernd Girod, 2013 Stanford University

Referensi

Dokumen terkait

Implementasi grading kualitas kopi dengan teknik image processing bisa diimplementasikan dengan menggunakan sample kopi arabica, teknik treshold mampu membaca grading

As the developments in the field of computer vision are related closely to image processing and machine learning, it can be used to more extensive areas of studies to predict or detect

Received: 31 March 2000; Revised: 4 October 2000 KEY WORDS: textile; quality control; texture segmentation; computer vision; image processing; fabric inspection system Introduction

The steps in image processing are import image or directly from digital photography, analysis and manipulation of the image by accomplished using various specialized software

Different kinds of noise • We said that Gaussian averaging was a reasonable thing to do if the noise was independent at each pixel and centered about zero such as if created by a

Form 5a_Course Specifications _SSRP_1 JULY 2013 Page 5 NQF Learning Domains And Course Learning Outcomes Course Teaching Strategies Course Assessment Methods 1.0 Knowledge

Laporan Akhir Projek Penyelidikan Jangka Pendek Image Data Compression using DCT Discrete Cosine Transform and Interpolation and Allied Topics in Digital Image Processing Applied to

This document provides an introduction to texturing, including its definition, need, types, and image texture