Complex sequence graphics matching system based on topological relation and realization method thereof

Abstract

The invention provides a complex sequence graphics matching system based on a topological relation, which is characterized in that the system comprises an identification and extraction module, a directed module, a matching network, a maximum flow rate solving module, a relevance matching module and an integral matching output module. The invention resolves a polygon registration problem into a matching problem of elements in two sets. The essence of the problem lies in solving maximum matching problem and also solves the maximum matching of the polygon registration problem on the premise of meeting the topological relation. The invention resolves the difficult problem of establishment of internal relations for complex sequence graphics and conducts thoroughly technical transformation aiming at the existing manufacturing method of two dimension animations, namely, manual labor is replaced by a computer, which is a fundamental technical breakthrough for improving production efficiency of animation products.

Description

technical field [0001] The invention relates to the field of digital graphic image processing and digital entertainment, in particular to a complex sequence graphic matching method based on topological relationship. Background technique [0002] At present, the matching technology of sequential graphics and images is the key technology to establish the internal relationship between graphics, and layering technology is also involved for complex graphics. These technologies are the key to realize automatic target matching, automatic establishment of topological relationship, automatic high-quality coloring and automatic computer interpolation. It is also the core technology to realize the automation and intelligence of two-dimensional animation production. [0003] The research on the registration of sequence graphics images is a main content of digital video, pattern recognition, computer vision and automatic animation processing. The difference from still image processing i...

AI Technical Summary

Problems solved by technology

The first type of algorithm is difficult to achieve satisfactory results when the polygon shape changes greatly; the second type of method only relies on the local position of the contour for matching, which is likely to produce a large error, so this method can only achieve the local maximum. optimal, not globally optimal

In addition, due to the different sizes of the contour scales, the above threshold is not single, so it is difficult to determine

[0013] The centroid-based polygon matching will cause a large change in the polygon centroid due to the overlapping and segmentation of polygons. In most cases, it is difficult to complete the matching, and it is only suitable for sequence graphics with little change.

[0014] Since the pattern matching method needs to know some fixed patterns in advance, the practicability of the ever-changing sequence graphics is limited.

Images