Professional Documents
Culture Documents
Image Segmentation: CIS 601 Fall 2004 Longin Jan Latecki
Image Segmentation: CIS 601 Fall 2004 Longin Jan Latecki
Image Segmentation
Segmentation divides an image into its
constituent regions or objects.
Segmentation of images is a difficult task in
image processing. Still under research.
Segmentation allows to extract objects in
images.
Segmentation is unsupervised learning.
Model based object extraction, e.g.,
template matching, is supervised learning.
Segmentation Algorithms
Segmentation algorithms are based on one of
two basic properties of color, gray values, or
texture: discontinuity and similarity.
First category is to partition an image based on
abrupt changes in intensity, such as edges in an
image.
Second category are based on partitioning an
image into regions that are similar according to a
predefined criteria. Histogram thresholding
approach falls under this category.
Domain
spaces
Examples
Original pictures
segmented pictures
Segmentation by Thresholding
Suppose that the gray-level histogram
corresponds to an image f(x,y) composed of
dark objects on the light background, in such a
way that object and background pixels have gray
levels grouped into two dominant modes. One
obvious way to extract the objects from the
background is to select a threshold T that
separates these modes.
Then any point (x,y) for which f(x,y) < T is called
an object point, otherwise, the point is called a
background point.
Histogram
Segmented Image
Segmented Image
Multimodal Histogram
If there are three or more dominant modes in the
image histogram, the histogram has to be
partitioned by multiple thresholds.
Multilevel thresholding classifies a point (x,y) as
belonging to one object class
if T1 < (x,y) <= T2,
to the other object class
if f(x,y) > T2
and to the background
if f(x,y) <= T1.
>
w
v
w
u
Multimodal Histogram
Histogram of lena
Segmented Image
Image after segmentation we get a outline of her face, hat, shadow etc
Histogram
Segmented Image
Introduction
Image segmentation with respect to
predicate P partitions the image X into
subregions R(i), i=1,,N such that
X = i=1,..N U R(i)
R(i) R(j) = 0 for I j
P(R(i)) = TRUE for i = 1,2,,N
P(R(i) U R(j)) = FALSE for i j
Introduction
The segmentation property is a logical
predicate of the form P(R,x,t)
x is a feature vector associated with region
R
t is a set of parameters (usually
thresholds). A simple segmentation rule
has the form:
P(R) : I(r,c) < T for all (r,c) in R
Introduction
In the case of color images the feature
vector x can be three RGB image
components (R(r,c),G(r,c),B(r,c))
A simple segmentation rule may have the
form:
P(R) : (R(r,c) <T(R)) && (G(r,c)<T(G))&&
(B(r,c) < T(B))
Region Growing
The growth mechanism at each stage k
and for each region Ri(k), i = 1,,N, we
check if there are unclassified pixels in the
8-neighbourhood of each pixel of the
region border
Before assigning such a pixel x to a region
Ri(k),we check if the region homogeneity:
P(Ri(k) U {x}) = TRUE , is valid
1
2
std ( R )
(
I
(
r
,
c
)
m
(
R
))
n 1 ( r ,c )R
The predicate
P: |m(R1) m(R2)| < k*min{std(R1), std(R2)},
is used to decide if the merging
of the two regions R1, R2 is allowed, i.e.,
if |m(R1) m(R2)| < k*min{std(R1), std(R2)},
two regions R1, R2 are merged.
Split
The opposite approach to region growing is region
splitting.
It is a top-down approach and it starts with the
assumption that the entire image is homogeneous
If this is not true, the image is split into four sub
images
This splitting procedure is repeated recursively
until we split the image into homogeneous regions
Split
If the original image is square N x N, having
dimensions that are powers of 2(N = 2n):
All regions produced but the splitting algorithm
are squares having dimensions M x M , where
M is a power of 2 as well.
Since the procedure is recursive, it produces an
image representation that can be described by a
tree whose nodes have four sons each
Such a tree is called a Quadtree.
Split
Quadtree
R0
R1
R0
R2
R3
R00
R1
R01
R02
R04
Split
Splitting techniques disadvantage, they
create regions that may be adjacent and
homogeneous, but not merged.
Split and Merge method is an iterative
algorithm that includes both splitting and
merging at each iteration:
Split / Merge
If a region R is inhomogeneous
(P(R)= False) then is split into four sub
regions
If two adjacent regions Ri,Rj are
homogeneous (P(Ri U Rj) = TRUE), they
are merged
The algorithm stops when no further
splitting or merging is possible
Split / Merge
The split and merge algorithm produces
more compact regions than the pure
splitting algorithm
Applications
3D Imaging : A basic task in 3-D image
processing is the segmentation of an image
which classifies voxels/pixels into objects or
groups. 3-D image segmentation makes it
possible to create 3-D rendering for multiple
objects and perform quantitative analysis for the
size, density and other parameters of detected
objects.
Several applications in the field of Medicine like
magnetic resonance imaging (MRI).