ADIP

Representation and Description
REPRESENTATION
AND
DESCRIPTION
4/12/2013
IT-BMSP&I,2013
R. V.COLLEGE OF ENGINEERING
PRESENTATION ON:
REPRESENTATION AND
DESCRIPTION
PRESENTED BY:
1st Semester , Mtech. Students ,
BIOMEDICAL SIGNAL PROCESSING AND
INSTUMENTATION DEPARTMENT
ASUTOSH
P.APARNA
MADHUMITHA.V
4/12/2013
IT-BMSP&I,2013
Overview
Objective
Introduction
Representation
Boundary Descriptors
Regional Descriptors
4/12/2013
IT-BMSP&I,2013
Image Representation and Description?

Objective:
To represent and describe information embedded in
an image in other forms that are more suitable than the
image itself.
Benefits:
- Easier to understand
- Require fewer memory, faster to be processed
- More ready to be used
What kind of information we can use?
- Boundary, shape
- Region
- Texture
- Relation between regions
4/12/2013
IT-BMSP&I,2013
Introduction
Representing region in 2 ways
1. in terms of its external characteristics (its
boundary) focus on shape characteristics.
2. in terms of its internal characteristics (its
region) focus on regional properties, e.g.,
color, texture
sometimes, we may need to use both ways
4/12/2013
IT-BMSP&I,2013
Introduction
Description describes the region based on the chosen
representation
example
1. representation boundary
2. description length of the boundary,
orientation of the straight line joining its
extreme points, and the number of concavities
in the boundary.
4/12/2013
IT-BMSP&I,2013
Representation
Chain Codes
Polygon Approximation
Signature
Boundary Segment
Skeleton
4/12/2013
IT-BMSP&I,2013
Shape Representation by Using Chain Codes

Chain codes: represent an object boundary by a connected
sequence of straight line segments of specified length
and direction.
4-directional
chain code
4/12/2013
8-directional
chain code
IT-BMSP&I,2013
4/12/2013
IT-BMSP&I,2013

unacceptable because
1. the resulting chain of codes tends to be quite long
2. any small disturbances along the boundary due to
noise or imperfect segmentation cause changes in
the code that may not be related to the shape of the
boundary
Solve the problems by
1. resample the boundary by selecting a larger grid
spacing
2. however, different grid can generate different chain
codes
starting point is arbitrary
4/12/2013
IT-BMSP&I,2013
10
The First Difference of a Chain Codes

Problem of a chain code:
A chain code sequence depends on a starting point.
Solution: treat a chain code as a circular sequence and redefine the starting
point so that the resulting sequence of numbers forms an integer of minimum
magnitude.
The first difference of a chain code: counting the number of
direction change (in counterclockwise) between 2 adjacent
elements of the code.
Example:
Example:
1
2
0
3
4/12/2013
Chain code : The first

difference
01 1
02 2
03 3
23 1
20 2
21 3
IT-BMSP&I,2013
- a chain code: 10103322

- The first difference = 3133030
- Treating a chain code as a
circular sequence, we get
the first difference = 33133030
The first difference is rotational
invariant.
11
Polygon Approximation
Polygonal approximations: to represent a boundary by straight line
segments, and a closed path becomes a polygon.

The number of straight line segments used determines the accuracy
of the approximation.
Only the minimum required number of sides necessary to preserve
the needed shape information should be used (Minimum perimeter
polygons).
A larger number of sides will only add noise to the model.
4/12/2013
IT-BMSP&I,2013
12
Polygon Approximation : Splitting Techniques

1. Find the line joining
two extreme points
0. Object boundary
2. Find the
farthest points
from the line
3. Draw a polygon
4/12/2013
IT-BMSP&I,2013
13
Shape Representation by Using Signature
The idea behind a signature is to convert a two
dimensional boundary into a representative one

dimensional function.
4/12/2013
IT-BMSP&I,2013
14
Shape Representation by Using Signature
Signatures are invariant to location, but will depend on

rotation and scaling.
1.
2.
Starting at the point farthest from the reference point

