• DocumentCode
    2631038
  • Title

    A methodology for the characterization of the performance of thinning algorithms

  • Author

    Jaisimha, M.Y. ; Haralick, Robert M. ; Dori, Dov

  • Author_Institution
    Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA
  • fYear
    1993
  • fDate
    20-22 Oct 1993
  • Firstpage
    282
  • Lastpage
    286
  • Abstract
    The authors measure the performance of thinning algorithms in the ideal world of noise-free Blum ribbons. Differences in the performance of thinning algorithms emerge even when they are applied on noise-free ribbon images. The authors define an error criterion function based on the Hausdorf distance that measures the deviation between the ideal and actual output of the thinning algorithms. They illustrate the process of performance evaluation by the application of ten state of the art thinning algorithms to the same (large) set of input images. They present results that show the mean value of the normalized error for each algorithm over each population of images. How performance of an algorithm varies over different populations of images is examined
  • Keywords
    optical character recognition; performance evaluation; Hausdorf distance; error criterion function; mean value; noise-free Blum ribbons; noise-free ribbon images; normalized error; optical character recognition; performance; performance evaluation; thinning algorithms; Algorithm design and analysis; Computer science; Electric variables measurement; Gold; Measurement standards; Noise measurement; Optical character recognition software; Protocols; Shape; Skeleton;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Document Analysis and Recognition, 1993., Proceedings of the Second International Conference on
  • Conference_Location
    Tsukuba Science City
  • Print_ISBN
    0-8186-4960-7
  • Type

    conf

  • DOI
    10.1109/ICDAR.1993.395731
  • Filename
    395731