Академический Документы
Профессиональный Документы
Культура Документы
Abstract: In the context of image segmentation For the purpose of image segmentation some extra nodes
for various image processing applications, a high denoted as terminals are required. Each terminal
quality segmentation of images is mandatory. corresponds to one of the possible pixel labels. For binary
Assuming a Graphical representation of the segmentation we need two terminals, the source s and the
images, we followed min-cut/max-flow sink t. In a terminal graph, each pixel is connected not only
segmentation algorithm. We used an original to its 8 neighbors, but also to the terminal nodes s and t.
initialization of the graph cut algorithm based on Hence, we distinguish two kinds of edges: n-links
the segmentation result of Boykov-Kolmogorov (neighboring links) are edges between two pixel nodes
approach. We then proposed our improvement for and t-links (terminal links) are edges between a pixel node
image segmentation using Simple Linear Iterative and a terminal. Thus, the two-terminal graph is defined as:
Clustering (SLIC) algorithm that efficiently uses
the color differentiation formula. Both sets of
results have been automatically classified
according to a set of significant features. Results
are compared
I. INTRODUCTION
Image segmentation involves the identification of regions of
interest, which generally are an object or a part in a digital
image. Each region must maximize the homogeneity of its
pixel’s features (color, texture) and simultaneously
maximize the differences with neighboring regions;
moreover, each region must be spatially compact. In
general, image segmentation is considered an important
initial step in most image processing applications, which use
the segmentation information in order to perform upper
level tasks, such as object tracking or identification, and
scenes interpretation.
Before stating the conditions that define a finite The Ford-Fulkerson method is called a method and
flow f in a network, let us denote all outgoing edges not an algorithm because it does not specify how
from node p and all incoming edges to node p by, one should go about finding the augmenting path.
O(p)={{p,q}∈E|q∈V} The Edmonds-Karp algorithm specifies that we use
I(p)={{q,p}∈E|q∈V} a breadth-first search to find a viable path in every
iteration.
respectively. The first condition is given by,
Boykov-Kolmogorov[2]: - This method gives the
values that can be assigned as the edge weights.
The n-link edges must have weights carefully
computed in order to reflect inter-pixel similarities.
Concretely, we want the weight of an edge to be
big with the two pixels are similar, and small when
they are quite different. One idea is to let the
weight be boundary penalty, a function that maps
which is comparable to Kirchhoff's current law. two pixel intensities to a positive integer. Let Ip be
Assuming that outcoming flows are positive and the brightness, or intensity, of the pixel vertex p.
incoming flows are negative, the sum of all outgoing
For any edge (p,q)∈E, the boundary
and incoming flows must be zero for all nodes but the penalty B(Ip,Iq) is defined to be: -
source and the sink. The flow emerging from the
source, f, is equal to the flow arriving at the sink.
Secondly, capacities must be finite, i.e., c{p,q}<∞.
Finally, the flow within an edge cannot exceed its
capacity, f(p,q)≤c{p,q}.
Efficient Implementation of Max-Flow
Regional Property: - This the property that helps
We have adopted the min-cut/max-flow algorithm in determining the edge weights for the source and
proposed in ,which is broadly used in the literature. It the sink of the graph,
is based on the augmenting path concept .The
algorithm works on a residual graph Gf, which is
initialized as G. In each iteration, a path along non
saturated edges from s to t is searched in Gf. The
smallest capacity along the path determines the
maximum flow Δf that can be pushed. The residual
capacities of the edges along the augmented path are
reduced by Δf, while the residual capacities of the
reverse edges are increased by the same amount. The
total flow from s to t is increased, f=f+Δf. The algorithm
terminates when there are no more s→t possible paths.
VII References
[1] Raquel Fandos, Leyna Sadamori and Abdelhak M. Zoubir ” HIGH
QUALITY SEGMENTATION OF SYNTHETIC APERTURE SONAR IMAGES USING
THE MIN-CUT/MAX-FLOW”
[2] Y. Boykov and V. Kolmogorov, “An experimental comparison of
min-cut/max- flow algorithms for energy minimization in vision,”
IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.
26, no. 9, pp. 1124 – 1137, 2004..
[3] Radhakrishna Achanta, Appu Shaji, Kevin Smith, Aurelien Lucchi,
Pascal Fua, and Sabine S•usstrunk.
[4] Gaurav Sharma, Wencheng Wu,Edul N. Dalal “
The CIEDE2000 Color-Difference Formula: Implementation
Notes, Supplementary Test Data, and Mathematical Observations”