Patent Publication Number: US-11023780-B1

Title: Methods for training auto labeling device and performing auto labeling related to object detection while performing automatic verification by using uncertainty scores and devices using the same

Description:
CROSS-REFERENCE TO RELATED APPLICATION 
     This application is a continuation of U.S. application Ser. No. 16/984,607, filed Aug. 4, 2020, the entire contents of which are herein incorporated by reference. 
    
    
     FIELD OF THE DISCLOSURE 
     The present disclosure relates to methods for training an auto labeling device and auto labeling and devices using the same; and more particularly, to the method for training the auto labeling device and the auto labeling while performing automatic verification by using uncertainty scores and the devices using the same. 
     BACKGROUND OF THE DISCLOSURE 
     Recently, methods of performing object identification and the like making use of machine learning are being studied. As part of a family of machine learning methods, deep learning, which uses a neural network with several hidden layers between an input layer and an output layer, shows high performance in recognition. 
     And, the neural network using the deep learning is generally trained through backpropagation using losses. 
     In order to perform such training of the deep learning network, training data are needed in which labels are added to individual data by labelers. Preparing these training data (i.e. classifying the data correctly) can be very labour-intensive, expensive and inconvenient, especially if a large amount of the training data is to be used and if the quality of the data pre-preparation is not consistently high. Conventional interactive labeling can be computationally expensive and may fail to deliver good results. 
     Therefore, recently, auto labeling which adds labels to training images using a deep learning-based automatic labeling device is popular, and inspectors may inspect the auto-labeled training images to correct the labels. 
     However, in such a conventional method, throughputs of the inspectors are low as compared to the throughput of the automatic labeling device. Therefore, it takes a long time to generate true labels for entire training images. In order to improve the overall throughput, the number of the inspectors must be increased, but it results in an increase of the cost. 
     Also, it is difficult to acquire a large number of the inspectors skilled enough to keep up with the throughput of the automatic labeling device. 
     SUMMARY OF THE DISCLOSURE 
     It is an object of the present disclosure to solve all the aforementioned problems. 
     It is another object of the present disclosure to improve a throughput of auto labeling for entire training images. 
     It is still another object of the present disclosure to maintain a maximal throughput of the auto labeling, while reducing the number of inspectors. 
     It is still yet another object of the present disclosure to allow unskilled inspectors to perform label-inspecting keeping up with a throughput of the auto labeling device. 
     It is still yet another object of the present disclosure to improve the throughput of the auto labeling, without degrading an accuracy of the auto labeling. 
     In order to accomplish objects above and characteristic effects to be described later of the present disclosure, distinctive structures of the present disclosure are described as follows. 
     In accordance with one aspect of the present disclosure, there is provided a method for training an auto labeling device capable of performing automatic verification by using uncertainty scores of auto-labeled labels, including steps of: (a) a learning device performing (i) a process of inputting or allowing the auto labeling device to input one or more unlabeled training images into an object detection network, which has been trained, of the auto labeling device, to thereby allow the object detection network to detect one or more objects for training in each of the unlabeled training images and thus to generate one or more bounding boxes for training and (ii) a process of inputting or allowing the auto labeling device to input the unlabeled training images into a convolution network, which has been trained, of the auto labeling device, to thereby allow the convolution network to apply at least one convolution operation to each of the unlabeled training images and thus to generate each of one or more feature maps for training corresponding to each of the unlabeled training images; and (b) the learning device performing (i) a process of instructing or allowing the auto labeling device to instruct an ROI (region of interest) pooling layer of the auto labeling device to apply at least one pooling operation to each of the feature maps for training by using the bounding boxes for training, to thereby generate each of pooled feature maps for training, (ii) at least one of (ii-1) a process of inputting or allowing the auto labeling device to input the pooled feature maps for training into a first classifier of the auto labeling device, to thereby allow the first classifier to apply at least one first fully-connected operation and then at least one PDF (probability distribution function) operation to each of the pooled feature maps for training and thus to generate each of first class scores for training and each of first box uncertainty scores for training, respectively corresponding to each of the bounding boxes for training and (ii-2) a process of inputting or allowing the auto labeling device to input the pooled feature maps for training into a second classifier of the auto labeling device, to thereby allow the second classifier to (1) generate k copies of each of the pooled feature maps for training, (2) randomly set at least one element in each of the k copies of each of the pooled feature maps for training as 0, to thereby generate randomly-zeroed k copies thereof, (3) apply at least one second fully-connected operation and then at least one softmax operation to the randomly-zeroed k copies of each of the pooled feature maps for training, and thus (4) generate each of second class scores for training and each of second box uncertainty scores for training, respectively corresponding to each of the bounding boxes for training, and (iii) one of (iii-1) a process of training the first classifier using one or more first class losses calculated by referring to the first class scores for training and ground truths corresponding to the bounding boxes for training and (iii-2) a process of training the second classifier using one or more second class losses calculated by referring to the second class scores for training and the ground truths corresponding to the bounding boxes for training. 
     As one example, at the step of (b), the learning device performs (i) a process of inputting or allowing the auto labeling device to input the pooled feature maps for training into a fitness estimation network of the auto labeling device, to thereby allow the fitness estimation network to apply at least one third fully-connected operation and then at least one sigmoid operation to the pooled feature maps for training and thus to generate fitness values for training which range from 0 to 1, wherein the fitness values for training are created by estimating differences between (1) first uncertainty scores for training in outputs, corresponding to the unlabeled training images, from the first classifier and (2) second uncertainty scores for training in outputs, corresponding to the unlabeled training images, from the second classifier, (ii) a process of calculating one or more uncertainty losses by referring to the first box uncertainty scores for training and adjusted second box uncertainty scores for training, wherein the adjusted second box uncertainty scores for training are created by adjusting each of the second box uncertainty scores for training by a scale parameter such that a range of the adjusted second box uncertainty scores for training corresponds to a range of the first box uncertainty scores for training, (iii) a process of updating the scale parameter by using the uncertainty losses, and (iv) a process of training the fitness estimation network using cross entropy losses calculated by referring to the uncertainty losses and the fitness values for training. 
     As one example, the learning device performs a process of clipping the cross entropy losses if the cross entropy losses lie outside a range from 0 to 1 such that a range of the clipped cross entropy losses becomes a range from 0 to 1, and a process of training the fitness estimation network by using the clipped cross entropy losses. 
     As one example, the object detection network is one of a platform object detection network corresponding to the auto labeling device, a third-party object detection network capable of providing a labeling service, and a combination of the platform object detection network and the third-party object detection network. 
     As one example, in case that the object detection network is the combination of the platform object detection network and the third-party object detection network, at the step of (a), the learning device performs (i) a process of inputting or allowing the auto labeling device to input the unlabeled training images into the platform object detection network of the auto labeling device, to thereby allow the platform object detection network to (1) detect the objects for training in each of the unlabeled training images and thus (2) generate each of platform bounding boxes for training, (ii) a process of transmitting or allowing the auto labeling device to transmit the unlabeled training images to the third-party object detection network, to thereby allow the third-party object detection network to (1) detect the objects for training in each of the unlabeled training images and thus (2) generate each of third-party bounding boxes for training, (iii) a process of selecting adjusted bounding boxes for training, corresponding to the objects for training, among a training box group comprised of the platform bounding boxes for training and the third-party bounding boxes for training, by using an NMS (non-maximal suppression) algorithm, and (iv) a process of setting the adjusted bounding boxes for training as the bounding boxes for training. 
     As one example, at the step of (b), the learning device performs a process of allowing the first classifier to apply at least one rectifying operation and then the PDF operation to results of the first fully-connected operation, and wherein the rectifying operation converts values of the results such that the values of the results are equal to or greater than 0. In accordance with another aspect of the present disclosure, there is provided a method for auto labeling while performing automatic verification by using uncertainty scores of auto-labeled labels, including steps of: (a) on condition that a learning device has performed (I) (I-1) a process of inputting or allowing an auto labeling device to input one or more unlabeled training images into an object detection network, which has been trained, of the auto labeling device, to thereby allow the object detection network to detect one or more objects for training in each of the unlabeled training images and thus to generate each of bounding boxes for training, and (I-2) a process of inputting or allowing the auto labeling device to input the unlabeled training images into a convolution network, which has been trained, of the auto labeling device, to thereby allow the convolution network to apply at least one convolution operation to each of the unlabeled training images and thus to generate each of feature maps for training corresponding to each of the unlabeled training images, and (II) (II-1) a process of inputting or allowing the auto labeling device to input the feature maps for training into an ROI (region of interest) pooling layer of the auto labeling device, to thereby allow the ROI pooling layer to apply at least one pooling operation to each of the feature maps for training by using the bounding boxes for training, to thereby generate each of pooled feature maps for training, and (II-2) at least one of (i) a process of inputting or allowing the auto labeling device to input the pooled feature maps for training into a first classifier of the auto labeling device, to thereby allow the first classifier to apply at least one first fully-connected operation and then at least one PDF (probability distribution function) operation to each of the pooled feature maps for training and thus to generate each of first class scores for training and each of first box uncertainty scores for training, respectively corresponding to each of the bounding boxes for training and (ii) a process of inputting or allowing the auto labeling device to input the pooled feature maps for training into a second classifier of the auto labeling device, to thereby allow the second classifier to (1) generate k copies of each of the pooled feature maps for training, (2) randomly set at least one element in each of the k copies of each of the pooled feature maps for training as 0, to thereby generate randomly-zeroed k copies thereof, (3) apply at least one second fully-connected operation and then at least one softmax operation to the randomly-zeroed k copies of each of the pooled feature maps for training, and thus (4) generate each of second class scores for training and each of second box uncertainty scores for training, respectively corresponding to each of the bounding boxes for training, and (II-3) one of (i) a process of training the first classifier using one or more first class losses calculated by referring to the first class scores for training and ground truths corresponding to the bounding boxes for training and (ii) a process of training the second classifier using one or more second class losses calculated by referring to the second class scores for training and the ground truths corresponding to the bounding boxes for training, then if one or more unlabeled test images are acquired, the auto labeling device performing (a1) a process of inputting the unlabeled test images into the object detection network, to thereby allow the object detection network to generate bounding boxes for testing corresponding to one or more objects for testing in each of the unlabeled test images and (a2) a process of inputting the unlabeled test images into the convolution network, to thereby allow the convolution network to apply the convolution operation to each of the unlabeled test images and thus to generate each of feature maps for testing corresponding to each of the unlabeled test images; (b) the auto labeling device performing (i) a process of allowing the ROI pooling layer to apply the pooling operation to each of the feature maps for testing by using the bounding boxes for testing, to thereby generate each of pooled feature maps for testing and (ii) at least one of (ii-1) a process of inputting the pooled feature maps for testing into the first classifier, to thereby allow the first classifier to apply the first fully-connected operation and then the PDF operation to each of the pooled feature maps for testing and thus to generate each of first class scores for testing and each of first box uncertainty scores for testing, respectively corresponding to each of the bounding boxes for testing and (ii-2) a process of inputting the pooled feature maps for testing into the second classifier, to thereby allow the second classifier to (1) generate k copies of each of the pooled feature maps for testing, (2) randomly set at least one element in each of the k copies of each of the pooled feature maps for testing as 0, to thereby generate randomly-zeroed k copies thereof, (3) apply the second fully-connected operation and then the softmax operation to the randomly-zeroed k copies of each of the pooled feature maps for testing, and thus (4) generate each of second class scores for testing and each of second box uncertainty scores for testing, respectively corresponding to each of the bounding boxes for testing; and (c) the auto labeling device performing (i) a process of labeling the bounding boxes for testing corresponding to each of the unlabeled test images and a process of generating first class information for testing corresponding to the first class scores for testing and second class information for testing corresponding to the second class scores for testing, to thereby generate labeled test images and (ii) a process of transmitting, to a labeler, specific labeled test images, among the generated labeled test images, including specific bounding boxes for testing, among the bounding boxes for testing, to thereby allow the labeler to verify the specific labeled test images, wherein each of the specific bounding boxes for testing is selected by referring to (1) a first box uncertainty score for testing, among the first box uncertainty scores for testing, equal to or greater than a preset criterion uncertainty score and (2) a second box uncertainty score for testing, among the second box uncertainty scores for testing, equal to or greater than the preset criterion uncertainty score. 
     As one example, at the step of (b), the auto labeling device performs (i) a process of inputting the pooled feature maps for testing into a fitness estimation network, to thereby allow the fitness estimation network to apply at least one third fully-connected operation and then at least one sigmoid operation to the pooled feature maps for testing and thus to generate fitness values for testing which range from 0 to 1, wherein the fitness values for testing are created by estimating differences between (1) first uncertainty scores for testing in outputs, corresponding to the unlabeled test images, from the first classifier and (2) second uncertainty scores for testing in outputs, corresponding to the unlabeled test images, from the second classifier and (ii) a process of inputting first pooled feature maps for testing, among the pooled feature maps for testing, into the first classifier, wherein the first pooled feature maps for testing correspond to first fitness values for testing equal to or greater than a preset criterion fitness value among the fitness values for testing, and a process of inputting second pooled feature maps for testing, among the pooled feature maps for testing, into the second classifier, wherein the second pooled feature maps for testing correspond to second fitness values for testing less than the preset criterion fitness value among the fitness values for testing, and wherein the learning device performs a process of setting adjusted second box uncertainty scores for testing as the second box uncertainty scores for testing, and wherein the adjusted second box uncertainty scores for testing are created by adjusting each of the second box uncertainty scores for testing by a scale parameter such that a range of the adjusted second box uncertainty scores for testing corresponds to a range of the first box uncertainty scores for testing. 
     As one example, the object detection network is one of a platform object detection network corresponding to the auto labeling device, a third-party object detection network capable of providing a labeling service, and a combination of the platform object detection network and the third-party object detection network. 
     As one example, in case that the object detection network is the combination of the platform object detection network and the third-party object detection network, at the step of (a), the auto labeling device performs (i) a process of inputting the unlabeled test images into the platform object detection network, to thereby allow the platform object detection network to detect the objects for testing in each of the unlabeled test images and thus to generate each of platform bounding boxes for testing, (ii) a process of transmitting the unlabeled test images to the third-party object detection network, to thereby allow the third-party object detection network to (1) detect the objects for testing in each of the unlabeled test images and thus (2) generate each of third-party bounding boxes for testing, (iii) a process of selecting adjusted bounding boxes for testing, corresponding to the objects for testing, among a testing box group comprised of the platform bounding boxes for testing and the third-party bounding boxes for testing, by using an NMS (non-maximal suppression) algorithm, and (iv) a process of setting the adjusted bounding boxes for testing as the bounding boxes for testing. 
     As one example, at the step of (b), the auto labeling device performs a process of allowing the first classifier to apply at least one rectifying operation and then the PDF operation to results of the first fully-connected operation, and wherein the rectifying operation converts values of the results such that the values of the results are equal to or greater than 0. 
     As one example, the method further comprises a step of: (d) the auto labeling device performing a process of re-training at least one of the first classifier and the second classifier, using one or more labeling losses calculated by referring to the specific labeled test images and verified labeled images wherein the verified labeled images are verified by the labeler. 
     In accordance with still another aspect of the present disclosure, there is provided a learning device for training an auto labeling device capable of performing automatic verification by using uncertainty scores of auto-labeled labels, including: at least one memory that stores instructions; and at least one processor configured to execute the instructions to perform or support another device to perform: (I) (i) a process of inputting or allowing the auto labeling device to input one or more unlabeled training images into an object detection network, which has been trained, of the auto labeling device, to thereby allow the object detection network to detect one or more objects for training in each of the unlabeled training images and thus to generate one or more bounding boxes for training and (ii) a process of inputting or allowing the auto labeling device to input the unlabeled training images into a convolution network, which has been trained, of the auto labeling device, to thereby allow the convolution network to apply at least one convolution operation to each of the unlabeled training images and thus to generate each of one or more feature maps for training corresponding to each of the unlabeled training images and (II) (i) a process of instructing or allowing the auto labeling device to instruct an ROI (region of interest) pooling layer of the auto labeling device to apply at least one pooling operation to each of the feature maps for training by using the bounding boxes for training, to thereby generate each of pooled feature maps for training, (ii) at least one of (ii-1) a process of inputting or allowing the auto labeling device to input the pooled feature maps for training into a first classifier of the auto labeling device, to thereby allow the first classifier to apply at least one first fully-connected operation and then at least one PDF (probability distribution function) operation to each of the pooled feature maps for training and thus to generate each of first class scores for training and each of first box uncertainty scores for training, respectively corresponding to each of the bounding boxes for training and (ii-2) a process of inputting or allowing the auto labeling device to input the pooled feature maps for training into a second classifier of the auto labeling device, to thereby allow the second classifier to (1) generate k copies of each of the pooled feature maps for training, (2) randomly set at least one element in each of the k copies of each of the pooled feature maps for training as 0, to thereby generate randomly-zeroed k copies thereof, (3) apply at least one second fully-connected operation and then at least one softmax operation to the randomly-zeroed k copies of each of the pooled feature maps for training, and thus (4) generate each of second class scores for training and each of second box uncertainty scores for training, respectively corresponding to each of the bounding boxes for training, and (iii) one of (iii-1) a process of training the first classifier using one or more first class losses calculated by referring to the first class scores for training and ground truths corresponding to the bounding boxes for training and (iii-2) a process of training the second classifier using one or more second class losses calculated by referring to the second class scores for training and the ground truths corresponding to the bounding boxes for training. 
     As one example, at the process of (II), the processor performs (i) a process of inputting or allowing the auto labeling device to input the pooled feature maps for training into a fitness estimation network of the auto labeling device, to thereby allow the fitness estimation network to apply at least one third fully-connected operation and then at least one sigmoid operation to the pooled feature maps for training and thus to generate fitness values for training which range from 0 to 1, wherein the fitness values for training are created by estimating differences between (1) first uncertainty scores for training in outputs, corresponding to the unlabeled training images, from the first classifier and (2) second uncertainty scores for training in outputs, corresponding to the unlabeled training images, from the second classifier, (ii) a process of calculating one or more uncertainty losses by referring to the first box uncertainty scores for training and adjusted second box uncertainty scores for training, wherein the adjusted second box uncertainty scores for training are created by adjusting each of the second box uncertainty scores for training by a scale parameter such that a range of the adjusted second box uncertainty scores for training corresponds to a range of the first box uncertainty scores for training, (iii) a process of updating the scale parameter by using the uncertainty losses, and (iv) a process of training the fitness estimation network using cross entropy losses calculated by referring to the uncertainty losses and the fitness values for training. 
     As one example, the processor performs a process of clipping the cross entropy losses if the cross entropy losses lie outside a range from 0 to 1 such that a range of the clipped cross entropy losses becomes a range from 0 to 1, and a process of training the fitness estimation network by using the clipped cross entropy losses. 
     As one example, the object detection network is one of a platform object detection network corresponding to the auto labeling device, a third-party object detection network capable of providing a labeling service, and a combination of the platform object detection network and the third-party object detection network. 
     As one example, in case that the object detection network is the combination of the platform object detection network and the third-party object detection network, at the process of (I), the processor performs (i) a process of inputting or allowing the auto labeling device to input the unlabeled training images into the platform object detection network of the auto labeling device, to thereby allow the platform object detection network to (1) detect the objects for training in each of the unlabeled training images and thus (2) generate each of platform bounding boxes for training, (ii) a process of transmitting or allowing the auto labeling device to transmit the unlabeled training images to the third-party object detection network, to thereby allow the third-party object detection network to (1) detect the objects for training in each of the unlabeled training images and thus (2) generate each of third-party bounding boxes for training, (iii) a process of selecting adjusted bounding boxes for training, corresponding to the objects for training, among a training box group comprised of the platform bounding boxes for training and the third-party bounding boxes for training, by using an NMS (non-maximal suppression) algorithm, and (iv) a process of setting the adjusted bounding boxes for training as the bounding boxes for training. 
     As one example, at the process of (II), the processor performs a process of allowing the first classifier to apply at least one rectifying operation and then the PDF operation to results of the first fully-connected operation, and wherein the rectifying operation converts values of the results such that the values of the results are equal to or greater than 0. 
     In accordance with still yet another aspect of the present disclosure, there is provided an auto labeling device for auto labeling while performing automatic verification by using uncertainty scores of auto-labeled labels including: at least one memory that stores instructions; and at least one processor configured to execute the instructions to perform or support another device to perform: (I) on condition that a learning device has performed (i) (i-1) a process of inputting or allowing the auto labeling device to input one or more unlabeled training images into an object detection network, which has been trained, of the auto labeling device, to thereby allow the object detection network to detect one or more objects for training in each of the unlabeled training images and thus to generate each of bounding boxes for training and (i-2) a process of inputting or allowing the auto labeling device to input the unlabeled training images into a convolution network, which has been trained, of the auto labeling device, to thereby allow the convolution network to apply at least one convolution operation to each of the unlabeled training images and thus to generate each of feature maps for training corresponding to each of the unlabeled training images and (ii) (ii-1) a process of inputting or allowing the auto labeling device to input the feature maps for training into an ROI (region of interest) pooling layer of the auto labeling device, to thereby allow the ROI pooling layer to apply at least one pooling operation to each of the feature maps for training by using the bounding boxes for training, to thereby generate each of pooled feature maps for training and (ii-2) at least one of (1) a process of inputting or allowing the auto labeling device to input the pooled feature maps for training into a first classifier of the auto labeling device, to thereby allow the first classifier to apply at least one first fully-connected operation and then at least one PDF (probability distribution function) operation to each of the pooled feature maps for training and thus to generate each of first class scores for training and each of first box uncertainty scores for training, respectively corresponding to each of the bounding boxes for training and (2) a process of inputting or allowing the auto labeling device to input the pooled feature maps for training into a second classifier of the auto labeling device, to thereby allow the second classifier to (2-1) generate k copies of each of the pooled feature maps for training, (2-2) randomly set at least one element in each of the k copies of each of the pooled feature maps for training as 0, to thereby generate randomly-zeroed k copies thereof, (2-3) apply at least one second fully-connected operation and then at least one softmax operation to the randomly-zeroed k copies of each of the pooled feature maps for training, and thus (2-4) generate each of second class scores for training and each of second box uncertainty scores for training, respectively corresponding to each of the bounding boxes for training, and (ii-3) one of (1) a process of training the first classifier using one or more first class losses calculated by referring to the first class scores for training and ground truths corresponding to the bounding boxes for training and (2) a process of training the second classifier using one or more second class losses calculated by referring to the second class scores for training and the ground truths corresponding to the bounding boxes for training, then if one or more unlabeled test images are acquired, (I-1) a process of inputting the unlabeled test images into the object detection network, to thereby allow the object detection network to generate bounding boxes for testing corresponding to one or more objects for testing in each of the unlabeled test images and (I-2) a process of inputting the unlabeled test images into the convolution network, to thereby allow the convolution network to apply the convolution operation to each of the unlabeled test images and thus to generate each of feature maps for testing corresponding to each of the unlabeled test images, (II) (i) a process of allowing the ROI pooling layer to apply the pooling operation to each of the feature maps for testing by using the bounding boxes for testing, to thereby generate each of pooled feature maps for testing and (ii) at least one of (ii-1) a process of inputting the pooled feature maps for testing into the first classifier, to thereby allow the first classifier to apply the first fully-connected operation and then the PDF operation to each of the pooled feature maps for testing and thus to generate each of first class scores for testing and each of first box uncertainty scores for testing, respectively corresponding to each of the bounding boxes for testing and (ii-2) a process of inputting the pooled feature maps for testing into the second classifier, to thereby allow the second classifier to (1) generate k copies of each of the pooled feature maps for testing, (2) randomly set at least one element in each of the k copies of each of the pooled feature maps for testing as 0, to thereby generate randomly-zeroed k copies thereof, (3) apply the second fully-connected operation and then the softmax operation to the randomly-zeroed k copies of each of the pooled feature maps for testing, and thus (4) generate each of second class scores for testing and each of second box uncertainty scores for testing, respectively corresponding to each of the bounding boxes for testing, and (III) (i) a process of labeling the bounding boxes for testing corresponding to each of the unlabeled test images and a process of generating first class information for testing corresponding to the first class scores for testing and second class information for testing corresponding to the second class scores for testing, to thereby generate labeled test images and (ii) a process of transmitting, to a labeler, specific labeled test images, among the generated labeled test images, including specific bounding boxes for testing, among the bounding boxes for testing, to thereby allow the labeler to verify the specific labeled test images, wherein each of the specific bounding boxes for testing is selected by referring to (1) a first box uncertainty score for testing, among the first box uncertainty scores for testing, equal to or greater than a preset criterion uncertainty score and (2) a second box uncertainty score for testing, among the second box uncertainty scores for testing, equal to or greater than the preset criterion uncertainty score. 
     As one example, at the process of (II), the processor performs (i) a process of inputting the pooled feature maps for testing into a fitness estimation network, to thereby allow the fitness estimation network to apply at least one third fully-connected operation and then at least one sigmoid operation to the pooled feature maps for testing and thus to generate fitness values for testing which range from 0 to 1, wherein the fitness values for testing are created by estimating differences between (1) first uncertainty scores for testing in outputs, corresponding to the unlabeled test images, from the first classifier and (2) second uncertainty scores for testing in outputs, corresponding to the unlabeled test images, from the second classifier and (ii) a process of inputting first pooled feature maps for testing, among the pooled feature maps for testing, into the first classifier, wherein the first pooled feature maps for testing correspond to first fitness values for testing equal to or greater than a preset criterion fitness value among the fitness values for testing, and a process of inputting second pooled feature maps for testing, among the pooled feature maps for testing, into the second classifier, wherein the second pooled feature maps for testing correspond to second fitness values for testing less than the preset criterion fitness value among the fitness values for testing, and wherein the learning device performs a process of setting adjusted second box uncertainty scores for testing as the second box uncertainty scores for testing, and wherein the adjusted second box uncertainty scores for testing are created by adjusting each of the second box uncertainty scores for testing by a scale parameter such that a range of the adjusted second box uncertainty scores for testing corresponds to a range of the first box uncertainty scores for testing. 
     As one example, the object detection network is one of a platform object detection network corresponding to the auto labeling device, a third-party object detection network capable of providing a labeling service, and a combination of the platform object detection network and the third-party object detection network. 
     As one example, in case that the object detection network is the combination of the platform object detection network and the third-party object detection network, at the process of (I), the processor performs (i) a process of inputting the unlabeled test images into the platform object detection network, to thereby allow the platform object detection network to detect the objects for testing in each of the unlabeled test images and thus to generate each of platform bounding boxes for testing, (ii) a process of transmitting the unlabeled test images to the third-party object detection network, to thereby allow the third-party object detection network to (1) detect the objects for testing in each of the unlabeled test images and thus (2) generate each of third-party bounding boxes for testing, (iii) a process of selecting adjusted bounding boxes for testing, corresponding to the objects for testing, among a testing box group comprised of the platform bounding boxes for testing and the third-party bounding boxes for testing, by using an NMS (non-maximal suppression) algorithm, and (iv) a process of setting the adjusted bounding boxes for testing as the bounding boxes for testing. 
     As one example, at the process of (II), the processor performs a process of allowing the first classifier to apply at least one rectifying operation and then the PDF operation to results of the first fully-connected operation, and wherein the rectifying operation converts values of the results such that the values of the results are equal to or greater than 0. 
     As one example, the processor further performs: (IV) a process of re-training at least one of the first classifier and the second classifier, using one or more labeling losses calculated by referring to the specific labeled test images and verified labeled images wherein the verified labeled images are verified by the labeler. 
     In addition, recordable media that are readable by a computer for storing a computer program to execute the method of the present disclosure is further provided. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
       The following drawings to be used to explain example embodiments of the present disclosure are only part of example embodiments of the present disclosure and other drawings can be obtained based on the drawings by those skilled in the art of the present disclosure without inventive work. 
         FIG. 1  is a drawing schematically illustrating a learning device for training an auto labeling device which performs automatic verification by using uncertainty scores of auto-labeled labels in accordance with one example of the present disclosure. 
         FIG. 2  is a drawing schematically illustrating a method for training the auto labeling device which performs the automatic verification by using the uncertainty scores of the auto-labeled labels in accordance with one example of the present disclosure. 
         FIG. 3  is a drawing schematically illustrating exemplar distributions of outputs from a first classifier in accordance with one example of the present disclosure. 
         FIG. 4  is a drawing schematically illustrating processes of selectively using the first classifier and a second classifier by using a fitness value of an unlabeled training image in accordance with one example of the present disclosure. 
         FIG. 5  is a drawing schematically illustrating the auto labeling device which performs the automatic verification by using the uncertainty scores of the auto-labeled labels in accordance with one example of the present disclosure. 
         FIG. 6  is a drawing schematically illustrating a method for auto labeling which performs the automatic verification by using the uncertainty scores of the auto-labeled labels in accordance with one example of the present disclosure. 
         FIG. 7  is a drawing schematically illustrating processes of selectively using the first classifier and the second classifier by using the fitness value of an unlabeled test image in accordance with one example of the present disclosure. 
     
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     In the following detailed description, reference is made to the accompanying drawings that show, by way of illustration, specific embodiments in which the disclosure may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice the disclosure. It is to be understood that the various embodiments of the present disclosure, although different, are not necessarily mutually exclusive. For example, a particular feature, structure, or characteristic described herein in connection with one embodiment may be implemented within other embodiments without departing from the spirit and scope of the present disclosure. In addition, it is to be understood that the position or arrangement of individual elements within each disclosed embodiment may be modified without departing from the spirit and scope of the present disclosure. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope of the present disclosure is defined only by the appended claims, appropriately interpreted, along with the full range of equivalents to which the claims are entitled. In the drawings, like numerals refer to the same or similar functionality throughout several aspects. 
     Any images referred to in the present disclosure may include images related to any roads paved or unpaved, in which case the objects on the roads or near the roads may include vehicles, persons, animals, plants, buildings, flying objects like planes or drones, or any other obstacles which may appear in a road-related scene, but the scope of the present disclosure is not limited thereto. As another example, said any images referred to in the present disclosure may include images not related to any roads, such as images related to alleyway, land lots, sea, lakes, rivers, mountains, forests, deserts, sky, or any indoor space, in which case the objects in said any images may include vehicles, persons, animals, plants, buildings, flying objects like planes or drones, ships, amphibious planes or ships, or any other obstacles which may appear in a scene related to alleyway, land lots, sea, lakes, rivers, mountains, forests, deserts, sky, or any indoor space, but the scope of the present disclosure is not limited thereto. 
     Besides, in the detailed description and claims of the present disclosure, a term “include” and its variations are not intended to exclude other technical features, additions, components or steps. Other objects, benefits and features of the present disclosure will be revealed to one skilled in the art, partially from the specification and partially from the implementation of the present disclosure. The following examples and drawings will be provided as examples but they are not intended to limit the present disclosure. 
     The headings and abstract of the present disclosure provided herein are for convenience only and do not limit or interpret the scope or meaning of the embodiments. 
     For reference, throughout the present disclosure, the phrase “for training” or “training” is added to terms related to training processes, and the phrase “for testing”, “testing”, or “test” is added to terms related to testing processes, to avoid possible confusion. 
     To allow those skilled in the art to carry out the present disclosure easily, the example embodiments of the present disclosure will be explained by referring to attached diagrams in detail as shown below. 
       FIG. 1  is a drawing schematically illustrating a learning device for training an auto labeling device which performs automatic verification by using uncertainty scores of auto-labeled labels in accordance with one example of the present disclosure. By referring to  FIG. 1 , the learning device  1000  may include a memory  1001  for storing instructions to train the auto labeling device which performs the automatic verification by using the uncertainty scores of the auto-labeled labels and a processor  1002  for performing processes of training the auto labeling device according to the instructions in the memory  1001 . 
     Specifically, the learning device  1000  may typically achieve a desired system performance by using combinations of at least one computing device and at least one computer software, e.g., a computer processor, a memory, a storage, an input device, an output device, or any other conventional computing components, an electronic communication device such as a router or a switch, an electronic information storage system such as a network-attached storage (NAS) device and a storage area network (SAN) as the computing device and any instructions that allow the computing device to function in a specific way as the computer software. 
     Also, the processors of such devices may include hardware configuration of MPU (Micro Processing Unit) or CPU (Central Processing Unit), cache memory, data bus, etc. Additionally, the computing device may further include OS (operating system) and software configuration of applications that achieve specific purposes. 
     Such description of the computing device does not exclude an integrated device including any combination of a processor, a memory, a medium, or any other computing components for implementing the present disclosure. 
     A method of the learning device  1000  for training the auto labeling device  2000  which performs the automatic verification by using the uncertainty scores of the auto-labeled labels in accordance with one example embodiment of the present disclosure is described by referring to  FIG. 2  as follows. In  FIG. 2 , terminologies of inputs and outputs may vary according to attributes of the unlabeled image. For example, “first”, “second”, “test” and the like may be attached to various inputs and outputs. 
     First, if one or more first unlabeled training images are acquired, the learning device  1000  may perform a process of inputting or allowing the auto labeling device  2000  to input the first unlabeled training images into a feature pyramid network (FPN)  2100  of the auto labeling device  2000 . 
     Then the feature pyramid network  2100  may apply at least one convolution operation to each of the first unlabeled training images and thus generate one or more first pyramid feature maps for training with different resolutions for each of the first unlabeled training images. That is, supposing that a size of the first unlabeled training images is H×W, sizes of the first pyramid feature maps for training generated by the feature pyramid network  2100  may be H′×W′. 
     Meanwhile, the learning device  1000  may perform a process of inputting or allowing the auto labeling device  2000  to input the first unlabeled training images into a convolution network of the auto labeling device  2000 , to thereby allow the convolution network to apply the convolution operation to the first unlabeled training images and thus to generate one or more first feature maps for training with a size of H′×W′. Description below makes use of the first pyramid feature maps for training, however, the same processes may apply to the first feature maps for training. 
     Thereafter, the learning device  1000  may perform a process of inputting or allowing the auto labeling device  2000  to input the first pyramid feature maps for training into an object detection network  2200  of the auto labeling device  2000 . 
     Then the object detection network  2200  may detect one or more first objects for training in each of the first pyramid feature maps for training and thus generate each of first bounding boxes for training corresponding to each of the first objects for training. 
     Herein, the object detection network  2200  may (i) allow a region proposal network (RPN) to generate one or more first proposal boxes for training, where the first objects for training are estimated as located, on the first pyramid feature maps for training, (ii) apply at least one pooling operation to the first pyramid feature maps for training by using the first proposal boxes for training, and (iii) allow an R-CNN (region based convolutional neural network) to apply at least one fully-connected operation to the pooled first pyramid feature maps for training, to thereby generate each of the first bounding boxes for training corresponding to each of the first objects for training. However, the object detection network  2200  in accordance with the present disclosure is not limited to be configured as R-CNN. For example, the object detection network  2200  may be configured as any perception networks capable of detecting objects on images, such as CNN, Fast R-CNN, YOLO (you only look once), SSD (single shot detector), etc. Also, the object detection network  2200  may adopt feature point detection algorithms such as a Canny edge detector, a Harris Corner Detector, Haar-like features, HOG (Histogram of Oriented Gradient), SIFT (Scale Invariant Feature Transform), etc. 
     And the object detection network  2200  may be one of (1) at least one platform object detection network corresponding to the auto labeling device  2000  and (2) at least one third-party object detection network  2300  capable of providing a labeling service. 
     As another example, the object detection network  2200  may be a combination of the platform object detection network and the third-party object detection network  2300 . 
     That is, as described above, the learning device  1000  may perform a process of allowing the platform object detection network of the auto labeling device  2000  to generate first platform bounding boxes for training corresponding to the first objects for training in each of the first unlabeled training images and a process of transmitting or allowing the auto labeling device  2000  to transmit the first unlabeled training images to the third-party object detection network  2300 . Then the third-party object detection network  2300  may perform (1) a process of detecting the first objects for training in each of the first unlabeled training images and thus (2) a process of generating each of first third-party bounding boxes for training corresponding to each of the first objects for training. Thereafter, the learning device  1000  may perform or allow the auto labeling device  2000  to perform (i) a process of selecting first adjusted bounding boxes for training, corresponding to the first objects for training, among a first training box group comprised of the first platform bounding boxes for training and the first third-party bounding boxes for training, by using an NMS (non-maximal suppression) algorithm, and (ii) a process of setting the first adjusted bounding boxes for training as the first bounding boxes for training. 
     Thereafter, the learning device  1000  may perform a process of training the object detection network  2200  and the feature pyramid network  2100 , using one or more first losses calculated by referring to the first bounding boxes for training and ground truths of the first unlabeled training images. 
     Although the first pyramid feature maps for training, outputted from the feature pyramid network  2100 , are described above as inputted into the object detection network  2200 , however, as another example, the first unlabeled training images may be inputted into the object detection network  2200 , to thereby generate the first bounding boxes for training. 
     Next, on condition that the object detection network  2200  and the feature pyramid network  2100  or the convolution network have been trained as above, a first classifier  2500  and a second classifier  2600  may be trained. 
     That is, if one or more unlabeled training images to be used for training the first classifier  2500  and the second classifier  2600  are acquired, the learning device  1000  may perform (i) a process of inputting or allowing the auto labeling device  2000  to input the unlabeled training images into the object detection network  2200 , which has been trained, of the auto labeling device  2000 , to thereby allow the object detection network  2200  to detect one or more objects for training in each of the unlabeled training images and thus to generate one or more bounding boxes for training and (ii) a process of inputting or allowing the auto labeling device  2000  to input the unlabeled training images into the feature pyramid network  2100 , which has been trained, of the auto labeling device  2000 , to thereby allow the feature pyramid network  2100  to apply the convolution operation to each of the unlabeled training images and thus to generate each of one or more pyramid feature maps for training corresponding to each of the unlabeled training images. 
     As one example, on condition that the object detection network  2200  and the feature pyramid network  2100  have been trained, the learning device  1000  may perform a process of inputting or allowing the auto labeling device  2000  to input the unlabeled training images, i.e., second unlabeled training images, into the feature pyramid network  2100  of the auto labeling device  2000 . 
     Then the feature pyramid network  2100  may apply the convolution operation to each of the second unlabeled training images and thus generate one or more second pyramid feature maps for training with different resolutions for each of the second unlabeled training images. 
     Thereafter, the learning device  1000  may perform a process of inputting or allowing the auto labeling device  2000  to input the second pyramid feature maps for training into the object detection network  2200  of the auto labeling device  2000 . 
     Then the object detection network  2200  may detect one or more second objects for training in each of the second pyramid feature maps for training and thus generate each of second bounding boxes for training corresponding to each of the second objects for training. Meanwhile, the second objects for training and the second bounding boxes for training may be result information on the unlabeled training images to be used for training the first classifier  2500  and the second classifier  2600 , and the term “second” is added to avoid confusion with result information on the first unlabeled training images to be used for training the object detection network, etc. above, and the same applies to description below. 
     Herein, the object detection network  2200  may (i) allow the region proposal network to generate one or more second proposal boxes for training, where the second objects for training are estimated as located, on the second pyramid feature maps for training, (ii) apply the pooling operation to the second pyramid feature maps for training by using the second proposal boxes for training, and (iii) allow the R-CNN to apply the fully-connected operation to the pooled second pyramid feature maps for training, to thereby generate each of the second bounding boxes for training corresponding to each of the second objects for training. 
     And the second pyramid feature maps for training are described above as inputted into the object detection network  2200 , however, as another example, the second unlabeled training images may be inputted into the object detection network  2200 , to thereby allow the object detection network  2200  to generate each of the second bounding boxes for training corresponding to each of the second objects for training. 
     Also, the object detection network  2200  may be one of (1) the platform object detection network corresponding to the auto labeling device  2000  and (2) the third-party object detection network capable of providing the labeling service. 
     Meanwhile, the second objects for training are described above as detected by using only the object detection network  2200 , which is the platform object detection network, of the auto labeling device  2000 , but as another example, at least one third-party object detection network capable of providing an object detection service may be used simultaneously for detecting the second objects for training. 
     That is, the learning device  1000  may perform a process of transmitting or allowing the auto labeling device  2000  to transmit the second unlabeled training images to the third-party object detection network  2300 . Then the third-party object detection network  2300  may perform (1) a process of detecting the second objects for training in each of the second unlabeled training images and thus (2) a process of generating each of second third-party bounding boxes for training corresponding to each of the second objects for training. Thereafter, the learning device  1000  may perform or allow the auto labeling device  2000  to perform (i) a process of selecting second adjusted bounding boxes for training, corresponding to the second objects for training, among a second training box group comprised of the second bounding boxes for training, which are second platform bounding boxes for training, and the second third-party bounding boxes for training, by using the NMS algorithm, and (ii) a process of setting the second adjusted bounding boxes for training as the second bounding boxes for training. 
     Next, the learning device  1000  may perform or support the auto labeling device  2000  to perform a process of allowing an ROI (region of interest) pooling layer  2400  of the auto labeling device  2000  to apply the pooling operation to each of the second pyramid feature maps for training by using the second bounding boxes for training, to thereby generate each of pooled feature maps for training. 
     Next, the learning device  1000  may perform at least one of (i) a process of inputting or allowing the auto labeling device  2000  to input the pooled feature maps for training into a first classifier  2500  of the auto labeling device  2000 , to thereby allow the first classifier  2500  to generate each of first class scores for training and each of first box uncertainty scores for training, respectively corresponding to each of the second bounding boxes for training, and (ii) a process of inputting or allowing the auto labeling device  2000  to input the pooled feature maps for training into a second classifier  2600  of the auto labeling device  2000 , to thereby allow the second classifier  2600  to generate each of second class scores for training and each of second box uncertainty scores for training, respectively corresponding to each of the second bounding boxes for training. 
     Next, the learning device  1000  may perform one of (i) a process of training the first classifier  2500  using one or more second losses, i.e., one or more first class losses, calculated by referring to the first class scores for training and ground truths corresponding to the second bounding boxes for training, and (ii) a process of training the second classifier  2600  using one or more third losses, i.e., one or more second class losses, calculated by referring to the second class scores for training and the ground truths corresponding to the second bounding boxes for training. 
     Herein, processes of generating the first class scores for training, the first box uncertainty scores for training, the second class scores for training, and the second box uncertainty scores for training, by the first classifier  2500  and the second classifier  2600  are described in detail as follows. 
     First, the first classifier  2500  may apply at least one first fully-connected operation and then at least one PDF (probability distribution function) operation to each of the pooled feature maps for training and thus generate each of the first class scores for training and each of the first box uncertainty scores for training, respectively corresponding to each of the second bounding boxes for training. 
     That is, the first classifier  2500  may input each of the pooled feature maps for training into an FC (fully connected) network, to thereby allow the FC network to apply the fully-connected operation to each of the pooled feature maps for training and thus to output PDF parameters. 
     As one example, supposing that the first class scores for training y=[y 1 , y 2 , . . . , y c ] to be used for determining c classes follow a Dirichlet distribution as shown in an equation 1 as below, the PDF parameters may be α 1 , α 2 , . . . , and α c . 
     
       
         
           
             
               
                 
                   
                     
                       p 
                       ⁡ 
                       
                         ( 
                         
                           y 
                           | 
                           α 
                         
                         ) 
                       
                     
                     = 
                     
                       
                         
                           Γ 
                           ⁡ 
                           
                             ( 
                             
                               
                                 ∑ 
                                 
                                   j 
                                   = 
                                   1 
                                 
                                 C 
                               
                               ⁢ 
                               
                                   
                               
                               ⁢ 
                               
                                 α 
                                 j 
                               
                             
                             ) 
                           
                         
                         
                           
                             ∏ 
                             
                               j 
                               = 
                               1 
                             
                             C 
                           
                           ⁢ 
                           
                               
                           
                           ⁢ 
                           
                             Γ 
                             ⁡ 
                             
                               ( 
                               
                                 α 
                                 j 
                               
                               ) 
                             
                           
                         
                       
                       ⁢ 
                       
                         
                           ∑ 
                           
                             j 
                             = 
                             1 
                           
                           C 
                         
                         ⁢ 
                         
                           y 
                           j 
                           
                             
                               α 
                               j 
                             
                             - 
                             1 
                           
                         
                       
                     
                   
                   , 
                   
                     
                       α 
                       j 
                     
                     ≥ 
                     0 
                   
                 
               
               
                 
                   &lt;Equation 1&gt; 
                 
               
             
           
         
       
     
     In the equation 1, Γ may represent a gamma function. 
     And, in order to satisfy a condition α j ≥0, at least one rectifying operation may be applied to results of the first fully-connected operation such that values of the results are equal to or greater than 0. Herein, a ReLU (Rectified Linear Unit) layer may be used for the rectifying operation, and the ReLU layer may leave an element, equal to or larger than 0, of an input tensor as is, but may convert an element, less than 0, of the input tensor into 0. 
     Also, since the first class scores for training, i.e., y, are defined probabilistically, expected losses may be used as the second losses which are related to y. 
     As one example, if y follows the Dirichlet distribution, and if losses related to y are defined as cross entropy losses, then the expected losses may be calculated by an equation 2. 
     
       
         
           
             
               
                 
                   
                     E 
                     ⁡ 
                     
                       [ 
                       
                         L 
                         ⁡ 
                         
                           ( 
                           
                             y 
                             | 
                             
                               y 
                               * 
                             
                           
                           ) 
                         
                       
                       ] 
                     
                   
                   = 
                   
                     
                       ∫ 
                       
                         
                           [ 
                           
                             
                               ∑ 
                               
                                 j 
                                 = 
                                 1 
                               
                               C 
                             
                             ⁢ 
                             
                               
                                 - 
                                 
                                   y 
                                   j 
                                   * 
                                 
                               
                               ⁢ 
                               
                                 log 
                                 ⁡ 
                                 
                                   ( 
                                   
                                     y 
                                     j 
                                   
                                   ) 
                                 
                               
                             
                           
                           ] 
                         
                         ⁢ 
                         
                           p 
                           ⁡ 
                           
                             ( 
                             y 
                             ) 
                           
                         
                         ⁢ 
                         dy 
                       
                     
                     = 
                     
                       
                         ∑ 
                         
                           j 
                           = 
                           1 
                         
                         C 
                       
                       ⁢ 
                       
                         
                           y 
                           j 
                           * 
                         
                         ⁡ 
                         
                           ( 
                           
                             
                               ψ 
                               ⁡ 
                               
                                 ( 
                                 S 
                                 ) 
                               
                             
                             - 
                             
                               ψ 
                               ⁡ 
                               
                                 ( 
                                 
                                   α 
                                   j 
                                 
                                 ) 
                               
                             
                           
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   &lt;Equation 2&gt; 
                 
               
             
           
         
       
     
     In the equation 2, y* represents a ground truth, ψ represents a Digamma function, S represents a sum of the PDF parameters which may be calculated as 
     
       
         
           
             S 
             = 
             
               
                 ∑ 
                 
                   j 
                   = 
                   1 
                 
                 C 
               
               ⁢ 
               
                   
               
               ⁢ 
               
                 
                   α 
                   j 
                 
                 . 
               
             
           
         
       
     
     Therefore, the learning device  1000  may perform a process of training the first classifier  2500  via backpropagating gradients corresponding to the expected losses as shown in the equation 2. 
     And, a mean and a variance of the Dirichlet distribution may be calculated as shown in an equation 3 below. 
     
       
         
           
             
               
                 
                   
                     
                       E 
                       ⁡ 
                       
                         [ 
                         
                           y 
                           j 
                         
                         ] 
                       
                     
                     = 
                     
                       
                         α 
                         j 
                       
                       S 
                     
                   
                   ⁢ 
                   
                     
 
                   
                   ⁢ 
                   
                     
                       Var 
                       ⁡ 
                       
                         [ 
                         
                           y 
                           j 
                         
                         ] 
                       
                     
                     = 
                     
                       
                         
                           α 
                           j 
                         
                         ⁡ 
                         
                           ( 
                           
                             S 
                             - 
                             
                               α 
                               j 
                             
                           
                           ) 
                         
                       
                       
                         
                           S 
                           2 
                         
                         ⁡ 
                         
                           ( 
                           
                             S 
                             + 
                             1 
                           
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   &lt;Equation 3&gt; 
                 
               
             
           
         
       
     
     In the equation 3, S may be the sum of the PDF parameters and may be calculated as 
     
       
         
           
             S 
             = 
             
               
                 ∑ 
                 
                   j 
                   = 
                   1 
                 
                 C 
               
               ⁢ 
               
                   
               
               ⁢ 
               
                 
                   α 
                   j 
                 
                 . 
               
             
           
         
       
     
     Also, the first box uncertainty scores for training may be calculated as shown in an equation 4 below. 
     
       
         
           
             
               
                 
                   
                     UncertaintyScore 
                     ⁡ 
                     
                       ( 
                       
                         y 
                         | 
                         α 
                       
                       ) 
                     
                   
                   = 
                   
                     C 
                     
                       C 
                       + 
                       S 
                     
                   
                 
               
               
                 
                   &lt;Equation 4&gt; 
                 
               
             
           
         
       
     
     The uncertainty score in the equation 4 may be derived by formularizing a theory on the uncertainty called Dempster-Shafer theory of evidence (or belief theory) described in “Interpreting Belief Functions as Dirichlet Distributions” (Audun Josang et al.) using the Dirichlet distribution. 
     And, according to the equation 4, the sum of the PDF parameters is small in a case of a high uncertainty score. 
     For example, supposing that α 1 =[0.1, 0.01, 0] (S 1 =0.11) and, α 2 =[10, 1, 0] (S 2 =11), then, as shown in an equation 5, the means are identical but the uncertainty scores much differ. 
     
       
         
           
             
               
                 
                   
                     
                       E 
                       ⁡ 
                       
                         [ 
                         
                           y 
                           1 
                         
                         ] 
                       
                     
                     = 
                     
                       
                         
                           α 
                           1 
                         
                         
                           S 
                           1 
                         
                       
                       = 
                       
                         
                           E 
                           ⁡ 
                           
                             [ 
                             
                               y 
                               2 
                             
                             ] 
                           
                         
                         = 
                         
                           
                             
                               α 
                               2 
                             
                             
                               S 
                               2 
                             
                           
                           = 
                           
                             [ 
                             
                               
                                 
                                   0 
                                   . 
                                   9 
                                 
                                 ⁢ 
                                 1 
                               
                               , 
                               
                                 
                                   0 
                                   . 
                                   0 
                                 
                                 ⁢ 
                                 9 
                               
                               , 
                               0 
                             
                             ] 
                           
                         
                       
                     
                   
                   ⁢ 
                   
                     
 
                   
                   ⁢ 
                   
                     
                       U 
                       ⁡ 
                       
                         ( 
                         
                           
                             y 
                             1 
                           
                           | 
                           
                             α 
                             1 
                           
                         
                         ) 
                       
                     
                     = 
                     
                       
                         3 
                         
                           3 
                           + 
                           
                             
                               0 
                               . 
                               1 
                             
                             ⁢ 
                             1 
                           
                         
                       
                       = 
                       
                         
                           
                             0 
                             . 
                             9 
                           
                           ⁢ 
                           6 
                           ⁢ 
                           
                             U 
                             ⁡ 
                             
                               ( 
                               
                                 
                                   y 
                                   2 
                                 
                                 | 
                                 
                                   α 
                                   2 
                                 
                               
                               ) 
                             
                           
                         
                         = 
                         
                           
                             3 
                             
                               3 
                               + 
                               
                                 1 
                                 ⁢ 
                                 1 
                               
                             
                           
                           = 
                           
                             
                               0 
                               . 
                               2 
                             
                             ⁢ 
                             1 
                           
                         
                       
                     
                   
                 
               
               
                 
                   &lt;Equation 5&gt; 
                 
               
             
           
         
       
     
     That is, comparing distributions of p(y 1 |α 1 ) and p(y 2 |α 2 ) by referring to  FIG. 3 , locations of the means are identical for α 1  and α 2 , however, the distribution of p(y 1 |α 1 ) is much broader. Herein, the broad distribution of p(y 1 |α 1 ) represents that p(y 1 |α 1 ) is more difficult to predict precisely, and this can be interpreted that input data are near an area difficult to classify, that is, near a decision boundary. 
     Therefore, a shape of the distribution of the first class scores for training may vary according to the PDF parameters, and the uncertainty score of the inputted image may be measured with a single inference by training for minimizing the expected losses, as can be seen by referring to “Evidential Deep Learning to Quantify Classification Uncertainty” (Murat Sensoy et al.). 
     Especially, since the Dirichlet distribution is a probability distribution of non-negative vectors whose sum of elements is 1, in case of softmax vectors such as class scores, an assumption that most of them follow the Dirichlet distribution is justified. Also, in the case of the Dirichlet distribution, since there is an equation for calculating the uncertainty score ranging from 0 to 1 as well as the variance, a reliability of prediction is easy to measure if the Dirichlet distribution is adopted for a classification network. 
     Next, the second classifier  2600  may (1) generate k copies of each of the pooled feature maps for training, (2) randomly set at least one element in each of the k copies of each of the pooled feature maps for training as 0, to thereby generate randomly-zeroed k copies thereof, (3) apply at least one second fully-connected operation and then at least one softmax operation to the randomly-zeroed k copies of each of the pooled feature maps for training, and thus (4) generate each of second class scores for training and each of second box uncertainty scores for training, respectively corresponding to each of the second bounding boxes for training. 
     Herein, each of the second class scores for training to be used for determining the c classes may be a c-dimensional softmax vector where y i =[y i1 +y i2 , . . . , y iC ]+ . . . +y iC =1. Herein y i1 +y i2 + . . . +y iC =1. 
     And, various values, such as a variance of the second class scores for training, entropy of the second class scores for training, etc. may be used as the first box uncertainty scores for training. Also, it is known that a measure called BALD (Bayesian Active Learning by Disagreement) is effective for representing the uncertainty. By referring to “Bayesian Active Learning for Classification and Preference Learning” (Neil Houlsby et al.), the BALD may be calculated as shown in an equation 6. 
     
       
         
           
             
               
                 
                   
                     UncertaintyScore 
                     ⁡ 
                     
                       ( 
                       y 
                       ) 
                     
                   
                   = 
                   
                     
                       Entropy 
                       ⁡ 
                       
                         ( 
                         
                           
                             
                               y 
                               1 
                             
                             + 
                             
                               y 
                               2 
                             
                             + 
                             … 
                             + 
                             
                               y 
                               K 
                             
                           
                           K 
                         
                         ) 
                       
                     
                     - 
                     
                       
                         1 
                         K 
                       
                       ⁢ 
                       
                         
                           ∑ 
                           
                             i 
                             = 
                             1 
                           
                           K 
                         
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         
                           Entropy 
                           ⁡ 
                           
                             ( 
                             
                               y 
                               i 
                             
                             ) 
                           
                         
                       
                     
                   
                 
               
               
                 
                   &lt;Equation 6&gt; 
                 
               
             
           
         
       
     
     According to the equation 6, high uncertainty scores are generated when each of y 1  predicts different classes with high confidence scores. 
     For example, given that y 1 =[0.9, 0.1, 0], y 2 =[0.01, 0.99, 0], y 3 =[0, 0, 1], and y 4 =[0, 0, 1], since each of y i  is a one-hot vector or almost similar thereto, each Entropy(y i ), i.e., 0.33, 0.06, 0, and 0, is much small. However, since each of y i  predicts different classes, an average 
                 y   1     +     y   2     +   …   +     y   K       K         
of the y i  is [0.23, 0.27, 0.5], similar to uniformity, and the entropy, calculated as 1.04, of the average is large. Accordingly, since the first term of the equation 6 is large and the second term thereof is small, the uncertainty score is large.
 
     Therefore, since the second classifier  2600  performs multiple inferences for a single input, an accuracy of the class scores is improved. 
       FIG. 4  is a drawing schematically illustrating a process of selectively using the first classifier and a second classifier by using a fitness value of an unlabeled training image in accordance with one example of the present disclosure, and its description is as follows. In the description below, the part easily deducible from the explanation of  FIG. 2  will be omitted. 
     First, on condition that the feature pyramid network  2100  and the object detection network  2200  of the auto labeling device  2000  have been trained by using the first unlabeled training images, the learning device  1000  may perform a process of inputting or allowing the auto labeling device  2000  to input the second unlabeled training images into the feature pyramid network  2100  of the auto labeling device  2000 . 
     Then the feature pyramid network  2100  may apply the convolution operation to each of the second unlabeled training images and thus generate one or more second pyramid feature maps for training with different resolutions for each of the second unlabeled training images. 
     Thereafter, the learning device  1000  may perform a process of inputting or allowing the auto labeling device  2000  to input the second pyramid feature maps for training into the object detection network  2200  of the auto labeling device  2000 . 
     Then the object detection network  2200  may detect one or more second objects for training in each of the second pyramid feature maps for training and thus generate each of second bounding boxes for training corresponding to each of the second objects for training. 
     Meanwhile, the second objects for training are described above as detected by using only the object detection network  2200  of the auto labeling device  2000 , but as another example, at least one third-party object detection network capable of providing the object detection service may further be used for detecting the second objects for training. 
     That is, the learning device  1000  may perform a process of transmitting or allowing the auto labeling device  2000  to transmit the second unlabeled training images to the third-party object detection network  2300 . Then the third-party object detection network  2300  may perform (1) a process of detecting the second objects for training in each of the second unlabeled training images and thus (2) a process of generating each of second third-party bounding boxes for training corresponding to each of the second objects for training. Thereafter, the learning device  1000  may perform or allow the auto labeling device  2000  to perform (i) a process of selecting second adjusted bounding boxes for training, corresponding to the second objects for training, among a second training box group comprised of the second bounding boxes for training and the second third-party bounding boxes for training, by using the NMS algorithm, and (ii) a process of setting the second adjusted bounding boxes for training as the second bounding boxes for training. 
     Meanwhile, the second pyramid feature maps for training are described above as inputted into the object detection network  2200 , however, as another example, the second unlabeled training images may be inputted into the object detection network  2200 , to thereby allow the object detection network  2200  to generate each of the second bounding boxes for training corresponding to each of the second objects for training. 
     Next, the learning device  1000  may perform or support the auto labeling device  2000  to perform a process of allowing an ROI (region of interest) pooling layer  2400  of the auto labeling device to apply the pooling operation to each of the second pyramid feature maps for training by using the second bounding boxes for training, to thereby generate each of pooled feature maps for training. 
     Next, the learning device  1000  may perform a process of inputting or allowing the auto labeling device  2000  to input the pooled feature maps for training into a fitness estimation network  2700  of the auto labeling device  2000 . 
     Then, the fitness estimation network  2700  may apply at least one third fully-connected operation and then at least one sigmoid operation to the pooled feature maps for training and thus generate fitness values for training which range from 0 to 1. 
     Herein, the fitness values for training may be created by estimating differences between (1) first box uncertainty scores for training of the first class scores for training, corresponding to the second unlabeled training images, outputted from the first classifier  2500  and (2) second box uncertainty scores for training of the second class scores for training, corresponding to the second unlabeled training images, outputted from the second classifier  2600 . 
     Next, as described by referring to  FIG. 2 , the learning device  1000  may perform or support another device to perform a process of inputting the pooled feature maps for training into the first classifier  2500  and the second classifier  2600 , to thereby allow (1) the first classifier  2500  to generate each of the first class scores for training and each of the first box uncertainty scores for training, respectively corresponding to each of the second bounding boxes for training and (2) the second classifier  2600  to generate each of second class scores for training and each of the second box uncertainty scores for training, respectively corresponding to each of the second bounding boxes for training. 
     Next, the learning device  1000  may perform one of (i) a process of training the first classifier  2500  using the second losses, i.e., the first class losses, calculated by referring to the first class scores for training and ground truths corresponding to the second bounding boxes for training, and (ii) a process of training the second classifier  2600  using the third losses, i.e., the second class losses, calculated by referring to the second class scores for training and the ground truths corresponding to the second bounding boxes for training. 
     Next, the learning device may perform a process of calculating one or more fourth losses, i.e., one or more uncertainty losses, by referring to the first box uncertainty scores for training and adjusted second box uncertainty scores for training, where the adjusted second box uncertainty scores for training may be created by adjusting each of the second box uncertainty scores for training by a scale parameter such that a range of the adjusted second box uncertainty scores for training corresponds to a range of the first box uncertainty scores for training. 
     Thereafter, the learning device  1000  may perform a process of updating the scale parameter by using the fourth losses, and a process of training the fitness estimation network  2700  using the cross entropy losses which are calculated by referring to the fourth losses and the fitness values for training. Herein, the cross entropy losses may be defined as “L(τ|1−|first box uncertainty scores for training−adjusted second box uncertainty scores for training|)”, but the scope of the present disclosure is not limited thereto. Further, if the cross entropy losses lie outside a range from 0 to 1, then the cross entropy losses may be clipped such that a range of the clipped cross entropy losses becomes a range from 0 to 1. And the fitness estimation network  2700  may be trained by using the clipped cross entropy losses. 
     That is, the learning device  1000  may perform a process of training the fitness estimation network  2700  such that the fitness values for training are inversely proportional to differences between the first box uncertainty scores for training and the adjusted second box uncertainty scores for training. 
     Therefore, depending on whether the class scores follow a specific distribution or not, either the first classifier or the second classifier may be selected for confirmation of uncertainties of the training images in accordance with the present disclosure. 
       FIG. 5  is a drawing schematically illustrating the auto labeling device which performs the automatic verification by using the uncertainty scores of the auto-labeled labels in accordance with one example of the present disclosure. By referring to  FIG. 5 , the auto labeling device  2000  may include a memory  2001  for storing instructions to perform auto labeling where the automatic verification by using the uncertainty scores of the auto-labeled labels is performed and a processor  2002  for performing processes of performing the auto labeling according to the instructions in the memory  2001 . 
     Specifically, the auto labeling device  2000  may typically achieve a desired system performance by using combinations of at least one computing device and at least one computer software, e.g., a computer processor, a memory, a storage, an input device, an output device, or any other conventional computing components, an electronic communication device such as a router or a switch, an electronic information storage system such as a network-attached storage (NAS) device and a storage area network (SAN) as the computing device and any instructions that allow the computing device to function in a specific way as the computer software. 
     Also, the processors of such devices may include hardware configuration of MPU (Micro Processing Unit) or CPU (Central Processing Unit), cache memory, data bus, etc. Additionally, the computing device may further include OS (operating system) and software configuration of applications that achieve specific purposes. 
     Such description of the computing device does not exclude an integrated device including any combination of a processor, a memory, a medium, or any other computing components for implementing the present disclosure. 
     A method of the auto labeling device  2000  for the auto labeling performing the automatic verification by using the uncertainty scores of the auto-labeled labels in accordance with one example embodiment of the present disclosure is described by referring to  FIG. 6  as follows. In the description below, the part easily deducible from the description of  FIGS. 2 to 4  will be omitted. 
     First, on condition that the auto labeling device  2000  has been trained according to the description of  FIGS. 2 to 4 , if one or more unlabeled test images are acquired, the auto labeling device  2000  may perform a process of inputting the unlabeled test images into the feature pyramid network  2100 . 
     Then the feature pyramid network  2100  may apply the convolution operation to each of the unlabeled test images and thus generate one or more pyramid feature maps for testing with different resolutions for each of the unlabeled test images. 
     Meanwhile, the auto labeling device  2000  may perform a process of inputting the unlabeled test images into the convolution network, which has been trained, to thereby allow the convolution network to apply the convolution operation to the unlabeled test images and thus to generate one or more feature maps for testing. Description below makes use of the pyramid feature maps for testing, however, the same processes may apply to the feature maps for testing. 
     Thereafter, the auto labeling device  2000  may input the pyramid feature maps for testing into the object detection network  2200 . 
     Then the object detection network  2200  may detect one or more objects for testing in each of the pyramid feature maps for testing and thus generate each of bounding boxes for testing corresponding to each of the objects for testing. 
     Herein, the object detection network  2200  may (i) allow the region proposal network to generate one or more proposal boxes for testing, where the objects for testing are estimated as located, on the pyramid feature maps for testing, (ii) apply the pooling operation to the pyramid feature maps for testing by using the proposal boxes for testing, and (iii) allow the R-CNN to apply the fully-connected operation to the pooled pyramid feature maps for testing, to thereby generate each of the bounding boxes for testing corresponding to each of the objects for testing. 
     And the object detection network  2200  may be one of (1) the platform object detection network corresponding to the auto labeling device  2000  and (2) the third-party object detection network  2300  capable of providing the labeling service. 
     As another example, the object detection network  2200  may be the combination of the platform object detection network and the third-party object detection network  2300 . 
     That is, the auto labeling device  2000  may perform a process of allowing the platform object detection network to generate platform bounding boxes for testing corresponding to the objects for testing in each of the unlabeled test images and a process of transmitting the unlabeled test images to the third-party object detection network  2300  capable of providing the object detection service. Then the third-party object detection network  2300  may perform (1) a process of detecting the objects for testing in each of the unlabeled test images and thus (2) a process of generating each of third-party bounding boxes for testing corresponding to each of the objects for testing. Thereafter, the auto labeling device  2000  may perform (i) a process of selecting adjusted bounding boxes for testing, corresponding to the objects for testing, among a test box group comprised of the platform bounding boxes for testing and the third-party bounding boxes for testing, by using the NMS algorithm, and (ii) a process of setting the adjusted bounding boxes for testing as the bounding boxes for testing. 
     Next, the auto labeling device  2000  may perform a process of allowing the ROI pooling layer  2400  to apply the pooling operation to each of the pyramid feature maps for testing by using the bounding boxes for testing, to thereby generate each of pooled feature maps for testing. 
     Although the pyramid feature maps for testing are described above as inputted into the object detection network  2200 , however, as another example, the unlabeled test images may be inputted into the object detection network  2200 , to thereby generate the bounding boxes for testing. 
     That is, the auto labeling device  2000  may perform or support another device to perform (i) a process of inputting the unlabeled test images into the object detection network  2200 , to thereby allow the object detection network  2200  to generate the bounding boxes for testing corresponding to the objects for testing in each of the unlabeled test images and (ii) a process of inputting the unlabeled test images into the convolution network, to thereby allow the convolution network to apply the convolution operation to each of the unlabeled test images and thus to generate each of the feature maps for testing corresponding to each of the unlabeled test images. Then, the auto labeling device  2000  may perform a process of allowing the ROI pooling layer  2400  to apply the pooling operation to each of the feature maps for testing by using the bounding boxes for testing, to thereby generate each of the pooled feature maps for testing. 
     Next, the auto labeling device  2000  may perform at least one of (i) a process of inputting the pooled feature maps for testing into the first classifier  2500 , to thereby allow the first classifier  2500  to generate each of first class scores for testing and each of first box uncertainty scores for testing, respectively corresponding to each of the bounding boxes for testing, and (ii) a process of inputting the pooled feature maps for testing into the second classifier  2600 , to thereby allow the second classifier  2600  to generate each of second class scores for testing and each of second box uncertainty scores for testing, respectively corresponding to each of the bounding boxes for testing. 
     Next, the auto labeling device  2000  may perform a process of labeling the bounding boxes for testing corresponding to each of the unlabeled test images and a process of generating first class information for testing corresponding to the first class scores for testing and second class information for testing corresponding to the second class scores for testing, to thereby generate labeled test images. 
     And the auto labeling device  2000  may perform a process of transmitting, to a labeler, specific labeled test images, among the generated labeled test images, including specific bounding boxes for testing, among the bounding boxes for testing, to thereby allow the labeler to verify the specific labeled test images, where each of the specific bounding boxes for testing is selected by referring to (1) a first box uncertainty score for testing, among the first box uncertainty scores for testing, equal to or greater than a preset criterion uncertainty score and (2) a second box uncertainty score for testing, among the second box uncertainty scores for testing, equal to or greater than the preset criterion uncertainty score. 
     Further, the auto labeling device  2000  may perform a process of re-training at least one of the first classifier and the second classifier, using one or more fifth losses, i.e., one or more labeling losses, calculated by referring to the specific labeled test images and verified labeled images where the verified labeled images are verified by the labeler. 
       FIG. 7  is a drawing schematically illustrating a process of selectively using the first classifier and the second classifier by using the fitness value of an unlabeled test image in accordance with one example of the present disclosure, and its description is as follows. In the description below, the part easily deducible from the description of  FIGS. 2 to 6  will be omitted. 
     First, the auto labeling device  2000  may input the unlabeled test images into the feature pyramid network  2100 . 
     Then the feature pyramid network  2100  may apply the convolution operation to each of the unlabeled test images and thus generate one or more pyramid feature maps for testing with different resolutions for each of the unlabeled test images. 
     Meanwhile, the auto labeling device  2000  may perform a process of inputting the unlabeled test images into the convolution network, which has been trained, to thereby allow the convolution network to apply the convolution operation to the unlabeled test images and thus to generate the feature maps for testing. Description below makes use of the pyramid feature maps for testing, however, the same processes apply to the feature maps for testing. 
     Thereafter, the auto labeling device  2000  may input the pyramid feature maps for testing into the object detection network  2200 . 
     Then the object detection network  2200  may detect one or more objects for testing in each of the pyramid feature maps for testing and thus generate each of bounding boxes for testing corresponding to each of the objects for testing. 
     Herein, the object detection network  2200  may be one of (1) the platform object detection network corresponding to the auto labeling device  2000  and (2) the third-party object detection network  2300  capable of providing the labeling service. 
     As another example, the object detection network  2200  may be the combination of the platform object detection network and the third-party object detection network  2300 . 
     That is, the auto labeling device  2000  may perform a process of allowing the platform object detection network to generate the platform bounding boxes for testing corresponding to the objects for testing in each of the unlabeled test images and a process of transmitting the unlabeled test images to the third-party object detection network  2300 . Then the third-party object detection network  2300  may perform (1) a process of detecting the objects for testing in each of the unlabeled test images and thus (2) a process of generating each of third-party bounding boxes for testing corresponding to each of the objects for testing. Thereafter, the auto labeling device  2000  may perform (i) a process of selecting adjusted bounding boxes for testing, corresponding to the objects for testing, among a test box group comprised of the platform bounding boxes for testing and the third-party bounding boxes for testing, by using the NMS algorithm, and (ii) a process of setting the adjusted bounding boxes for testing as the bounding boxes for testing. 
     Next, the auto labeling device  2000  may perform a process of allowing the ROI pooling layer  2400  to apply the pooling operation to each of the pyramid feature maps for testing by using the bounding boxes for testing, to thereby generate each of the pooled feature maps for testing. 
     Although the pyramid feature maps for testing are described above as inputted into the object detection network  2200 , however, as another example, the unlabeled test images may be inputted into the object detection network  2200 , to thereby generate the bounding boxes for testing. 
     That is, the auto labeling device  2000  may perform or support another device to perform (i) a process of inputting the unlabeled test images into the object detection network  2200 , to thereby allow the object detection network  2200  to detect the objects for testing in each of the unlabeled test images and thus to generate the bounding boxes for testing corresponding to the objects for testing in each of the unlabeled test images and (ii) a process of inputting the unlabeled test images into the convolution network, to thereby allow the convolution network to apply the convolution operation to each of the unlabeled test images and thus to generate each of the feature maps for testing corresponding to each of the unlabeled test images. Then, the auto labeling device  2000  may perform a process of allowing the ROI pooling layer  2400  to apply the pooling operation to each of the feature maps for testing by using the bounding boxes for testing, to thereby generate each of the pooled feature maps for testing. 
     Next, the auto labeling device  2000  may input the pooled feature maps for testing into the fitness estimation network  2700 . 
     Then, the fitness estimation network  2700  may apply the third fully-connected operation and then the sigmoid operation to the pooled feature maps for testing and thus generate the fitness values for testing which range from 0 to 1. 
     Herein, the fitness values for testing may be created by estimating differences between (1) first box uncertainty scores for testing of the first class scores for testing, corresponding to the unlabeled test images, outputted from the first classifier  2500  and (2) second box uncertainty scores for testing of the second class scores for testing, corresponding to the unlabeled test images, outputted from the second classifier  2600 . 
     And, the auto labeling device  2000  may determine whether the fitness values for testing are equal to or greater than the preset criterion fitness value. 
     Herein, first pooled feature maps for testing, among the pooled feature maps for testing, may be inputted into the first classifier  2500 , where the first pooled feature maps for testing correspond to first fitness values for testing equal to or greater than the preset criterion fitness value among the fitness values for testing, and as described by referring to  FIG. 5 , the first classifier  2500  may generate each of the first class scores for testing and each of the first box uncertainty scores for testing, respectively corresponding to each of the bounding boxes for testing. 
     And, second pooled feature maps for testing, among the pooled feature maps for testing, may be inputted into the second classifier  2600 , where the second pooled feature maps for testing correspond to second fitness values for testing less than the preset criterion fitness value among the fitness values for testing, and as described by referring to  FIG. 5 , the second classifier  2600  may generate each of second class scores for testing and each of the second box uncertainty scores for testing, respectively corresponding to each of the bounding boxes for testing. Herein, the second box uncertainty scores for testing may be adjusted by the scale parameter such that a range of the second box uncertainty scores for testing corresponds to a range of the first box uncertainty scores for testing. 
     Next, the auto labeling device  2000  may perform a process of labeling the bounding boxes for testing corresponding to each of the unlabeled test images and a process of generating first class information for testing corresponding to the first class scores for testing and second class information for testing corresponding to the second class scores for testing, to thereby generate labeled test images. 
     And the auto labeling device  2000  may perform a process of transmitting, to the labeler, specific labeled test images, among the generated labeled test images, including specific bounding boxes for testing, among the bounding boxes for testing, to thereby allow the labeler to verify the specific labeled test images, where each of the specific bounding boxes for testing is selected by referring to (1) a first box uncertainty score for testing, among the first box uncertainty scores for testing, equal to or greater than a preset criterion uncertainty score and (2) a second box uncertainty score for testing, among the second box uncertainty scores for testing, equal to or greater than the preset criterion uncertainty score. 
     Further, the auto labeling device  2000  may perform a process of re-training at least one of the first classifier and the second classifier, using the fifth losses, i.e., the labeling losses, calculated by referring to the specific labeled test images and the verified labeled images where the verified labeled images are verified by the labeler. 
     The present disclosure has an effect of reducing time of inspection by selectively inspecting only images that are difficult to label among images auto-labeled by the auto labeling device. 
     The present disclosure has another effect of increasing a throughput of the labeling for entire images by allowing an unskilled inspector to keep up with a throughput of the auto labeling device via selectively inspecting only the images that are difficult to label among the images automatically labeled by the auto labeling device. 
     The present disclosure has still another effect of reducing a cost by decreasing the number of inspectors via selectively inspecting only the images that are difficult to label among the images automatically labeled by the auto labeling device. 
     The present disclosure has still yet another effect of improving a throughput of the auto labeling, without degrading an accuracy of the auto labeling by selectively inspecting only the images that are difficult to label among the images automatically labeled by the auto labeling device. 
     The embodiments of the present disclosure as explained above can be implemented in a form of executable program command through a variety of computer means recordable to computer readable media. The computer readable media may include solely or in combination, program commands, data files, and data structures. The program commands recorded to the media may be components specially designed for the present disclosure or may be usable to a skilled human in a field of computer software. Computer readable media include magnetic media such as hard disk, floppy disk, and magnetic tape, optical media such as CD-ROM and DVD, magneto-optical media such as floptical disk and hardware devices such as ROM, RAM, and flash memory specially designed to store and carry out program commands. Program commands may include not only a machine language code made by a complier but also a high level code that can be used by an interpreter etc., which is executed by a computer. The aforementioned hardware device can work as more than a software module to perform the action of the present disclosure and they can do the same in the opposite case. 
     As seen above, the present disclosure has been explained by specific matters such as detailed components, limited embodiments, and drawings. They have been provided only to help more general understanding of the present disclosure. It, however, will be understood by those skilled in the art that various changes and modification may be made from the description without departing from the spirit and scope of the disclosure as defined in the following claims. 
     Accordingly, the thought of the present disclosure must not be confined to the explained embodiments, and the following patent claims as well as everything including variations equal or equivalent to the patent claims pertain to the category of the thought of the present disclosure.