Professional Documents
Culture Documents
Topics
Computer vision system Image enhancement Image analysis Pattern Classification
robot
Dual purpose: 1.Provide feedback for operator 2. Recognize victims (must be automated)
Image
Digitizer
Image Processor
Digital Computer
Storage Device
Display
Image representation
Images are usually represented by a 2-D intensity function f(x,y) where
x and y represent spatial coordinates The value of f is proportional to the brightness (gray level) of the image.
A digital image u(m,n) is represented by a matrix whose rows and columns identify a point in an image and matrix element value identifies the gray level at that point. Each point is referred to as a picture element or pixel
Image representation
For computer storage, an array with the number of gray levels being a power of 2 is selected. A typical gray level image contains 256 shades of gray (8 bit) Values are stored between 0 - 255
Columns(16) Rows(16)
u(m,n) = value
Image enhancement
Refers to the accentuation or sharpening of image features such as edges, boundaries, or contrast to make an image more useful for display and analysis.
Image Enhancement
Point Operations Contrast stretching Noise clipping Window Slicing Histogram modeling
Spatial Operations Noise smoothing Median Filtering Unsharp masking Low-pass, bandpass, high-pass filtering
Point Operations
Mapping a given gray level u [0, L] into a gray
level v [0, L] according to v = f(u) Contrast Stretching For low-contrast images that occur because of: Poor or non-uniform lighting Non-linearity or small dynamic range of sensors. u 0ua (u a) a u b (u - b) b u L
v=
Contrast Stretching
Thresholding
Output is a binary image.
Example:
u(m,n) =
1(255)
0(0) 120
u
v(m,n) =
threshold
Electrical Engineering Design Project - Fall 2002
Histogram Equalization
The effect of performing histogram equalization on an image is to produce a uniform distribution of gray levels in an image. The equalization process spreads out the peaks in an image and while compressing the range of intensities in regions of the histogram that have relatively few pixels. The histogram represents the relative frequency of occurrence of the various gray levels in an image. Equalization provides a way to enhance minor intensity variations in an apparently uniform image - method to emphasize dim features.
Image Math
Image math operations (addition, subtraction, multiplication and division) use two images to create a third image using pixel by pixel application of the mathematical operator.
Boolean Operations
Image A Image B A OR B
A AND B
A XOR B
NOT A
Spatial Operations
Spatial filtering involves passing a weighted mask, or kernel, over the noisy image and replacing the original image pixel value corresponding to the centre of the kernel with the sum of the original pixel values in the region corresponding to the kernel multiplied by the kernel weights.
Spatial Operations
Performed on local neighborhoods of input pixels. Image is convolved with a finite response filter called a spatial mask (window). Spatial average - each pixel is replaced by a weighted average of its neighborhood pixels. - average filter- used for noise smoothing, low-pass filtering
3 x 3 window
0 0 0
1 1 1
1 0 -1
1 0 -1
1 0 -1
-1 -1
-1
Sobel
0 0 0
1 2 1
1 0 -1
2 0 -2
1 0 -1
-2 -1
Transformations
Images can be transformed using techniques similar to those in systems and signals. f(t) h(t) g(t)
Except now the signal is represented in 2-D space instead of 1-D time. Examples of transformations include: - Fourier transforms - Cosine transforms - Walsh transform
Electrical Engineering Design Project - Fall 2002
Image Analysis
Goal is to extract important features from image data, from which a description, interpretation, or understanding of the scene can be provided.
Image Analysis
Feature Extraction Spatial features Transform features Edges and boundaries Shape features Moments Texture
Segmentation Template matching Thresholding Boundary detection Clustering Quad-trees Texture matching
Classification Clustering Statistical Decision trees Similarity Measures Min. spanning tree
Segmentation
Includes: 1. 2. Thresholding Edge detection
Thresholding - separate different portions of the image based on the gray level values.
Blob Labeling
Each blob is labeled with a unique value. Scan image until a on pixel is encountered. Label every pixel connected to the pixel with the same label value
4-connected
8-connected
2
Usually use 8-connected.
1 3
Edge Detection
Edge detection segment the image by finding sharp edges. Can be performed using a spatial mask
Feature extraction
Feature extraction involves finding features of the segmented image. Usually performed on a binary image produced from a thresholding operation.
Perimeter pixels
Other Features
Formfactor A B C D 0.257 0.256 0.459 0.457 Aspect Ratio 1.339 2.005 1.294 2.017
Pattern Classification
sample