2. Group Members
๏ต Swarnadeep Modak(ECE2015/050)
๏ต Suvojit Sanyal(ECE2015/051)
๏ต Somit Samanto(ECE2015/058)
๏ต Sandipan Roy(ECE2015/40)
2
3. Contents
SL.NO TOPIC PAGE NO.
1. Image segmentation 4
2. Edge Detection 5
3. Intensity Histogram 6
4. Region Growing 7-9
5. Advantage and Disadvantage of
Region Growing.
10-11
6. Split and Merge Approach 12
7. Example 13
8. Split and Merge Algorithm 14-16
9. Region Splitting and Merging 17-21
10. Region Oriented Segmentation 22
11. conclusion 23
3
4. Image Segmentation:
โข Segmentation refers to the process of partitioning a digital image into
multiple regions (sets of pixels).
โข The goal of segmentation is to simplify or change the representation of an
image into something that is more meaningful and easier to analyze.
โข Image segmentation is typically used to locate objects and boundaries in
images
โข Each of the pixels in a region are similar with respect to some characteristic or
computed property, such as color, intensity, or texture.
4
5. Edge Detection
โข Edges in images are areas with strong intensity contrasts โ
a jump in intensity from one pixel to the next.
โข Edge detecting an image significantly reduces the amount
of data and filters out useless information, while
preserving the important structural properties in an
image.
โข There are many ways to perform edge detection.
โ Gradient - The gradient method detects the edges by looking for
the maximum and minimum in the first derivative of the image.
โ Laplacian - The Laplacian method searches for zero crossings in
the second derivative of the image to find edges.
5
6. Intensity histograms provide a means of determining useful
intensity values as well as determining whether or not an
image is a good candidate for thresholding or stretching.
Intensity histogram based
segmentation
6
7. Region Growing
โข Region growing is a procedure that groups pixels or sub regions into
larger regions.
โข The simplest of these approaches is pixel aggregation, which starts
with a set of โseedโ points and from these grows regions by
appending to each seed points those neighboring pixels that have
similar properties (such as gray level, texture, color, shape).
โข Region growing based techniques are better than the edge-based
techniques in noisy images where edges are difficult to detect
7
9. Result of region growing Boundaries of segmented defective welds
9
10. THE ADVANTAGES AND DISADVANTAGES OF
REGION GROWING
Advantages
๏ต Region growing methods can correctly separate the
regions that have the same properties we define.
๏ต Region growing methods can provide the original
images which have clear edges with good segmentation results.
๏ต The concept is simple. Weonly need a small number of seed points to represent
the property we want, then grow the region.
10
11. Disadvantage
โข Computationally expensive
โข It is a local method with no global view of the problem.
โข Sensitive to noise.
โข Unless the image has had a threshold function applied to
it, a continuous path of points related to color may exist
which connects any two points in the image.
11
12. Split and Merge Approach:
โข This is a 2 step procedure:
โ top-down: split image into
homogeneous quadrant regions
โ bottom-up: merge similar adjacent
regions
โข The algorithm includes:
Top-down
โ successively subdivide image into
quadrant regions Ri
โ stop when all regions are
homogeneous: P(Ri ) = TRUE) obtain
quadtree structure
Bottom-up
โ at each level, merge adjacent regions
Ri and Rj if P(Ri [ Rj ) = TRUE
โข Iterate until no further
splitting/merging is possible
12
17. REGION SPLITTING AND MERGING
Region Splitting
โข Region growing starts from a set of seed points.
โข An alternative is to start with the whole image as a
single region and subdivide the regions that do not
satisfy a condition of homogeneity.
17
18. Region Merging
โข Region merging is the opposite of region splitting.
โข Start with small regions (e.g. 2x2 or 4x4 regions) and merge
the regions that have similar characteristics (such as gray level,
variance).
โข Typically, splitting and merging approaches are used
iteratively
CONTUโฆโฆโฆ.
18
19. โข Let R represent the entire image region and select a predicate .
โข One approach for segmenting R is to subdivide it successively
into smaller and smaller quadrant regions so that , for Ri ,
P(Ri) = TRUE.
โข If P(R)FALSE divide the image into quadrants .
โข If P is FALSE for any quadrant , subdivide that , quadrants and
so on.
โข This particular splitting technique has a convenient
representation in the form called quad tree.
19
21. ๏ถ Split into four disjoint quadrants any region Ri for which
P(Ri)=FALSE.
๏ถ Merge any adjacent regions Rj and Rk for which P(Rj U Rk) =
TRUE.
๏ถ Stop when no further merging or splitting is possible.
21
23. CONCLUSION
โข Region and boundary information for the purpose of segmentation.
โข Image segmentation is an essential step in most automatic graphic pattern
recognition and scene analysis problems.
โข One segmentation technique over another is dictated mostly by the peculiar
characteristics of problem being measured.
23
