Representation of EARS C-family algorithms

Title::: Representation of EARS C-family algorithms
Date::: 2008/06/06 17:58
Filename::: model_of_ears_c_fam_algs.jpg
Caption::: a) The task structure of C-family algorithms is based on the general task structure of temporal aberrancy detection algorithms (see Fig. 2). A single eligible method is selected for each task. Omitted tasks are grayed out. b) The five tasks constituting C-family algorithms are connected to each other so that the outputs from one task are used as inputs by other task(s). Note that the current date is not produced by any task and must be specified externally; in our case it is provided by a containing iteration structure (not shown here), which increments the date at each step of algorithm execution. The alarm value is not consumed by any other task – this is a final result of the detection algorithm for a single day. Individual alarm values are aggregated into a vector by the iteration structure.
Format::: JPEG
Size::: 75KB
Width::: 972
Height::: 548