// featbin/paste-feats.cc // Copyright 2012 Korbinian Riedhammer // 2013 Brno University of Technology (Author: Karel Vesely) // 2013 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" #include "matrix/kaldi-matrix.h" namespace kaldi { // returns true if successfully appended. bool AppendFeats(const std::vector > &in, std::string utt, int32 tolerance, Matrix *out) { // Check the lengths int32 min_len = in[0].NumRows(), max_len = in[0].NumRows(), tot_dim = in[0].NumCols(); for (int32 i = 1; i < in.size(); i++) { int32 len = in[i].NumRows(), dim = in[i].NumCols(); tot_dim += dim; if(len < min_len) min_len = len; if(len > max_len) max_len = len; } if (max_len - min_len > tolerance || min_len == 0) { KALDI_WARN << "Length mismatch " << max_len << " vs. " << min_len << (utt.empty() ? "" : " for utt ") << utt << " exceeds tolerance " << tolerance; out->Resize(0, 0); return false; } if (max_len - min_len > 0) { KALDI_LOG << "Length mismatch " << max_len << " vs. " << min_len << (utt.empty() ? "" : " for utt ") << utt << " within tolerance " << tolerance; } out->Resize(min_len, tot_dim); int32 dim_offset = 0; for (int32 i = 0; i < in.size(); i++) { int32 this_dim = in[i].NumCols(); out->Range(0, min_len, dim_offset, this_dim).CopyFromMat( in[i].Range(0, min_len, 0, this_dim)); dim_offset += this_dim; } return true; } } int main(int argc, char *argv[]) { try { using namespace kaldi; using namespace std; const char *usage = "Paste feature files (assuming they have the same lengths); think of the\n" "unix command paste a b.\n" "Usage: paste-feats [ ...] \n" " or: paste-feats [ ...] \n" " e.g. paste-feats ark:feats1.ark \"ark:select-feats 0-3 ark:feats2.ark ark:- |\" ark:feats-out.ark\n" " or: paste-feats foo.mat bar.mat baz.mat\n"; ParseOptions po(usage); int32 length_tolerance = 0; bool binary = true; po.Register("length-tolerance", &length_tolerance, "If length is different, trim as shortest up to a frame difference of length-tolerance, otherwise exclude segment."); po.Register("binary", &binary, "If true, output files in binary " "(only relevant for single-file operation, i.e. no tables)"); po.Read(argc, argv); if (po.NumArgs() < 3) { po.PrintUsage(); exit(1); } if (ClassifyRspecifier(po.GetArg(1), NULL, NULL) != kNoRspecifier) { // We're operating on tables, e.g. archives. // Last argument is output string wspecifier = po.GetArg(po.NumArgs()); BaseFloatMatrixWriter feat_writer(wspecifier); // First input is sequential string rspecifier1 = po.GetArg(1); SequentialBaseFloatMatrixReader input1(rspecifier1); // Assemble vector of other input readers (with random-access) vector input; for (int32 i = 2; i < po.NumArgs(); i++) { string rspecifier = po.GetArg(i); RandomAccessBaseFloatMatrixReader *rd = new RandomAccessBaseFloatMatrixReader(rspecifier); input.push_back(rd); } int32 num_done = 0, num_err = 0; // Main loop for (; !input1.Done(); input1.Next()) { string utt = input1.Key(); KALDI_VLOG(2) << "Merging features for utterance " << utt; // Collect features from streams to vector 'feats' vector > feats(po.NumArgs() - 1); feats[0] = input1.Value(); int32 i; for (i = 0; i < static_cast(input.size()); i++) { if (input[i]->HasKey(utt)) { feats[i + 1] = input[i]->Value(utt); } else { KALDI_WARN << "Missing utt " << utt << " from input " << po.GetArg(i+2); num_err++; break; } } if (i != static_cast(input.size())) continue; Matrix output; if (!AppendFeats(feats, utt, length_tolerance, &output)) { num_err++; continue; // it will have printed a warning. } feat_writer.Write(utt, output); num_done++; } for (int32 i=0; i < input.size(); i++) delete input[i]; input.clear(); KALDI_LOG << "Done " << num_done << " utts, errors on " << num_err; return (num_done == 0 ? -1 : 0); } else { // We're operating on rxfilenames|wxfilenames, most likely files. std::vector > feats(po.NumArgs() - 1); for (int32 i = 1; i < po.NumArgs(); i++) ReadKaldiObject(po.GetArg(i), &(feats[i-1])); Matrix output; if (!AppendFeats(feats, "", length_tolerance, &output)) return 1; // it will have printed a warning. std::string output_wxfilename = po.GetArg(po.NumArgs()); WriteKaldiObject(output, output_wxfilename, binary); KALDI_LOG << "Wrote appended features to " << output_wxfilename; return 0; } } catch(const std::exception &e) { std::cerr << e.what(); return -1; } } /* Testing: cat <1.mat [ 0 1 2 3 4 5 8 9 10 ] EOF cat < 2.mat [ 0 1 2 3 ] EOF paste-feats --length-tolerance=1 --binary=false 1.mat 2.mat 3a.mat cat < 3b.mat [ 0 1 2 0 1 3 4 5 2 3 ] EOF cmp <(../bin/copy-matrix 3b.mat -) <(../bin/copy-matrix 3a.mat -) || echo 'Bad!' paste-feats --length-tolerance=1 'scp:echo foo 1.mat|' 'scp:echo foo 2.mat|' 'scp,t:echo foo 3a.mat|' cmp <(../bin/copy-matrix 3b.mat -) <(../bin/copy-matrix 3a.mat -) || echo 'Bad!' rm {1,2,3?}.mat */