Segmentation of edges into lines and arcs

摘要

A long standing problem in computer vision is the extraction of meaningful features from images. This paper describes a method of segmenting curves in images into a combination of circular arcs and straight lines. This uses a recursive algorithm that first analyses lists of connected edge points and finds a polygonal description, and then analyses this description fitting arcs to groups of connected lines. The result is a description of image edges consisting of circular arcs and lines. The algorithm uses no thresholding. Instead the best option is chosen at each decision stage.