Package | Description |
---|---|
de.unihalle.informatik.MiToBo.tracking.multitarget.algo | |
de.unihalle.informatik.MiToBo.tracking.multitarget.datatypes.impl |
Modifier and Type | Field and Description |
---|---|
(package private) HashMap<Integer,Vector<MTBGraphNode<PartitGraphNodeID>>> |
GreedyGourmetPartitioning.partitions |
Modifier and Type | Method and Description |
---|---|
private MTBGraphNode<PartitGraphNodeID> |
GreedyGourmetPartitioning.getGraphNode(int subgraphID,
int partitionID)
Get the graph node from partition 'partitionID' in subgraph 'subgraphID'.
|
private MTBGraphNode<PartitGraphNodeID> |
GreedyGourmetPartitioning.getOptimalNeighbor(MTBGraphNode<PartitGraphNodeID> currentNode,
int partitionID)
Get node of partition 'partitionID' which is connected to current node and has optimal weight
|
Modifier and Type | Method and Description |
---|---|
private int |
GreedyGourmetPartitioning.numOfConnectedNodes(PartitGraphNodeID currentNode,
int partitionID)
Get number of nodes from partition 'partitionID' connected to current node
|
Modifier and Type | Method and Description |
---|---|
private boolean |
GreedyGourmetPartitioning.connectNodesCase1(MTBGraphNode<PartitGraphNodeID> n1,
MTBGraphNode<PartitGraphNodeID> n2,
MTBGraphNode<PartitGraphNodeID> nstar1,
MTBGraphNode<PartitGraphNodeID> nstar2,
boolean do_connect)
Connect nodes if case 1
|
private boolean |
GreedyGourmetPartitioning.connectNodesCase1(MTBGraphNode<PartitGraphNodeID> n1,
MTBGraphNode<PartitGraphNodeID> n2,
MTBGraphNode<PartitGraphNodeID> nstar1,
MTBGraphNode<PartitGraphNodeID> nstar2,
boolean do_connect)
Connect nodes if case 1
|
private boolean |
GreedyGourmetPartitioning.connectNodesCase1(MTBGraphNode<PartitGraphNodeID> n1,
MTBGraphNode<PartitGraphNodeID> n2,
MTBGraphNode<PartitGraphNodeID> nstar1,
MTBGraphNode<PartitGraphNodeID> nstar2,
boolean do_connect)
Connect nodes if case 1
|
private boolean |
GreedyGourmetPartitioning.connectNodesCase1(MTBGraphNode<PartitGraphNodeID> n1,
MTBGraphNode<PartitGraphNodeID> n2,
MTBGraphNode<PartitGraphNodeID> nstar1,
MTBGraphNode<PartitGraphNodeID> nstar2,
boolean do_connect)
Connect nodes if case 1
|
private MTBGraphNode<PartitGraphNodeID> |
GreedyGourmetPartitioning.getOptimalNeighbor(MTBGraphNode<PartitGraphNodeID> currentNode,
int partitionID)
Get node of partition 'partitionID' which is connected to current node and has optimal weight
|
Modifier and Type | Field and Description |
---|---|
private PartitGraphNodeID[] |
ObservationAdjacency.nodes |
Modifier and Type | Field and Description |
---|---|
private HashMap<Short,SortedSet<PartitGraphNodeID>> |
RBMCDASampleInfo.tracks
HashMap of the tracks represented by the sample.
|
Modifier and Type | Method and Description |
---|---|
PartitGraphNodeID[] |
ObservationAdjacency.getNodes() |
Modifier and Type | Method and Description |
---|---|
SortedSet<PartitGraphNodeID> |
RBMCDASampleInfo.getTrack(short targetID)
Get track of target given by
targetID up to current time, where targetID may be 0 to obtain the clutter observations (which do not form a
track). |
Modifier and Type | Method and Description |
---|---|
double |
ObservationAdjacency.getWeight(PartitGraphNodeID nodeSrc,
PartitGraphNodeID nodeTgt) |
void |
ObservationAdjacency.setWeight(PartitGraphNodeID nodeSrc,
PartitGraphNodeID nodeTgt,
double weight) |
Copyright © 2010–2020 Martin Luther University Halle-Wittenberg, Institute of Computer Science, Pattern Recognition and Bioinformatics. All rights reserved.