By Topic

Optimizing the Level Set Algorithm for Detecting Object Edges in MR and CT Images

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Heydarian, M. ; Dept. of Comput. & Software, McMaster Univ., Hamilton, ON ; Noseworthy, M.D. ; Kamath, M.V. ; Boylan, C.
more authors

Specifying the boundary of tissues or an organ is one of the most frequently required tasks for a radiologist. It is a first step for further processing, such as comparing two serial images in time, volume measurements. In the present work, we use genetic algorithms (GA) and where necessary apply a ldquodynamic genetic algorithmrdquo (dGA) procedure, which (we believe) is a unique application, to assess different values for finding an optimal set of parameters that characterize the level set method, a geometric active contour, for use as a boundary detection method. Four quantitative measures are used in calculating geometric differences between the object boundaries, as determined by the level set method, and the desired object boundaries. A semi-automated method is also developed to find the desired boundary for the object. A two-step method requires the user to manipulate the object boundaries obtained by applying an edge detection method based on the Canny filter. By setting the level set method parameters using the output of the GA we obtain accurate boundaries of organs automatically and rapidly.

Published in:

Nuclear Science, IEEE Transactions on  (Volume:56 ,  Issue: 1 )