Active contours of biomedical imaging

Er.AsadUllah et al., International Journal of Research in Engineering and Social Sciences

ISSN 2249-9482, Volume 6 Issue 05, May 2016, Page 19-29

Page 19 www.indusedu.org

Active contours of biomedical imaging

Er.AsadUllah1, Abid Jamil

2, Mohsin Rehman

3

1(Lecturer, Electrical Engineering Department, Riphah International University, Faisalabad, Contact No:

+923129113166, Email: [email protected]) 2(Lecturer, Department of Computing, Riphah International University, Faisalabad, Contact No: +923009637481,

Email: [email protected]) 3(Lecturer, Department of Computing, Riphah International University, Faisalabad, Contact No: +923247757991,

Email: [email protected])

_____________________________________________________________________________________________

Abstract: The active contour models are widely used for segmentation. The Biomedical images require quality

segmentation that can only be provided by active contours plus we need computational complexity as well. In this

paper, a new model is proposed for active contours to detect objects in a given image, based on techniques of curve

evolution, Mumford Shah functional and level sets. Those objects can also be detected whose gradient is not

necessarily defined. Energy is minimized that can be particular case of minimal partition problem. Stopping term is

related to particular segmentation rather instead of dependent on gradient of image. At last, various experimental

results are presented and the differences of this model with other techniques are also elaborated. The initial curve

can be anywhere in the image and interior contours are automatically detected.

I. INTRODUCTION

Numerous of methods have been suggested for active contours during recent years. The key principle is based on the

utilization of the deformable contours to transform into various shapes and motions. Active contour approach is a

framework used for delineating outline of an object from a noisy 2d image. Such contours are used in minimizing

energy. It is used for edge detection, curve detection, shape recognition, image segmentation and object tracking

[13].

The most important and main concept in active contour model is curve evolution around objects in image. This

model starts outlining a curve around the object that will be detected. It moves towards interior normal of that

object. It should stop at the boundary of that object [6].In active contour approach, an edge detector is used to find

image gradient. The image gradient represents a directional change in the intensity of an image. It is used to stop the

curve evolution around desired object boundary [8].

The active contour model is used to control smoothness of object in contour i.e. (internal energy). The contour is

attracted to the object in proposed image i.e. (external energy). A general function of edge-detector is defined by

positive decreasing function, i.e. 𝑘, It is used in gradual blend of the color for gradation from the low level to high

level values. It is used in image to convert from white to black. Such that

𝑙𝑖𝑚𝒛→∞ 𝑘(𝑧) = 0 (I.1)

The smoother version of image𝑥0 is obtained by convolving that image with Gaussian𝐺 =(𝑥, 𝑦). The function

obtained give positive result in the regions that are homogeneous and gives null at edges.

In problems regarding curve evolution that reduces set of the vertices into the subset of vertices. It contains

important information regarding original contour. Level-set method is the technique used for the tracking of shapes

and interfaces. Its benefit is that numerical computations can be made possible involving curves. Osher and Sethian

[21] is also used comprehensively, because by its corners, cusps and changes that occurs topologically. Furthermore,

process of transferring of continuous models and equations into respective discrete counterparts. The object curve C

is represented through Lipchitz function. Curve evaluation is represented by zero level curves at function time.

Solving differential equation [21] 𝜕ᴪ

𝜕𝑥= ᴪ , 𝐹, ᴪ (0, 𝑥, 𝑦) = ᴪ0(𝑥0, 𝑦0) (I.2)

In which set {(𝑥, 𝑦)}ᴪ0(𝑥0, 𝑦0) = 0 defines the initial contour. A geometric model is given by following equation

[6] which is based on motion of the mean curvature. The zero level curve in image moves in usual direction with the

pace which is𝑘(𝑥0) (𝑐𝑢𝑟𝑣 (ᴪ) (𝑥, 𝑦) + )and stops n the desired edge where 𝑘vanish.

mailto:[email protected]






In (𝑑𝑖𝑣 (ᴪ(𝑥, 𝑦)/ ᴪ(𝑥, 𝑦)) + 𝑣) where 𝑣 is used as correction term and the whole term always remains

constructive. This𝑣will interpret as power which will push that curve towards object, when the curvature becomes

