Issue No. 05 - September (1988 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.6784
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.<
medical diagnostic computing, computerised pattern recognition, dynamic programming, kidney, hierarchical multiresolution, image matching, computerised pattern recognition, edge detection, biomedical image analysis, shape recognition, kidney glomerulus, dynamic programming, polygon, gray-level, model segments, Dynamic programming, Navigation, Mobile robots, Shape, Error analysis, Computer errors, Robotics and automation, Image analysis, Data mining, Biomembranes
"Recognition of kidney glomerulus by dynamic programming matching method," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 10, no. , pp. 731,732,733,734,735,736,737, 1988.