Iterative edge linking algorithm with noise removal capability

Shing Min Liu*, Wei Chung Lin, Cheng Chung Liang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Scopus citations

Abstract

A linking algorithm to fill gaps between edge segments is presented. The gap filling operation is performed in an iterative manner rather than a single step. During each iteration, the noises are also removed gradually. The proposed algorithm starts with connecting the tip ends of two (line or curve) segments with a line segment and then tries to modify the resulting segment by straight-line fitting. The two major phases of the algorithm are detailed step by step. The advantages of using the algorithm are also discussed.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Pattern Recognition
PublisherPubl by IEEE
Pages1120-1122
Number of pages3
ISBN (Print)0818608781
StatePublished - Dec 1 1988

Publication series

NameProceedings - International Conference on Pattern Recognition

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition

Cite this