Patent ID: 11948373
Assignee: VERKADA INC.
Field: Computer technology (Electrical engineering)
Classification: CPC G | IPC G

Claim 5:
6. A system comprising:
at least one hardware processor; and
at least one non-transitory memory storing instructions, which, when executed by the at least one hardware processor, cause the system to:
analyze a plurality of frames of a video of an object to detect an alphanumeric identifier associated with the object;
upon detecting the alphanumeric identifier associated with the object in a frame of the plurality of frames, determine a subset of frames containing the alphanumeric identifier by analyzing neighboring frames associated with the frame to detect the alphanumeric identifier
determine a plurality of characters by:
based on a location of the character in the plurality of characters, determining corresponding characters in each frame in the subset of frames;
determine, to be a part of the plurality of characters, a most frequent character occurring among the character and the corresponding characters;

obtain a plurality of bounding boxes indicating locations of the plurality of characters, the locations represented by Cartesian coordinates;
obtain a plurality of nodes based on the plurality of bounding boxes, wherein a respective location of each respective node indicates a respective location of a respective box in the plurality of bounding boxes;
determine a distance based on a first location of a first node of the plurality of nodes and a second location of a second node of the plurality of nodes;
determine whether the distance is below a threshold, wherein the threshold is computed based on a length of a long side of a box of the plurality of bounding boxes;
based on a determination that the distance is below the threshold, create a first edge between the first and second nodes, thereby obtaining a first graph including the first node, the second node, and the first edge;
determine a leftmost node in the first graph based on first Cartesian coordinates representing the first location and second Cartesian coordinates representing the second location; and
order the plurality of characters into a sequence of characters based on the first graph and the leftmost node in the first graph.