Bayesian analysis of cell nucleus segmentation by a Viterbi search based active contour
暂无分享,去创建一个
An image segmentation scheme is shown to be exceptionally successful through the application of high-level knowledge of the required image objects (cell nuclei). By tuning the algorithm's single parameter it is shown that the performance can be maximised for the dataset, but leads to individual failures that may require alternative choices. A second stage is introduced to process each of the resulting segmentations obtained by varying the parameter over the working range. This stage gives a Bayesian interpretation of the results which indicates the probable accuracy of each of the segmentations that can then be used to make a decision upon whether to accept or reject the segmentation.
[1] K. Lai. Deformable contours: modeling, extraction, detection and classification , 1995 .
[2] Bo Nordin,et al. The Development of an Automated Prescreener for the Early Detection of Cervical Cancer : Algorithms and Implementation , 1989 .
[3] Calum Eric MacAulay. Development, implementation and evaluation of segmentation algorithms for the automatic classification of cervical cells , 1989 .