negative rather null. It also increases propagation speed.

In other active contour approaches which are fundamentally on level sets and they are proposed in [17]. There is

problem about geodesic computation regarding Riemannian space. Its shortest path between two points in curved

space so that can be found by writing equations for length of curve and minimize the length using calculus of

variations. It is broad and abstract way of generalization of differential geometry in R3 surface. It deals with the

extensive range of the geometries whose characteristics differ point to point.

All classical and traditional active contour models rely on 𝑘 i.e. edge-function, depending on gradient of image

𝑥0, stopping curve evolution. Those objects can only be detected whose edges are defined through gradient.

Normally, the distinct gradients which are surrounded and stopping function 𝑘by no means gives null at the edges.

Thus curve may also pass through edge, especially for the models in [6].If image 𝑥 0is noisy, then isotropic

smoothing Gaussian must be well-built and edges will be smoothened mean 2d convolution operator is used for

blurring images [17]. Such operator removes detail and noise. It is similar to mean filter but different kernel is used

that represent Gaussian shape.

Boundary detection is based on detection of discontinuities regarding that image. It is commonly known as edge

detection or contour. It examines local edges throughout image and exploits the spatial information through it.

Though, conventional methods used for edge finding are Laplacian, Sobel and Prewit. They yields lot of false

boundaries and additional processing is required in removing them. So they become computationally costly.

Whereas for plain and noiseless images, straightforward delineation occurs by detection of edges, while edge

exposure of noisy images even produces absent edges frequently. Thus detected borders do not certainly results in

forming set of closed associated curves surrounding connected regions.

Most important class of the deformable models is Active contours that were anticipated by Kass-et-al [17]. Active

contours are planar and deformable which are valuable in many image examination tasks. Often used in

approximating shapes and locations of object edges based on rational supposition that the edges are piecewise

continuous or even. It means that active contour model is a supervised technique while having prior knowledge

regarding location, shape and size of R.O.I. and contours are required to be initialized.

Among all deformable models classical active contour model is more suitable for biomedical images. It is because

of the importance that biomedical images demands best quality segmentation. This can only be provided through

classical active contours. However, performance of active contours depends on the closeness of initial contours to

actual boundaries. Unfortunately, prior knowledge regarding regions of interest generally does not exist for

biomedical images. Hence, it is complicated for employing active contours in biomedical images for segmentation.

Considering medical imaging where assignment is to sense cancer or some extra irregularity. Thus it is hard to

achieve the prior information regarding location of such irregularity. While not having prior information active

contours cannot be reliably entertained in such case.

A different approach is proposed in this research work, without having stopping function 𝑘. It is an approach that

isnot based on gradient of image 𝑥 0 for stopping procedure. Stopping expression in this research work is

incorporated by Mumford-shah techniques [20]. Model is obtained that can sense contours with or exclusive of the

gradient. Furthermore, this model has level set function which can automatically detects interior contours and

preliminary curve may be at any place in the image.

II. LITERATURE REVIEW

Concise overview is stated to tell for what purpose active contour is used and how it works. Henceforth the

differences between active contour methods have been discussed. Active contours are employed in field of image

processing in-order to object outline. Attempting to check the outline of object through low rank image processing

task,canny edge detection is used that is not successful enough. Often edge is non-continuous mean it can consists of

holes along edge, and false edges could be there because of noise. While implementing beneficial properties of

smoothing and adding continuity to object contour and improve results. This means that firm degree of earlier

knowledge is added to active contour method for dealing with dilemma of finding contour of object.




Figure II-1: Illustration of a parametric curve.. The blue dot marks the starting point and end point of the active

contour curve. Ideally the active contour will have minimized its energy when it has positioned itself on the contour

of the object.

1. Original Snake by Kass, Witkin and Ter-zopoulos The active contours thought was initiated by Kass, Witkin and Ter-zopoulos i.e. "Snakes: Active Contour Models".

It was very dominant and research was much sparked.

Snake is generally a parametric curve which takes its location when energy is reduced. For manipulating snake

energy the Energy functional introduced was

𝐸∗𝑠𝑛𝑎𝑘𝑒 = ∫ 𝐸𝑠𝑛𝑎𝑘𝑒(𝑣(𝑠))𝜕𝑠

