_VlAIB Struct Reference

AIB algorithm data. More...


Data Fields

vl_aib_nodenodes
vl_aib_node nentries
vl_doublebeta
vl_aib_nodebidx
vl_aib_nodewhich
vl_aib_node nwhich
vl_aib_probPcx
vl_aib_probPx
vl_aib_probPc
vl_uint nvalues
vl_uint nlabels


Detailed Description

For internal use only.

The implementation is quite straightforward, but the way feature values are handled in order to support efficiently joins, deletions and re-arrangement needs to be explaiend. This is achieved by a layer of indrirection:


Field Documentation

vl_aib_node* _VlAIB::nodes

Entires to nodes

vl_aib_node _VlAIB::nentries

Total number of entries (= # active nodes)

vl_double* _VlAIB::beta

Minimum distance to an entry

vl_aib_node* _VlAIB::bidx

Closest entry

vl_aib_node* _VlAIB::which

List of entries to update

vl_aib_node _VlAIB::nwhich

Number of entries to update

vl_aib_prob* _VlAIB::Pcx

Joint probability table

vl_aib_prob* _VlAIB::Px

Marginal.

vl_aib_prob* _VlAIB::Pc

Marginal.

vl_uint _VlAIB::nvalues

Number of feature values

vl_uint _VlAIB::nlabels

Number of labels


The documentation for this struct was generated from the following file:
Generated on Mon Jan 21 17:43:33 2008 for vlfeat by  doxygen 1.5.4