Hierarchical Integer K-Means Clustering - Declaration. More...

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include "hikmeans.h"

Include dependency graph for hikmeans.c:

Functions
vl_uint8 *	vl_hikm_copy_subset (vl_uint8 const data, vl_uint32 ids, vl_size N, vl_size M, vl_uint32 id, vl_size *N2)
void	vl_hikm_delete (VlHIKMTree *f)
	Delete HIKM tree.
vl_size	vl_hikm_get_depth (VlHIKMTree const *f)
	Get depth.
vl_size	vl_hikm_get_K (VlHIKMTree const *f)
	Get K.
vl_size	vl_hikm_get_max_niters (VlHIKMTree const *f)
	Get maximum number of iterations.
vl_size	vl_hikm_get_ndims (VlHIKMTree const *f)
	Get data dimensionality.
VlHIKMNode const *	vl_hikm_get_root (VlHIKMTree const *f)
	Get maximum number of iterations.
int	vl_hikm_get_verbosity (VlHIKMTree const *f)
	Get verbosity level.
void	vl_hikm_init (VlHIKMTree *f, vl_size M, vl_size K, vl_size depth)
	Initialize HIKM tree.
VlHIKMTree *	vl_hikm_new (int method)
	New HIKM tree.
void	vl_hikm_push (VlHIKMTree f, vl_uint32 asgn, vl_uint8 const *data, vl_size N)
	Project data down HIKM tree.
void	vl_hikm_set_max_niters (VlHIKMTree *f, int max_niters)
	Set maximum number of iterations.
void	vl_hikm_set_verbosity (VlHIKMTree *f, int verb)
	Set verbosity level.
void	vl_hikm_train (VlHIKMTree f, vl_uint8 const data, vl_size N)
	Train HIKM tree.
static void	xdelete (VlHIKMNode *node)
static VlHIKMNode *	xmeans (VlHIKMTree tree, vl_uint8 const data, vl_size N, vl_size K, vl_size height)
	Compute HIKM clustering.

Detailed Description

Hierarchical Integer K-Means Clustering - Declaration.

Author:: Brian Fulkerson; Andrea Vedaldi

Definition in file hikmeans.c.

Function Documentation

vl_uint8* vl_hikm_copy_subset	(	vl_uint8 const *	data,
		vl_uint32 *	ids,
		vl_size	N,
		vl_size	M,
		vl_uint32	id,
		vl_size *	N2
	)

------------------------------------------------------------------

Definition at line 56 of file hikmeans.c.

void vl_hikm_delete ( VlHIKMTree * f )

Delete HIKM tree.

------------------------------------------------------------------

Parameters:

f	HIKM tree.

Definition at line 197 of file hikmeans.c.

vl_size vl_hikm_get_depth ( VlHIKMTree const * f )

Get depth.

Parameters:

f	HIKM tree.

Returns:: depth.

Definition at line 312 of file hikmeans.c.

vl_size vl_hikm_get_K ( VlHIKMTree const * f )

Get K.

Parameters:

f	HIKM tree.

Returns:: K.

Definition at line 301 of file hikmeans.c.

vl_size vl_hikm_get_max_niters ( VlHIKMTree const * f )

Get maximum number of iterations.

Parameters:

f	HIKM tree.

Returns:: maximum number of iterations.

Definition at line 335 of file hikmeans.c.

vl_size vl_hikm_get_ndims ( VlHIKMTree const * f )

Get data dimensionality.

Parameters:

f	HIKM tree.

Returns:: data dimensionality.

Definition at line 290 of file hikmeans.c.

VlHIKMNode const* vl_hikm_get_root ( VlHIKMTree const * f )

Get maximum number of iterations.

Parameters:

f	HIKM tree.

Returns:: maximum number of iterations.

Definition at line 346 of file hikmeans.c.

int vl_hikm_get_verbosity ( VlHIKMTree const * f )

Get verbosity level.

Parameters:

f	HIKM tree.

Returns:: verbosity level.

Definition at line 324 of file hikmeans.c.

void vl_hikm_init	(	VlHIKMTree *	f,
		vl_size	M,
		vl_size	K,
		vl_size	depth
	)

Initialize HIKM tree.

------------------------------------------------------------------

Parameters:

f	HIKM tree.
M	Data dimensionality.
K	Number of clusters per node.
depth	Tree depth.

Returns:: a new HIKM tree representing the clustering.

Remarks:: depth cannot be smaller than 1.

Definition at line 217 of file hikmeans.c.

VlHIKMTree* vl_hikm_new ( int method )

New HIKM tree.

------------------------------------------------------------------

Parameters:

method clustering method.

Returns:: new HIKM tree.

Definition at line 183 of file hikmeans.c.

void vl_hikm_push	(	VlHIKMTree *	f,
		vl_uint32 *	asgn,
		vl_uint8 const *	data,
		vl_size	N
	)

Project data down HIKM tree.

------------------------------------------------------------------

Parameters:

f	HIKM tree.
asgn	Path down the tree (out).
data	Data to project.
N	Number of data.

The function writes to asgn the path of the data data down the HIKM tree f. The parameter asgn must point to an array of M by N elements, where M is the depth of the HIKM tree and N is the number of data point to process.

Definition at line 257 of file hikmeans.c.

void vl_hikm_set_max_niters	(	VlHIKMTree *	f,
		int	max_niters
	)

Set maximum number of iterations.

Parameters:

f	HIKM tree.
max_niters	maximum number of iterations.

Definition at line 368 of file hikmeans.c.

void vl_hikm_set_verbosity	(	VlHIKMTree *	f,
		int	verb
	)

Set verbosity level.

Parameters:

f	HIKM tree.
verb	verbosity level.

Definition at line 357 of file hikmeans.c.

void vl_hikm_train	(	VlHIKMTree *	f,
		vl_uint8 const *	data,
		vl_size	N
	)

Train HIKM tree.

------------------------------------------------------------------

Parameters:

f	HIKM tree.
data	Data to cluster.
N	Number of data.

Definition at line 238 of file hikmeans.c.

static void xdelete ( VlHIKMNode * node ) [static]

------------------------------------------------------------------

Definition at line 160 of file hikmeans.c.

static VlHIKMNode* xmeans	(	VlHIKMTree *	tree,
		vl_uint8 const *	data,
		vl_size	N,
		vl_size	K,
		vl_size	height
	)		`[static]`

Compute HIKM clustering.

------------------------------------------------------------------

Parameters:

tree	HIKM tree to initialize.
data	Data to cluster.
N	Number of data points.
K	Number of clusters for this node.
height	Tree height.

Remarks:: height cannot be smaller than 1.

Returns:: a new HIKM node representing a sub-clustering.

Definition at line 104 of file hikmeans.c.

Functions

Detailed Description

Function Documentation