Download to read offline
![• Distance measures – Euclidean distance – City-block distance – Chessboard distance 2 1 2 2 ] ) ( ) [( ) , ( t y s x q p De | ) ( | | ) ( | ) , ( 4 t y s x q p D |) ) ( | |, ) ( max(| ) , ( 8 t y s x q p D ](https://image.slidesharecdn.com/chap2-240311152425-76b07b67/75/digital-image-processing-chapter-two-fundamentals-39-2048.jpg)
digital image processing chapter two, fundamentals
- 1. Digital Image Processing Chapter2: Digital Image Fundamentals
- 2. Elements of VisualPerception • Structure of the human eye
- 3. • Rods andcones in the retina
- 4. • Image formationin the eye
- 5. • Brightness adaptationand discrimination
- 6.
- 7.
- 8.
- 9.
- 10.
- 11. Light and theElectromagnetic Spectrum
- 12.
- 13. Image Sensing andAcquisition
- 14. • Image acquisitionusing a single sensor
- 15. • Using sensorstrips
- 16. A simple imageformation model
- 17. • Illumination andreflectance • Illumination and transmissivity ) , ( ) , ( ) , ( y x r y x i y x f
- 18. Image Sampling andQuantization
- 19.
- 20. • Representing digitalimages
- 22. • Saturation andnoise
- 23. • Number ofstorage bits
- 24. • Spatial andgray-level resolution
- 25.
- 26.
- 27.
- 28.
- 29. • N andk in different-details images
- 30.
- 31.
- 32.
- 33. Some Basic RelationshipsBetween Pixels • Neighbors of a pixel – : 4-neighbors of p , , , : four diagonal neighbors of p , , , : 8-neighbors of p and ) ( 4 p N ) , 1 ( y x ) 1 , ( y x ) , 1 ( y x ) 1 , ( y x ) 1 , 1 ( y x ) 1 , 1 ( y x ) 1 , 1 ( y x ) 1 , 1 ( y x ) (p ND ) ( 8 p N ) ( 4 p N ) (p ND
- 34. • Adjacency – :The set of gray-level values used to define adjacency – 4-adjacency: Two pixels p and q with values from V are 4-adjacency if q is in the set – 8-adjacency: Two pixels p and q with values from V are 8-adjacency if q is in the set V ) ( 4 p N ) ( 8 p N
- 35. – m-adjacency (mixedadjacency): Two pixels p and q with values from V are m-adjacency if • q is in , or • q is in and the set has no pixels whose values are from V ) ( 4 p N ) (p ND ) ( ) ( 4 4 q N p N
- 37. • Subset adjacency –S1 and S2 are adjacent if some pixel in S1 is adjacent to some pixel in S2 • Path – A path from p with coordinates to pixel q with coordinates is a sequence of distinct pixels with coordinates – , ,…, where = , = , and pixels and are adjacent ) , ( y x ) , ( t s ) , ( 0 0 y x ) , ( 1 1 y x ) , ( n n y x ) , ( 0 0 y x ) , ( y x ) , ( n n y x ) , ( t s ) , ( i i y x ) , ( 1 1 i i y x
- 38. • Region – Wecall R a region of the image if R is a connected set • Boundary – The boundary of a region R is the set of pixels in the region that have one or more neighbors that are not in R • Edge – Pixels with derivative values that exceed a preset threshold
- 39. • Distance measures –Euclidean distance – City-block distance – Chessboard distance 2 1 2 2 ] ) ( ) [( ) , ( t y s x q p De | ) ( | | ) ( | ) , ( 4 t y s x q p D |) ) ( | |, ) ( max(| ) , ( 8 t y s x q p D
- 40. m D distance: Theshortest m-path between the points
- 41. An Introduction tothe Mathematical Tools Used in Digital Image Processing • Linear operation – H is said to be a linear operator if, for any two images f and g and any two scalars a and b, ) ( ) ( ) ( g bH f aH bg af H
- 42.
- 43.
- 44.
- 45.
- 46.
- 47.
- 48.
- 49.
- 50.
- 51.
- 52.
- 53.
- 54.
- 55.
- 56.
- 57.
- 58.