An iterative edge linking algorithm with noise removal capability

摘要

A linking algorithm to fill gaps between edge segments ispresented. The gap filling operation is performed in an iterative mannerrather than a single step. During each iteration, the noises are alsoremoved gradually. The proposed algorithm starts with connecting the tipends of two (line or curve) segments with a line segment and then triesto modify the resulting segment by straight-line fitting. The two majorphases of the algorithm are detailed step by step. The advantages ofusing the algorithm are also discussed