Patent ID: 8433661

Claim:
A method for adapting and optimizing information processing of a computer vision system using accumulated knowledge about a perceivable world as sensed by vision sensors, its objects and its properties, a current vision task, a sensory context, and a perception apparatus, said method comprising the steps of: storing for each object a number of object properties and routines, wherein visual routines are bound to object properties, the object properties representing nodes, establishing link connections between nodes expressing dependencies between the nodes, storing for each node a node information, said node information comprising estimated values gained from sensory measurements of the object properties corresponding to each node; storing for each node a node state, indicating whether information stored for the node requires an update, generating a subtask structure for each node as a subgraph, comprising the node and its direct dependent nodes and routines, the nodes and routines in the subgraph are required to be accessed or executed to update information stored for the node, in case an update of a node information is required at an initial node, at run-time the method dynamically determines the nodes required to update the node information by recursively traversing link connections for nodes of the subgraphs for each node starting with the initial node, during traversal, builds a graph structure from the subgraphs of traversed nodes in case the information stored for a traversed node also requires an update, in case the information stored for the traversed node does not require an update, only the traversed node is included into the graph, detects circular dependencies in the built graph and resolves circular dependencies in the built graph structure, by removing links of a specific type, generating an information flow from the built graph with resolved dependencies comprising the nodes which need to be accessed to node information, or the routines bound to the nodes which need to be executed to determine updated node information, the information flow represents the steps that need to be performed to update the node information at the initial node, wherein the dependencies in the graph establish an execution order of the nodes and routines, executes the task represented by the built graph to obtain the updated node information for the initial node.