A Simple Image Model

A Simple Image Model
• Image: a 2-D light-intensity function f(x,y)
• The value of f at (x,y)  the intensity

(brightness) of the image at that point
• 0 < f(x,y) < 

Digital Image Acquisition
• Nature of f(x,y):
– The amount of source light incident on the scene

being viewed
– The amount of light reflected by the objects in

the scene
• Illumination & reflectance components:
– Illumination: i(x,y)
– Reflectance: r(x,y)
– f(x,y) = i(x,y)  r(x,y)
– 0 < i(x,y) < 

and 0 < r(x,y) < 1
(from total absorption to total reflectance)
• Sample values of r(x,y):
– 0.01: black velvet
– 0.93: snow
• Sample values of i(x,y):

– 9000 foot-candles: sunny day
– 1000 foot-candles: cloudy day
– 0.01 foot-candles: full moon
• Intensity of a monochrome image f at (xo,yo):
gray level l of the image at that point
l=f(xo, yo)
• Lmin ≤ l ≤ Lmax
– Where Lmin: positive
Lmax: finite
• In practice:
– Lmin = imin rmin and
– Lmax = imax rmax
• E.g. for indoor image processing:

– Lmin ≈ 10 Lmax ≈ 1000
• [Lmin, Lmax] : gray scale

– Often shifted to [0,L-1]  l=0: black
l=L-1: white
Sampling & Quantization
• The spatial and amplitude digitization of
f(x,y) is called:
– image sampling when it refers to spatial

coordinates (x,y) and
– gray-level quantization when it refers to the

amplitude.
Digital Image
Sampling and Quantization
A Digital Image
 f (0,0) f (0,1) ... f (0, M  1) 
 f (1,0) ... ... f (1, M  1) 
f ( x, y )  
 ... ... ... ... 
 
 f ( N  1,0) f ( N  1,1) ... f ( N  1, M  1)
Digital Image Image Elements

(Pixels)
• Important terms for future discussion:
– Z: set of real integers
– R: set of real numbers

• Sampling: partitioning xy plane into a grid
– the coordinate of the center of each grid is a pair

of elements from the Cartesian product Z x Z (Z2)
• Z2 is the set of all ordered pairs of elements

(a,b) with a and b being integers from Z.
• f(x,y) is a digital image if:
– (x,y) are integers from Z2 and

– f is a function that assigns a gray-level value
(from R) to each distinct pair of coordinates (x,y)
[quantization]
• Gray levels are usually integers

– then Z replaces R
• The digitization process requires decisions
about:
– values for N,M (where N x M: the image array)
and
– the number of discrete gray levels allowed for

each pixel.
• Usually, in DIP these quantities are integer
powers of two:
N=2n M=2m and G=2k
number of gray levels
• Another assumption is that the discrete

levels are equally spaced between 0 and L-1
in the gray scale.
Examples
Examples
Examples
Examples
• If b is the number of bits required to store a
digitized image then:
– b = N x M x k (if M=N, then b=N2k)

Storage
• How many samples and gray levels are
required for a good approximation?
– Resolution (the degree of discernible detail) of

an image depends on sample number and gray
level number.
– i.e. the more these parameters are increased,
the closer the digitized array approximates the
original image.
• How many samples and gray levels are
required for a good approximation? (cont.)
– But: storage & processing requirements increase

rapidly as a function of N, M, and k
• Different versions (images) of the same
object can be generated through:
– Varying N, M numbers
– Varying k (number of bits)
– Varying both
• Isopreference curves (in the Nm plane)
– Each point: image having values of N and k equal

to the coordinates of this point
– Points lying on an isopreference curve correspond

to images of equal subjective quality.
Examples
Isopreference Curves
• Conclusions:
– Quality of images increases as N & k increase
– Sometimes, for fixed N, the quality improved by
decreasing k (increased contrast)
– For images with large amounts of detail, few gray
levels are needed
Nonuniform
• An adaptive sampling scheme can improve the
appearance of an image, where the sampling would
consider the characteristics of the image.
– i.e. fine sampling in the neighborhood of sharp gray-level

transitions (e.g. boundaries)
– Coarse sampling in relatively smooth regions
• Considerations: boundary detection, detail content

Nonuniform
• Similarly: nonuniform quantization process
• In this case:
– few gray levels in the neighborhood of
boundaries
– more in regions of smooth gray-level variations
(reducing thus false contours)

A Simple Image Model

Uploaded by

Copyright:

Available Formats

A Simple Image Model

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

A Simple Image Model

Uploaded by

Copyright:

Available Formats

A Simple Image Model

• Image: a 2-D light-intensity function f(x,y)

• The value of f at (x,y)  the intensity

• 0 < f(x,y) < 

– The amount of source light incident on the scene

– The amount of light reflected by the objects in

– f(x,y) = i(x,y)  r(x,y)

– 0 < i(x,y) < 

• Sample values of i(x,y):

• E.g. for indoor image processing:

• [Lmin, Lmax] : gray scale

– image sampling when it refers to spatial

– gray-level quantization when it refers to the

Digital Image Image Elements

• Important terms for future discussion:

– Z: set of real integers

– R: set of real numbers

• Sampling: partitioning xy plane into a grid

– the coordinate of the center of each grid is a pair

• Z2 is the set of all ordered pairs of elements

– (x,y) are integers from Z2 and

• Gray levels are usually integers

– values for N,M (where N x M: the image array)

– the number of discrete gray levels allowed for

number of gray levels

• Another assumption is that the discrete

– b = N x M x k (if M=N, then b=N2k)

– Resolution (the degree of discernible detail) of

– But: storage & processing requirements increase

– Each point: image having values of N and k equal

– Points lying on an isopreference curve correspond

– i.e. fine sampling in the neighborhood of sharp gray-level

• Considerations: boundary detection, detail content

You might also like