This document discusses region-based image segmentation techniques. Region-based segmentation groups pixels into regions based on common properties. Region growing is described as starting with seed points and grouping neighboring pixels with similar properties into larger regions. The advantages are it can correctly separate regions with the same defined properties and provide good segmentation in images with clear edges. The disadvantages include being computationally expensive and sensitive to noise. Region splitting and merging techniques are also discussed as alternatives to region growing.
The presentation begins with a welcome note and listing of members involved.
Region-based segmentation defines a technique for segmenting images by region, emphasizing seed points and methods.
It discusses various applications in medical imaging and video summarization, highlighting methods like thresholding and k-means clustering.
Details on formulation criteria for segmentation include completeness, connectedness, disjointness, satisfiability, and segmentability.
Region growing aggregates pixels into larger regions from seed points, providing advantages such as clear edges but also facing challenges like computational costs.
Describes alternative methods of region splitting and merging, where regions are subdivided or combined based on homogeneity.
WHAT IS REGIONBASED
SEGMENTATION?
• Region-based segmentation is a technique for
determining the region directly.
• Region growing is a simple region-based image
segmentation method. It is also classified as a
pixel-based image segmentation method since it
involves the selection of initial seed points.
5.
APPLICATION AND METHOD
•Applications-Findingtumors ,veins etc in
medical images , finding targets in
satellite/aerial images , finding people in
surveillance images , summarizing video etc
•Methods- Thresholding , k-means clustering
etc
6.
FORMULATION
• Completeness-The segmentationmust be complete i.e,
𝑖=1
𝑛
𝑅𝑖 = 𝑅 Every pixel must be in a region
• Connectedness-The points of a region must be connected in
some sense
• Disjoint ness -Regions must be disjoint: 𝑅𝑖 𝑅𝑗 =∅ ∀𝑖 = 1,2, … 𝑛
7.
FORMULATION CONT.
• Satisfiability-Pixelsof a region must satisfy one common P(Ri) =
TRUE,∀𝑖 property P at least , i.e any region must satisfy a homogeneity
predicate P
• Segment ability - Different regions satisfy different P(𝑅𝑖 ∪ 𝑅𝑗) = FALSE
properties i.e any two adjacent regions cannot be merged into a single
region
8.
REGION GROWING
• Regiongrowing 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
THE ADVANTAGES OFREGION GROWING
• Region growing methods can correctly separate the regions that
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. We only need a small number of seed
points to represent the property we want, then grow the region.
11.
THE DISADVANTAGES OFREGION GROWING
• 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.
12.
REGION SPLITTING
•Region growingstarts 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.
13.
REGION MERGING
• Regionmerging 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