<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>PocketSphinx: src/libpocketsphinx/ptm_mgau.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.3 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">PocketSphinx <span id="projectnumber">0.6</span></div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('ptm__mgau_8c.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<h1>src/libpocketsphinx/ptm_mgau.c</h1> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */</span>
<a name="l00002"></a>00002 <span class="comment">/* ====================================================================</span>
<a name="l00003"></a>00003 <span class="comment"> * Copyright (c) 1999-2010 Carnegie Mellon University. All rights</span>
<a name="l00004"></a>00004 <span class="comment"> * reserved.</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00007"></a>00007 <span class="comment"> * modification, are permitted provided that the following conditions</span>
<a name="l00008"></a>00008 <span class="comment"> * are met:</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span>
<a name="l00011"></a>00011 <span class="comment"> * notice, this list of conditions and the following disclaimer. </span>
<a name="l00012"></a>00012 <span class="comment"> *</span>
<a name="l00013"></a>00013 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span>
<a name="l00014"></a>00014 <span class="comment"> * notice, this list of conditions and the following disclaimer in</span>
<a name="l00015"></a>00015 <span class="comment"> * the documentation and/or other materials provided with the</span>
<a name="l00016"></a>00016 <span class="comment"> * distribution.</span>
<a name="l00017"></a>00017 <span class="comment"> *</span>
<a name="l00018"></a>00018 <span class="comment"> * This work was supported in part by funding from the Defense Advanced </span>
<a name="l00019"></a>00019 <span class="comment"> * Research Projects Agency and the National Science Foundation of the </span>
<a name="l00020"></a>00020 <span class="comment"> * United States of America, and the CMU Sphinx Speech Consortium.</span>
<a name="l00021"></a>00021 <span class="comment"> *</span>
<a name="l00022"></a>00022 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND </span>
<a name="l00023"></a>00023 <span class="comment"> * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, </span>
<a name="l00024"></a>00024 <span class="comment"> * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR</span>
<a name="l00025"></a>00025 <span class="comment"> * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY</span>
<a name="l00026"></a>00026 <span class="comment"> * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span>
<a name="l00027"></a>00027 <span class="comment"> * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT </span>
<a name="l00028"></a>00028 <span class="comment"> * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, </span>
<a name="l00029"></a>00029 <span class="comment"> * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY </span>
<a name="l00030"></a>00030 <span class="comment"> * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT </span>
<a name="l00031"></a>00031 <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE </span>
<a name="l00032"></a>00032 <span class="comment"> * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00033"></a>00033 <span class="comment"> *</span>
<a name="l00034"></a>00034 <span class="comment"> * ====================================================================</span>
<a name="l00035"></a>00035 <span class="comment"> *</span>
<a name="l00036"></a>00036 <span class="comment"> */</span>
<a name="l00037"></a>00037
<a name="l00038"></a>00038 <span class="comment">/* System headers */</span>
<a name="l00039"></a>00039 <span class="preprocessor">#include <stdio.h></span>
<a name="l00040"></a>00040 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00041"></a>00041 <span class="preprocessor">#include <string.h></span>
<a name="l00042"></a>00042 <span class="preprocessor">#include <assert.h></span>
<a name="l00043"></a>00043 <span class="preprocessor">#include <limits.h></span>
<a name="l00044"></a>00044 <span class="preprocessor">#include <math.h></span>
<a name="l00045"></a>00045 <span class="preprocessor">#if defined(__ADSPBLACKFIN__)</span>
<a name="l00046"></a>00046 <span class="preprocessor"></span><span class="preprocessor">#elif !defined(_WIN32_WCE)</span>
<a name="l00047"></a>00047 <span class="preprocessor"></span><span class="preprocessor">#include <sys/types.h></span>
<a name="l00048"></a>00048 <span class="preprocessor">#endif</span>
<a name="l00049"></a>00049 <span class="preprocessor"></span>
<a name="l00050"></a>00050 <span class="preprocessor">#ifndef M_PI </span>
<a name="l00051"></a>00051 <span class="preprocessor"></span><span class="preprocessor">#define M_PI 3.14159265358979323846 </span>
<a name="l00052"></a>00052 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00053"></a>00053 <span class="preprocessor"></span>
<a name="l00054"></a>00054 <span class="comment">/* SphinxBase headers */</span>
<a name="l00055"></a>00055 <span class="preprocessor">#include <sphinx_config.h></span>
<a name="l00056"></a>00056 <span class="preprocessor">#include <sphinxbase/cmd_ln.h></span>
<a name="l00057"></a>00057 <span class="preprocessor">#include <sphinxbase/fixpoint.h></span>
<a name="l00058"></a>00058 <span class="preprocessor">#include <sphinxbase/ckd_alloc.h></span>
<a name="l00059"></a>00059 <span class="preprocessor">#include <sphinxbase/bio.h></span>
<a name="l00060"></a>00060 <span class="preprocessor">#include <sphinxbase/err.h></span>
<a name="l00061"></a>00061 <span class="preprocessor">#include <sphinxbase/prim_type.h></span>
<a name="l00062"></a>00062
<a name="l00063"></a>00063 <span class="comment">/* Local headers */</span>
<a name="l00064"></a>00064 <span class="preprocessor">#include "<a class="code" href="tied__mgau__common_8h.html" title="Common code shared between SC and PTM (tied-state) models.">tied_mgau_common.h</a>"</span>
<a name="l00065"></a>00065 <span class="preprocessor">#include "<a class="code" href="ptm__mgau_8h.html" title="Fast phonetically-tied mixture evaluation.">ptm_mgau.h</a>"</span>
<a name="l00066"></a>00066 <span class="preprocessor">#include "posixwin32.h"</span>
<a name="l00067"></a>00067
<a name="l00068"></a>00068 <span class="keyword">static</span> <a class="code" href="structps__mgaufuncs__s.html">ps_mgaufuncs_t</a> ptm_mgau_funcs = {
<a name="l00069"></a>00069 <span class="stringliteral">"ptm"</span>,
<a name="l00070"></a>00070 &ptm_mgau_frame_eval, <span class="comment">/* frame_eval */</span>
<a name="l00071"></a>00071 &ptm_mgau_mllr_transform, <span class="comment">/* transform */</span>
<a name="l00072"></a>00072 &ptm_mgau_free <span class="comment">/* free */</span>
<a name="l00073"></a>00073 };
<a name="l00074"></a>00074
<a name="l00075"></a>00075 <span class="preprocessor">#define COMPUTE_GMM_MAP(_idx) \</span>
<a name="l00076"></a>00076 <span class="preprocessor"> diff[_idx] = obs[_idx] - mean[_idx]; \</span>
<a name="l00077"></a>00077 <span class="preprocessor"> sqdiff[_idx] = MFCCMUL(diff[_idx], diff[_idx]); \</span>
<a name="l00078"></a>00078 <span class="preprocessor"> compl[_idx] = MFCCMUL(sqdiff[_idx], var[_idx]);</span>
<a name="l00079"></a>00079 <span class="preprocessor"></span><span class="preprocessor">#define COMPUTE_GMM_REDUCE(_idx) \</span>
<a name="l00080"></a>00080 <span class="preprocessor"> d = GMMSUB(d, compl[_idx]);</span>
<a name="l00081"></a>00081 <span class="preprocessor"></span>
<a name="l00082"></a>00082 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00083"></a>00083 insertion_sort_topn(<a class="code" href="structptm__topn__s.html">ptm_topn_t</a> *topn, <span class="keywordtype">int</span> i, int32 d)
<a name="l00084"></a>00084 {
<a name="l00085"></a>00085 <a class="code" href="structptm__topn__s.html">ptm_topn_t</a> vtmp;
<a name="l00086"></a>00086 <span class="keywordtype">int</span> j;
<a name="l00087"></a>00087
<a name="l00088"></a>00088 topn[i].<a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a> = d;
<a name="l00089"></a>00089 <span class="keywordflow">if</span> (i == 0)
<a name="l00090"></a>00090 <span class="keywordflow">return</span>;
<a name="l00091"></a>00091 vtmp = topn[i];
<a name="l00092"></a>00092 <span class="keywordflow">for</span> (j = i - 1; j >= 0 && d > topn[j].<a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a>; j--) {
<a name="l00093"></a>00093 topn[j + 1] = topn[j];
<a name="l00094"></a>00094 }
<a name="l00095"></a>00095 topn[j + 1] = vtmp;
<a name="l00096"></a>00096 }
<a name="l00097"></a>00097
<a name="l00098"></a>00098 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l00099"></a>00099 eval_topn(<a class="code" href="structptm__mgau__s.html">ptm_mgau_t</a> *s, <span class="keywordtype">int</span> cb, <span class="keywordtype">int</span> feat, mfcc_t *z)
<a name="l00100"></a>00100 {
<a name="l00101"></a>00101 <a class="code" href="structptm__topn__s.html">ptm_topn_t</a> *topn;
<a name="l00102"></a>00102 <span class="keywordtype">int</span> i, ceplen;
<a name="l00103"></a>00103
<a name="l00104"></a>00104 topn = s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[cb][feat];
<a name="l00105"></a>00105 ceplen = s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c" title="feature length for each feature">featlen</a>[feat];
<a name="l00106"></a>00106
<a name="l00107"></a>00107 <span class="keywordflow">for</span> (i = 0; i < s->max_topn; i++) {
<a name="l00108"></a>00108 mfcc_t *mean, diff[4], sqdiff[4], compl[4]; <span class="comment">/* diff, diff^2, component likelihood */</span>
<a name="l00109"></a>00109 mfcc_t *var, d;
<a name="l00110"></a>00110 mfcc_t *obs;
<a name="l00111"></a>00111 int32 cw, j;
<a name="l00112"></a>00112
<a name="l00113"></a>00113 cw = topn[i].<a class="code" href="structptm__topn__s.html#a8a46095488efefa2714214a7a74117b1" title="Codeword index.">cw</a>;
<a name="l00114"></a>00114 mean = s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37" title="mean[codebook][feature][codeword] vector">mean</a>[cb][feat][0] + cw * ceplen;
<a name="l00115"></a>00115 var = s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19" title="like mean; diagonal covariance vector only">var</a>[cb][feat][0] + cw * ceplen;
<a name="l00116"></a>00116 d = s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b" title="log(determinant) for each variance vector; actually, log(sqrt(2*pi*det))">det</a>[cb][feat][cw];
<a name="l00117"></a>00117 obs = z;
<a name="l00118"></a>00118 <span class="keywordflow">for</span> (j = 0; j < ceplen % 4; ++j) {
<a name="l00119"></a>00119 diff[0] = *obs++ - *mean++;
<a name="l00120"></a>00120 sqdiff[0] = MFCCMUL(diff[0], diff[0]);
<a name="l00121"></a>00121 compl[0] = MFCCMUL(sqdiff[0], *var);
<a name="l00122"></a>00122 d = <a class="code" href="tied__mgau__common_8h.html#a740dfe5b30e702ba8b2ec7426bd4d57e" title="Subtract GMM component b (assumed to be positive) and saturate.">GMMSUB</a>(d, compl[0]);
<a name="l00123"></a>00123 ++var;
<a name="l00124"></a>00124 }
<a name="l00125"></a>00125 <span class="comment">/* We could vectorize this but it's unlikely to make much</span>
<a name="l00126"></a>00126 <span class="comment"> * difference as the outer loop here isn't very big. */</span>
<a name="l00127"></a>00127 <span class="keywordflow">for</span> (;j < ceplen; j += 4) {
<a name="l00128"></a>00128 COMPUTE_GMM_MAP(0);
<a name="l00129"></a>00129 COMPUTE_GMM_MAP(1);
<a name="l00130"></a>00130 COMPUTE_GMM_MAP(2);
<a name="l00131"></a>00131 COMPUTE_GMM_MAP(3);
<a name="l00132"></a>00132 COMPUTE_GMM_REDUCE(0);
<a name="l00133"></a>00133 COMPUTE_GMM_REDUCE(1);
<a name="l00134"></a>00134 COMPUTE_GMM_REDUCE(2);
<a name="l00135"></a>00135 COMPUTE_GMM_REDUCE(3);
<a name="l00136"></a>00136 var += 4;
<a name="l00137"></a>00137 obs += 4;
<a name="l00138"></a>00138 mean += 4;
<a name="l00139"></a>00139 }
<a name="l00140"></a>00140 insertion_sort_topn(topn, i, (int32)d);
<a name="l00141"></a>00141 }
<a name="l00142"></a>00142
<a name="l00143"></a>00143 <span class="keywordflow">return</span> topn[0].<a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a>;
<a name="l00144"></a>00144 }
<a name="l00145"></a>00145
<a name="l00146"></a>00146 <span class="comment">/* This looks bad, but it actually isn't. Less than 1% of eval_cb's</span>
<a name="l00147"></a>00147 <span class="comment"> * time is spent doing this. */</span>
<a name="l00148"></a>00148 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00149"></a>00149 insertion_sort_cb(<a class="code" href="structptm__topn__s.html">ptm_topn_t</a> **cur, <a class="code" href="structptm__topn__s.html">ptm_topn_t</a> *worst, <a class="code" href="structptm__topn__s.html">ptm_topn_t</a> *best,
<a name="l00150"></a>00150 <span class="keywordtype">int</span> cw, int32 intd)
<a name="l00151"></a>00151 {
<a name="l00152"></a>00152 <span class="keywordflow">for</span> (*cur = worst - 1; *cur >= best && intd >= (*cur)-><a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a>; --*cur)
<a name="l00153"></a>00153 memcpy(*cur + 1, *cur, <span class="keyword">sizeof</span>(**cur));
<a name="l00154"></a>00154 ++*cur;
<a name="l00155"></a>00155 (*cur)-><a class="code" href="structptm__topn__s.html#a8a46095488efefa2714214a7a74117b1" title="Codeword index.">cw</a> = cw;
<a name="l00156"></a>00156 (*cur)->score = intd;
<a name="l00157"></a>00157 }
<a name="l00158"></a>00158
<a name="l00159"></a>00159 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l00160"></a>00160 eval_cb(<a class="code" href="structptm__mgau__s.html">ptm_mgau_t</a> *s, <span class="keywordtype">int</span> cb, <span class="keywordtype">int</span> feat, mfcc_t *z)
<a name="l00161"></a>00161 {
<a name="l00162"></a>00162 <a class="code" href="structptm__topn__s.html">ptm_topn_t</a> *worst, *best, *topn;
<a name="l00163"></a>00163 mfcc_t *mean;
<a name="l00164"></a>00164 mfcc_t *var, *det, *detP, *detE;
<a name="l00165"></a>00165 int32 i, ceplen;
<a name="l00166"></a>00166
<a name="l00167"></a>00167 best = topn = s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[cb][feat];
<a name="l00168"></a>00168 worst = topn + (s->max_topn - 1);
<a name="l00169"></a>00169 mean = s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#aa76d63009601dcb6b99f17db96167f37" title="mean[codebook][feature][codeword] vector">mean</a>[cb][feat][0];
<a name="l00170"></a>00170 var = s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a172cb69c018608ab8c33d54e6f0fdf19" title="like mean; diagonal covariance vector only">var</a>[cb][feat][0];
<a name="l00171"></a>00171 det = s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a315918a44ff97b95a6fcdf8739d8089b" title="log(determinant) for each variance vector; actually, log(sqrt(2*pi*det))">det</a>[cb][feat];
<a name="l00172"></a>00172 detE = det + s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac" title="Number gaussian densities in each codebook-feature stream.">n_density</a>;
<a name="l00173"></a>00173 ceplen = s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c" title="feature length for each feature">featlen</a>[feat];
<a name="l00174"></a>00174
<a name="l00175"></a>00175 <span class="keywordflow">for</span> (detP = det; detP < detE; ++detP) {
<a name="l00176"></a>00176 mfcc_t diff[4], sqdiff[4], compl[4]; <span class="comment">/* diff, diff^2, component likelihood */</span>
<a name="l00177"></a>00177 mfcc_t d, thresh;
<a name="l00178"></a>00178 mfcc_t *obs;
<a name="l00179"></a>00179 <a class="code" href="structptm__topn__s.html">ptm_topn_t</a> *cur;
<a name="l00180"></a>00180 int32 cw, j;
<a name="l00181"></a>00181
<a name="l00182"></a>00182 d = *detP;
<a name="l00183"></a>00183 thresh = (mfcc_t) worst-><a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a>; <span class="comment">/* Avoid int-to-float conversions */</span>
<a name="l00184"></a>00184 obs = z;
<a name="l00185"></a>00185 cw = detP - det;
<a name="l00186"></a>00186
<a name="l00187"></a>00187 <span class="comment">/* Unroll the loop starting with the first dimension(s). In</span>
<a name="l00188"></a>00188 <span class="comment"> * theory this might be a bit faster if this Gaussian gets</span>
<a name="l00189"></a>00189 <span class="comment"> * "knocked out" by C0. In practice not. */</span>
<a name="l00190"></a>00190 for (j = 0; (j < ceplen % 4) && (d >= thresh); ++j) {
<a name="l00191"></a>00191 diff[0] = *obs++ - *mean++;
<a name="l00192"></a>00192 sqdiff[0] = MFCCMUL(diff[0], diff[0]);
<a name="l00193"></a>00193 compl[0] = MFCCMUL(sqdiff[0], *var++);
<a name="l00194"></a>00194 d = <a class="code" href="tied__mgau__common_8h.html#a740dfe5b30e702ba8b2ec7426bd4d57e" title="Subtract GMM component b (assumed to be positive) and saturate.">GMMSUB</a>(d, compl[0]);
<a name="l00195"></a>00195 }
<a name="l00196"></a>00196 <span class="comment">/* Now do 4 dimensions at a time. You'd think that GCC would</span>
<a name="l00197"></a>00197 <span class="comment"> * vectorize this? Apparently not. And it's right, because</span>
<a name="l00198"></a>00198 <span class="comment"> * that won't make this any faster, at least on x86-64. */</span>
<a name="l00199"></a>00199 <span class="keywordflow">for</span> (; j < ceplen && d >= thresh; j += 4) {
<a name="l00200"></a>00200 COMPUTE_GMM_MAP(0);
<a name="l00201"></a>00201 COMPUTE_GMM_MAP(1);
<a name="l00202"></a>00202 COMPUTE_GMM_MAP(2);
<a name="l00203"></a>00203 COMPUTE_GMM_MAP(3);
<a name="l00204"></a>00204 COMPUTE_GMM_REDUCE(0);
<a name="l00205"></a>00205 COMPUTE_GMM_REDUCE(1);
<a name="l00206"></a>00206 COMPUTE_GMM_REDUCE(2);
<a name="l00207"></a>00207 COMPUTE_GMM_REDUCE(3);
<a name="l00208"></a>00208 var += 4;
<a name="l00209"></a>00209 obs += 4;
<a name="l00210"></a>00210 mean += 4;
<a name="l00211"></a>00211 }
<a name="l00212"></a>00212 <span class="keywordflow">if</span> (j < ceplen) {
<a name="l00213"></a>00213 <span class="comment">/* terminated early, so not in topn */</span>
<a name="l00214"></a>00214 mean += (ceplen - j);
<a name="l00215"></a>00215 var += (ceplen - j);
<a name="l00216"></a>00216 <span class="keywordflow">continue</span>;
<a name="l00217"></a>00217 }
<a name="l00218"></a>00218 <span class="keywordflow">if</span> (d < thresh)
<a name="l00219"></a>00219 <span class="keywordflow">continue</span>;
<a name="l00220"></a>00220 <span class="keywordflow">for</span> (i = 0; i < s->max_topn; i++) {
<a name="l00221"></a>00221 <span class="comment">/* already there, so don't need to insert */</span>
<a name="l00222"></a>00222 <span class="keywordflow">if</span> (topn[i].cw == cw)
<a name="l00223"></a>00223 <span class="keywordflow">break</span>;
<a name="l00224"></a>00224 }
<a name="l00225"></a>00225 <span class="keywordflow">if</span> (i < s->max_topn)
<a name="l00226"></a>00226 <span class="keywordflow">continue</span>; <span class="comment">/* already there. Don't insert */</span>
<a name="l00227"></a>00227 insertion_sort_cb(&cur, worst, best, cw, (int32)d);
<a name="l00228"></a>00228 }
<a name="l00229"></a>00229
<a name="l00230"></a>00230 <span class="keywordflow">return</span> best-><a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a>;
<a name="l00231"></a>00231 }
<a name="l00232"></a>00232
<a name="l00236"></a>00236 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l00237"></a>00237 ptm_mgau_codebook_eval(<a class="code" href="structptm__mgau__s.html">ptm_mgau_t</a> *s, mfcc_t **z, <span class="keywordtype">int</span> frame)
<a name="l00238"></a>00238 {
<a name="l00239"></a>00239 <span class="keywordtype">int</span> i, j;
<a name="l00240"></a>00240
<a name="l00241"></a>00241 <span class="comment">/* First evaluate top-N from previous frame. */</span>
<a name="l00242"></a>00242 <span class="keywordflow">for</span> (i = 0; i < s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a>; ++i)
<a name="l00243"></a>00243 <span class="keywordflow">for</span> (j = 0; j < s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a>; ++j)
<a name="l00244"></a>00244 eval_topn(s, i, j, z[j]);
<a name="l00245"></a>00245
<a name="l00246"></a>00246 <span class="comment">/* If frame downsampling is in effect, possibly do nothing else. */</span>
<a name="l00247"></a>00247 <span class="keywordflow">if</span> (frame % s->ds_ratio)
<a name="l00248"></a>00248 <span class="keywordflow">return</span> 0;
<a name="l00249"></a>00249
<a name="l00250"></a>00250 <span class="comment">/* Evaluate remaining codebooks. */</span>
<a name="l00251"></a>00251 <span class="keywordflow">for</span> (i = 0; i < s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a>; ++i) {
<a name="l00252"></a>00252 <span class="keywordflow">if</span> (bitvec_is_clear(s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#ac5d3b21239d567b395015d7c4fea157c" title="Set of active codebooks.">mgau_active</a>, i))
<a name="l00253"></a>00253 <span class="keywordflow">continue</span>;
<a name="l00254"></a>00254 <span class="keywordflow">for</span> (j = 0; j < s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a>; ++j) {
<a name="l00255"></a>00255 eval_cb(s, i, j, z[j]);
<a name="l00256"></a>00256 }
<a name="l00257"></a>00257 }
<a name="l00258"></a>00258
<a name="l00259"></a>00259 <span class="comment">/* Normalize densities to produce "posterior probabilities",</span>
<a name="l00260"></a>00260 <span class="comment"> * i.e. things with a reasonable dynamic range, then scale and</span>
<a name="l00261"></a>00261 <span class="comment"> * clamp them to the acceptable range. This is actually done</span>
<a name="l00262"></a>00262 <span class="comment"> * solely to ensure that we can use fast_logmath_add(). Note that</span>
<a name="l00263"></a>00263 <span class="comment"> * unless we share the same normalizer across all codebooks for</span>
<a name="l00264"></a>00264 <span class="comment"> * each feature stream we get defective scores (that's why these</span>
<a name="l00265"></a>00265 <span class="comment"> * loops are inside out - doing it per-feature should give us</span>
<a name="l00266"></a>00266 <span class="comment"> * greater precision). */</span>
<a name="l00267"></a>00267 <span class="keywordflow">for</span> (j = 0; j < s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a>; ++j) {
<a name="l00268"></a>00268 int32 norm = 0x7fffffff;
<a name="l00269"></a>00269 <span class="keywordflow">for</span> (i = 0; i < s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a>; ++i) {
<a name="l00270"></a>00270 <span class="keywordflow">if</span> (bitvec_is_clear(s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#ac5d3b21239d567b395015d7c4fea157c" title="Set of active codebooks.">mgau_active</a>, i))
<a name="l00271"></a>00271 <span class="keywordflow">continue</span>;
<a name="l00272"></a>00272 <span class="keywordflow">if</span> (norm > s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[i][j][0].<a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a> >> <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>)
<a name="l00273"></a>00273 norm = s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[i][j][0].<a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a> >> <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>;
<a name="l00274"></a>00274 }
<a name="l00275"></a>00275 assert(norm != 0x7fffffff);
<a name="l00276"></a>00276 <span class="keywordflow">for</span> (i = 0; i < s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a>; ++i) {
<a name="l00277"></a>00277 int32 k;
<a name="l00278"></a>00278 <span class="keywordflow">if</span> (bitvec_is_clear(s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#ac5d3b21239d567b395015d7c4fea157c" title="Set of active codebooks.">mgau_active</a>, i))
<a name="l00279"></a>00279 <span class="keywordflow">continue</span>;
<a name="l00280"></a>00280 <span class="keywordflow">for</span> (k = 0; k < s->max_topn; ++k) {
<a name="l00281"></a>00281 s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[i][j][k].<a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a> >>= <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>;
<a name="l00282"></a>00282 s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[i][j][k].<a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a> -= norm;
<a name="l00283"></a>00283 s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[i][j][k].<a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a> = -s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[i][j][k].<a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a>;
<a name="l00284"></a>00284 <span class="keywordflow">if</span> (s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[i][j][k].<a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a> > <a class="code" href="tied__mgau__common_8h.html#a965d50d73044c3f2dc2589662fd2e89e" title="Maximum negated acoustic score value.">MAX_NEG_ASCR</a>)
<a name="l00285"></a>00285 s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[i][j][k].<a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a> = <a class="code" href="tied__mgau__common_8h.html#a965d50d73044c3f2dc2589662fd2e89e" title="Maximum negated acoustic score value.">MAX_NEG_ASCR</a>;
<a name="l00286"></a>00286 }
<a name="l00287"></a>00287 }
<a name="l00288"></a>00288 }
<a name="l00289"></a>00289
<a name="l00290"></a>00290 <span class="keywordflow">return</span> 0;
<a name="l00291"></a>00291 }
<a name="l00292"></a>00292
<a name="l00293"></a>00293 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l00294"></a>00294 ptm_mgau_calc_cb_active(<a class="code" href="structptm__mgau__s.html">ptm_mgau_t</a> *s, uint8 *senone_active,
<a name="l00295"></a>00295 int32 n_senone_active, <span class="keywordtype">int</span> compallsen)
<a name="l00296"></a>00296 {
<a name="l00297"></a>00297 <span class="keywordtype">int</span> i, lastsen;
<a name="l00298"></a>00298
<a name="l00299"></a>00299 <span class="keywordflow">if</span> (compallsen) {
<a name="l00300"></a>00300 bitvec_set_all(s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#ac5d3b21239d567b395015d7c4fea157c" title="Set of active codebooks.">mgau_active</a>, s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a>);
<a name="l00301"></a>00301 <span class="keywordflow">return</span> 0;
<a name="l00302"></a>00302 }
<a name="l00303"></a>00303 bitvec_clear_all(s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#ac5d3b21239d567b395015d7c4fea157c" title="Set of active codebooks.">mgau_active</a>, s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a>);
<a name="l00304"></a>00304 <span class="keywordflow">for</span> (lastsen = i = 0; i < n_senone_active; ++i) {
<a name="l00305"></a>00305 <span class="keywordtype">int</span> sen = senone_active[i] + lastsen;
<a name="l00306"></a>00306 <span class="keywordtype">int</span> cb = s-><a class="code" href="structptm__mgau__s.html#a5e677255165b8abda63dd1d6dbed1be7" title="Senone to codebook mapping.">sen2cb</a>[sen];
<a name="l00307"></a>00307 bitvec_set(s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#ac5d3b21239d567b395015d7c4fea157c" title="Set of active codebooks.">mgau_active</a>, cb);
<a name="l00308"></a>00308 lastsen = sen;
<a name="l00309"></a>00309 }
<a name="l00310"></a>00310 E_DEBUG(1, (<span class="stringliteral">"Active codebooks:"</span>));
<a name="l00311"></a>00311 <span class="keywordflow">for</span> (i = 0; i < s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a>; ++i) {
<a name="l00312"></a>00312 <span class="keywordflow">if</span> (bitvec_is_clear(s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#ac5d3b21239d567b395015d7c4fea157c" title="Set of active codebooks.">mgau_active</a>, i))
<a name="l00313"></a>00313 <span class="keywordflow">continue</span>;
<a name="l00314"></a>00314 E_DEBUGCONT(1, (<span class="stringliteral">" %d"</span>, i));
<a name="l00315"></a>00315 }
<a name="l00316"></a>00316 E_DEBUGCONT(1, (<span class="stringliteral">"\n"</span>));
<a name="l00317"></a>00317 <span class="keywordflow">return</span> 0;
<a name="l00318"></a>00318 }
<a name="l00319"></a>00319
<a name="l00323"></a>00323 <span class="keyword">static</span> <span class="keywordtype">int</span>
<a name="l00324"></a>00324 ptm_mgau_senone_eval(<a class="code" href="structptm__mgau__s.html">ptm_mgau_t</a> *s, int16 *senone_scores,
<a name="l00325"></a>00325 uint8 *senone_active, int32 n_senone_active,
<a name="l00326"></a>00326 <span class="keywordtype">int</span> compall)
<a name="l00327"></a>00327 {
<a name="l00328"></a>00328 <span class="keywordtype">int</span> i, lastsen, bestscore;
<a name="l00329"></a>00329
<a name="l00330"></a>00330 memset(senone_scores, 0, s-><a class="code" href="structptm__mgau__s.html#ab0f6c452efe082383e906ac2a4f75de4" title="Number of senones.">n_sen</a> * <span class="keyword">sizeof</span>(*senone_scores));
<a name="l00331"></a>00331 <span class="comment">/* FIXME: This is the non-cache-efficient way to do this. We want</span>
<a name="l00332"></a>00332 <span class="comment"> * to evaluate one codeword at a time but this requires us to have</span>
<a name="l00333"></a>00333 <span class="comment"> * a reverse codebook to senone mapping, which we don't have</span>
<a name="l00334"></a>00334 <span class="comment"> * (yet), since different codebooks have different top-N</span>
<a name="l00335"></a>00335 <span class="comment"> * codewords. */</span>
<a name="l00336"></a>00336 <span class="keywordflow">if</span> (compall)
<a name="l00337"></a>00337 n_senone_active = s-><a class="code" href="structptm__mgau__s.html#ab0f6c452efe082383e906ac2a4f75de4" title="Number of senones.">n_sen</a>;
<a name="l00338"></a>00338 bestscore = 0x7fffffff;
<a name="l00339"></a>00339 <span class="keywordflow">for</span> (lastsen = i = 0; i < n_senone_active; ++i) {
<a name="l00340"></a>00340 <span class="keywordtype">int</span> sen, f, cb;
<a name="l00341"></a>00341 <span class="keywordtype">int</span> ascore;
<a name="l00342"></a>00342
<a name="l00343"></a>00343 <span class="keywordflow">if</span> (compall)
<a name="l00344"></a>00344 sen = i;
<a name="l00345"></a>00345 <span class="keywordflow">else</span>
<a name="l00346"></a>00346 sen = senone_active[i] + lastsen;
<a name="l00347"></a>00347 lastsen = sen;
<a name="l00348"></a>00348 cb = s-><a class="code" href="structptm__mgau__s.html#a5e677255165b8abda63dd1d6dbed1be7" title="Senone to codebook mapping.">sen2cb</a>[sen];
<a name="l00349"></a>00349
<a name="l00350"></a>00350 <span class="keywordflow">if</span> (bitvec_is_clear(s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#ac5d3b21239d567b395015d7c4fea157c" title="Set of active codebooks.">mgau_active</a>, cb)) {
<a name="l00351"></a>00351 <span class="keywordtype">int</span> j;
<a name="l00352"></a>00352 <span class="comment">/* Because senone_active is deltas we can't really "knock</span>
<a name="l00353"></a>00353 <span class="comment"> * out" senones from pruned codebooks, and in any case,</span>
<a name="l00354"></a>00354 <span class="comment"> * it wouldn't make any difference to the search code,</span>
<a name="l00355"></a>00355 <span class="comment"> * which doesn't expect senone_active to change. */</span>
<a name="l00356"></a>00356 <span class="keywordflow">for</span> (f = 0; f < s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a>; ++f) {
<a name="l00357"></a>00357 <span class="keywordflow">for</span> (j = 0; j < s->max_topn; ++j) {
<a name="l00358"></a>00358 s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[cb][f][j].<a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a> = <a class="code" href="tied__mgau__common_8h.html#a965d50d73044c3f2dc2589662fd2e89e" title="Maximum negated acoustic score value.">MAX_NEG_ASCR</a>;
<a name="l00359"></a>00359 }
<a name="l00360"></a>00360 }
<a name="l00361"></a>00361 }
<a name="l00362"></a>00362 <span class="comment">/* For each feature, log-sum codeword scores + mixw to get</span>
<a name="l00363"></a>00363 <span class="comment"> * feature density, then sum (multiply) to get ascore */</span>
<a name="l00364"></a>00364 ascore = 0;
<a name="l00365"></a>00365 <span class="keywordflow">for</span> (f = 0; f < s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a>; ++f) {
<a name="l00366"></a>00366 <a class="code" href="structptm__topn__s.html">ptm_topn_t</a> *topn;
<a name="l00367"></a>00367 <span class="keywordtype">int</span> j, fden = 0;
<a name="l00368"></a>00368 topn = s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[cb][f];
<a name="l00369"></a>00369 <span class="keywordflow">for</span> (j = 0; j < s->max_topn; ++j) {
<a name="l00370"></a>00370 <span class="keywordtype">int</span> mixw;
<a name="l00371"></a>00371 <span class="comment">/* Find mixture weight for this codeword. */</span>
<a name="l00372"></a>00372 <span class="keywordflow">if</span> (s->mixw_cb) {
<a name="l00373"></a>00373 <span class="keywordtype">int</span> dcw = s-><a class="code" href="structptm__mgau__s.html#af0898f6d5b5b863901a4a4858a10d32a" title="Mixture weight distributions by feature, codeword, senone.">mixw</a>[f][topn[j].<a class="code" href="structptm__topn__s.html#a8a46095488efefa2714214a7a74117b1" title="Codeword index.">cw</a>][sen/2];
<a name="l00374"></a>00374 dcw = (dcw & 1) ? dcw >> 4 : dcw & 0x0f;
<a name="l00375"></a>00375 mixw = s->mixw_cb[dcw];
<a name="l00376"></a>00376 }
<a name="l00377"></a>00377 <span class="keywordflow">else</span> {
<a name="l00378"></a>00378 mixw = s-><a class="code" href="structptm__mgau__s.html#af0898f6d5b5b863901a4a4858a10d32a" title="Mixture weight distributions by feature, codeword, senone.">mixw</a>[f][topn[j].<a class="code" href="structptm__topn__s.html#a8a46095488efefa2714214a7a74117b1" title="Codeword index.">cw</a>][sen];
<a name="l00379"></a>00379 }
<a name="l00380"></a>00380 <span class="keywordflow">if</span> (j == 0)
<a name="l00381"></a>00381 fden = mixw + topn[j].<a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a>;
<a name="l00382"></a>00382 <span class="keywordflow">else</span>
<a name="l00383"></a>00383 fden = <a class="code" href="tied__mgau__common_8h.html#a947ea19b4351ecbf70330e089994c3a1" title="Quickly log-add two negated log probabilities.">fast_logmath_add</a>(s->lmath_8b, fden,
<a name="l00384"></a>00384 mixw + topn[j].<a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a>);
<a name="l00385"></a>00385 E_DEBUG(3, (<span class="stringliteral">"fden[%d][%d] l+= %d + %d = %d\n"</span>,
<a name="l00386"></a>00386 sen, f, mixw, topn[j].score, fden));
<a name="l00387"></a>00387 }
<a name="l00388"></a>00388 ascore += fden;
<a name="l00389"></a>00389 }
<a name="l00390"></a>00390 <span class="keywordflow">if</span> (ascore < bestscore) bestscore = ascore;
<a name="l00391"></a>00391 senone_scores[sen] = ascore;
<a name="l00392"></a>00392 }
<a name="l00393"></a>00393 <span class="comment">/* Normalize the scores again (finishing the job we started above</span>
<a name="l00394"></a>00394 <span class="comment"> * in ptm_mgau_codebook_eval...) */</span>
<a name="l00395"></a>00395 <span class="keywordflow">for</span> (i = 0; i < s-><a class="code" href="structptm__mgau__s.html#ab0f6c452efe082383e906ac2a4f75de4" title="Number of senones.">n_sen</a>; ++i) {
<a name="l00396"></a>00396 senone_scores[i] -= bestscore;
<a name="l00397"></a>00397 }
<a name="l00398"></a>00398
<a name="l00399"></a>00399 <span class="keywordflow">return</span> 0;
<a name="l00400"></a>00400 }
<a name="l00401"></a>00401
<a name="l00405"></a>00405 int32
<a name="l00406"></a><a class="code" href="ptm__mgau_8h.html#ae9fb76ef388e6541bd6c1b20fe8bc094">00406</a> ptm_mgau_frame_eval(<a class="code" href="structps__mgau__s.html">ps_mgau_t</a> *ps,
<a name="l00407"></a>00407 int16 *senone_scores,
<a name="l00408"></a>00408 uint8 *senone_active,
<a name="l00409"></a>00409 int32 n_senone_active,
<a name="l00410"></a>00410 mfcc_t ** featbuf, int32 frame,
<a name="l00411"></a>00411 int32 compallsen)
<a name="l00412"></a>00412 {
<a name="l00413"></a>00413 <a class="code" href="structptm__mgau__s.html">ptm_mgau_t</a> *s = (<a class="code" href="structptm__mgau__s.html">ptm_mgau_t</a> *)ps;
<a name="l00414"></a>00414 <span class="keywordtype">int</span> fast_eval_idx;
<a name="l00415"></a>00415
<a name="l00416"></a>00416 <span class="comment">/* Find the appropriate frame in the rotating history buffer</span>
<a name="l00417"></a>00417 <span class="comment"> * corresponding to the requested input frame. No bounds checking</span>
<a name="l00418"></a>00418 <span class="comment"> * is done here, which just means you'll get semi-random crap if</span>
<a name="l00419"></a>00419 <span class="comment"> * you request a frame in the future or one that's too far in the</span>
<a name="l00420"></a>00420 <span class="comment"> * past. Since the history buffer is just used for fast match</span>
<a name="l00421"></a>00421 <span class="comment"> * that might not be fatal. */</span>
<a name="l00422"></a>00422 fast_eval_idx = frame % s-><a class="code" href="structptm__mgau__s.html#ac491c223199ed5374dfb13fc41854601" title="Number of past frames tracked.">n_fast_hist</a>;
<a name="l00423"></a>00423 s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a> = s-><a class="code" href="structptm__mgau__s.html#a68c75460ebffecc786d7eb2840ed7631" title="Fast evaluation info for past frames.">hist</a> + fast_eval_idx;
<a name="l00424"></a>00424 <span class="comment">/* Compute the top-N codewords for every codebook, unless this</span>
<a name="l00425"></a>00425 <span class="comment"> * is a past frame, in which case we already have them (we</span>
<a name="l00426"></a>00426 <span class="comment"> * hope!) */</span>
<a name="l00427"></a>00427 <span class="keywordflow">if</span> (frame >= ps_mgau_base(ps)->frame_idx) {
<a name="l00428"></a>00428 <a class="code" href="structptm__fast__eval__s.html">ptm_fast_eval_t</a> *lastf;
<a name="l00429"></a>00429 <span class="comment">/* Get the previous frame's top-N information (on the</span>
<a name="l00430"></a>00430 <span class="comment"> * first frame of the input this is just all WORST_DIST,</span>
<a name="l00431"></a>00431 <span class="comment"> * no harm in that) */</span>
<a name="l00432"></a>00432 <span class="keywordflow">if</span> (fast_eval_idx == 0)
<a name="l00433"></a>00433 lastf = s-><a class="code" href="structptm__mgau__s.html#a68c75460ebffecc786d7eb2840ed7631" title="Fast evaluation info for past frames.">hist</a> + s-><a class="code" href="structptm__mgau__s.html#ac491c223199ed5374dfb13fc41854601" title="Number of past frames tracked.">n_fast_hist</a> - 1;
<a name="l00434"></a>00434 <span class="keywordflow">else</span>
<a name="l00435"></a>00435 lastf = s-><a class="code" href="structptm__mgau__s.html#a68c75460ebffecc786d7eb2840ed7631" title="Fast evaluation info for past frames.">hist</a> + fast_eval_idx - 1;
<a name="l00436"></a>00436 <span class="comment">/* Copy in initial top-N info */</span>
<a name="l00437"></a>00437 memcpy(s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a>-><a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[0][0], lastf-><a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[0][0],
<a name="l00438"></a>00438 s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a> * s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a> * s->max_topn * <span class="keyword">sizeof</span>(<a class="code" href="structptm__topn__s.html">ptm_topn_t</a>));
<a name="l00439"></a>00439 <span class="comment">/* Generate initial active codebook list (this might not be</span>
<a name="l00440"></a>00440 <span class="comment"> * necessary) */</span>
<a name="l00441"></a>00441 ptm_mgau_calc_cb_active(s, senone_active, n_senone_active, compallsen);
<a name="l00442"></a>00442 <span class="comment">/* Now evaluate top-N, prune, and evaluate remaining codebooks. */</span>
<a name="l00443"></a>00443 ptm_mgau_codebook_eval(s, featbuf, frame);
<a name="l00444"></a>00444 }
<a name="l00445"></a>00445 <span class="comment">/* Evaluate intersection of active senones and active codebooks. */</span>
<a name="l00446"></a>00446 ptm_mgau_senone_eval(s, senone_scores, senone_active,
<a name="l00447"></a>00447 n_senone_active, compallsen);
<a name="l00448"></a>00448
<a name="l00449"></a>00449 <span class="keywordflow">return</span> 0;
<a name="l00450"></a>00450 }
<a name="l00451"></a>00451
<a name="l00452"></a>00452 <span class="keyword">static</span> int32
<a name="l00453"></a>00453 read_sendump(<a class="code" href="structptm__mgau__s.html">ptm_mgau_t</a> *s, <a class="code" href="structbin__mdef__s.html">bin_mdef_t</a> *mdef, <span class="keywordtype">char</span> <span class="keyword">const</span> *file)
<a name="l00454"></a>00454 {
<a name="l00455"></a>00455 FILE *fp;
<a name="l00456"></a>00456 <span class="keywordtype">char</span> line[1000];
<a name="l00457"></a>00457 int32 i, n, r, c;
<a name="l00458"></a>00458 int32 do_swap, do_mmap;
<a name="l00459"></a>00459 <span class="keywordtype">size_t</span> filesize, offset;
<a name="l00460"></a>00460 <span class="keywordtype">int</span> n_clust = 0;
<a name="l00461"></a>00461 <span class="keywordtype">int</span> n_feat = s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a>;
<a name="l00462"></a>00462 <span class="keywordtype">int</span> n_density = s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac" title="Number gaussian densities in each codebook-feature stream.">n_density</a>;
<a name="l00463"></a>00463 <span class="keywordtype">int</span> n_sen = bin_mdef_n_sen(mdef);
<a name="l00464"></a>00464 <span class="keywordtype">int</span> n_bits = 8;
<a name="l00465"></a>00465
<a name="l00466"></a>00466 s-><a class="code" href="structptm__mgau__s.html#ab0f6c452efe082383e906ac2a4f75de4" title="Number of senones.">n_sen</a> = n_sen; <span class="comment">/* FIXME: Should have been done earlier */</span>
<a name="l00467"></a>00467 do_mmap = cmd_ln_boolean_r(s-><a class="code" href="structptm__mgau__s.html#aa9cd83ce89052bd6d112ecff54d118f9" title="Configuration parameters.">config</a>, <span class="stringliteral">"-mmap"</span>);
<a name="l00468"></a>00468
<a name="l00469"></a>00469 <span class="keywordflow">if</span> ((fp = fopen(file, <span class="stringliteral">"rb"</span>)) == NULL)
<a name="l00470"></a>00470 <span class="keywordflow">return</span> -1;
<a name="l00471"></a>00471
<a name="l00472"></a>00472 E_INFO(<span class="stringliteral">"Loading senones from dump file %s\n"</span>, file);
<a name="l00473"></a>00473 <span class="comment">/* Read title size, title */</span>
<a name="l00474"></a>00474 <span class="keywordflow">if</span> (fread(&n, <span class="keyword">sizeof</span>(int32), 1, fp) != 1) {
<a name="l00475"></a>00475 E_ERROR_SYSTEM(<span class="stringliteral">"Failed to read title size from %s"</span>, file);
<a name="l00476"></a>00476 <span class="keywordflow">goto</span> error_out;
<a name="l00477"></a>00477 }
<a name="l00478"></a>00478 <span class="comment">/* This is extremely bogus */</span>
<a name="l00479"></a>00479 do_swap = 0;
<a name="l00480"></a>00480 <span class="keywordflow">if</span> (n < 1 || n > 999) {
<a name="l00481"></a>00481 SWAP_INT32(&n);
<a name="l00482"></a>00482 <span class="keywordflow">if</span> (n < 1 || n > 999) {
<a name="l00483"></a>00483 E_ERROR(<span class="stringliteral">"Title length %x in dump file %s out of range\n"</span>, n, file);
<a name="l00484"></a>00484 <span class="keywordflow">goto</span> error_out;
<a name="l00485"></a>00485 }
<a name="l00486"></a>00486 do_swap = 1;
<a name="l00487"></a>00487 }
<a name="l00488"></a>00488 <span class="keywordflow">if</span> (fread(line, <span class="keyword">sizeof</span>(<span class="keywordtype">char</span>), n, fp) != n) {
<a name="l00489"></a>00489 E_ERROR_SYSTEM(<span class="stringliteral">"Cannot read title"</span>);
<a name="l00490"></a>00490 <span class="keywordflow">goto</span> error_out;
<a name="l00491"></a>00491 }
<a name="l00492"></a>00492 <span class="keywordflow">if</span> (line[n - 1] != <span class="charliteral">'\0'</span>) {
<a name="l00493"></a>00493 E_ERROR(<span class="stringliteral">"Bad title in dump file\n"</span>);
<a name="l00494"></a>00494 <span class="keywordflow">goto</span> error_out;
<a name="l00495"></a>00495 }
<a name="l00496"></a>00496 E_INFO(<span class="stringliteral">"%s\n"</span>, line);
<a name="l00497"></a>00497
<a name="l00498"></a>00498 <span class="comment">/* Read header size, header */</span>
<a name="l00499"></a>00499 <span class="keywordflow">if</span> (fread(&n, <span class="keyword">sizeof</span>(n), 1, fp) != 1) {
<a name="l00500"></a>00500 E_ERROR_SYSTEM(<span class="stringliteral">"Failed to read header size from %s"</span>, file);
<a name="l00501"></a>00501 <span class="keywordflow">goto</span> error_out;
<a name="l00502"></a>00502 }
<a name="l00503"></a>00503 <span class="keywordflow">if</span> (do_swap) SWAP_INT32(&n);
<a name="l00504"></a>00504 <span class="keywordflow">if</span> (fread(line, <span class="keyword">sizeof</span>(<span class="keywordtype">char</span>), n, fp) != n) {
<a name="l00505"></a>00505 E_ERROR_SYSTEM(<span class="stringliteral">"Cannot read header"</span>);
<a name="l00506"></a>00506 <span class="keywordflow">goto</span> error_out;
<a name="l00507"></a>00507 }
<a name="l00508"></a>00508 <span class="keywordflow">if</span> (line[n - 1] != <span class="charliteral">'\0'</span>) {
<a name="l00509"></a>00509 E_ERROR(<span class="stringliteral">"Bad header in dump file\n"</span>);
<a name="l00510"></a>00510 <span class="keywordflow">goto</span> error_out;
<a name="l00511"></a>00511 }
<a name="l00512"></a>00512
<a name="l00513"></a>00513 <span class="comment">/* Read other header strings until string length = 0 */</span>
<a name="l00514"></a>00514 <span class="keywordflow">for</span> (;;) {
<a name="l00515"></a>00515 <span class="keywordflow">if</span> (fread(&n, <span class="keyword">sizeof</span>(n), 1, fp) != 1) {
<a name="l00516"></a>00516 E_ERROR_SYSTEM(<span class="stringliteral">"Failed to read header string size from %s"</span>, file);
<a name="l00517"></a>00517 <span class="keywordflow">goto</span> error_out;
<a name="l00518"></a>00518 }
<a name="l00519"></a>00519 <span class="keywordflow">if</span> (do_swap) SWAP_INT32(&n);
<a name="l00520"></a>00520 <span class="keywordflow">if</span> (n == 0)
<a name="l00521"></a>00521 <span class="keywordflow">break</span>;
<a name="l00522"></a>00522 <span class="keywordflow">if</span> (fread(line, <span class="keyword">sizeof</span>(<span class="keywordtype">char</span>), n, fp) != n) {
<a name="l00523"></a>00523 E_ERROR_SYSTEM(<span class="stringliteral">"Cannot read header"</span>);
<a name="l00524"></a>00524 <span class="keywordflow">goto</span> error_out;
<a name="l00525"></a>00525 }
<a name="l00526"></a>00526 <span class="comment">/* Look for a cluster count, if present */</span>
<a name="l00527"></a>00527 <span class="keywordflow">if</span> (!strncmp(line, <span class="stringliteral">"feature_count "</span>, strlen(<span class="stringliteral">"feature_count "</span>))) {
<a name="l00528"></a>00528 n_feat = atoi(line + strlen(<span class="stringliteral">"feature_count "</span>));
<a name="l00529"></a>00529 }
<a name="l00530"></a>00530 <span class="keywordflow">if</span> (!strncmp(line, <span class="stringliteral">"mixture_count "</span>, strlen(<span class="stringliteral">"mixture_count "</span>))) {
<a name="l00531"></a>00531 n_density = atoi(line + strlen(<span class="stringliteral">"mixture_count "</span>));
<a name="l00532"></a>00532 }
<a name="l00533"></a>00533 <span class="keywordflow">if</span> (!strncmp(line, <span class="stringliteral">"model_count "</span>, strlen(<span class="stringliteral">"model_count "</span>))) {
<a name="l00534"></a>00534 n_sen = atoi(line + strlen(<span class="stringliteral">"model_count "</span>));
<a name="l00535"></a>00535 }
<a name="l00536"></a>00536 <span class="keywordflow">if</span> (!strncmp(line, <span class="stringliteral">"cluster_count "</span>, strlen(<span class="stringliteral">"cluster_count "</span>))) {
<a name="l00537"></a>00537 n_clust = atoi(line + strlen(<span class="stringliteral">"cluster_count "</span>));
<a name="l00538"></a>00538 }
<a name="l00539"></a>00539 <span class="keywordflow">if</span> (!strncmp(line, <span class="stringliteral">"cluster_bits "</span>, strlen(<span class="stringliteral">"cluster_bits "</span>))) {
<a name="l00540"></a>00540 n_bits = atoi(line + strlen(<span class="stringliteral">"cluster_bits "</span>));
<a name="l00541"></a>00541 }
<a name="l00542"></a>00542 }
<a name="l00543"></a>00543
<a name="l00544"></a>00544 <span class="comment">/* Defaults for #rows, #columns in mixw array. */</span>
<a name="l00545"></a>00545 c = n_sen;
<a name="l00546"></a>00546 r = n_density;
<a name="l00547"></a>00547 <span class="keywordflow">if</span> (n_clust == 0) {
<a name="l00548"></a>00548 <span class="comment">/* Older mixw files have them here, and they might be padded. */</span>
<a name="l00549"></a>00549 <span class="keywordflow">if</span> (fread(&r, <span class="keyword">sizeof</span>(r), 1, fp) != 1) {
<a name="l00550"></a>00550 E_ERROR_SYSTEM(<span class="stringliteral">"Cannot read #rows"</span>);
<a name="l00551"></a>00551 <span class="keywordflow">goto</span> error_out;
<a name="l00552"></a>00552 }
<a name="l00553"></a>00553 <span class="keywordflow">if</span> (do_swap) SWAP_INT32(&r);
<a name="l00554"></a>00554 <span class="keywordflow">if</span> (fread(&c, <span class="keyword">sizeof</span>(c), 1, fp) != 1) {
<a name="l00555"></a>00555 E_ERROR_SYSTEM(<span class="stringliteral">"Cannot read #columns"</span>);
<a name="l00556"></a>00556 <span class="keywordflow">goto</span> error_out;
<a name="l00557"></a>00557 }
<a name="l00558"></a>00558 <span class="keywordflow">if</span> (do_swap) SWAP_INT32(&c);
<a name="l00559"></a>00559 E_INFO(<span class="stringliteral">"Rows: %d, Columns: %d\n"</span>, r, c);
<a name="l00560"></a>00560 }
<a name="l00561"></a>00561
<a name="l00562"></a>00562 <span class="keywordflow">if</span> (n_feat != s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a>) {
<a name="l00563"></a>00563 E_ERROR(<span class="stringliteral">"Number of feature streams mismatch: %d != %d\n"</span>,
<a name="l00564"></a>00564 n_feat, s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a>);
<a name="l00565"></a>00565 <span class="keywordflow">goto</span> error_out;
<a name="l00566"></a>00566 }
<a name="l00567"></a>00567 <span class="keywordflow">if</span> (n_density != s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac" title="Number gaussian densities in each codebook-feature stream.">n_density</a>) {
<a name="l00568"></a>00568 E_ERROR(<span class="stringliteral">"Number of densities mismatch: %d != %d\n"</span>,
<a name="l00569"></a>00569 n_density, s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac" title="Number gaussian densities in each codebook-feature stream.">n_density</a>);
<a name="l00570"></a>00570 <span class="keywordflow">goto</span> error_out;
<a name="l00571"></a>00571 }
<a name="l00572"></a>00572 <span class="keywordflow">if</span> (n_sen != s-><a class="code" href="structptm__mgau__s.html#ab0f6c452efe082383e906ac2a4f75de4" title="Number of senones.">n_sen</a>) {
<a name="l00573"></a>00573 E_ERROR(<span class="stringliteral">"Number of senones mismatch: %d != %d\n"</span>,
<a name="l00574"></a>00574 n_sen, s-><a class="code" href="structptm__mgau__s.html#ab0f6c452efe082383e906ac2a4f75de4" title="Number of senones.">n_sen</a>);
<a name="l00575"></a>00575 <span class="keywordflow">goto</span> error_out;
<a name="l00576"></a>00576 }
<a name="l00577"></a>00577
<a name="l00578"></a>00578 <span class="keywordflow">if</span> (!((n_clust == 0) || (n_clust == 15) || (n_clust == 16))) {
<a name="l00579"></a>00579 E_ERROR(<span class="stringliteral">"Cluster count must be 0, 15, or 16\n"</span>);
<a name="l00580"></a>00580 <span class="keywordflow">goto</span> error_out;
<a name="l00581"></a>00581 }
<a name="l00582"></a>00582 <span class="keywordflow">if</span> (n_clust == 15)
<a name="l00583"></a>00583 ++n_clust;
<a name="l00584"></a>00584
<a name="l00585"></a>00585 <span class="keywordflow">if</span> (!((n_bits == 8) || (n_bits == 4))) {
<a name="l00586"></a>00586 E_ERROR(<span class="stringliteral">"Cluster count must be 4 or 8\n"</span>);
<a name="l00587"></a>00587 <span class="keywordflow">goto</span> error_out;
<a name="l00588"></a>00588 }
<a name="l00589"></a>00589
<a name="l00590"></a>00590 <span class="keywordflow">if</span> (do_mmap) {
<a name="l00591"></a>00591 E_INFO(<span class="stringliteral">"Using memory-mapped I/O for senones\n"</span>);
<a name="l00592"></a>00592 }
<a name="l00593"></a>00593 offset = ftell(fp);
<a name="l00594"></a>00594 fseek(fp, 0, SEEK_END);
<a name="l00595"></a>00595 filesize = ftell(fp);
<a name="l00596"></a>00596 fseek(fp, offset, SEEK_SET);
<a name="l00597"></a>00597
<a name="l00598"></a>00598 <span class="comment">/* Allocate memory for pdfs (or memory map them) */</span>
<a name="l00599"></a>00599 <span class="keywordflow">if</span> (do_mmap) {
<a name="l00600"></a>00600 s->sendump_mmap = mmio_file_read(file);
<a name="l00601"></a>00601 <span class="comment">/* Get cluster codebook if any. */</span>
<a name="l00602"></a>00602 <span class="keywordflow">if</span> (n_clust) {
<a name="l00603"></a>00603 s->mixw_cb = ((uint8 *) mmio_file_ptr(s->sendump_mmap)) + offset;
<a name="l00604"></a>00604 offset += n_clust;
<a name="l00605"></a>00605 }
<a name="l00606"></a>00606 }
<a name="l00607"></a>00607 <span class="keywordflow">else</span> {
<a name="l00608"></a>00608 <span class="comment">/* Get cluster codebook if any. */</span>
<a name="l00609"></a>00609 <span class="keywordflow">if</span> (n_clust) {
<a name="l00610"></a>00610 s->mixw_cb = ckd_calloc(1, n_clust);
<a name="l00611"></a>00611 <span class="keywordflow">if</span> (fread(s->mixw_cb, 1, n_clust, fp) != (<span class="keywordtype">size_t</span>) n_clust) {
<a name="l00612"></a>00612 E_ERROR(<span class="stringliteral">"Failed to read %d bytes from sendump\n"</span>, n_clust);
<a name="l00613"></a>00613 <span class="keywordflow">goto</span> error_out;
<a name="l00614"></a>00614 }
<a name="l00615"></a>00615 }
<a name="l00616"></a>00616 }
<a name="l00617"></a>00617
<a name="l00618"></a>00618 <span class="comment">/* Set up pointers, or read, or whatever */</span>
<a name="l00619"></a>00619 <span class="keywordflow">if</span> (s->sendump_mmap) {
<a name="l00620"></a>00620 s-><a class="code" href="structptm__mgau__s.html#af0898f6d5b5b863901a4a4858a10d32a" title="Mixture weight distributions by feature, codeword, senone.">mixw</a> = ckd_calloc_2d(n_feat, n_density, <span class="keyword">sizeof</span>(*s-><a class="code" href="structptm__mgau__s.html#af0898f6d5b5b863901a4a4858a10d32a" title="Mixture weight distributions by feature, codeword, senone.">mixw</a>));
<a name="l00621"></a>00621 <span class="keywordflow">for</span> (n = 0; n < n_feat; n++) {
<a name="l00622"></a>00622 <span class="keywordtype">int</span> step = c;
<a name="l00623"></a>00623 <span class="keywordflow">if</span> (n_bits == 4)
<a name="l00624"></a>00624 step = (step + 1) / 2;
<a name="l00625"></a>00625 <span class="keywordflow">for</span> (i = 0; i < r; i++) {
<a name="l00626"></a>00626 s-><a class="code" href="structptm__mgau__s.html#af0898f6d5b5b863901a4a4858a10d32a" title="Mixture weight distributions by feature, codeword, senone.">mixw</a>[n][i] = ((uint8 *) mmio_file_ptr(s->sendump_mmap)) + offset;
<a name="l00627"></a>00627 offset += step;
<a name="l00628"></a>00628 }
<a name="l00629"></a>00629 }
<a name="l00630"></a>00630 }
<a name="l00631"></a>00631 <span class="keywordflow">else</span> {
<a name="l00632"></a>00632 s-><a class="code" href="structptm__mgau__s.html#af0898f6d5b5b863901a4a4858a10d32a" title="Mixture weight distributions by feature, codeword, senone.">mixw</a> = ckd_calloc_3d(n_feat, n_density, n_sen, <span class="keyword">sizeof</span>(***s-><a class="code" href="structptm__mgau__s.html#af0898f6d5b5b863901a4a4858a10d32a" title="Mixture weight distributions by feature, codeword, senone.">mixw</a>));
<a name="l00633"></a>00633 <span class="comment">/* Read pdf values and ids */</span>
<a name="l00634"></a>00634 <span class="keywordflow">for</span> (n = 0; n < n_feat; n++) {
<a name="l00635"></a>00635 <span class="keywordtype">int</span> step = c;
<a name="l00636"></a>00636 <span class="keywordflow">if</span> (n_bits == 4)
<a name="l00637"></a>00637 step = (step + 1) / 2;
<a name="l00638"></a>00638 <span class="keywordflow">for</span> (i = 0; i < r; i++) {
<a name="l00639"></a>00639 <span class="keywordflow">if</span> (fread(s-><a class="code" href="structptm__mgau__s.html#af0898f6d5b5b863901a4a4858a10d32a" title="Mixture weight distributions by feature, codeword, senone.">mixw</a>[n][i], <span class="keyword">sizeof</span>(***s-><a class="code" href="structptm__mgau__s.html#af0898f6d5b5b863901a4a4858a10d32a" title="Mixture weight distributions by feature, codeword, senone.">mixw</a>), step, fp)
<a name="l00640"></a>00640 != (size_t) step) {
<a name="l00641"></a>00641 E_ERROR(<span class="stringliteral">"Failed to read %d bytes from sendump\n"</span>, step);
<a name="l00642"></a>00642 <span class="keywordflow">goto</span> error_out;
<a name="l00643"></a>00643 }
<a name="l00644"></a>00644 }
<a name="l00645"></a>00645 }
<a name="l00646"></a>00646 }
<a name="l00647"></a>00647
<a name="l00648"></a>00648 fclose(fp);
<a name="l00649"></a>00649 <span class="keywordflow">return</span> 0;
<a name="l00650"></a>00650 error_out:
<a name="l00651"></a>00651 fclose(fp);
<a name="l00652"></a>00652 <span class="keywordflow">return</span> -1;
<a name="l00653"></a>00653 }
<a name="l00654"></a>00654
<a name="l00655"></a>00655 <span class="keyword">static</span> int32
<a name="l00656"></a>00656 read_mixw(<a class="code" href="structptm__mgau__s.html">ptm_mgau_t</a> * s, <span class="keywordtype">char</span> <span class="keyword">const</span> *file_name, <span class="keywordtype">double</span> SmoothMin)
<a name="l00657"></a>00657 {
<a name="l00658"></a>00658 <span class="keywordtype">char</span> **argname, **argval;
<a name="l00659"></a>00659 <span class="keywordtype">char</span> eofchk;
<a name="l00660"></a>00660 FILE *fp;
<a name="l00661"></a>00661 int32 byteswap, chksum_present;
<a name="l00662"></a>00662 uint32 chksum;
<a name="l00663"></a>00663 float32 *pdf;
<a name="l00664"></a>00664 int32 i, f, c, n;
<a name="l00665"></a>00665 int32 n_sen;
<a name="l00666"></a>00666 int32 n_feat;
<a name="l00667"></a>00667 int32 n_comp;
<a name="l00668"></a>00668 int32 n_err;
<a name="l00669"></a>00669
<a name="l00670"></a>00670 E_INFO(<span class="stringliteral">"Reading mixture weights file '%s'\n"</span>, file_name);
<a name="l00671"></a>00671
<a name="l00672"></a>00672 <span class="keywordflow">if</span> ((fp = fopen(file_name, <span class="stringliteral">"rb"</span>)) == NULL)
<a name="l00673"></a>00673 E_FATAL(<span class="stringliteral">"Failed to open mixture file '%s' for reading: %s\n"</span>, file_name, strerror(errno));
<a name="l00674"></a>00674
<a name="l00675"></a>00675 <span class="comment">/* Read header, including argument-value info and 32-bit byteorder magic */</span>
<a name="l00676"></a>00676 <span class="keywordflow">if</span> (bio_readhdr(fp, &argname, &argval, &byteswap) < 0)
<a name="l00677"></a>00677 E_FATAL(<span class="stringliteral">"Failed to read header from '%s'\n"</span>, file_name);
<a name="l00678"></a>00678
<a name="l00679"></a>00679 <span class="comment">/* Parse argument-value list */</span>
<a name="l00680"></a>00680 chksum_present = 0;
<a name="l00681"></a>00681 <span class="keywordflow">for</span> (i = 0; argname[i]; i++) {
<a name="l00682"></a>00682 <span class="keywordflow">if</span> (strcmp(argname[i], <span class="stringliteral">"version"</span>) == 0) {
<a name="l00683"></a>00683 <span class="keywordflow">if</span> (strcmp(argval[i], MGAU_MIXW_VERSION) != 0)
<a name="l00684"></a>00684 E_WARN(<span class="stringliteral">"Version mismatch(%s): %s, expecting %s\n"</span>,
<a name="l00685"></a>00685 file_name, argval[i], MGAU_MIXW_VERSION);
<a name="l00686"></a>00686 }
<a name="l00687"></a>00687 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (strcmp(argname[i], <span class="stringliteral">"chksum0"</span>) == 0) {
<a name="l00688"></a>00688 chksum_present = 1; <span class="comment">/* Ignore the associated value */</span>
<a name="l00689"></a>00689 }
<a name="l00690"></a>00690 }
<a name="l00691"></a>00691 bio_hdrarg_free(argname, argval);
<a name="l00692"></a>00692 argname = argval = NULL;
<a name="l00693"></a>00693
<a name="l00694"></a>00694 chksum = 0;
<a name="l00695"></a>00695
<a name="l00696"></a>00696 <span class="comment">/* Read #senones, #features, #codewords, arraysize */</span>
<a name="l00697"></a>00697 <span class="keywordflow">if</span> ((bio_fread(&n_sen, <span class="keyword">sizeof</span>(int32), 1, fp, byteswap, &chksum) != 1)
<a name="l00698"></a>00698 || (bio_fread(&n_feat, <span class="keyword">sizeof</span>(int32), 1, fp, byteswap, &chksum) !=
<a name="l00699"></a>00699 1)
<a name="l00700"></a>00700 || (bio_fread(&n_comp, <span class="keyword">sizeof</span>(int32), 1, fp, byteswap, &chksum) !=
<a name="l00701"></a>00701 1)
<a name="l00702"></a>00702 || (bio_fread(&n, <span class="keyword">sizeof</span>(int32), 1, fp, byteswap, &chksum) != 1)) {
<a name="l00703"></a>00703 E_FATAL(<span class="stringliteral">"bio_fread(%s) (arraysize) failed\n"</span>, file_name);
<a name="l00704"></a>00704 }
<a name="l00705"></a>00705 <span class="keywordflow">if</span> (n_feat != s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a>)
<a name="l00706"></a>00706 E_FATAL(<span class="stringliteral">"#Features streams(%d) != %d\n"</span>, n_feat, s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a>);
<a name="l00707"></a>00707 <span class="keywordflow">if</span> (n != n_sen * n_feat * n_comp) {
<a name="l00708"></a>00708 E_FATAL
<a name="l00709"></a>00709 (<span class="stringliteral">"%s: #float32s(%d) doesn't match header dimensions: %d x %d x %d\n"</span>,
<a name="l00710"></a>00710 file_name, i, n_sen, n_feat, n_comp);
<a name="l00711"></a>00711 }
<a name="l00712"></a>00712
<a name="l00713"></a>00713 <span class="comment">/* n_sen = number of mixture weights per codeword, which is</span>
<a name="l00714"></a>00714 <span class="comment"> * fixed at the number of senones since we have only one codebook.</span>
<a name="l00715"></a>00715 <span class="comment"> */</span>
<a name="l00716"></a>00716 s-><a class="code" href="structptm__mgau__s.html#ab0f6c452efe082383e906ac2a4f75de4" title="Number of senones.">n_sen</a> = n_sen;
<a name="l00717"></a>00717
<a name="l00718"></a>00718 <span class="comment">/* Quantized mixture weight arrays. */</span>
<a name="l00719"></a>00719 s-><a class="code" href="structptm__mgau__s.html#af0898f6d5b5b863901a4a4858a10d32a" title="Mixture weight distributions by feature, codeword, senone.">mixw</a> = ckd_calloc_3d(s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a>, s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#ab5104d8fa59bc94b12b36104dd4c19ac" title="Number gaussian densities in each codebook-feature stream.">n_density</a>,
<a name="l00720"></a>00720 n_sen, <span class="keyword">sizeof</span>(***s-><a class="code" href="structptm__mgau__s.html#af0898f6d5b5b863901a4a4858a10d32a" title="Mixture weight distributions by feature, codeword, senone.">mixw</a>));
<a name="l00721"></a>00721
<a name="l00722"></a>00722 <span class="comment">/* Temporary structure to read in floats before conversion to (int32) logs3 */</span>
<a name="l00723"></a>00723 pdf = (float32 *) ckd_calloc(n_comp, <span class="keyword">sizeof</span>(float32));
<a name="l00724"></a>00724
<a name="l00725"></a>00725 <span class="comment">/* Read senone probs data, normalize, floor, convert to logs3, truncate to 8 bits */</span>
<a name="l00726"></a>00726 n_err = 0;
<a name="l00727"></a>00727 <span class="keywordflow">for</span> (i = 0; i < n_sen; i++) {
<a name="l00728"></a>00728 <span class="keywordflow">for</span> (f = 0; f < n_feat; f++) {
<a name="l00729"></a>00729 <span class="keywordflow">if</span> (bio_fread((<span class="keywordtype">void</span> *) pdf, <span class="keyword">sizeof</span>(float32),
<a name="l00730"></a>00730 n_comp, fp, byteswap, &chksum) != n_comp) {
<a name="l00731"></a>00731 E_FATAL(<span class="stringliteral">"bio_fread(%s) (arraydata) failed\n"</span>, file_name);
<a name="l00732"></a>00732 }
<a name="l00733"></a>00733
<a name="l00734"></a>00734 <span class="comment">/* Normalize and floor */</span>
<a name="l00735"></a>00735 <span class="keywordflow">if</span> (vector_sum_norm(pdf, n_comp) <= 0.0)
<a name="l00736"></a>00736 n_err++;
<a name="l00737"></a>00737 vector_floor(pdf, n_comp, SmoothMin);
<a name="l00738"></a>00738 vector_sum_norm(pdf, n_comp);
<a name="l00739"></a>00739
<a name="l00740"></a>00740 <span class="comment">/* Convert to LOG, quantize, and transpose */</span>
<a name="l00741"></a>00741 <span class="keywordflow">for</span> (c = 0; c < n_comp; c++) {
<a name="l00742"></a>00742 int32 qscr;
<a name="l00743"></a>00743
<a name="l00744"></a>00744 qscr = -logmath_log(s->lmath_8b, pdf[c]);
<a name="l00745"></a>00745 <span class="keywordflow">if</span> ((qscr > <a class="code" href="tied__mgau__common_8h.html#ad739d757ed78293c18dc2386fd3b750e" title="Maximum negated mixture weight value.">MAX_NEG_MIXW</a>) || (qscr < 0))
<a name="l00746"></a>00746 qscr = <a class="code" href="tied__mgau__common_8h.html#ad739d757ed78293c18dc2386fd3b750e" title="Maximum negated mixture weight value.">MAX_NEG_MIXW</a>;
<a name="l00747"></a>00747 s-><a class="code" href="structptm__mgau__s.html#af0898f6d5b5b863901a4a4858a10d32a" title="Mixture weight distributions by feature, codeword, senone.">mixw</a>[f][c][i] = qscr;
<a name="l00748"></a>00748 }
<a name="l00749"></a>00749 }
<a name="l00750"></a>00750 }
<a name="l00751"></a>00751 <span class="keywordflow">if</span> (n_err > 0)
<a name="l00752"></a>00752 E_WARN(<span class="stringliteral">"Weight normalization failed for %d senones\n"</span>, n_err);
<a name="l00753"></a>00753
<a name="l00754"></a>00754 ckd_free(pdf);
<a name="l00755"></a>00755
<a name="l00756"></a>00756 <span class="keywordflow">if</span> (chksum_present)
<a name="l00757"></a>00757 bio_verify_chksum(fp, byteswap, chksum);
<a name="l00758"></a>00758
<a name="l00759"></a>00759 <span class="keywordflow">if</span> (fread(&eofchk, 1, 1, fp) == 1)
<a name="l00760"></a>00760 E_FATAL(<span class="stringliteral">"More data than expected in %s\n"</span>, file_name);
<a name="l00761"></a>00761
<a name="l00762"></a>00762 fclose(fp);
<a name="l00763"></a>00763
<a name="l00764"></a>00764 E_INFO(<span class="stringliteral">"Read %d x %d x %d mixture weights\n"</span>, n_sen, n_feat, n_comp);
<a name="l00765"></a>00765 <span class="keywordflow">return</span> n_sen;
<a name="l00766"></a>00766 }
<a name="l00767"></a>00767
<a name="l00768"></a>00768 <a class="code" href="structps__mgau__s.html">ps_mgau_t</a> *
<a name="l00769"></a>00769 ptm_mgau_init(<a class="code" href="structacmod__s.html" title="Acoustic model structure.">acmod_t</a> *acmod, <a class="code" href="structbin__mdef__s.html">bin_mdef_t</a> *mdef)
<a name="l00770"></a>00770 {
<a name="l00771"></a>00771 <a class="code" href="structptm__mgau__s.html">ptm_mgau_t</a> *s;
<a name="l00772"></a>00772 <a class="code" href="structps__mgau__s.html">ps_mgau_t</a> *ps;
<a name="l00773"></a>00773 <span class="keywordtype">char</span> <span class="keyword">const</span> *sendump_path;
<a name="l00774"></a>00774 <span class="keywordtype">int</span> i;
<a name="l00775"></a>00775
<a name="l00776"></a>00776 s = ckd_calloc(1, <span class="keyword">sizeof</span>(*s));
<a name="l00777"></a>00777 s-><a class="code" href="structptm__mgau__s.html#aa9cd83ce89052bd6d112ecff54d118f9" title="Configuration parameters.">config</a> = acmod-><a class="code" href="structacmod__s.html#a3563f4d0bdc48d3ee140b9e28806279d" title="Configuration.">config</a>;
<a name="l00778"></a>00778
<a name="l00779"></a>00779 s->lmath = logmath_retain(acmod-><a class="code" href="structacmod__s.html#a9de7e8ac9c0c4df3d2a9ad5406787f3c" title="Log-math computation.">lmath</a>);
<a name="l00780"></a>00780 <span class="comment">/* Log-add table. */</span>
<a name="l00781"></a>00781 s->lmath_8b = logmath_init(logmath_get_base(acmod-><a class="code" href="structacmod__s.html#a9de7e8ac9c0c4df3d2a9ad5406787f3c" title="Log-math computation.">lmath</a>), <a class="code" href="hmm_8h.html#af94da16e3e5b550b9be05b0f07402cc7" title="Shift count for senone scores.">SENSCR_SHIFT</a>, TRUE);
<a name="l00782"></a>00782 <span class="keywordflow">if</span> (s->lmath_8b == NULL)
<a name="l00783"></a>00783 <span class="keywordflow">goto</span> error_out;
<a name="l00784"></a>00784 <span class="comment">/* Ensure that it is only 8 bits wide so that fast_logmath_add() works. */</span>
<a name="l00785"></a>00785 <span class="keywordflow">if</span> (logmath_get_width(s->lmath_8b) != 1) {
<a name="l00786"></a>00786 E_ERROR(<span class="stringliteral">"Log base %f is too small to represent add table in 8 bits\n"</span>,
<a name="l00787"></a>00787 logmath_get_base(s->lmath_8b));
<a name="l00788"></a>00788 <span class="keywordflow">goto</span> error_out;
<a name="l00789"></a>00789 }
<a name="l00790"></a>00790
<a name="l00791"></a>00791 <span class="comment">/* Read means and variances. */</span>
<a name="l00792"></a>00792 <span class="keywordflow">if</span> ((s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a> = gauden_init(cmd_ln_str_r(s-><a class="code" href="structptm__mgau__s.html#aa9cd83ce89052bd6d112ecff54d118f9" title="Configuration parameters.">config</a>, <span class="stringliteral">"-mean"</span>),
<a name="l00793"></a>00793 cmd_ln_str_r(s-><a class="code" href="structptm__mgau__s.html#aa9cd83ce89052bd6d112ecff54d118f9" title="Configuration parameters.">config</a>, <span class="stringliteral">"-var"</span>),
<a name="l00794"></a>00794 cmd_ln_float32_r(s-><a class="code" href="structptm__mgau__s.html#aa9cd83ce89052bd6d112ecff54d118f9" title="Configuration parameters.">config</a>, <span class="stringliteral">"-varfloor"</span>),
<a name="l00795"></a>00795 s->lmath)) == NULL)
<a name="l00796"></a>00796 <span class="keywordflow">goto</span> error_out;
<a name="l00797"></a>00797 <span class="comment">/* We only support 256 codebooks or less (like 640k or 2GB, this</span>
<a name="l00798"></a>00798 <span class="comment"> * should be enough for anyone) */</span>
<a name="l00799"></a>00799 <span class="keywordflow">if</span> (s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a> > 256) {
<a name="l00800"></a>00800 E_INFO(<span class="stringliteral">"Number of codebooks exceeds 256: %d\n"</span>, s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a>);
<a name="l00801"></a>00801 <span class="keywordflow">goto</span> error_out;
<a name="l00802"></a>00802 }
<a name="l00803"></a>00803 <span class="keywordflow">if</span> (s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a> != bin_mdef_n_ciphone(mdef)) {
<a name="l00804"></a>00804 E_INFO(<span class="stringliteral">"Number of codebooks doesn't match number of ciphones, doesn't look like PTM: %d %d\n"</span>, s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a>, bin_mdef_n_ciphone(mdef));
<a name="l00805"></a>00805 <span class="keywordflow">goto</span> error_out;
<a name="l00806"></a>00806 }
<a name="l00807"></a>00807 <span class="comment">/* Verify n_feat and veclen, against acmod. */</span>
<a name="l00808"></a>00808 <span class="keywordflow">if</span> (s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a> != feat_dimension1(acmod-><a class="code" href="structacmod__s.html#a37ec6c2b1f3ada764842e08481239b34" title="Dynamic feature computation.">fcb</a>)) {
<a name="l00809"></a>00809 E_ERROR(<span class="stringliteral">"Number of streams does not match: %d != %d\n"</span>,
<a name="l00810"></a>00810 s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a>, feat_dimension(acmod-><a class="code" href="structacmod__s.html#a37ec6c2b1f3ada764842e08481239b34" title="Dynamic feature computation.">fcb</a>));
<a name="l00811"></a>00811 <span class="keywordflow">goto</span> error_out;
<a name="l00812"></a>00812 }
<a name="l00813"></a>00813 <span class="keywordflow">for</span> (i = 0; i < s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a>; ++i) {
<a name="l00814"></a>00814 <span class="keywordflow">if</span> (s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c" title="feature length for each feature">featlen</a>[i] != feat_dimension2(acmod-><a class="code" href="structacmod__s.html#a37ec6c2b1f3ada764842e08481239b34" title="Dynamic feature computation.">fcb</a>, i)) {
<a name="l00815"></a>00815 E_ERROR(<span class="stringliteral">"Dimension of stream %d does not match: %d != %d\n"</span>,
<a name="l00816"></a>00816 s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#aca099d830de926e628ac0b523046b32c" title="feature length for each feature">featlen</a>[i], feat_dimension2(acmod-><a class="code" href="structacmod__s.html#a37ec6c2b1f3ada764842e08481239b34" title="Dynamic feature computation.">fcb</a>, i));
<a name="l00817"></a>00817 <span class="keywordflow">goto</span> error_out;
<a name="l00818"></a>00818 }
<a name="l00819"></a>00819 }
<a name="l00820"></a>00820 <span class="comment">/* Read mixture weights. */</span>
<a name="l00821"></a>00821 <span class="keywordflow">if</span> ((sendump_path = cmd_ln_str_r(s-><a class="code" href="structptm__mgau__s.html#aa9cd83ce89052bd6d112ecff54d118f9" title="Configuration parameters.">config</a>, <span class="stringliteral">"-sendump"</span>))) {
<a name="l00822"></a>00822 <span class="keywordflow">if</span> (read_sendump(s, acmod-><a class="code" href="structacmod__s.html#a351548ff5547c29b4a684e10434a51dd" title="Model definition.">mdef</a>, sendump_path) < 0) {
<a name="l00823"></a>00823 <span class="keywordflow">goto</span> error_out;
<a name="l00824"></a>00824 }
<a name="l00825"></a>00825 }
<a name="l00826"></a>00826 <span class="keywordflow">else</span> {
<a name="l00827"></a>00827 <span class="keywordflow">if</span> (read_mixw(s, cmd_ln_str_r(s-><a class="code" href="structptm__mgau__s.html#aa9cd83ce89052bd6d112ecff54d118f9" title="Configuration parameters.">config</a>, <span class="stringliteral">"-mixw"</span>),
<a name="l00828"></a>00828 cmd_ln_float32_r(s-><a class="code" href="structptm__mgau__s.html#aa9cd83ce89052bd6d112ecff54d118f9" title="Configuration parameters.">config</a>, <span class="stringliteral">"-mixwfloor"</span>)) < 0) {
<a name="l00829"></a>00829 <span class="keywordflow">goto</span> error_out;
<a name="l00830"></a>00830 }
<a name="l00831"></a>00831 }
<a name="l00832"></a>00832 s->ds_ratio = cmd_ln_int32_r(s-><a class="code" href="structptm__mgau__s.html#aa9cd83ce89052bd6d112ecff54d118f9" title="Configuration parameters.">config</a>, <span class="stringliteral">"-ds"</span>);
<a name="l00833"></a>00833 s->max_topn = cmd_ln_int32_r(s-><a class="code" href="structptm__mgau__s.html#aa9cd83ce89052bd6d112ecff54d118f9" title="Configuration parameters.">config</a>, <span class="stringliteral">"-topn"</span>);
<a name="l00834"></a>00834 E_INFO(<span class="stringliteral">"Maximum top-N: %d\n"</span>, s->max_topn);
<a name="l00835"></a>00835
<a name="l00836"></a>00836 <span class="comment">/* Assume mapping of senones to their base phones, though this</span>
<a name="l00837"></a>00837 <span class="comment"> * will become more flexible in the future. */</span>
<a name="l00838"></a>00838 s-><a class="code" href="structptm__mgau__s.html#a5e677255165b8abda63dd1d6dbed1be7" title="Senone to codebook mapping.">sen2cb</a> = ckd_calloc(s-><a class="code" href="structptm__mgau__s.html#ab0f6c452efe082383e906ac2a4f75de4" title="Number of senones.">n_sen</a>, <span class="keyword">sizeof</span>(*s-><a class="code" href="structptm__mgau__s.html#a5e677255165b8abda63dd1d6dbed1be7" title="Senone to codebook mapping.">sen2cb</a>));
<a name="l00839"></a>00839 <span class="keywordflow">for</span> (i = 0; i < s-><a class="code" href="structptm__mgau__s.html#ab0f6c452efe082383e906ac2a4f75de4" title="Number of senones.">n_sen</a>; ++i)
<a name="l00840"></a>00840 s-><a class="code" href="structptm__mgau__s.html#a5e677255165b8abda63dd1d6dbed1be7" title="Senone to codebook mapping.">sen2cb</a>[i] = bin_mdef_sen2cimap(acmod-><a class="code" href="structacmod__s.html#a351548ff5547c29b4a684e10434a51dd" title="Model definition.">mdef</a>, i);
<a name="l00841"></a>00841
<a name="l00842"></a>00842 <span class="comment">/* Allocate fast-match history buffers. We need enough for the</span>
<a name="l00843"></a>00843 <span class="comment"> * phoneme lookahead window, plus the current frame, plus one for</span>
<a name="l00844"></a>00844 <span class="comment"> * good measure? (FIXME: I don't remember why) */</span>
<a name="l00845"></a>00845 s-><a class="code" href="structptm__mgau__s.html#ac491c223199ed5374dfb13fc41854601" title="Number of past frames tracked.">n_fast_hist</a> = cmd_ln_int32_r(s-><a class="code" href="structptm__mgau__s.html#aa9cd83ce89052bd6d112ecff54d118f9" title="Configuration parameters.">config</a>, <span class="stringliteral">"-pl_window"</span>) + 2;
<a name="l00846"></a>00846 s-><a class="code" href="structptm__mgau__s.html#a68c75460ebffecc786d7eb2840ed7631" title="Fast evaluation info for past frames.">hist</a> = ckd_calloc(s-><a class="code" href="structptm__mgau__s.html#ac491c223199ed5374dfb13fc41854601" title="Number of past frames tracked.">n_fast_hist</a>, <span class="keyword">sizeof</span>(*s-><a class="code" href="structptm__mgau__s.html#a68c75460ebffecc786d7eb2840ed7631" title="Fast evaluation info for past frames.">hist</a>));
<a name="l00847"></a>00847 <span class="comment">/* s->f will be a rotating pointer into s->hist. */</span>
<a name="l00848"></a>00848 s-><a class="code" href="structptm__mgau__s.html#aad0c43234e33c2307ce0df2ddb1c05c9" title="Fast eval info for current frame.">f</a> = s-><a class="code" href="structptm__mgau__s.html#a68c75460ebffecc786d7eb2840ed7631" title="Fast evaluation info for past frames.">hist</a>;
<a name="l00849"></a>00849 <span class="keywordflow">for</span> (i = 0; i < s-><a class="code" href="structptm__mgau__s.html#ac491c223199ed5374dfb13fc41854601" title="Number of past frames tracked.">n_fast_hist</a>; ++i) {
<a name="l00850"></a>00850 <span class="keywordtype">int</span> j, k, m;
<a name="l00851"></a>00851 <span class="comment">/* Top-N codewords for every codebook and feature. */</span>
<a name="l00852"></a>00852 s-><a class="code" href="structptm__mgau__s.html#a68c75460ebffecc786d7eb2840ed7631" title="Fast evaluation info for past frames.">hist</a>[i].<a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a> = ckd_calloc_3d(s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a>, s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a>,
<a name="l00853"></a>00853 s->max_topn, <span class="keyword">sizeof</span>(<a class="code" href="structptm__topn__s.html">ptm_topn_t</a>));
<a name="l00854"></a>00854 <span class="comment">/* Initialize them to sane (yet arbitrary) defaults. */</span>
<a name="l00855"></a>00855 <span class="keywordflow">for</span> (j = 0; j < s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a>; ++j) {
<a name="l00856"></a>00856 <span class="keywordflow">for</span> (k = 0; k < s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#a6dea221962b4a278dbae4806925a7be0" title="Number feature streams in each codebook.">n_feat</a>; ++k) {
<a name="l00857"></a>00857 <span class="keywordflow">for</span> (m = 0; m < s->max_topn; ++m) {
<a name="l00858"></a>00858 s-><a class="code" href="structptm__mgau__s.html#a68c75460ebffecc786d7eb2840ed7631" title="Fast evaluation info for past frames.">hist</a>[i].<a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[j][k][m].<a class="code" href="structptm__topn__s.html#a8a46095488efefa2714214a7a74117b1" title="Codeword index.">cw</a> = m;
<a name="l00859"></a>00859 s-><a class="code" href="structptm__mgau__s.html#a68c75460ebffecc786d7eb2840ed7631" title="Fast evaluation info for past frames.">hist</a>[i].<a class="code" href="structptm__fast__eval__s.html#a95e382028ed8a0af8b56bfcb797af96b" title="Top-N for each codebook (mgau x feature x topn)">topn</a>[j][k][m].<a class="code" href="structptm__topn__s.html#aa2080ad2d4f038cdbfbf46bf90884f56" title="Score.">score</a> = WORST_DIST;
<a name="l00860"></a>00860 }
<a name="l00861"></a>00861 }
<a name="l00862"></a>00862 }
<a name="l00863"></a>00863 <span class="comment">/* Active codebook mapping (just codebook, not features,</span>
<a name="l00864"></a>00864 <span class="comment"> at least not yet) */</span>
<a name="l00865"></a>00865 s-><a class="code" href="structptm__mgau__s.html#a68c75460ebffecc786d7eb2840ed7631" title="Fast evaluation info for past frames.">hist</a>[i].<a class="code" href="structptm__fast__eval__s.html#ac5d3b21239d567b395015d7c4fea157c" title="Set of active codebooks.">mgau_active</a> = bitvec_alloc(s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a>);
<a name="l00866"></a>00866 <span class="comment">/* Start with them all on, prune them later. */</span>
<a name="l00867"></a>00867 bitvec_set_all(s-><a class="code" href="structptm__mgau__s.html#a68c75460ebffecc786d7eb2840ed7631" title="Fast evaluation info for past frames.">hist</a>[i].<a class="code" href="structptm__fast__eval__s.html#ac5d3b21239d567b395015d7c4fea157c" title="Set of active codebooks.">mgau_active</a>, s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>-><a class="code" href="structgauden__t.html#af15df11bd2f3ab0290e0a33ca15c836c" title="Number codebooks.">n_mgau</a>);
<a name="l00868"></a>00868 }
<a name="l00869"></a>00869
<a name="l00870"></a>00870 ps = (<a class="code" href="structps__mgau__s.html">ps_mgau_t</a> *)s;
<a name="l00871"></a>00871 ps-><a class="code" href="structps__mgau__s.html#a931f7cbf334b8ed50b0e1c2803a10c67" title="vtable of mgau functions.">vt</a> = &ptm_mgau_funcs;
<a name="l00872"></a>00872 <span class="keywordflow">return</span> ps;
<a name="l00873"></a>00873 error_out:
<a name="l00874"></a>00874 ptm_mgau_free(ps_mgau_base(s));
<a name="l00875"></a>00875 <span class="keywordflow">return</span> NULL;
<a name="l00876"></a>00876 }
<a name="l00877"></a>00877
<a name="l00878"></a>00878 <span class="keywordtype">int</span>
<a name="l00879"></a>00879 ptm_mgau_mllr_transform(<a class="code" href="structps__mgau__s.html">ps_mgau_t</a> *ps,
<a name="l00880"></a>00880 <a class="code" href="structps__mllr__s.html" title="Feature space linear transform structure.">ps_mllr_t</a> *mllr)
<a name="l00881"></a>00881 {
<a name="l00882"></a>00882 <a class="code" href="structptm__mgau__s.html">ptm_mgau_t</a> *s = (<a class="code" href="structptm__mgau__s.html">ptm_mgau_t</a> *)ps;
<a name="l00883"></a>00883 <span class="keywordflow">return</span> gauden_mllr_transform(s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>, mllr, s-><a class="code" href="structptm__mgau__s.html#aa9cd83ce89052bd6d112ecff54d118f9" title="Configuration parameters.">config</a>);
<a name="l00884"></a>00884 }
<a name="l00885"></a>00885
<a name="l00886"></a>00886 <span class="keywordtype">void</span>
<a name="l00887"></a>00887 ptm_mgau_free(<a class="code" href="structps__mgau__s.html">ps_mgau_t</a> *ps)
<a name="l00888"></a>00888 {
<a name="l00889"></a>00889 <a class="code" href="structptm__mgau__s.html">ptm_mgau_t</a> *s = (<a class="code" href="structptm__mgau__s.html">ptm_mgau_t</a> *)ps;
<a name="l00890"></a>00890
<a name="l00891"></a>00891 logmath_free(s->lmath);
<a name="l00892"></a>00892 logmath_free(s->lmath_8b);
<a name="l00893"></a>00893 <span class="keywordflow">if</span> (s->sendump_mmap) {
<a name="l00894"></a>00894 ckd_free_2d(s-><a class="code" href="structptm__mgau__s.html#af0898f6d5b5b863901a4a4858a10d32a" title="Mixture weight distributions by feature, codeword, senone.">mixw</a>);
<a name="l00895"></a>00895 mmio_file_unmap(s->sendump_mmap);
<a name="l00896"></a>00896 }
<a name="l00897"></a>00897 <span class="keywordflow">else</span> {
<a name="l00898"></a>00898 ckd_free_3d(s-><a class="code" href="structptm__mgau__s.html#af0898f6d5b5b863901a4a4858a10d32a" title="Mixture weight distributions by feature, codeword, senone.">mixw</a>);
<a name="l00899"></a>00899 }
<a name="l00900"></a>00900 ckd_free(s-><a class="code" href="structptm__mgau__s.html#a5e677255165b8abda63dd1d6dbed1be7" title="Senone to codebook mapping.">sen2cb</a>);
<a name="l00901"></a>00901 gauden_free(s-><a class="code" href="structptm__mgau__s.html#adfba8a590e8d71812ea8082f485e7ad3" title="Set of Gaussians.">g</a>);
<a name="l00902"></a>00902 ckd_free(s);
<a name="l00903"></a>00903 }
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><b>ptm_mgau.c</b> </li>
<li class="footer">Generated on Wed Apr 20 2011 for PocketSphinx by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </li>
</ul>
</div>
</body>
</html>
