Professional Documents
Culture Documents
A.Puraneeswari
Post Graduate Student, M.E (Embedded systems)
The Kavery Engineering College,
Salem, India.
Abstract - Image segmentation is one of the most Doing so with a computer algorithm on the other hand
significant steps leading to the study the processed image is not so easy. What features distinguish one region from
data. This paper delivers a survey of achievements, another? What determines how many regions you have in
complications being encountered, and the open issues in a given image? To analysis the above, Discontinuity and
the investigation area of image segmentation and habit of regularity are two basic properties of the pixels in relation
the techniques in different areas. In this paper we have to their local region used in many segmentation method.
discussed about the image segmentation techniques
Intentionally alienated thresholding technique from
like Edge based, Region based and Threshold-based.
region based due to the procedure of histogram. Image
Region Growing is a method to image segmentation in
segmentation would have been easy if not because of,
which neighboring pixels are scanned and added to a
region session if no edges are detected. This process is Image - sound
repeated for each boundary pixel in the region. if Weak - object borders
adjacent regions are establish, a region-merging
Inhomogeneous object area
algorithm is used in which weak edges are dissolved and
Weak contrast and
strong edges are gone together. The algorithm is also
Many - others that shake images.
very constant with respect to noise.
An initial set of small parts are iteratively merged Region growing procedures can properly separate
according to parallel restrictions. the regions that have the equivalent properties we
Start by selecting an arbitrary seed pixel and compare define.
it with neighboring pixels. Region growing procedures can provide the
Region is grown from the seed pixels by adding the unique images which have clear edges the good
neighboring pixels that are parallel, growing the size segmentation results.
of the region. The theory is simple. We only need a small
When the progress of one region stops, we simply numbers of seed point to denote the property we
select other seed pixels which does not belong to any want, then propagate the region.
region and start again. We can regulate the seed point and the criteria
This whole process is continuous until all pixels fits to we need to make.
some region. We can choose the various criteria at the same
Region growing approaches often give very good time.
segmentation that relate well to the observed edges. It implements well with respect to noise.
The key goal of segmentation is to partition an There are limited main points that are important
image into regions. Specific segmentation methods such as to study once trying to segment an image. You must have
"Thresholding" achieve this goal by considering the regions that are disjoint as a single point cannot be
boundaries between regions based on discontinuities in restricted in two different regions. The regions need the
gray levels or color properties. distance in the entire image because each point has to fit to
one region or another. To get regions at all, you must
Basic theory of seed points: define various property that will be accurate for each
region that you define. To confirm that the regions are well
The first step in region growing is to select a
defined and that they are certainly regions themselves and
fixed the seed points. Seed point range is based
not some regions together or just a segment of a single
on some user principle (For instance, pixels in a
region, that property cannot be exact for any combination
certain gray-level range, pixels uniformly spaced
of two or more regions. If these principles are met, then
on a grid, etc.). The initial region creates the exact
the image is correctly segmented into regions. This paper
position of these seeds.
talk over two different region determination
The regions are grown up from these seed points techniques: one that motivations on edge detection as
to adjacent points depending on a region its main purpose characteristic and another that uses region
membership condition. For example, pixel growing to localize separate areas of the image. The region
strength, gray level surface, or color. growing procedures took various aspects in the potential
Since the regions are grown up on the basis of the sequences of processes that can lead to segmentation using
principle, the image information itself is region growing.
significant. For example, if the principle were a
pixel intensity threshold value, information of the IV. UNIFORM BLOCKING
histogram of the image would be of use, as one
Uniform blocking is the major part of this
could use it to regulate a suitable threshold value
algorithm. This part includes dividing the images into
for the region membership condition.
uniform blocks for processing. We usually use 2x2 segmenting algorithm to end up with a small number of
blocks, if region growing is, to work directly or16x16 regions by confirming that the output of the merge-split
blocks, if the merge-split algorithm is used. It shouldn’t algorithm has blocks that are no smaller than a specified
matter what block dimension is fed into the merge-split dimension. Without this feature there is a possible for the
routine, but picking an in-between value enriches the merge- split routine to return many small blocks. If these
speed for most images. blocks are not effectively merged by the region growing
algorithm, unwanted results are likely.