sum-matrices.cc
1.9 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
// bin/sum-matrices.cc
// Copyright 2012 Johns Hopkins University (Author: Daniel Povey)
// See ../../COPYING for clarification regarding multiple authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// THIS CODE IS PROVIDED *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
// WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
// MERCHANTABLITY OR NON-INFRINGEMENT.
// See the Apache 2 License for the specific language governing permissions and
// limitations under the License.
#include "base/kaldi-common.h"
#include "util/common-utils.h"
int main(int argc, char *argv[]) {
using namespace kaldi;
typedef kaldi::int32 int32;
try {
const char *usage =
"Sum matrices, e.g. stats for fMPE training\n"
"Usage: sum-matrices [options] <mat-out> <mat-in1> <mat-in2> ...\n"
"e.g.:\n"
" sum-matrices mat 1.mat 2.mat 3.mat\n";
ParseOptions po(usage);
bool binary = true;
po.Register("binary", &binary, "Write output in binary mode");
po.Read(argc, argv);
if (po.NumArgs() < 2) {
po.PrintUsage();
exit(1);
}
Matrix<BaseFloat> mat;
for (int32 i = 2; i <= po.NumArgs(); i++) {
bool binary_in;
Input ki(po.GetArg(i), &binary_in);
mat.Read(ki.Stream(), binary_in, true); // true == add.
// This will crash if dimensions do not match.
}
Output ko(po.GetArg(1), binary);
mat.Write(ko.Stream(), binary);
KALDI_LOG << "Summed " << (po.NumArgs()-1) << " matrices "
<< " of dimension " << mat.NumRows() << " by " << mat.NumCols();
} catch(const std::exception &e) {
std::cerr << e.what();
return -1;
}
}