APPROXIMATION, BROKEN LINE OF MINIMUM LENGTH WHEN DEFINING THE CONTOURS IN THE COLOR IMAGE

Abstract

The discrete boundary can be approximated as precisely as possible by a polyline. The approximation becomes accurate when the number of polyline segments is equal to the number of border points (which is true in the case of a closed border) and each pair of neighboring points connects its own segment. In practice, the goal of polyline approximation is to use as few segments as possible to approximate the "essence" of the border shape. In General, this task is not trivial and its solution often results in labor-intensive re-sorting schemes. However, some approximation methods that are characterized by moderate computational complexity are well suited for digital image processing. Among these methods, one of the most powerful is the representation of the border by a polyline of minimal length (LLD), which we will now consider