Image Processing Lecture on Representation and Description

300046 Multimedia Signal Processing / 300193 Multimedia Engineering - Part B: Image Processing
Lecture 6
Representation Recommended
Chapter
and description reading
11
JJ Zou & Q Cheng, UWS School of Engineering
Lecture 6 1
Representation and Description
Lecture 6 2
Introduction
After
an image is segmented into regions, pixels in each region are usually represented and described in a form suitable for further computer processing. Represent a region in terms of
its external characteristics (its boundary); or its internal characteristics (the pixels comprising the region).
Describe
a region by its features, such as the length of its boundary, the orientation of a line joining its extreme points, etc.
Lecture 6 3
Representation
Chain
codes
Chain codes are used to represent a boundary by a connected sequence of straight-line segments of specified length and direction. This representation is usually based on 4- or 8connectivity of the segments. The direction of each segment is coded by using a numbering scheme (see below).
Lecture 6 4
A chain code for representing a region could be generated by
following its boundary in a clockwise (or counterclockwise) direction and Assigning a direction to each segment connecting two consecutive pixels.
However, this method is generally unacceptable for boundary representation since
the resulting code tends to be long, and is sensitive to boundary noise.
We can solve this problem by resampling the boundary using a larger grid spacing (see next slide).
Lecture 6 5
Chain code examples

4-directional chain code = 003301 8-directional chain code = 076612
Lecture 6 6
One problem with the above chain code is that it depends on the starting point.
The code can be normalized with respect to the starting point by the following steps. 1. Treat the chain code as a circular sequence of direction numbers; 2. Redefine the starting point so that the resulting sequence of numbers forms an integer of minimum magnitude. For example, an integer of minimum magnitude of a circular sequence 12300321 is 00321123.
Lecture 6 7
Another problem with the chain code is that it is not invariant to rotation.
We will get a different chain code after we rotate the object.
Lecture 6 8
The chain code can be normalized for rotation by using its first difference instead of the code itself. The first difference is obtained by counting the number of direction changes (in a counterclockwise direction) that separate two adjacent elements of the code. For example, the first difference of a 4-direction circular chain code 10103322 is 33133030. 2 1 = 3, 1 0 = 3, 0 1 = 1,
Lecture 6 9
Polygonal
approximations
A digital boundary can be approximated with arbitrary accuracy by a polygon. The goal of polygonal approximation is to capture the essence of the boundary shape with the fewest possible polygonal segments. We will discuss a number of polygonal approximation methods in the following.
Lecture 6 10
Minimum perimeter polygons
Think of the boundary of an object as a rubber band contained within walls. If the rubber band is allowed to shrink, it produces a polygon of minimum perimeter. The maximum error of the approximation is 2d ,where d is the minimum possible distance between different pixels.
Lecture 6 11
Merging techniques
Basic approach Merge points along a boundary until the approximation error exceeds a preset threshold. If the condition occurs, connect the first point and the point before last to form a segment and repeat the above procedure for a new segment. A major difficulty with this approach is that vertices in the resulting polygon do not always correspond to corners in the original boundary. Splitting techniques discussed next may be used to solve this problem.
Lecture 6 12
Splitting techniques
Basic approach Subdivide a segment successively into two parts until a specified criterion is satisfied. A popular method for approximating a close boundary Select two extreme points to divide the boundary into two segments. For each segment, if the maximum perpendicular distance from the segment to the line joining its two end points exceeds a preset threshold, subdivide the segment at the farthest point from the line. This method has the advantage of seeking prominent inflection points (see next slide for an example).
Lecture 6 13
Example: approximating a closed boundary by splitting
Lecture 6 14
Signatures
A signature is a 1D functional representation of a boundary.
The idea is to reduce the 2D boundary representation to a 1D function.
For example, a boundary can be represented by the distance from the centroid to the boundary versus the angle (see below).
Lecture 6 15
Boundary
segments
It is often useful to decompose a boundary into segment.
For example, decomposition reduces the boundarys complexity and thus simplifies the description process.
The convex hull of a closed boundary is a powerful tool for robust decomposition of the boundary.
The convex hull of a set S is the smallest convex set containing S.
Lecture 6 16
Skeletons
An important approach to representing the structural shape of a plane region is to reduce it to the skeleton. Skeletons have various applications, ranging from optical character recognition to data compression. The skeleton of a region may be defined via the medial axis transformation (MAT) proposed by Blum in 1967.
For each point p in a region R, we find its closest neighbour in the boundary B of R. If p has more than one such neighbour, it is said to belong to the medial axis (skeleton) of R.
Lecture 6 17
Examples of medial axes (skeletons)
Lecture 6 18
It is computationally expensive to directly implement the MAT.
Implementation potentially involves calculating the distance from every interior point to every point on the boundary of a region.
Numerous algorithms have been proposed for improving computational efficiency. Most of these algorithms are based on the thinning technique. The basic concept of thinning is to iteratively delete boundary points of a region subject to the constraints that deletion of these points
does not remove end points; does not break connectivity; and does not cause excessive erosion of the region.
Lecture 6 19
Example: computing the skeleton of a region by thinning
Lecture 6 20
Boundary descriptors
Some simple descriptors
Length
The length of a boundary is the sum of the lengths of boundary segments between adjacent boundary pixels. The diameter of a boundary is the distance between its two extreme points. The major axis of a boundary is a line that passes through the two extreme points. The minor axis is a line that is perpendicular to the major axis, and passes through two farthest points along this direction. A rectangle is a basic rectangle if it completely encloses the boundary and passes through two extreme points along the major axis and two farthest points along the minor axis. Curvature is defined as the rate of change of slope.
Diameter
Major axis, minor axis and basic rectangle
Curvature
Lecture 6 21
Shape numbers
Given a boundary represented by a chain code, the shape number of the boundary is defined as the first difference of the smallest magnitude of the code. The order of a shape number is defined as the number of digits in its representation. Example 1: some shape numbers
Lecture 6 22
Example 2: steps in the generation of a shape number

