de.unihalle.informatik.MiToBo.tracking.multitarget.datatypes.impl
Class ObservationAdjacency

java.lang.Object
  extended by de.unihalle.informatik.MiToBo.tracking.multitarget.datatypes.abstracts.MatchingAdjacencyMatrix
      extended by de.unihalle.informatik.MiToBo.tracking.multitarget.datatypes.impl.ObservationAdjacency
All Implemented Interfaces:
AdjacencyMatrix<PartitGraphNodeID>

@ALDMetaInfo(export=ALLOWED)
public class ObservationAdjacency
extends MatchingAdjacencyMatrix

An adjacency matrix for observations in a time series used for greedyGourmet-partitioning. Observation of one time point form a partition. Edges are undirected.

Author:
Oliver Gress

Field Summary
protected  int totalObservations
          total number of observations over all frames
protected  int[] votesClutter
           
protected  int[] votesTarget
           
protected  double[][] Zadj
          adjacency votes matrix: which observations are associated (same track) and how many particles vote for these associations
 
Constructor Summary
ObservationAdjacency(ObservationAdjacency oa)
           
ObservationAdjacency(Vector<MultiState<MotionModelID>> observations, DataAssociationExclusive[][] associations)
          Deprecated. 
ObservationAdjacency(Vector<MultiState<MotionModelID>> observations, RBMCDASampleInfo<MotionModelID>[] sampleinfos)
          Constructor that initializes the adjacency matrix with the given observations and sets edge weights according to the information from RBMCDA-samples
 
Method Summary
 double getMaxWeight()
           
 double getMinWeight()
           
 PartitGraphNodeID[] getNodes()
          Get graph nodes
 double getVotesAdjacency(int t1, int m1, int t2, int m2)
           
 int getVotesClutter(int t, int m)
           
 int getVotesTarget(int t, int m)
           
 double getWeight(PartitGraphNodeID nodeSrc, PartitGraphNodeID nodeTgt)
          Get weight of edge from nodeSrc to nodeTgt.
 boolean isDirected()
          Returns true if graph has directed edges, false if undirected
 int numOfNodes()
          Get number of graph nodes
 void setVotesAdjacency(int t1, int m1, int t2, int m2, double value)
           
 void setVotesClutter(int t, int m, int value)
           
 void setVotesTarget(int t, int m, int value)
           
 void setWeight(PartitGraphNodeID nodeSrc, PartitGraphNodeID nodeTgt, double weight)
          Set weight of edge from nodeSrc to nodeTgt.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

Zadj

protected double[][] Zadj
adjacency votes matrix: which observations are associated (same track) and how many particles vote for these associations


votesClutter

protected int[] votesClutter

votesTarget

protected int[] votesTarget

totalObservations

protected int totalObservations
total number of observations over all frames

Constructor Detail

ObservationAdjacency

public ObservationAdjacency(Vector<MultiState<MotionModelID>> observations,
                            RBMCDASampleInfo<MotionModelID>[] sampleinfos)
Constructor that initializes the adjacency matrix with the given observations and sets edge weights according to the information from RBMCDA-samples

Parameters:
observations - vector of observations. Each entry in the vector corresponds to a time point.
sampleinfos - information from RBMCDA-samples

ObservationAdjacency

@Deprecated
public ObservationAdjacency(Vector<MultiState<MotionModelID>> observations,
                                       DataAssociationExclusive[][] associations)
Deprecated. 


ObservationAdjacency

public ObservationAdjacency(ObservationAdjacency oa)
Method Detail

getVotesClutter

public int getVotesClutter(int t,
                           int m)

getVotesTarget

public int getVotesTarget(int t,
                          int m)

setVotesClutter

public void setVotesClutter(int t,
                            int m,
                            int value)

setVotesTarget

public void setVotesTarget(int t,
                           int m,
                           int value)

getVotesAdjacency

public double getVotesAdjacency(int t1,
                                int m1,
                                int t2,
                                int m2)

setVotesAdjacency

public void setVotesAdjacency(int t1,
                              int m1,
                              int t2,
                              int m2,
                              double value)

numOfNodes

public int numOfNodes()
Description copied from interface: AdjacencyMatrix
Get number of graph nodes


getWeight

public double getWeight(PartitGraphNodeID nodeSrc,
                        PartitGraphNodeID nodeTgt)
Description copied from interface: AdjacencyMatrix
Get weight of edge from nodeSrc to nodeTgt.


setWeight

public void setWeight(PartitGraphNodeID nodeSrc,
                      PartitGraphNodeID nodeTgt,
                      double weight)
Description copied from interface: AdjacencyMatrix
Set weight of edge from nodeSrc to nodeTgt.


getNodes

public PartitGraphNodeID[] getNodes()
Description copied from interface: AdjacencyMatrix
Get graph nodes


isDirected

public boolean isDirected()
Description copied from interface: AdjacencyMatrix
Returns true if graph has directed edges, false if undirected


getMaxWeight

public double getMaxWeight()

getMinWeight

public double getMinWeight()


Copyright © 2010–2015 Martin Luther University Halle-Wittenberg. All rights reserved.