# US 2025/0148771 A1 · Neural Network Training Method Using Semi-Pseudo-Labels

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0148771 A1
- Document ID: US20250148771A1
- Status: Published application
- Kind: A1
- Application number: 18/835,343
- Filed: 2023-02-02
- Published: 2025-05-08
- Earliest claimed: 2022-02-03
- Assignees: AImotive Kft.
- Applicants: aiMotive Kft.
- Inventors: Dániel Ákos Kozma; Tamás Matuszka; Ákos Utasi
- Web page: https://patentgrep.com/patent/US20250148771A1

## CPC

- G06F 18/24133: {Distances to prototypes}
- G06V 10/82: using neural networks
- G06F 18/214: Generating training patterns; Bootstrap methods, e.g. bagging or boosting
- G06V 20/70: Labelling scene content, e.g. deriving syntactic or semantic representations
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING

## Abstract

The present invention provides a method for training a complex machine learning model based on a dataset that comprises datapoints and ground truth labels for at least some of the datapoints of the dataset, wherein the datapoints comprise images, the method comprising: using a reduced-complexity machine learning model to predict pseudo labels for the dataset, and training the complex machine learning model using an extended dataset that comprises the ground truth labels and the pseudo labels as output.

## Claims

### Claim 1

A method for training a complex machine learning model based on a dataset that comprises datapoints and ground truth labels for at least some of the datapoints of the dataset, wherein the datapoints comprise images, the method comprising:
using (210) a reduced-complexity machine learning model to predict pseudo labels for the dataset, and
training (220) the complex machine learning model using an extended dataset that comprises the ground truth labels and the pseudo labels as output.

### Claim 2 (depends on 1)

The method of claim 1, wherein
a ground truth label comprises a coordinate, a dimension, and/or an orientation of a 3D bounding box,
a pseudo label comprises a coordinate, a dimension and/or an orientation of a 2D bounding box, and/or
a ground truth label and/or a pseudo label comprises an objectness score and/or probabilities for a set of object categories.

### Claim 3

The method of one of the previous claims, wherein the ground truth labels are labels of objects within an annotated area (110a, 110b, 110c) of the dataset and wherein the dataset comprises unlabelled datapoints for objects that are outside the annotated area of the dataset, wherein preferably the annotated area corresponds to a near-field (130) of a camera and a non-annotated area (112a, 112b, 112c) corresponds to a far-field (132) of the camera.

### Claim 4

The method of one of the previous claims, further comprising:
obtaining 3D data, and
extending the dataset with virtual images based on a virtual camera virtually capturing the 3D data,
wherein the obtaining the images comprises moving a position of the virtual camera to obtain shifted and/or zoomed images from a moved camera position.

### Claim 5 (depends on 4)

The method of claim 4, wherein the obtaining images from the moved camera position comprises adjusting a camera matrix that describes a mapping of positions in the 3D data to a 2D image, wherein preferably adjusting the camera matrix comprises adjusting the principal point and the focal length based on an original camera matrix and a 2D scaling.

### Claim 6

The method of one of the previous claims, further comprising
an initial step of detecting, based on the images, objects for which pseudo labels need to be predicted, and/or
performing deduplication to remove pseudo labels for which the dataset already comprises ground truth labels.

### Claim 7 (depends on 6)

The method of claim 6, wherein the step of performing deduplication comprises:
determining a ratio of an intersection over union of a 2D bounding box of a pseudo label and a 2D projection of a 3D bounding box of a ground truth label, and
if the ratio is larger than a predetermined threshold, removing the pseudo label from the extended dataset.

### Claim 8

The method of one of the previous claims, wherein the training the complex machine learning model comprises using a loss function that does not penalize errors contribu-tions that correspond to 3D properties where no ground truth label is available, wherein preferably a Boolean flag is used to indicate in the extended dataset whether a label is a ground truth label or a predicted pseudo label.

### Claim 9

The method of one of the previous claims, further comprising using the complex machine learning model for detecting objects in autonomous driving, wherein the labels comprise object classes that preferably comprise one or more of vehicles, two-wheelers, pedestrians, traffic signs, and traffic lights.

### Claim 10

The method of one of the previous claims, wherein the complex machine learning model is used to predict a center point of a 3D cuboid based on a prediction of the 2D projection of the 3D cuboid and a predicted depth.

### Claim 11 (depends on 10)

The method of claim 10, wherein the depth is predicted based on a disparity that is calculated based on a camera baseline, a focal length and a depth and/or a predicted depth is adjusted based on a focal length of a current camera.

### Claim 12

The method of one of the previous claims, wherein the complex machine learning model is a multi task machine learning model that is configured to solve a first task and a second task in parallel, and wherein the reduced-complexity machine learning model is configured to solve the first task, wherein preferably the first task comprises a prediction of a 2D bounding box and the second task comprises a prediction of a 3D bounding box.

### Claim 13

The method of one of the previous claims, wherein training of the complex machine learning model comprises using a loss terms that comprises one or more of:
a projection loss term that is based on a 3D projection of 3D cuboid,
a disparity loss term that is based on a disparity between a centre point of a 2D projected 3D bounding box on left and right stereo images, and
a width loss term that is based on a difference between a width of a 2D projection of 3D bounding boxes on left and right stereo images.

### Claim 14

An apparatus, configured to carry out the method of one of the previous claims.

### Claim 15 (depends on 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)

A computer-readable storage medium storing program code, the program code comprising instructions that when executed by a processor carry out the method of any one of claims 1 to 13.
