File: tckstats.cpp

package info (click to toggle)
mrtrix3 3.0.8-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 15,300 kB
  • sloc: cpp: 130,470; python: 9,603; sh: 597; makefile: 62; xml: 47
file content (256 lines) | stat: -rw-r--r-- 8,816 bytes parent folder | download
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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
/* Copyright (c) 2008-2025 the MRtrix3 contributors.
 *
 * This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
 *
 * Covered Software is provided under this License on an "as is"
 * basis, without warranty of any kind, either expressed, implied, or
 * statutory, including, without limitation, warranties that the
 * Covered Software is free of defects, merchantable, fit for a
 * particular purpose or non-infringing.
 * See the Mozilla Public License v. 2.0 for more details.
 *
 * For more details, see http://www.mrtrix.org/.
 */

#include "command.h"
#include "memory.h"
#include "progressbar.h"
#include "types.h"

#include "file/ofstream.h"

#include "math/median.h"

#include "dwi/tractography/file.h"
#include "dwi/tractography/properties.h"
#include "dwi/tractography/weights.h"




using namespace MR;
using namespace App;
using namespace MR::DWI;
using namespace MR::DWI::Tractography;


// TODO Make compatible with stats generic options?
// - Some features would not be compatible due to potential presence of track weights


const char * field_choices[] = { "mean", "median", "std", "min", "max", "count", NULL };


void usage ()
{

  AUTHOR = "Robert E. Smith (robert.smith@florey.edu.au)";

  SYNOPSIS = "Calculate statistics on streamlines lengths";

  ARGUMENTS
  + Argument ("tracks_in", "the input track file").type_tracks_in();

  OPTIONS

  + Option ("output",
      "output only the field specified. Multiple such options can be supplied if required. "
      "Choices are: " + join (field_choices, ", ") + ". Useful for use in scripts.").allow_multiple()
    + Argument ("field").type_choice (field_choices)

  + Option ("histogram", "output a histogram of streamline lengths")
    + Argument ("path").type_file_out()

  + Option ("dump", "dump the streamlines lengths to a text file")
    + Argument ("path").type_file_out()

  + Option ("ignorezero", "do not generate a warning if the track file contains streamlines with zero length")

  + Tractography::TrackWeightsInOption;

}


// Store length and weight of each streamline
class LW { NOMEMALIGN
  public:
    LW (const float l, const float w) : length (l), weight (w) { }
    LW () : length (NaN), weight (NaN) { }
    bool operator< (const LW& that) const { return length < that.length; }
    float get_length() const { return length; }
    float get_weight() const { return weight; }
  private:
    float length, weight;
    friend LW operator+ (const LW&, const LW&);
    friend LW operator/ (const LW&, const double);
};

// Necessary for median template function
LW operator+ (const LW& one, const LW& two)
{
  return LW (one.get_length() + two.get_length(), one.get_weight() + two.get_weight());
}

LW operator/ (const LW& lw, const double div)
{
  return LW (lw.get_length() / div, lw.get_weight() / div);
}


