METHOD FOR CLUSTERING MULTI-MODAL DATA THAT CONTAIN HARD AND SOFT CROSS-MODE CONSTRAINTS
First Claim
1. A program product for clustering multi-modal data including hard and soft cross-mode constraints, the program-product comprising a non-transitory processor-readable medium on which program instructions are embodied, wherein the program instructions are operable, when executed by at least one processor, to:
- color nodes in a graph having a plurality of objective edges and a plurality of constraint edges, wherein at least two colors are used to color the nodes, and wherein the plurality of constraint edges connects a respective plurality of node pairs, the two nodes in the node pairs being different colors;
partition the nodes by color, wherein the partitioned nodes of the same color are independent of constraint edges;
map the partitions back to the graph to form a color-partitioned graph having at least two sub-domains; and
cross-associate all data that are part of a cluster.
1 Assignment
0 Petitions
Accused Products
Abstract
A program product for clustering multi-modal data including hard and soft cross-mode constraints is provided. The program-product includes a non-transitory processor-readable medium on which program instructions are embodied. The program instructions are operable, when executed by at least one processor, to: color nodes in a graph having a plurality of objective edges and a plurality of constraint edges; partition the nodes by color; map the partitions back to the graph to form a color-partitioned graph having at least two sub-domains; and cross-associate all data that are part of a cluster. At least two colors are used to color the nodes. The plurality of constraint edges connects a respective plurality of node pairs, the two nodes in the node pairs being different colors. The partitioned nodes of the same color are independent of constraint edges.
30 Citations
20 Claims
-
1. A program product for clustering multi-modal data including hard and soft cross-mode constraints, the program-product comprising a non-transitory processor-readable medium on which program instructions are embodied, wherein the program instructions are operable, when executed by at least one processor, to:
-
color nodes in a graph having a plurality of objective edges and a plurality of constraint edges, wherein at least two colors are used to color the nodes, and wherein the plurality of constraint edges connects a respective plurality of node pairs, the two nodes in the node pairs being different colors; partition the nodes by color, wherein the partitioned nodes of the same color are independent of constraint edges; map the partitions back to the graph to form a color-partitioned graph having at least two sub-domains; and cross-associate all data that are part of a cluster. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A method to extend the lifespan of a track of a moving object to overcome spatial non-locality and temporal non-locality by:
-
obtaining quantified similarity data based on data received from a plurality of cameras; transforming the quantified similarity data to form a graph having a plurality of objective edges and a plurality of constraint edges; coloring nodes in the graph, wherein at least two colors are used to color the nodes, and wherein the plurality of constraint edges connect a respective plurality of node pairs, the two nodes in the node pairs being different colors; partitioning the nodes by color, wherein the partitioned nodes of the same color are independent of the plurality of constraint edges; and mapping the partitions back to the graph to form a color-partitioned graph having at least two sub-domains. - View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18, 19)
-
-
20. A program product for clustering multi-modal data including hard and soft cross-mode constraints, the program-product comprising a non-transitory processor-readable medium on which program instructions are embodied, wherein the program instructions are operable, when executed by at least one processor, to:
-
color nodes in a graph formed from quantified similarity data based on data received from a plurality of cameras, the colored nodes being connected by a plurality of objective edges and a plurality of constraint edges, wherein at least two colors are used to color the nodes, wherein the plurality of constraint edges connect a respective plurality of node pairs, and wherein the two nodes in the node pairs are different colors; determine if at least one pair of nodes in the graph is connected by at least one objective edge and at least one constraint edge; remove the at least one objective edge connecting the pair of nodes determined to be connected by at least one objective edge and at least one constraint edge; compute all disconnected sub-domains within the graph based on the objective edges; for the computed sub-domains, construct a graph from a subset of the nodes, wherein the subset of nodes includes nodes that only have constraint edges and that have no objective edges, wherein the constructed graph forms a constraint-edge graph; compute a coloring of the graph to form an initial partitioning of the sub-domain; map the initial partitionings together to form a color-partitioned graph in which edge-cuts of the objective edges are minimized; and minimize a function of the objective-edge weights cut by the sub-domains.
-
Specification