| CPC G06T 11/60 (2013.01) [G06N 3/08 (2013.01); G06T 11/40 (2013.01)] | 4 Claims |

|
1. A method for generating a random graphic training dataset, comprising:
randomly generating a plurality of graphic datasets, wherein each of the graphic datasets comprises a square, a circle and an equilateral triangle;
for any graphic dataset, performing gradual filling on each graphic in the graphic dataset to obtain a gradual graphic dataset, which further comprises:
for any graphic in the graphic dataset, determining a to-be-filled pixel value at each point in the graphic according to a distance from each point in the graphic to a center of the graphic, to obtain a gradual graphic corresponding to the graphic, which further comprises:
for any point inside the graphic, calculating a to-be-filled pixel value be point according to a formula
![]() wherein p is the to-be-filled pixel value of the point, LOU is a distance from the point to the center of the graphic, max (LOU) is a maximum of distances from all points inside the graphic to the center of the graphic, and δ is a gradual index of a gray value; and
performing translation transformation on each graphic in the gradual graphic dataset for a predetermined number of times to obtain random graphics corresponding to the graphic dataset, and determining random graphics corresponding to all graphic datasets as a random graphic training dataset.
|