US 12,032,909 B2
Perceptual associative memory for a neuro-linguistic behavior recognition system
Ming-Jung Seow, The Woodlands, TX (US); Gang Xu, Katy, TX (US); Tao Yang, Katy, TX (US); and Wesley Kenneth Cobb, The Woodlands, TX (US)
Assigned to Intellective Ai, Inc., Dallas, TX (US)
Filed by Intellective Ai, Inc., Dallas, TX (US)
Filed on Sep. 20, 2021, as Appl. No. 17/479,331.
Application 17/479,331 is a continuation of application No. 16/522,915, filed on Jul. 26, 2019, abandoned.
Application 16/522,915 is a continuation of application No. 14/569,161, filed on Dec. 12, 2014, granted, now 10,409,910, issued on Sep. 10, 2019.
Prior Publication US 2022/0075946 A1, Mar. 10, 2022
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 40/30 (2020.01); G06F 40/242 (2020.01); G06F 40/284 (2020.01); G06F 40/40 (2020.01); G06N 20/00 (2019.01)
CPC G06F 40/284 (2020.01) [G06F 40/242 (2020.01); G06F 40/40 (2020.01)] 20 Claims
OG exemplary drawing
 
1. A method, comprising:
receiving a plurality of video frames from a video source, the plurality of video frames including a representation of an object;
normalizing, via at least one processor, data in each video frame from the plurality of video frames to obtain normalized data for the plurality of video frames;
generating, via the at least one processor and based on the normalized data, a syntax for a neuro-linguistic model, the syntax including a stable model of phrases, the generating the syntax including generating a connected graph having a plurality of nodes, each node from the plurality of nodes representing one machine-readable word from a plurality of machine-readable words having an associated predefined maximum symbol combination length;
identifying, via the at least one processor, instances of at least one machine-readable phrase from the stable model of phrases and based on the connected graph and a phrase length limit;
calculating, via the at least one processor, an unusualness score for an observation of a first machine-readable phrase from the at least one machine-readable phrase identified in the connected graph; and
publishing, via the at least one processor, an alert associated with the observation of the first machine-readable phrase, the alert indicating an anomaly in the behavior of the object.