or using the major axis of the region can be used to
decrease dependence on rotation.
Scale invariance can be achieved by either scaling the
signature function to fixed amplitude or by dividing
the function values by the standard deviation of the
function.
4/12/2013
IT-BMSP&I,2013
15
Shape Representation by Using

Boundary Segment
Boundary segments: decompose a boundary into
segments.
Use of the convex hull of the region enclosed by the
boundary is a powerful tool for robust decomposition of
the boundary.
4/12/2013
IT-BMSP&I,2013
16
Shape Representation by Using Skeletons
Skeletons: produce a one pixel wide graph that has the
same basic shape of the region, like a stick figure of a

human. It can be used to analyze the geometric structure
of a region which has bumps and arms.
4/12/2013
IT-BMSP&I,2013
17
Before a thinning algorithm:
A contour point is any pixel with value 1 and having at

least one 8-neighbor valued 0.
Let
N ( p1 ) p2 p3 ... p8 p9
T ( p1 ) : the number of 0 - 1 transitions
in the ordered sequence
p2 , p3 ,..., p8 , p9 , p2
4/12/2013
IT-BMSP&I,2013
18
Step 1: Flag a contour point p1 for deletion if the

following conditions are satisfied
(a ) 2 N ( p1 ) 6
(b) T ( p1 ) 1
4/12/2013
( c ) p 2 p 4 p6 0
(d ) p4 p6 p8 0
IT-BMSP&I,2013
19
Step 2: Flag a contour point p1 for deletion again.

