kdtree.h

Go to the documentation of this file.
00001 /* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
00002 /* ====================================================================
00003  * Copyright (c) 2005 Carnegie Mellon University.  All rights 
00004  * reserved.
00005  *
00006  * Redistribution and use in source and binary forms, with or without
00007  * modification, are permitted provided that the following conditions
00008  * are met:
00009  *
00010  * 1. Redistributions of source code must retain the above copyright
00011  *    notice, this list of conditions and the following disclaimer. 
00012  *
00013  * 2. Redistributions in binary form must reproduce the above copyright
00014  *    notice, this list of conditions and the following disclaimer in
00015  *    the documentation and/or other materials provided with the
00016  *    distribution.
00017  *
00018  * This work was supported in part by funding from the Defense Advanced 
00019  * Research Projects Agency and the National Science Foundation of the 
00020  * United States of America, and the CMU Sphinx Speech Consortium.
00021  *
00022  * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND 
00023  * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 
00024  * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00025  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY
00026  * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
00027  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 
00028  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 
00029  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 
00030  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 
00031  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 
00032  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00033  *
00034  * ====================================================================
00035  *
00036  */
00037 /*********************************************************************
00038  *
00039  * File: kdtree.h
00040  * 
00041  * Description: Cut-down kd-trees for Sphinx2 decoding
00042  * 
00043  * Author: David Huggins-Daines <dhuggins@cs.cmu.edu>
00044  * 
00045  *********************************************************************/
00046 
00047 #ifndef __KDTREE_H__
00048 #define __KDTREE_H__
00049 
00050 #include "s3types.h"
00051 
00052 
00053 #ifdef __cplusplus
00054 extern "C" {
00055 #endif
00056 #if 0
00057 /* Fool Emacs. */
00058 }
00059 #endif
00060 
00061 typedef struct kd_tree_node_s kd_tree_node_t;
00062 struct kd_tree_node_s {
00063     uint8 *bbi; /* BBI list of intersecting Gaussians */
00064     /* FIXME: Should be mfcc_t */
00065     float32 split_plane;
00066     uint16 n_bbi, split_comp;
00067     uint16 left, right; /* Indices of left and right child nodes */
00068 };
00069 typedef struct kd_tree_s kd_tree_t;
00070 struct kd_tree_s {
00071     uint32 n_nodes, n_level, n_comp;
00072     kd_tree_node_t *nodes;
00073 };
00074 
00075 int32 read_kd_trees(const char *infile, kd_tree_t ***out_trees, uint32 *out_n_trees,
00076                     uint32 maxdepth, int32 maxbbi);
00077 void free_kd_tree(kd_tree_t *tree);
00078 /* FIXME: Should be mfcc_t */
00079 kd_tree_node_t *eval_kd_tree(kd_tree_t *tree, float32 *feat, uint32 maxdepth);
00080 
00081 #ifdef __cplusplus
00082 }
00083 #endif
00084 
00085 
00086 #endif /* __KDTREE_H__ */

Generated on 7 Mar 2010 by  doxygen 1.6.1