Find the basic rectangle Subdivide the rectangle Compute the chain code, first difference and shape number.
Lecture 6 23
Summary (Important topics are highlighted)

Representation
and description
Representation

Chain codes Polygonal approximations Signatures Boundary segments Skeletons Some simple descriptors Shape numbers
Boundary descriptors

Lecture 6 24

Image Processing Lecture on Representation and Description

Cargado por

Información del documento

Descripción original:

Título original

Derechos de autor

Formatos disponibles

Compartir este documento

Compartir o incrustar documentos

Opciones para compartir

¿Le pareció útil este documento?

¿Este contenido es inapropiado?

Copyright:

Formatos disponibles

Image Processing Lecture on Representation and Description

Cargado por

Copyright:

Formatos disponibles

300046 Multimedia Signal Processing / 300193 Multimedia Engineering - Part B: Image Processing

and description reading

JJ Zou & Q Cheng, UWS School of Engineering

Representation and Description

JJ Zou & Q Cheng, UWS School of Engineering

JJ Zou & Q Cheng, UWS School of Engineering

A chain code for representing a region could be generated by

However, this method is generally unacceptable for boundary representation since

the resulting code tends to be long, and is sensitive to boundary noise.

JJ Zou & Q Cheng, UWS School of Engineering

Chain code examples

4-directional chain code = 003301 8-directional chain code = 076612

JJ Zou & Q Cheng, UWS School of Engineering

JJ Zou & Q Cheng, UWS School of Engineering

We will get a different chain code after we rotate the object.

JJ Zou & Q Cheng, UWS School of Engineering

JJ Zou & Q Cheng, UWS School of Engineering

JJ Zou & Q Cheng, UWS School of Engineering

Minimum perimeter polygons

JJ Zou & Q Cheng, UWS School of Engineering

JJ Zou & Q Cheng, UWS School of Engineering

JJ Zou & Q Cheng, UWS School of Engineering

Example: approximating a closed boundary by splitting

JJ Zou & Q Cheng, UWS School of Engineering

A signature is a 1D functional representation of a boundary.

The idea is to reduce the 2D boundary representation to a 1D function.

JJ Zou & Q Cheng, UWS School of Engineering

It is often useful to decompose a boundary into segment.

The convex hull of a set S is the smallest convex set containing S.

JJ Zou & Q Cheng, UWS School of Engineering

JJ Zou & Q Cheng, UWS School of Engineering

Examples of medial axes (skeletons)

JJ Zou & Q Cheng, UWS School of Engineering

It is computationally expensive to directly implement the MAT.

JJ Zou & Q Cheng, UWS School of Engineering

Example: computing the skeleton of a region by thinning

JJ Zou & Q Cheng, UWS School of Engineering

Some simple descriptors

Major axis, minor axis and basic rectangle

JJ Zou & Q Cheng, UWS School of Engineering

Example 2: steps in the generation of a shape number

JJ Zou & Q Cheng, UWS School of Engineering

Summary (Important topics are highlighted)

JJ Zou & Q Cheng, UWS School of Engineering

También podría gustarte