Graph-based cognitive swarms for object group recognition in a 3N or greater-dimensional solution space
First Claim
1. A graph-based object group recognition system incorporating swarming domain classifiers, the system comprising:
- A processor having a plurality of software agents configured to operate as a cooperative swarm to classify an object group in a domain, where each agent'"'"'s position in a multi-dimensional solution space represents a graph having N-nodes, where each node N represents an object in the group having K object attributes, where K>
=3, and where each agent is assigned an initial velocity vector to explore a KN-dimensional solution space for solutions matching the agent'"'"'s graph such that each agent has positional coordinates as it explores the KN-dimensional solution space, where each agent is configured to perform at least one iteration, the iteration being a search in the solution space for an optimum solution where each agent keeps track of its coordinates in the KN-dimensional solution space that are associated with an observed best solution (pbest) that the agent has identified, and a global best solution (gbest) where the gbest is used to store the best solution among all agents which corresponds to a best graph among all agents, with each velocity vector thereafter changing towards pbest and gbest, allowing the cooperative swarm to concentrate on the vicinity of the object group and classify the object group when a classification level exceeds a preset threshold.
2 Assignments
0 Petitions
Accused Products
Abstract
An object recognition system is described that incorporates swarming classifiers. The swarming classifiers comprise a plurality of software agents configured to operate as a cooperative swarm to classify an object group in a domain. Each node N represents an object in the group having K object attributes. Each agent is assigned an initial velocity vector to explore a KN-dimensional solution space for solutions matching the agent'"'"'s graph. Further, each agent is configured to search the solution space for an optimum solution. The agents keep track of their coordinates in the KN-dimensional solution space that are associated with an observed best solution (pbest) and a global best solution (gbest). The gbest is used to store the best solution among all agents which corresponds to a best graph among all agents. Each velocity vector thereafter changes towards pbest and gbest, allowing the cooperative swarm to classify of the object group.
20 Citations
36 Claims
-
1. A graph-based object group recognition system incorporating swarming domain classifiers, the system comprising:
A processor having a plurality of software agents configured to operate as a cooperative swarm to classify an object group in a domain, where each agent'"'"'s position in a multi-dimensional solution space represents a graph having N-nodes, where each node N represents an object in the group having K object attributes, where K>
=3, and where each agent is assigned an initial velocity vector to explore a KN-dimensional solution space for solutions matching the agent'"'"'s graph such that each agent has positional coordinates as it explores the KN-dimensional solution space, where each agent is configured to perform at least one iteration, the iteration being a search in the solution space for an optimum solution where each agent keeps track of its coordinates in the KN-dimensional solution space that are associated with an observed best solution (pbest) that the agent has identified, and a global best solution (gbest) where the gbest is used to store the best solution among all agents which corresponds to a best graph among all agents, with each velocity vector thereafter changing towards pbest and gbest, allowing the cooperative swarm to concentrate on the vicinity of the object group and classify the object group when a classification level exceeds a preset threshold.- View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
-
13. A method for graph-based object group recognition incorporating swarming domain classifiers, the method comprising an act of:
Configuring a plurality of software agents to be initialized by a processor such that when initialized, the software agents cooperate as a cooperative swarm to classify an object group in a domain, where each agent'"'"'s position in a multi-dimensional solution space represents a graph having N-nodes, where each node N represents an object in the group having K object attributes, where K>
=3, and where each agent is assigned an initial velocity vector to explore a KN-dimensional solution space for solutions matching the agent'"'"'s graph such that each agent has positional coordinates as it explores the KN-dimensional solution space, where each agent is configured to perform at least one iteration, the iteration being a search in the solution space for an optimum solution where each agent keeps track of its coordinates in the KN-dimensional solution space that are associated with an observed best solution (pbest) that the agent has identified, and a global best solution (gbest) where the gbest is used to store the best solution among all agents which corresponds to a best graph among all agents, with each velocity vector thereafter changing towards pbest and gbest, allowing the cooperative swarm to concentrate on the vicinity of the object group and classify the object group when a classification level exceeds a preset threshold.- View Dependent Claims (14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24)
-
25. A computer program product for graph-based object recognition, the computer program product comprising computer-readable instruction means stored computer-readable medium that are executable by a computer for causing the computer to:
Initialize a plurality of software agents to cooperate as a cooperative swarm to classify an object group in a domain, where each agent'"'"'s position in a multi-dimensional solution space represents a graph having N-nodes, where each node N represents an object in the group having K object attributes, where K>
=3, and where each agent is assigned an initial velocity vector to explore a KN-dimensional solution space for solutions matching the agent'"'"'s graph such that each agent has positional coordinates as it explores the KN-dimensional solution space, where each agent is configured to perform at least one iteration, the iteration being a search in the solution space for an optimum solution where each agent keeps track of its coordinates in the KN-dimensional solution space that are associated with an observed best solution (pbest) that the agent has identified, and a global best solution (gbest) where the gbest is used to store the best solution among all agents which corresponds to a best graph among all agents, with each velocity vector thereafter changing towards pbest and gbest, allowing the cooperative swarm to concentrate on the vicinity of the object group and classify the object group when a classification level exceeds a preset threshold.- View Dependent Claims (26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36)
Specification