However, conditions (a) and (b) remain the same, but
conditions (c) and (d) are changed to
(d' ) p2 p6 p8 0
(c' ) p2 p4 p8 0
4/12/2013
IT-BMSP&I,2013
20
A thinning algorithm:
(1) applying step 1 to flag border points for deletion
(2) deleting the flagged points
(3) applying step 2 to flag the remaining border points
for deletion
(4) deleting the flagged points
This procedure is applied iteratively until no further
points are deleted.
4/12/2013
IT-BMSP&I,2013
21
One application of
skeletonization is for
character recognition.
A letter or character is
determined by the
center-line of its
strokes, and is
unrelated to the width
of the stroke lines.
4/12/2013
IT-BMSP&I,2013
22
Boundary Descriptors
1. Simple boundary descriptors:
we can use
- Length of the boundary
- The size of smallest circle or box that can totally
enclosing the object
2. Shape number
3. Fourier descriptor
4. Statistical moments
4/12/2013
IT-BMSP&I,2013
23
Shape Number
Shape number of the boundary definition:
the first difference of smallest magnitude
The order n of the shape number:
the number of digits in the sequence
4/12/2013
IT-BMSP&I,2013
1
2
0
3
24
Shape Number (cont.)

Shape numbers of order
4, 6 and 8
4/12/2013
IT-BMSP&I,2013
25
Example: Shape Number
2. Find the smallest rectangle

that fits the shape
1. Original boundary
Chain code:
000030032232221211
First difference:
300031033013003130
3. Create grid
4/12/2013
4. Find the nearest

Grid.
IT-BMSP&I,2013
Shape No.
000310330130031303
26
Fourier Descriptor
Fourier descriptor: view a coordinate (x,y) as a complex number
(x = real part and y = imaginary part) then apply the Fourier
transform to a sequence of boundary points.
Let s(k) be a coordinate
of a boundary point k :
Fourier descriptor :
s(k ) x ( k ) jy (k )
1
a (u )
K
K 1
2uk / K
s
(
k
)
e
k 0
Reconstruction formula
1
s(k )
K
K 1
2uk / K
a
(
u
)
e
k 0
Boundary
points
4/12/2013
IT-BMSP&I,2013
27
Example: Fourier Descriptor

Examples of reconstruction from Fourier descriptors
1
s(k )
K
P 1
2uk / K
a
(
u
)
e
k 0
P is the number of
Fourier coefficients
used to reconstruct
the boundary
4/12/2013
IT-BMSP&I,2013
28
Fourier Descriptor Properties

Some properties of Fourier descriptors
4/12/2013
IT-BMSP&I,2013
29
Statistical Moments
Definition: the nth moment
K 1
n ( r ) ( ri m)n g ( ri )
Example of moment:
The first moment = mean
The second moment = variance
i 0
K 1
where
m ri g ( ri )
Boundary
segment
1.
2.
3.
i 0
1D graph
Convert a boundary segment into 1D graph

View a 1D graph as a PDF function
Compute the nth order moment of the graph
4/12/2013
IT-BMSP&I,2013
30
What is Representation and Description ?

Types of Representation and Description .
Regional Descriptors -Area and Perimeter Descriptor.
Example using MATLAB.
Topological Descriptor.
Texture Descriptor.
Applications and Advancements .
4/12/2013
IT-BMSP&I,2013
31
Types of Representation and Description

Area, ,perimeter and compactness.
Topological Descriptors .
Texture Descriptors.
4/12/2013
IT-BMSP&I,2013
32
4/12/2013
IT-BMSP&I,2013
33
Example for Area and Perimeter Descriptor
4/12/2013
IT-BMSP&I,2013
34
4/12/2013
IT-BMSP&I,2013
35
4/12/2013
IT-BMSP&I,2013
36
4/12/2013
IT-BMSP&I,2013
37
Topological Descriptors
Topological property 1:
the number of holes (H)
Topological property 2:
the number of connected
components (C)
4/12/2013
IT-BMSP&I,2013
38
Texture Descriptors
4/12/2013
IT-BMSP&I,2013
39
Texture Descriptors
Statistical approach
Statistical Moments .
L 1
n ( z ) ( zi m) n p ( zi )
k 0
L 1
where m zi p ( zi )
i 0
1
R 1
1 2 ( z)
4/12/2013
IT-BMSP&I,2013
40
Descriptor Applications
Multimedia documents
search
engines
and
classifiers.
Digital library : visual descriptors allow a very
detailed and concrete search of any video or image
by means of different search parameters. For
instance, the search of films where a known actor
appears, the search of videos containing the
Everest mountain, etc.
Personalized electronic news service.
Possibility of an automatic connection to a TV
channel broadcasting a soccer match, for example,
whenever a player approaches the goal area.
4/12/2013
IT-BMSP&I,2013
41
Latest Development
4/12/2013
IT-BMSP&I,2013
42
Latest Development
4/12/2013
IT-BMSP&I,2013
43
THANK YOU
4/12/2013
IT-BMSP&I,2013
44

ADIP

Uploaded by

Document Information

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

ADIP

Uploaded by

Copyright:

Available Formats

Representation and Description

Representation and Description

Representation and Description

Representation and Description

Image Representation and Description?

Representation and Description

Representation and Description

Representation and Description

Representation and Description

Shape Representation by Using Chain Codes

Representation and Description

Shape Representation by Using Chain Codes

Representation and Description

Shape Representation by Using Chain Codes

Representation and Description

The First Difference of a Chain Codes

Chain code : The first

- a chain code: 10103322

Representation and Description

segments, and a closed path becomes a polygon.

Representation and Description

Polygon Approximation : Splitting Techniques

Representation and Description

Shape Representation by Using Signature

The idea behind a signature is to convert a two

dimensional boundary into a representative one

Representation and Description

Shape Representation by Using Signature

Signatures are invariant to location, but will depend on

Starting at the point farthest from the reference point

Representation and Description

Shape Representation by Using

Boundary segments: decompose a boundary into

Representation and Description

Shape Representation by Using Skeletons

Skeletons: produce a one pixel wide graph that has the

same basic shape of the region, like a stick figure of a

Representation and Description

Shape Representation by Using Skeletons

Before a thinning algorithm:

A contour point is any pixel with value 1 and having at

Representation and Description

Shape Representation by Using Skeletons

Step 1: Flag a contour point p1 for deletion if the

Representation and Description

Shape Representation by Using Skeletons

Step 2: Flag a contour point p1 for deletion again.

Representation and Description

Shape Representation by Using Skeletons

Representation and Description

Shape Representation by Using Skeletons

Representation and Description

Representation and Description

Representation and Description

Shape Number (cont.)

Representation and Description

Example: Shape Number

2. Find the smallest rectangle

4. Find the nearest

Representation and Description

Representation and Description

Example: Fourier Descriptor

Representation and Description