US 12,272,113 B2
Semi-automatic image data labeling method, electronic apparatus, and storage medium
Fuqin Deng, Jiangmen (CN); Yongshen Huang, Jiangmen (CN); Jianfeng Peng, Jiangmen (CN); Hua Feng, Jiangmen (CN); Yingying Chen, Jiangmen (CN); and Weike Li, Jiangmen (CN)
Assigned to WUYI UNIVERSITY, Jiangmen (CN)
Appl. No. 17/772,846
Filed by Wuyi University, Jiangmen (CN)
PCT Filed Jul. 6, 2020, PCT No. PCT/CN2020/100348
§ 371(c)(1), (2) Date Apr. 28, 2022,
PCT Pub. No. WO2021/093344, PCT Pub. Date May 20, 2021.
Claims priority of application No. 201911117335.0 (CN), filed on Nov. 15, 2019.
Prior Publication US 2022/0375188 A1, Nov. 24, 2022
Int. Cl. G06V 10/26 (2022.01); G06V 10/20 (2022.01); G06V 10/22 (2022.01); G06V 10/764 (2022.01)
CPC G06V 10/273 (2022.01) [G06V 10/235 (2022.01); G06V 10/255 (2022.01); G06V 10/764 (2022.01)] 6 Claims
OG exemplary drawing
 
1. A semi-automatic image data labeling method, comprising:
S100: displaying a to-be-labeled image, the to-be-labeled image comprising a selected area and an unselected area;
S200: acquiring a coordinate point of the unselected area and a first range value;
S300: executing a grabcut algorithm based on the coordinate point of the unselected area and the first range value acquired, and obtaining a binarized image divided by the grabcut algorithm;
S400: executing an edge tracking algorithm on the binarized image to acquire current edge coordinates;
S500: updating a local coordinate set based on the current edge coordinates acquired;
S600: updating the selected area of the to-be-labeled image based on the local coordinate set acquired;
S700: judging whether an all-selected instruction is received; if yes, generating a whole coordinate set, and if not, returning to S200; and
S800: acquiring category information and saving the category information and the whole coordinate set as json files; and
wherein the generating the whole coordinate set comprises the following steps of:
S710: establishing a set A′, adding any coordinate point p0 in the local coordinate set to the set A′, establishing other coordinate points except p0 in the local coordinate set as a set A2, and setting a first labeled coordinate point p as p0;
S720: judging whether a number of elements in the set A2 is zero; if not, executing S720a, and if yes, executing S720b;
S720a: calculating distances d between all coordinate points in the set A2 and the first labeled coordinate point p, setting the first labeled coordinate point p as a coordinate point corresponding to the minimum distance d in the set A2, adding the coordinate point corresponding to the minimum distance d in the set A2 into the set A′ and deleting the coordinate point from the set A2, and returning to S720;
S720b: sorting the coordinate points according to an order in which the coordinate points are added to the set A′;
S730: establishing the whole coordinate set, adding p0 into the whole coordinate set and deleting p0 from the set A′, and setting a second labeled coordinate point p′ as p0;
S740: judging whether a number of elements in the set A′ is 1; if not, executing S740a, and if yes, executing S740b;
S740a: judging whether the second labeled coordinate point p′ is collinear with the two coordinate points ranked in the first two places in the set A′; if yes, executing S740a1, and if not, executing S740a2;
S740a1: deleting the coordinate point in the first place in the set A′ from the set A′, and returning to S740;
S740a2: setting the second labeled coordinate point p′ as the coordinate point ranked in the first place in the set A′, adding the coordinate point ranked in the first place in the set A′ to the whole coordinate set and deleting the coordinate point from the set A′, and returning to S740; and
S740b: adding the coordinate points in the set A′ to the whole coordinate set and outputting the whole coordinate set.