Developer Documentation
Centre for Vision, Speech & Signal Processing
USER IN NAMESPACE AMMA TREE ROOT AMMA SEARCH AMMA HOME
 

  PUBLIC
DataBunchC::DataBunchC(const DListC &,RealT (*)(FuncArgList),IntT,RealT,RealT)
DataBunchC::Closest(const VectorC &)
DataBunchC::NClosest(const VectorC &,int)
DataBunchC::Initialise(void)
DataBunchC::DataBunchC(const DataBunchC &)
DataBunchC::operator=(const DataBunchC &)
DataBunchC<class LabelT>
 
This is a mixture of BIG and SMALL objects, therefore do not use it as a BIG object.
 
include "amma/DataBunch.hh"
User Level:Default
Library:dataBunch
Example: doNumClassComb.cc
Section: Statistics.Histograms
In Scope:std

Typedefs:

typedef Tuple2C<VectorC,LabelT> DataC;
This class expects the data points to come in this form.

Variables:
DListC data;
not sure this is neccesary. Specially not if the Initialise code is called in the constructor...

BinListC bins;
VectorC is the Table index Index2dC is the discrete index of the bin table. Each bin is a list of DataC objects.

RealT noBins;

IntT dim;

RealT maxSearchDistance;

NumReducePCAC reducer;

Methods:
DataBunchC(const DListC<DataC> & data,RealT (*)(FuncArgList) DistanceEvalF,IntT indDim,RealT noBins = 5,RealT nMaxSearchDistance = -1)
Constructor

DataC Closest(const VectorC & point)
Find the closest couple (Vector, Label) to a given point

DListC<DataC> NClosest(const VectorC & point,int N)
Find the N closest couple (Vector, Label) to a given point

void Initialise()
Fills the bin table with the data provided by the user.

DataBunchC(const DataBunchC & oth)
Not allowed to copy until I implement it!

DataBunchC & operator=(const DataBunchC & oth)
Not allowed to copy until I implement it!


Programmer:Luis Molina Tanco, Documentation by CxxDoc: Tue Mar 20 10:49:27 2001