By Topic

Recognition of kidney glomerulus by dynamic programming matching method

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

3 Author(s)
Yamada, H. ; Nat. Res. Council, Ottawa, Ont., Canada ; Merritt, C. ; Kasvand, T.

Dynamic programming was applied to locate the glomeruli in microscopic images of kidney tissue section. The glomeruli were modeled by a polygon whose sides could be varied within a given range of lengths. The objects were located by determining the best match of the model according to a so-called optimum criterion in which all possible shapes were evaluated at all possible positions in the input image. The best model was selected according to the maximum average gray level. To increase the probability of obtaining a closed contour, a distance criterion was added and the maximum gray-level requirement was relaxed somewhat. The optimum criterion was modified to include a directionality constraint in which the difference in angle between model segments and the edge values in the image was minimized, thereby increasing the performance of the method. A hierarchical multiresolution strategy was used to reduce calculation time. The cyclical property of a contour is also taken into account.<>

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:10 ,  Issue: 5 )