Pixelation Algorithm for Computing the Intersection of Connected Graphs in Intelligent Damage Recognition

Abstract

Intelligent damage determination refers to the identification of the damage and parts of the vehicle in the picture and video through the image recognition algorithm, and then automatically output the damage of the vehicle. How to accurately judge the size of the damage on the vehicle components is an important step to get the damage of the vehicle. This problem is actually a solution to the intersection of two connected graphs. However, the existing algorithms can only solve some simple and special graphics. In practical applications, the shapes of damage and parts are changeable, and these algorithms can no longer meet the actual needs. This paper presents a universal algorithm for solving the intersection of connected graphs by pixelating the graph and according to the change law of the relative position relationship between the points on the plane and the graph. The algorithm has a wide range of applications and simple input requirements for graphics. The application results of simulation tests and actual scenes show that this algorithm can accurately calculate the intersection of concave polygons, holed polygons and other connected graphics, which has high practical application value.