Optimal Line and Arc Detection on Run-Length Representations

Daniel Keysers, Thomas Breuel
Sixth International IAPR Workshop on Graphics Recognition (GREC) volume 3926, LNCS, Pages 369-380, Springer, 2006


The robust detection of lines and arcs in scanned documents or technical drawings is an important problem in document image understanding. We present a new solution to this problem that works directly on run-length encoded data. The method finds globally optimal solutions to parameterized thick line and arc models. Line thickness is part of the model and directly used during the matching process. Unlike previous approaches, it does not require any thinning or other preprocessing steps, no computation of the line adjacency graphs, and no heuristics. Furthermore, the only search-related parameter that needs to be specified is the desired numerical accuracy of the solution. The method is based on a branch-and-bound approach for the globally optimal detection of these geometric primitives using runs of black pixels in a bi-level image. We present qualitative and quantitative results of the algorithm on images used in the 2003 and 2005 GREC arc segmentation contests.




@inproceedings{ KEYS2006,
	Title = {Optimal Line and Arc Detection on Run-Length Representations},
	Author = {Daniel Keysers and Thomas Breuel},
	BookTitle = {Sixth International IAPR Workshop on Graphics Recognition (GREC)},
	Year = {2006},
	Series = {LNCS},
	Publisher = {Springer},
	Publisher = {3926},
	Pages = {369-380}

Last modified:: 30.08.2016