1

0

= ∫ 𝐸𝑖𝑛𝑡(𝑣(𝑠)) + 𝐸𝑒𝑥𝑡(𝑣(𝑠))𝜕𝑠 1

0 (II.1)

=∫ 𝐸𝑖𝑛𝑡(𝑣(𝑠)) + 𝐸𝑖𝑚𝑔(𝑣(𝑠)) + 𝐸𝑐𝑜𝑛(𝑣(𝑠))𝜕𝑠1

0

It consists of three terms. Internal energy is represented by 𝐸𝑖𝑛𝑡 .Image forces are denoted by𝐸𝑖𝑚𝑔 . The term

𝐸𝑐𝑜𝑛raises constraint forces. External active contour energy represented by 𝐸𝑒𝑥𝑡 is composed of external constraint

forces and image forces. The𝐸𝑖𝑛𝑡is written as

𝐸𝑖𝑛𝑡 = (𝛼(𝑠)║𝑉𝑠(𝑠)║2

+ ║𝛽(𝑠)𝑉𝑠𝑠(𝑠)║2

) 2⁄ (II.2)

First order term is controlled byα(s) while second order term is controlled byβ(s).First order term treat it like

membrane while second term as thin plate. By adjusting weights the comparative importance of membrane and thin

plates terms could be controlled. Making second term zero gives second order non- continuous and generates a

corner. Loweringα(s)and β(s)makes the active contour more deformable.

The 𝐸𝑖𝑚𝑔 is used to catch the attention of active contour to preferred attributes in image. 𝐸𝑐𝑜𝑛 is mainly user

interactive that is compatible to high level understanding. It is helpful in pulling out active contour from unwanted

local minimum.

2. An Active Contour Balloon Model The original active contour model developed by Kass et al. was advanced by Laurent D.Cohen in paper i.e. "Active

Contour Models and Balloons". The model generated by Cohen works on same law which was in previous one. The

difference between them is that when there is no influence of 𝐸𝑖𝑚𝑔the Kass et al. active contour shrank and Cohen

active contour expands. This expansion resembles to a balloon that’s the reason for its name.




When initial curve is detected that lies inside object, balloon technique is very competent in that case. Looking for

cavity boundary in image, Estimation is taken by low value threshold of image after applying mathematical

operations. By taking estimated boundary as initial value, the balloon is expanded. It is accurately to cavity

boundary. It can solve few problems which the previous active contour model faced. The definition was customized

of external forces to attain good results. A pressure force introduced which makes the curve behave like balloon.

These changes made by balloon active contour made it possible to detect the contours of objects. This is done by

inserting the active contour inside object rather than outside the object, and gives more accurate results.

3. The Greedy Active Contour Algorithm This algorithm was initiated by D. J. Williams and M. Shah. They provided different approach then the active

contours mentioned above. It worked out on movement of active contour points in discrete way. In Kass et al.

algorithm the iteration of whole active contour was computed at once. This algorithm consists of calculating

movement of individual active contour point on discrete index of image. The progress of each active contour point is

calculated by having a look at its neighborhood pixels around it. Thus, it moves the point to position where the

energy term is minimized. The name of greedy algorithm is taken from the phenomenon of active contour points

acquiring their new positions.

The algorithm is given as

𝐸𝑐𝑜𝑚𝑏(𝑥, 𝑦) = 𝛼(𝑠𝑖)𝐸𝑒𝑙𝑎𝑠(𝑥, 𝑦) + 𝛽(𝑠𝑖)𝐸𝑐𝑢𝑟𝑣𝑒(𝑥, 𝑦) + 𝛾(𝑠𝑖)𝐸𝑖𝑚𝑔(𝑥, 𝑦)

Where 𝐸𝑒𝑙𝑎𝑠(𝑥, 𝑦) is elasticity energy? 𝐸𝑐𝑢𝑟𝑣𝑒(𝑥, 𝑦) is curvature energy.𝐸𝑖𝑚𝑔(𝑥, 𝑦) is image energy and the indices

to points in neighborhood is denoted by (𝑥, 𝑦). Moreover in this algorithm while controlling image energy influence

