Scribd
Upload
20 views59 pages

Group 1

The document covers the fundamentals of digital image acquisition, including the structure of the human eye, image formation, and visual perception. It discusses various aspects of image processing such as sampling, quantization, pixel relationships, and mathematical tools used in digital image processing. Key concepts include adjacency, distance measures, and linear operations relevant to image manipulation.

Uploaded by

seriousimteaz63
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
20 views59 pages

Group 1

The document covers the fundamentals of digital image acquisition, including the structure of the human eye, image formation, and visual perception. It discusses various aspects of image processing such as sampling, quantization, pixel relationships, and mathematical tools used in digital image processing. Key concepts include adjacency, distance measures, and linear operations relevant to image manipulation.

Uploaded by

seriousimteaz63
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 59

Digital Image

Acquisition

Group No:01
Elements of Visual Perception

 Structure of the
human eye
 Rods and cones in the retina
 Image formation in the eye
 Brightness adaptation and discrimination
 Brightness discrimination
 Weber ratio
 Perceived
brightness
 Simultaneous contrast
 Optical
illusion
Light and the Electromagnetic
Spectrum
 Wavelength
c
=

E = h
 Image acquisition using a single sensor
 Using sensor
strips
 A simple image
formation model
 Illumination and reflectance
 Illumination and transmissivity

f ( x, y) = i( x, y)r ( x, y)
 Sampling and
quantization
 Representing digital images
 Saturation and noise
 Number of storage bits
 Spatial and gray-level resolution
 Subsampled and
resampled
 Reducing spatial
resolution
 Varying the
number of gray
levels
 Varying the
number of gray
levels
 N and k in different-details images
 Isopreference
 Interpolations
 Zooming and
shrinking
Some Basic Relationships
Between Pixels
 Neighbors of a pixel
 : 4-neighbors of p
N 4 ( ,p) , ,
( x + 1, y) ( x − 1, y) ( x, y + 1) ( x, y − 1)
: four diagonal neighbors of p

N D ( p, ) , ,

( x + 1, y + 1) ( x + 1, y −1) ( x −1, y −1)


( x −:18-neighbors
, y + 1) of p
and

N8 ( p)
N 4 ( p) N D ( p)
 Adjacency

V : 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 N ( p)
4
 8-adjacency: Two pixels p and q with values from V are 8-
adjacency if q is in the set N ( p)
8
 m-adjacency (mixed adjacency): Two pixels p and q with
values from V are m-adjacency if
 q is in N 4 ( p) , or
 q is in N D ( p)and the set N 4 ( p)  N 4 (q)
has no pixels whose values are from V
 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 ( x, y) to pixel q with coordinates ( s, t )
is a sequence of distinct pixels with coordinates
 ( x0 , y0 ) ,( x1 , y1 ) ,…, ( xn , y n )
where ( x0 , y0 )= ( x, y) , ( xn , y n ) = (s, t ) ,

and pixels ( xi , yi ) and ( xi −1 , yi −1 ) are adjacent


 Region
 We call 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
 Distance measures
 Euclidean distance
1
De ( p, q) = [( x − s ) 2 + ( y − t ) ]
2 2

 City-block distance

D4 ( p, q) =| ( x − s) | + | ( y − t ) |
 Chessboard distance

D8 ( p, q) = max(| ( x − s) |, | ( y − t ) |)
⚫ Dm distance: The shortest m-path
between the points
An Introduction to the 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,

H (af + bg ) = aH ( f ) + bH ( g )
 Arithmetic operations
 Addition
 Arithmetic operations
 Subtraction
 Digital subtraction
angiography
 Shading correction
 Image multiplication
 Set operations
 Complements
 Logical
operations
 Single-pixel
operations
 Neighborhood operations
 Affine transformations
 Inverse mapping
 Registration
 Vector operations
 Image transforms
 Fourier transform
 Probabilistic methods
THANK YOU

You might also like