CPC G06F 16/583 (2019.01) [G06F 16/51 (2019.01); G06F 16/58 (2019.01); G06F 16/5838 (2019.01); G06F 18/214 (2023.01); G06V 10/764 (2022.01); G06V 10/7625 (2022.01); G06V 10/77 (2022.01); G06V 10/7715 (2022.01); G06V 20/30 (2022.01); G06V 40/1306 (2022.01); G06V 40/165 (2022.01); G06V 40/172 (2022.01)] | 20 Claims |
1. A method comprising:
generating a query feature vector based at least in part on a query image;
determining a set of distances that comprises a respective distance between the query feature vector and each respective candidate feature vector of a set of candidate feature vectors;
generating a decision tree vector that comprises a selected subset of the determined set of distances;
inputting the decision tree vector to a trained decision tree to obtain a probability value; and
determining, in response to the probability value satisfying a threshold value, that an entity associated with the query image is a same entity that is associated with the respective candidate feature vector that produced a shortest distance of the selected subset of the determined set of distances included in the decision tree vector.
|