void run ()
{

  const bool weights_provided = get_options ("tck_weights_in").size();

  float step_size = NaN;
  size_t count = 0, header_count = 0;
  float min_length = std::numeric_limits<float>::infinity();
  float max_length = -std::numeric_limits<float>::infinity();
  size_t empty_streamlines = 0, zero_length_streamlines = 0;
  default_type sum_lengths = 0.0, sum_weights = 0.0;
  vector<default_type> histogram;
  vector<LW> all_lengths;
  all_lengths.reserve (header_count);

  {
    Tractography::Properties properties;
    Tractography::Reader<float> reader (argument[0], properties);

    if (properties.find ("count") != properties.end())
      header_count = to<size_t> (properties["count"]);

    step_size = properties.get_stepsize();
    if ((!std::isfinite (step_size) || !step_size) && get_options ("histogram").size()) {
      WARN ("Do not have streamline step size with which to bin histogram; histogram will be generated using 1mm bin widths");
    }

    std::unique_ptr<File::OFStream> dump;
    auto opt = get_options ("dump");
    if (opt.size())
      dump.reset (new File::OFStream (std::string(opt[0][0]), std::ios_base::out | std::ios_base::trunc));

    ProgressBar progress ("Reading track file", header_count);
    Streamline<> tck;
    while (reader (tck)) {
      ++count;
      const float length = Tractography::length (tck);
      if (std::isfinite (length)) {
        min_length = std::min (min_length, length);
        max_length = std::max (max_length, length);
        sum_lengths += tck.weight * length;
        sum_weights += tck.weight;
        all_lengths.push_back (LW (length, tck.weight));
        const size_t index = std::isfinite (step_size) ? std::round (length / step_size) : std::round (length);
        while (histogram.size() <= index)
          histogram.push_back (0.0);
        histogram[index] += tck.weight;
        if (!length)
          ++zero_length_streamlines;
      } else {
        ++empty_streamlines;
      }
      if (dump)
        (*dump) << length << "\n";
      ++progress;
    }
  }

  if (!get_options ("ignorezero").size() && (empty_streamlines || zero_length_streamlines)) {
    std::string s ("read");
    if (empty_streamlines) {
      s += " " + str(empty_streamlines) + " empty streamlines";
      if (zero_length_streamlines)
        s += " and";
    }
    if (zero_length_streamlines)
      s += " " + str(zero_length_streamlines) + " streamlines with zero length (one vertex only)";
    WARN (s);
  }
  if (count != header_count)
    WARN ("expected " + str(header_count) + " tracks according to header; read " + str(count));
  if (!std::isfinite (min_length))
    min_length = NaN;
  if (!std::isfinite (max_length))
    max_length = NaN;

  const float mean_length = sum_weights ? (sum_lengths / sum_weights) : NaN;

  float median_length = 0.0f;
  if (count) {
    if (weights_provided) {
      // Perform a weighted median calculation
      std::sort (all_lengths.begin(), all_lengths.end());
      size_t median_index = 0;
      default_type sum = sum_weights - all_lengths[0].get_weight();
      while (sum > 0.5 * sum_weights) { sum -= all_lengths[++median_index].get_weight(); }
      median_length = all_lengths[median_index].get_length();
    } else {
      median_length = Math::median (all_lengths).get_length();
    }
  } else {
    median_length = NaN;
  }

  default_type ssd = 0.0;
  for (vector<LW>::const_iterator i = all_lengths.begin(); i != all_lengths.end(); ++i)
    ssd += i->get_weight() * Math::pow2 (i->get_length() - mean_length);
  const float stdev = sum_weights ? (std::sqrt (ssd / (((count - 1) / default_type(count)) * sum_weights))) : NaN;

  vector<std::string> fields;
  auto opt = get_options ("output");
  for (size_t n = 0; n < opt.size(); ++n)
    fields.push_back (opt[n][0]);

  if (fields.size()) {

    for (size_t n = 0; n < fields.size(); ++n) {
      if (fields[n] == "mean")        std::cout << str(mean_length) << " ";
      else if (fields[n] == "median") std::cout << str(median_length) << " ";
      else if (fields[n] == "std")    std::cout << str(stdev) << " ";
      else if (fields[n] == "min")    std::cout << str(min_length) << " ";
      else if (fields[n] == "max")    std::cout << str(max_length) << " ";
      else if (fields[n] == "count")  std::cout << count << " ";
    }
    std::cout << "\n";

  } else {

    const size_t width = 12;

    std::cout << " " << std::setw(width) << std::right << "mean"
              << " " << std::setw(width) << std::right << "median"
              << " " << std::setw(width) << std::right << "std. dev."
              << " " << std::setw(width) << std::right << "min"
              << " " << std::setw(width) << std::right << "max"
              << " " << std::setw(width) << std::right << "count\n";

    std::cout << " " << std::setw(width) << std::right << (mean_length)
              << " " << std::setw(width) << std::right << (median_length)
              << " " << std::setw(width) << std::right << (stdev)
              << " " << std::setw(width) << std::right << (min_length)
              << " " << std::setw(width) << std::right << (max_length)
              << " " << std::setw(width) << std::right << (count) << "\n";

  }

  opt = get_options ("histogram");
  if (opt.size()) {
    File::OFStream out (opt[0][0], std::ios_base::out | std::ios_base::trunc);
    out << "# " << App::command_history_string << "\n";
    if (!std::isfinite (step_size))
      step_size = 1.0f;
    if (weights_provided) {
      out << "Length,Sum_weights\n";
      for (size_t i = 0; i != histogram.size(); ++i)
        out << str(i * step_size) << "," << str(histogram[i]) << "\n";
    } else {
      out << "Length,Count\n";
      for (size_t i = 0; i != histogram.size(); ++i)
        out << str(i * step_size) << "," << str<size_t>(histogram[i]) << "\n";
    }
    out << "\n";
  }

}