another parameter γ is used. Once collective energy has been manipulated for all points in neighborhood, the

algorithm moves active contour control point at position that is having minimum combined energy. Thus name of

this algorithm is suggested from its behavior.

4. The Gradient Vector Flow This is one of more recent models which have been developed by Xu and Prince. It was developed for the sake of

raise in capture range and to advance active contour ability to progress into the boundary concavities. The range of

capturing the original active contour was usually restricted to the neighborhood of desired contour. In addition

original active contour was having problems while moving in concave areas. E.g. progressing in concave region of

objects which were U- shaped.

In this algorithm a new external force is introduced for the sake of handling the problems occurred previously. This

force is thick vector field which is taken from image by reducing energy functional in framework. Xu and Prince

mentioned those fields as GVF fields. The GVF field is 𝑣(𝑥, 𝑦) = (𝑢(𝑥, 𝑦), 𝑣(𝑥, 𝑦)) which minimizes the energy

functional as followed

휀 = (𝑢𝑥2 + 𝑢𝑦

2 + 𝑣𝑥2 + 𝑣𝑦

2) + ║𝑓║2║𝑣 − 𝑓 ║

2𝜕𝑥𝜕𝑦 (II.3)

In this equation,𝑓 is used as gray level that can be achieved using canny edge detection. The parameter stabilizes

the first term sorted in integrand. That term is used for smoothing which is derived from optical flow formulation

Xu-98. If the image is having much noise then must be increased for compensation. If ║𝑓║is having small value

then the first term would be dominating and thus energy functional would be slowly verifying field. If ║𝑓║is

having big value then the second term would be the dominating one and hence for minimizing energy 𝑣 = 𝑓. In

homogeneous regions, the vector field 𝑣 slowly varies and at current time it is almost equal to gradient of gray

level/edge map in areas where its gradient is large.

III. MODEL DESCRIPTION

The evolving curve is defined as 𝐶 in region, as open subset boundary (i.e. and = 𝜕 ). is denoted by

region inside (𝐶) and / is denoted by region outside (𝐶). In this method, the energy of segmentation is minimized. Basic plan of this method is elaborated through following procedure. Assume image 𝑥0that is basically

composed of two regions of nearly piecewise- constant intensities of values 𝑥0𝑖 and𝑥0

𝑜. Further assumption is that




object which has to be detected is characterized by region with value 𝑥0𝑖. Let the boundary be denoted by C0. Then

𝑥0 ≈ 𝑥0𝑖is inside object, and 𝑥0 ≈ 𝑥0

𝑜is outside object. Now considering the "fitting" term

𝐹1(𝐶) + 𝐹2(𝐶) = ∫ 𝑥0(𝑥, 𝑦) − 𝑏12

𝑖𝑛𝑠𝑖𝑑𝑒 (𝐶)

𝜕𝑥𝜕𝑦

+ ∫ 𝑥0(𝑥, 𝑦)– 𝑏22

𝜕𝑥𝜕𝑦𝑜𝑢𝑡𝑠𝑖𝑑𝑒(𝐶)

(III.1)

Where 𝑏1 and 𝑏2 are constants that depend on 𝐶 and they are averages of 𝑥0inside 𝐶and 𝑥0 outside 𝐶. In

this case, it is pretty clear that Co is boundary of object which is the reducer of fitting term

𝑖𝑛𝑓𝐶{𝐹1(𝐶) + 𝐹2(𝐶)} ≈ 0 ≈ 𝐹1(𝐶0) + 𝐹2(𝐶0)(III.2)

This could be noticed easily. For example, if curve 𝐶 is lying outside object, then 𝐹1(𝐶) > 0 and 𝐹2(𝐶) ≈ 0 and if curve 𝐶 is within object then 𝐹1(𝐶) ≈ 0 and 𝐹2(𝐶) > 0 and if curve 𝐶 is both within and out of object

then 𝐹1(𝐶) > 0 and 𝐹2(𝐶) > 0 . At last minimization takes place when 𝐶 = 𝐶0, i.e. for the curve over the boundary

of object. These comments are illustrated in Fig. III -1.

In this model few of regularizing terms must be added for minimizing the fitting term mentioned above.

