hikmeans.h
Go to the documentation of this file.
00001 
00006 /*
00007 Copyright (C) 2007-12 Andrea Vedaldi and Brian Fulkerson.
00008 All rights reserved.
00009 
00010 This file is part of the VLFeat library and is made available under
00011 the terms of the BSD license (see the COPYING file).
00012 */
00013 
00014 #ifndef VL_HIKMEANS_H
00015 #define VL_HIKMEANS_H
00016 
00017 #include "generic.h"
00018 #include "ikmeans.h"
00019 
00020 struct _VLHIKMTree ;
00021 struct _VLHIKMNode ;
00022 
00028 typedef struct _VlHIKMNode
00029 {
00030   VlIKMFilt *filter ; 
00031   struct _VlHIKMNode **children ; 
00032 } VlHIKMNode ;
00033 
00035 typedef struct _VlHIKMTree {
00036   vl_size M ; 
00037   vl_size K ; 
00038   vl_size depth ; 
00039   vl_size max_niters ;  
00040   int method ; 
00041   int verb ; 
00042   VlHIKMNode * root; 
00043 } VlHIKMTree ;
00044 
00048 VL_EXPORT VlHIKMTree *vl_hikm_new (int method) ;
00049 VL_EXPORT void vl_hikm_delete (VlHIKMTree *f) ;
00055 VL_EXPORT vl_size vl_hikm_get_ndims (VlHIKMTree const *f) ;
00056 VL_EXPORT vl_size vl_hikm_get_K (VlHIKMTree const *f) ;
00057 VL_EXPORT vl_size vl_hikm_get_depth (VlHIKMTree const *f) ;
00058 VL_EXPORT int vl_hikm_get_verbosity (VlHIKMTree const *f) ;
00059 VL_EXPORT vl_size vl_hikm_get_max_niters (VlHIKMTree const *f) ;
00060 VL_EXPORT VlHIKMNode const * vl_hikm_get_root (VlHIKMTree const *f) ;
00066 VL_EXPORT void vl_hikm_set_verbosity (VlHIKMTree *f, int verb) ;
00067 VL_EXPORT void vl_hikm_set_max_niters (VlHIKMTree *f, int max_niters) ;
00073 VL_EXPORT void vl_hikm_init (VlHIKMTree *f, vl_size M, vl_size K, vl_size depth) ;
00074 VL_EXPORT void vl_hikm_train (VlHIKMTree *f, vl_uint8 const *data, vl_size N) ;
00075 VL_EXPORT void vl_hikm_push (VlHIKMTree *f, vl_uint32 *asgn, vl_uint8 const *data, vl_size N) ;
00079 /* VL_HIKMEANS_H */
00080 #endif


libvlfeat
Author(s): Andrea Vedaldi
autogenerated on Thu Jun 6 2019 20:25:51