Filling algorithm for rapidly matching pair of left and right boundary point

Abstract

The invention relates to a filling algorithm method for quick matching of left and right boundary points, belongs to the computer image processing technology field and essentially solves image filing problem in known Freeman chain code. The filling algorithm method is characterized in that according to the features of the Freeman chain code at zone boundary, the boundary points are divided into three types of a left end point, a right end point and a cuspidal point. The filling algorithm method approaches to the minimum time complexity, namely, the area of filling zone and girth thereof without adding memory and auxiliary marker color. The technical proposal is that: a boundary is searched quickly to determine the position of the right end point and color the right end point in a image directly; the boundary is searched again to find out pixel of the left end point and color the pixel of the left end point and the pixel of the right side thereof in sequence till encountering the colored right end point. After finishing treatment of all chain codes, the filling algorithm method is completed. The filling algorithm method is applied to display of simply connected image or multiply connected image in digital image processing field, obtaining the common region of two objects and relations of two regions or storing binary image.

Description

technical field [0001] The invention relates to a boundary point pairing filling algorithm of an image area, which belongs to the technical field of computer image processing. Background technique [0002] Filling is a basic algorithm in the field of computer graphics and digital image processing. In computer graphics, to represent an area on raster-scan displays and dot-matrix output devices, it is often necessary to use fill to color the area in addition to displaying the border. In three-dimensional realistic display, spatial objects are also often projected on a plane to generate a plane area. For this reason, a certain grayscale or color should be added to the area to express this area more clearly. Digital image processing also often uses filling methods to study certain characteristics of images, for example, finding the area of ​​a given area or obtaining the intersection area of ​​two objects, storing binary images, and so on. At present, with the rapid developmen...

AI Technical Summary

Problems solved by technology

In order to avoid the calculation error of the number of intersection points, the algorithm generally adopts the method of storing and processing various boundary points separately, so that it is necessary to apply for enough memory space to complete the storage of various boundary points during the implementation of the algorithm, or to store the boundary points outside the area. Pixels are detected, which greatly affects the efficiency of the algorithm

The common problem of the algorithm based on seed filling is that it is difficult to quickly find effective seed points, and the marking of seed points usually requires multiple colors, so for some images, such as binary images, auxiliary storage space is required

Images