Those terms are length of Curve 𝐶, and area of region inside C. Hence, energy functional has been defined as

𝐹(𝑏1, 𝑏2, 𝐶) = . 𝐿𝑒𝑛𝑔𝑡ℎ(𝐶) + 𝑣 . 𝐴𝑟𝑒𝑎(𝑖𝑛𝑠𝑖𝑑𝑒(𝐶))

+ 1 ∫ 𝑥0(𝑥, 𝑦) − 𝑏12

𝜕𝑥𝜕𝑖𝑛𝑠𝑖𝑑𝑒(𝐶)

𝑦

+ 2 ∫ 𝑥0(𝑥, 𝑦) − 𝑏22

𝜕𝑥𝜕𝑦𝑜𝑢𝑡𝑠𝑖𝑑𝑒(𝐶)

(III.3) Where 0, 𝑣 0, 1 , 2 > 0 are set parameters. In

nearly all numerical calculations, 1 = 2 = 1 and 𝑣 = 0.

Remark 1: In this model, the 𝐿𝑒𝑛𝑔𝑡ℎ(𝐶) term has been produced in more generalized way as (𝐿𝑒𝑛𝑔𝑡ℎ (𝐶))pr, with

𝑝𝑟 1. For the scenario of arbitrary case N > 1, then the value of 𝑝𝑟can be: 𝑝𝑟 = 1 or 𝑝𝑟 = N/ (N - 1). The

isoperimetric inequality has been used for last expression [9] that demonstrates that (𝐿𝑒𝑛𝑔𝑡ℎ(𝐶))N/ (N-1) is almost

equal to 𝐴𝑟𝑒𝑎 (𝑖𝑛𝑠𝑖𝑑𝑒 (𝐶)):

Fig. III-1 All possible cases have been considered. The fitting term is only minimized when the curve is on the

boundary

𝐴𝑟𝑒𝑎(𝑖𝑛𝑠𝑖𝑑𝑒(𝐶)) 𝑏. (𝐿𝑒𝑛𝑔𝑡ℎ(𝐶))𝑁

𝑁−1

(III.4)

Where b is constant that depends on N

1. Relation with Mumford- Shah

𝐹𝑀𝑆 = . 𝐿𝑒𝑛𝑔𝑡ℎ(𝐶) + ∫ 𝑥0(𝑥, 𝑦) − 𝑥(𝑥, 𝑦)2

𝜕𝑥𝜕

𝑦




+ ∫ 𝑥 (𝑥, 𝑦)2

𝜕𝑥𝜕\𝐶

𝑦 (III.5)

Where 𝑥0 is the image which is given and and are parameters with positive values. The desired object 𝑥 is

obtained by smoothing regions and having sharp boundaries, and is formed by reducing the functional.

This problem is converted to reduced form by simply restricting 𝐹𝑀𝑆 to piecewise constant functions𝑥. Thus the

reduced form is also elaborated as minimal partition problem. This model with 𝑣 = 0 and 1 = 2 = is

generally the case of minimal partition problem, where the best approximation 𝑥 of 𝑥0has been considered

