Evaluation of Interactive Segmentation Algorithms Using Densely Sampled Correct Interactions
dc.contributor.author | Haque, S.M. Rafizul | |
dc.contributor.author | Eramian, Mark G. | |
dc.contributor.author | Schneider, Kevin A. | |
dc.date.accessioned | 2015-08-06T21:51:10Z | |
dc.date.available | 2015-08-06T21:51:10Z | |
dc.date.issued | 2013 | |
dc.description.abstract | The accuracy and reproducibility of semiautomatic interactive segmentation algorithms are typically evaluated using only a small number of human observers which only considers a very small number of the possible correct interactions that an observer might provide. A correct interaction is one that provides contextual information that would be expected to result in a correct segmentation. In this paper, we demonstrate new evaluation methods for semiautomatic interactive segmentation algorithms that employ simulated observer models constructed from a large number of segmentations computed by uniformly sampling the entire set of possible correct interactions. The advantages of this method are that it is free of observer biases and the large number of segmentations produced for each object of interest to be segmented allow a range of statistical methods to be brought to bear on the analysis of segmentation algorithm performance. The methods are demonstrated using a semi-automated segmentation algorithm for ovarian follicles in ultrasonographic images. | en_US |
dc.description.refereed | Yes | en_US |
dc.identifier.doi | 10.1007/978-3-642-41181-6_20 | |
dc.identifier.uri | http://hdl.handle.net/1880/50843 | |
dc.identifier.uri | https://doi.org/10.11575/PRISM/46182 | |
dc.publisher | Springer | en_US |
dc.publisher.url | http://dx.doi.org/10.1007/978-3-642-41181-6_20 | en_US |
dc.title | Evaluation of Interactive Segmentation Algorithms Using Densely Sampled Correct Interactions | en_US |
dc.type | unknown |
Files
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.84 KB
- Format:
- Item-specific license agreed upon to submission
- Description: