Scribd
Upload
21 views54 pages

Chapter 11 New

The document discusses various techniques for representing and describing segmented regions from images. It describes methods such as chain codes, polygonal approximations, signatures, boundary segments, and the skeleton of a region to represent boundaries. Descriptors are then computed based on the representation, including length, orientation, number of concavities, and other measures. Regional descriptors like area, principal axes, and topological descriptors are also discussed.

Uploaded by

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

Chapter 11 New

The document discusses various techniques for representing and describing segmented regions from images. It describes methods such as chain codes, polygonal approximations, signatures, boundary segments, and the skeleton of a region to represent boundaries. Descriptors are then computed based on the representation, including length, orientation, number of concavities, and other measures. Regional descriptors like area, principal axes, and topological descriptors are also discussed.

Uploaded by

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

Chapter 11

Representation & Description

Md. Mahadi Hassan


Associate Professor, CSE
Representation & Description
• Representation of a segmented region:

– In terms of its external characteristics


(boundary)

– In terms of its internal characteristics


(pixels comprising the region)
Representation & Description
• Description of the region based on the
chosen representation:

– e.g. boundary: length, orientation of straight


line joining the extreme points, number of
concavities.

• Descriptors should be insensitive to changes


in size, translation, rotation, …
Representation Schemes

Segmentation Raw data (pixels)

Representations

Computation of descriptors
Representation Schemes

Chain Codes
Polygonal Approximations
Signatures
Boundary Segments
The Skeleton of a Region
Chain Codes
• Represent boundaries by a connected
sequence of straight-line segments of
specified length and direction.

– Based on 4- or 8-connectivity

– Direction of each segment coded by a


numbering scheme
Representation & Description
Chain Codes
• Problems:
– Long chains of codes
– Easily disturbed by noise, and sidetracked

• Solution:
– Resampling using larger grid spacing
– Normalizations
Representation & Description
Polygonal Approximations
• To capture the essence of the boundary
shape with the fewest possible polygonal
segments.

• Various methods:

– Minimum perimeter polygons


– Merging techniques (least square error line fit)
Representation & Description
Polygonal Approximations
• Merging technique problem: corners

• Solution:
– Splitting: to subdivide a segment successively
into two parts until a given criterion is satisfied.

– Objective: seeking prominent inflection points.


Representation & Description
Signatures
• 1-D functional representation of a boundary

• To generate:

– Plot the distance from the centroid to the


boundary as a function of angle.
Representation & Description
Signatures
• Invariable to translation, but depends on
rotation & scaling

– normalization of the procedure is necessary


– e.g. select the same starting point
Signatures
• Changes in size change the amplitude values

– Scaling the functions so that they always span the


same range of values, e.g. [0,1] might help.

– Disadvantage: it only depends on minimum &


maximum values.
Signatures
• Another way to generate signatures:

– Plot the angle between a line tangent to the


boundary and a reference line as a function of
position along the boundary

– e.g. horizontal segments would correspond to


straight lines as the tangent angle would be
constant there.
Signatures
• Another way to generate signatures:

– Slope-density function = a histogram of tangent-


angle values.
Boundary Segments
• Decomposition of a boundary into segments
reduces the boundary’s complexity and
simplifies the description process.

– Convex hull H of a set S is the smallest convex


containing S
– H-S = convex deficiency D of S
– Scheme: independent of size and orientation.
Representation & Description
Boundary Segments
• Prior to partitioning, smooth the boundary:

– e.g. by replacing each pixel by the average


coordinates of m of its neighbors along the
boundary

– or use a polygonal approximation prior to finding


the convex deficiency
The Skeleton of a Region
• To reduce a plane region to a graph

– by e.g. obtaining the skeleton of the region via


thinning.
The Skeleton of a Region
• Find medial axis transformation (MAT):

– The MAT of region R with border B is found as:


• For each point p in R, we find its closest neighbor in B.

• If p has more than one, it belongs to the Medial Axis


(skeleton) of R.
Representation & Description
The Skeleton of a Region
• To improve computational efficiency, in
essence we perform thinning:

– Edge points of a region are iteratively deleted if:

• End points are not deleted


• Connectedness is not broken
• No excessive erosion is caused
Representation & Description
Boundary Descriptors
• Length:

– Number of pixels
– Number of vertical and horizontal components +
√2 times the number of diagonal components
Boundary Descriptors
• Diameter:

– Diam( B)  max[ D( pi , p j )]
i, j

– D: distance measure; pi,pj: boundary points

– Major axis (connecting the two extreme points)


Boundary Descriptors
• Curvature:

– Rate of change of slope

– i.e. using the difference between the slopes of


adjacent boundary segments, which have been
represented as straight lines, as a descriptor of
curvature at the point of intersection of the
segments.
Boundary Descriptors
• Curvature (cont.):

– Convex segment: change in slope at p is nonnegative


– Concave segment: change in slope at p is negative

– Ranges in the change of slope:


• Less than 10°  line
• More than 90°  corner
Boundary Descriptors
• Other Boundary Descriptors:

Shape numbers
Fourier descriptors
Moments
Representation & Description
Chapter 11
Representation & Description
Chain Code:
Regional Descriptors
• Area: # of pixels within the boundary
• Perimeter: length of boundary

– Can be used with area to measure compactness


(perimeter2/area)

– Compactness is:
• Dimensionless, and thus insensitive to scale changes
• Insensitive to orientation
Regional Descriptors
• Principal axes:

– Eigenvectors of the covariance matrix


– Ratio of large to small eigenvalue: insensitive to
scale and rotation
Regional Descriptors
• Other descriptors:

– Mean and median of gray levels


– Min. and max. gray-level values
– # pixels with values above and below the mean
Topological Descriptors
• Topology:

– properties of figures that are unaffected by


deformations
– no tearing or joining though  rubber sheet
distortions.
Topological Descriptors
• Examples:
– # of holes H
– # of connected components C:
• A subset of maximal size such that any two points can
be joined by a connected curve lying entirely within the
subset.

– Euler number E: E = C-H


• also a topological property
Representation & Description
Topological Descriptors
• Regions represented by straight line
segments (polygonal network):

–W: # of vertices
–Q: # of edges Euler formula:
–F: # of faces
W-Q+F = C-H = E
Representation & Description
Representation & Description
Relational Descriptors
• To organize boundaries & regions to exploit
any structural relationships that may exist
between them.

• Example:
Relational Descriptors
• In the previous example:

– Recursive relationship involving the primitive


elements a and b.

– Rewriting rules:
• S  aA
• A  bS, and
• Ab
Relational Descriptors
• When dealing with disjoint structures, tree
descriptors are used:

– A tree T is a finite set of one or more nodes for


which:
• There is a unique node $ designated the root
• The remaining nodes are partitioned into m disjointed
sets T1, …, Tm, each of which in turn is a tree called a
subtree of T.
Relational Descriptors
• The tree frontier is the set of nodes at the
bottom of the tree (leaves), taken in order
from left to right.
Relational Descriptors
• Two types of information are important (in
a tree):

– Information about a node stored as a set of words


describing the node
– Information relating a node to its neighbors
stored as a set of pointers to those neighbors
Representation & Description
Representation & Description
Representation & Description
The End

(or is it?)

You might also like