𝑥 = {𝑎𝑣𝑒𝑟𝑎𝑔𝑒 (𝑥0)𝑖𝑛𝑠𝑖𝑑𝑒 𝐶

𝑎𝑣𝑒𝑟𝑎𝑔𝑒 (𝑥0)𝑜𝑢𝑡𝑠𝑖𝑑𝑒 𝐶(III.6)

2. Level Set Formulation of Model In the level set method [21], 𝐶 that is characterized by zero level set of Lipschitz function ᴪ, such that

{

𝐶 = 𝜕 = {(𝑥, 𝑦) ∶ ᴪ(𝑥, 𝑦) = 0}

𝑖𝑛𝑠𝑖𝑑𝑒(𝐶) = = {(𝑥, 𝑦) ∶ ᴪ(𝑥, 𝑦) > 0}

𝑜𝑢𝑡𝑠𝑖𝑑𝑒(𝐶) = \ = {(𝑥, 𝑦) ∶ ᴪ(𝑥, 𝑦) < 0}

Recalling that is open and 𝐶 = 𝜕. In fig.III-2 the above suppositions and notations has been considered on

level set functionᴪ,which defines the evolving curve. In level set formulation the unknown variable 𝐶 is being

replaced by ᴪ because of variation [25].

Fig. III-2𝐶𝑢𝑟𝑣𝑒 𝐶 = {(𝑥, 𝑦): ᴪ(𝑥, 𝑦) =} propagating in normal direction.

Using Heaviside function 𝐻 and single dimensional Dirac measure𝛿0 that is defined as

𝐻(𝑧) = {1, 𝑖𝑓 𝑧 00, 𝑖𝑓 𝑧 < 0

𝛿0 = 𝜕

𝜕(𝑧) 𝐻(𝑧)

𝐿𝑒𝑛𝑔𝑡ℎ {ᴪ = 0} = ∫ 𝐻 (ᴪ(𝑥, 𝑦))

∂x∂y

= ∫ 𝛿0(ᴪ(𝑥, 𝑦)) ᴪ(𝑥, 𝑦)

𝜕𝑥𝜕𝑦

𝐴𝑟𝑒𝑎 { ᴪ 0} = ∫ 𝐻 (ᴪ(𝑥, 𝑦))

𝜕𝑥𝜕𝑦

Then, energy 𝐹 (𝑏1, 𝑏2, ᴪ) would be written as




𝐹 (𝑏1, 𝑏2, ᴪ) = ∫ 𝛿(ᴪ(𝑥, 𝑦)) ᴪ(𝑥, 𝑦)𝜕𝑥𝜕𝑦 + 𝑣 ∫ 𝐻 (ᴪ(𝑥, 𝑦))

𝜕𝑥𝜕𝑦

+ 1 ∫ 𝑥0(𝑥, 𝑦) − 𝑏12

𝐻 (ᴪ(𝑥, 𝑦))𝜕𝑥𝜕

𝑦

+ 2 ∫ 𝑥0(𝑥, 𝑦) − 𝑏22

(1 − 𝐻 (ᴪ(𝑥, 𝑦))) 𝜕𝑥𝜕

𝑦

Where,

𝑏1(ᴪ) = ∫ 𝑥0(𝑥, 𝑦) (𝐻(ᴪ(𝑥, 𝑦)))

𝜕𝑥𝜕𝑦

∫ (𝐻(ᴪ(𝑥, 𝑦)))

𝜕𝑥𝜕𝑦

And,

𝑏2(ᴪ) = ∫ 𝑥0(𝑥, 𝑦) (1 − 𝐻(ᴪ(𝑥, 𝑦)))

𝜕𝑥𝜕𝑦

∫ (1 − 𝐻(ᴪ(𝑥, 𝑦)))

𝜕𝑥𝜕𝑦

For non-empty exterior curve regarding "degenerate" cases, the values of 𝑏1and 𝑏2has no constraints. Then, 𝑏1 and

𝑏2are given by

{𝑏1(ᴪ) = 𝑎𝑣𝑒𝑟𝑎𝑔𝑒 (𝑥0) 𝑖𝑛 {ᴪ 0}

𝑏2(ᴪ) = 𝑎𝑣𝑒𝑟𝑎𝑔𝑒 (𝑥0) 𝑖𝑛 {ᴪ < 0}

Remark 2: By previous formulae, this can be seen that energy can only be written in form of 𝐻 (ᴪ), which is

characteristic function of the set .

In order to manipulate the related Euler- Lagrange equation for ᴪ i.e. unknown function, the regularized versions has

been considered of 𝐻 and 𝛿0. They are denoted by 𝐻𝜀 and 𝛿𝜀, as 휀 → 0. Let 𝛿𝜀 = 𝐻′𝜀 and 𝐻𝜀is any regularization of

𝐻. So regularized associated functional would be 𝐹𝜀

𝐹𝜀(𝑏1, 𝑏2, ᴪ) = ∫ 𝛿𝜀(ᴪ(𝑥, 𝑦)) ᴪ(𝑥, 𝑦)𝜕𝑥𝜕𝑦 + 𝑣 ∫ 𝐻𝜀 (ᴪ(𝑥, 𝑦))

𝜕𝑥𝜕𝑦

+ 1 ∫ 𝑥0(𝑥, 𝑦) − 𝑏12

𝐻𝜀 (ᴪ(𝑥, 𝑦))𝜕𝑥𝜕

𝑦 + 2 ∫ 𝑥0(𝑥, 𝑦) − 𝑏22

(1 − 𝐻𝜀(ᴪ(𝑥, 𝑦)))𝜕𝑥𝜕

𝑦

IV. EXPERIMENTAL RESULTS

This research work presents mathematical results on numerous artificial and true biomedical images. Variety of

contours and figures are used. In this research evolution of curve round the image 𝑥0 and related estimation is

calculated. The description of which can transform depending on self-determining variable taken through mean of

𝑏1, 𝑏2. In this research work values of lambdas are taken 1.𝑣 is taken as 0.𝛥𝑡 is taken 0.1 and ℎ taken as 1. Where 𝛥𝑡

is time step, ℎ is step space. To automatically detect the internal contours and insuring working out of global

reducer, estimation of delta and Heaviside functions has been made ℎ = 1, 휀 = 1. Just parameter of length has

been differed in all tests is used for scaling purpose. For detecting as much as possible objects of any size, value of

would be minimum. For detecting bigger objects and not detecting small objects mean noise created points so in

that case would have been assigned large value. Accurate values of and ᴪ0 has been taken every time, processing

time is taken in seconds while manipulating results. This is executed on Intel (R) Atom (TM) CPU N570 @

1.66GHz (4CPU's), Windows 7 starter 32-bit and 1 GB RAM.

Finally, the key steps of algorithm are:

• Initialize by ᴪ0 by ᴪ0, 𝑛 = 0.

• Compute𝑏1(ᴪ𝑛) and 𝑏1(ᴪ𝑛)

• Solving PDE in ᴪ to get ᴪn+1.

• Check whether the result is stationary. If not,

𝑛 = 𝑛 + 1 and then repeat.

The use of PDE which is time dependent for ᴪ is not critical. The problem of stationary can be achieved directly

from minimization problem and could be numerically solved, while exercising a related finite differences method.




Fig IV-1 MRI of brain ventricle. Tracking object with number of iterations using Gradient Vector Flow.

Fig. IV-2 Detection of contours in blurred image. Size of image133 x 128, with value 0.5, no. of iterations 200 and

cpu time 54.5s




Fig.IV-3 Detecting objects in image through imcontour with value of 3.

Fig.IV-4 Detection of the defected area i.e. Skin cancer through Active contour model by changing the parameters.

Fig.IV-5 Lungs cancer detection with no. of iterations200 and value 0.5.




V. CONCLUSION

In this research work, an active contour model is proposed for boundary detection of biomedical images using level-

set method. This model is not using edge function for stopping the curve evolving on the boundary which is desired.

There is no need of smoothing the original image. Although if the image is noisy, and the boundary locations are

detected very well and well preserved. In this model the objects can be detected whose boundaries are very smooth

or gradient wise defined. For which classical approach is not applicable. Applying active contour at the ending

period gives precise outcomes and as a result, the anticipated model verifies to be good selection for biomedical

imaging. This is obtained by given outcomes. Moreover, the algorithm really works fit on images having fine

contrast. The images having interested areas well notable while in gray-scale then image background.

As a result, Improvement of image is essential in the preprocessing for the images having random contrast. Using

this model the boundaries of interior contours are automatically detected starting with just first initial curve. Starting

position of the initial contour can be at any place for the prescribed image. The objects are not surrounded

necessarily. Various images are used in this research work for better results and then results are compared plus

modified. This is proposed for biomedical images and the detection of the affected area in the image. It is having

less computational complexity. The model is validated by numerous results.

References

[1] AUBERT, G. and VESE, L. (1997) A variational method in image recovery. Journal on Numerical Analysis, Vol. 34, pp. 1948–1979.

[2] BLAKE, A. and YUILLE, A. (1992) Active Vision. MIT Press, Cambridge.

[3] BYERS, S. and RAFTERY, A. (1998) Nearest-neighbor cluster removal for estimating features in spatial point processes. Journal on America Statististic Association, Vol.93, pp. 577–584.

[4] CARMO, M.P. (1992) Riemannian Geometry. Prentice-Hall, New Jersey.

[5] CHAN, T. F. and VESE, L. A. (2001) Active contours without edges. IEEE Transactions on Image Processing, Vol. 10, pp.1999-2012. [6] CASELLES, V., CATTE , F. , COLL, T. and DIBOS, F. (1993) A geometric model for active contours in image processing. Numerical

Mathematics, Vol. 66, pp. 1–31.

[7] DASGUPTA, A. and RAFTERY, A. (1998) Detecting features in spatial point processes with cluster via model-based clustering. Journal on

America Statististic Association, Vol. 93, pp. 294–302.

[8] DERICHE, R. and PARAGIOS, N. (1999) Geodesic active regions for motion estimation and tracking. Project Robotics, Vol. 9, pp. 254-279

.

[9] EVANS, L.C. and GARIEPY, R. F. (1992) Measure Theory and Fine Properties of Functions. Boca Raton, Florida, USA

[10] FLEISCHER, K. and TERZOPOULUS, D.(1988) Deformable Models. The Visual Computer, Vol. 4, pp. 306-331.

[11] GAGE, M. and HAMILTON, R. S. (1986) The heat equation shrinking convex plane curves. Journal on Differential Geometry, Vol. 23, pp. 69-96.

[12] KANG, M., ZHAO, H.K., MERRIMAN, B. and OSHER, S. (1998) Implicit, nonparametric shape reconstruction from unorganized points using a variational level set method. Computer Vision and Image Understanding, Vol. 3, pp. 4- 19.

[13] KASS, M., WITKIN, A. and TERZOPOULOS, D. (1988) Snakes: Active contour models. International Journal On Computer Vision, Vol. 1,

pp. 321–331

[14] KICHENASSAMY, S., KUMAR, A., TANNENBAUM, A. and YEZZY, A. (1995) Gradient flows and geometric active contour models. Processing International Conference Computer Vision, Vol.5, pp. 810–815.

[15] LEE, M.S. and MEDIONI, G. (1995) Inferred descriptions in terms of curves, regions and junctions from sparse, noisy binary data. Processing IEEE International Symposium on Computer Vision, Vol.10, pp. 73–78.

[16] LOPEZ, C. and MOREL, J. M. (1992) Axiomatization of shape analysis and application to texture hyper discrimination. Processing Trento Conference Surface Tension Movement Mean Curvature, Berlin, Germany.

[17] MALLADI, R., SETHIAN, J.A . and VEMURI, B. C. (1993) A topology independent shape modeling scheme. Conference on Geometric

Methods Computer Vision II, Vol. 2031, pp. 246–258.




[18] MASO, G.D., MOREL, J. M. and SOLIMINI, S. (1992) A variational method in image segmentation: existence and approximation results.

Mathematics Act, Vol. 168, pp. 89–151.

[19] MOREL, J. M. and SOLIMINI, S.(1988) Segmentation of Images by Variational Methods: A Constructive Approach. Mathematics

Magazine Madrid, Vol. 1, pp. 169–182.

[20] MUMFORD, D. and SHAH, J. (1989) Optimal approximation by piecewise smooth functions and associated variational problems.

Community Pure Apple Math, Vol. 42, pp. 577–685.

[21] OSHER, S., and SETHIAN, J. A. (1988) Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton–Jacobi

Formulation. Journal on Computer Physics, Vol. 79, pp. 12–49.

[22] PARAGIOS, N. and DERICHE, R. (1998) Geodesic Active Regions for Texture Segmentation. Computer vision and Robotics group, Vol.1,

pp. 5- 29.

[23] ROUY, E. and TOURIN, A. (1999) A viscosity solutions approach to shape-fromshading. Journal on Numerical Anaysis, Vol. 29, pp. 867–

884.

[24] RUDIN, L., OSHER, S. and FATEMI, E. (1992) Nonlinear total variation based noise removal algorithms. Physics, Vol. 60, pp. 259–268.

[25] SIDDIQI, K., LAUZIERE, Y. B., TANNENBAUM, A. and ZUCKER, S.W. (1998) Area and length minimizing flows for shape segmentation.

IEEE Transactions on Image Processing, Vol. 7, pp. 433–443.

Documents

Active contours of biomedical imaging