@inproceedings{8a5f77e87135431f8c8d6c7a14d403ec,
title = "Minimum-cost path algorithm for separating touching characters",
abstract = "The paper proposes an algorithm which finds a nonlinear cut path for a greyscale touching character image. It proposes a new penalizing rule which is probable to guide correctly the cut path for touching situations difficult to separate. Additionally the algorithm adopts a strategy of producing both the downward and upward paths and selecting better one. The experimental results on actual touching character images showed that the proposed algorithm was superior to conventional algorithms.",
keywords = "Document images, Greedy algorithm, Minimum-cost path, Optical character recognition (OCR), Touching characters",
author = "Lee, \{Duk Ryong\} and Oh, \{Il Seok\}",
year = "2010",
language = "English",
isbn = "9780889868236",
series = "Proceedings of the 7th IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2010",
pages = "164--168",
booktitle = "Proceedings of the 7th IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2010",
note = "7th IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2010 ; Conference date: 17-02-2010 Through 19-02-2010",
}