Abstract
This paper describes a protocol for systematically evaluating the performance of dashed-line detection algorithms. It includes a test image generator which creates random line patterns subject to prespecified constraints. The generator also outputs ground truth data for each line in the image. The output of the dashed line detection algorithm is then compared to these ground truths and evaluated using a set of criteria.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R.M. Haralick, “Detection Performance Methodology” Proceedings Image Understanding Workshop, Palm Springs, California, February 1996, Vol II, pp. 981–983.
J.D. Foley and A. Van Dam, “Computer Graphics, Principles and Practice” Addison-Wesley, Reading, Massachusetts, 1991
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kong, B., Phillips, I.T., Haralick, R.M., Prasad, A., Kasturi, R. (1996). A benchmark: Performance evaluation of dashed-line detection algorithms. In: Kasturi, R., Tombre, K. (eds) Graphics Recognition Methods and Applications. GREC 1995. Lecture Notes in Computer Science, vol 1072. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61226-2_22
Download citation
DOI: https://doi.org/10.1007/3-540-61226-2_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61226-1
Online ISBN: 978-3-540-68387-2
eBook Packages: Springer Book Archive