Abstract: A method includes imaging a first graybody with a focal plane array (FPA), wherein the first graybody has a first emissivity, and imaging a second graybody having a lower emissivity than the first graybody. The method includes using data captured while imaging the first and second graybodies to perform non-uniformity correction (NUC) of the FPA.

Abstract: A method includes imaging a first graybody with a focal plane array (FPA), wherein the first graybody has a first emissivity, and imaging a second graybody having a lower emissivity than the first graybody. The method includes using data captured while imaging the first and 5 second graybodies to perform non-uniformity correction (NUC) of the FPA.

Abstract: A method includes imaging a first graybody with a focal plane array (FPA), wherein the first graybody has a first emissivity, and imaging a second graybody having a lower emissivity than the first graybody. The method includes using data captured while imaging the first and second graybodies to perform non-uniformity correction (NUC) of the FPA.

Abstract: A method corrects a captured image and includes the steps of determining an effect of atmosphere and a distance from an image capture device which is spaced relatively far from an area of interest. The method utilizes a transmission and reception device to identify the effect on a transmitted and reflected signal due to the atmosphere and distance. An image of the area of interest is captured. The image is corrected based upon the effect of the distance and atmosphere on the transmitted and reflected signal. An apparatus programmed to perform the method is also disclosed. An apparatus for capturing an image from a distance is also disclosed.

Abstract: A method for generating look-up tables for a high speed multi-bit Real-time Deterministic Finite state Automaton (hereinafter RDFA). The method begins with a DFA generated in accordance with the prior art. For each state in the DFA, and for each of the bytes recognized in parallel the following occurs. First an n-closure list is generated. An n-closure list is a list of states reachable in n-transitions from the current state. Next an alphabet transition list is generated for each state. An “alphabet transition list” is a list of the transitions out of a particular state for each of the characters in an alphabet. Finally, the transitions are grouped into classes. That is, the transitions that go to the same state are grouped into the same class. Each class is used to identify the next state. The result is a state machine that has less states than the original DFA.

Abstract: A system and method in accordance with the present invention determines in real-time the portions of a set of characters from a data or character stream which satisfies one or more predetermined regular expressions. A Real-time Deterministic Finite state Automaton (RDFA) ensures that the set of characters is processed at high speeds with relatively small memory requirements. An optimized state machine models the regular expression(s) and state related alphabet lookup and next state tables are generated. Characters from the data stream are processed in parallel using the alphabet lookup and next state tables, to determine whether to transition to a next state or a terminal state, until the regular expression is satisfied or processing is terminated. Additional means may be implemented to determine a next action from satisfaction of the regular expression.

Abstract: Data that spans multiple packets is processes. A finite state machine is used to process the data in each packet and the “state” of a finite state machine is saved after processing a packet. The saved state is stored with information that identifies the particular data stream from which the packet originated. This means that a state machine engine (hardware implementation of the finite state machine) is not tied to a particular data stream. The present invention makes it possible to utilize state machine co-processors very efficiently in a multiple engine/multiple data stream system.

Abstract: A method for generating look-up tables for a high speed multi-bit Real-time Deterministic Finite state Automaton (hereinafter RDFA). The method begins with a DFA generated in accordance with the prior art. For each state in the DFA, and for each of the bytes recognized in parallel the following occurs. First an n-closure list is generated. An n-closure list is a list of states reachable in n-transitions from the current state. Next an alphabet transition list is generated for each state. An “alphabet transition list” is a list of the transitions out of a particular state for each of the characters in an alphabet. Finally, the transitions are grouped into classes. That is, the transitions that go to the same state are grouped into the same class. Each class is used to identify the next state. The result is a state machine that has less states than the original DFA.

Abstract: A system and method in accordance with the present invention determines in real-time the portions of a set of characters from a data or character stream which satisfies one or more predetermined regular expressions. A Real-time Deterministic Einite state Automaton (RDFA) ensures that the set of characters is processed at high speeds with relatively small memory requirements. An optimized state machine models the regular expression(s) and state related alphabet lookup and next state tables are generated. Characters from the data stream are processed in parallel using the alphabet lookup and next state tables, to determine whether to transition to a next state or a terminal state, until the regular expression is satisfied or processing is terminated. Additional means may be implemented to determine a next action from satisfaction of the regular expression.