File: BrainModelSurfaceMetricExtrema.cxx

package info (click to toggle)
caret 5.6.4~dfsg.1-3
  • links: PTS, VCS
  • area: main
  • in suites: jessie, jessie-kfreebsd, wheezy
  • size: 31,904 kB
  • ctags: 28,901
  • sloc: cpp: 378,050; python: 6,718; ansic: 5,507; makefile: 333; sh: 46
file content (169 lines) | stat: -rw-r--r-- 5,309 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
/*LICENSE_START*/
/*
 *  Copyright 1995-2002 Washington University School of Medicine
 *
 *  http://brainmap.wustl.edu
 *
 *  This file is part of CARET.
 *
 *  CARET is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  CARET is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with CARET; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 */
/*LICENSE_END*/

#include "BrainModelVolume.h"
#include "BrainModelSurfaceMetricExtrema.h"
#include "BrainSet.h"
#include "BrainModelSurface.h"
#include "CoordinateFile.h"
#include "TopologyFile.h"
#include "TopologyHelper.h"
#include "MetricFile.h"
#include <cmath>
#include <iostream>

/**
 * Constructor.
 */
BrainModelSurfaceMetricExtrema::BrainModelSurfaceMetricExtrema(
                                               BrainSet* bs,
                                               int bsIndexIn,
                                               MetricFile* valuesIn,
                                               int metricIndexIn,
                                               MetricFile* extremaOutIn,
                                               int exOutIndexIn,
                                               int depthIn)
   : BrainModelAlgorithm(bs)
{
   setIndex   = bsIndexIn;
   values     = valuesIn;
   metricIndex = metricIndexIn;
   extremaOut    = extremaOutIn;
   exOutIndex = exOutIndexIn;
   depth = depthIn;
}
                                      
/**
 * Destructor.
 */
BrainModelSurfaceMetricExtrema::~BrainModelSurfaceMetricExtrema()
{
}

/**
 * execute the algorithm.
 */
void 
BrainModelSurfaceMetricExtrema::execute() throw (BrainModelAlgorithmException)
{
   //
   // Verify files exist, are valid, etc.
   //
   BrainModelSurface* mysurf = brainSet->getBrainModelSurface(setIndex);//reference
   CoordinateFile* source = mysurf->getCoordinateFile();//reference
   TopologyFile* topo = mysurf->getTopologyFile();
   const TopologyHelper* myhelper = topo->getTopologyHelper(false, true, false);
   if (depth < 1)
   {
      depth = 1;
   }
   if (source == NULL) {
      throw BrainModelAlgorithmException("Invalid coordinate file.");
   }
   if (values == NULL) {
      throw BrainModelAlgorithmException("Invalid metric file.");
   }
   if (source->getNumberOfCoordinates() < 1)
   {
      throw BrainModelAlgorithmException("Not enough nodes in coordinate file.");
   }
   if (source->getNumberOfCoordinates() != values->getNumberOfNodes())
   {
      throw BrainModelAlgorithmException("Node numbers do not match.");
   }
   //
   // Check output files exist
   //
   if (extremaOut == NULL) {
      throw BrainModelAlgorithmException("No valid output file.");
   }
   if (extremaOut->getNumberOfNodes() != source->getNumberOfCoordinates())
   {
      extremaOut->setNumberOfNodesAndColumns(source->getNumberOfCoordinates(), 1);
      exOutIndex = 0;
   }
   if (exOutIndex < 0 || exOutIndex >= extremaOut->getNumberOfColumns())
   {
      exOutIndex = extremaOut->getNumberOfColumns();
      extremaOut->addColumns(1);
   }
   extremaOut->setColumnName(exOutIndex, QString("extrema depth=") + QString::number(depth));
   int numNodes = source->getNumberOfCoordinates();
   int i, j, numNeigh, whichnode;
   float nodemetric;
   float* sourceData = new float[numNodes * 3];
   source->getAllCoordinates(sourceData);
   float* metricData = new float[numNodes];
   values->getColumnForAllNodes(metricIndex, metricData);
   std::vector<int> neighbors;
   float* exData = new float[numNodes];
   int* markmax = new int[numNodes], *markmin = new int[numNodes];
   for (i = 0; i < numNodes; ++i)
   {
      exData[i] = 0.0f;
      markmax[i] = 0;
      markmin[i] = 0;
   }
   bool isMax, isMin;
   for (i = 0; i < numNodes; ++i)
   {
      isMax = !markmax[i];//skip previously compared nodes for extra speed
      isMin = !markmin[i];//also allows it to not request neighbors, even more speed
      if (isMax || isMin)
      {
         nodemetric = metricData[i];
         myhelper->getNodeNeighborsToDepth(i, depth, neighbors);
         numNeigh = neighbors.size();
         for (j = 0; (isMax || isMin) && j < numNeigh; ++j)
         {
            whichnode = neighbors[j];
            if (nodemetric < metricData[whichnode])
            {
               isMax = false;
               markmin[whichnode] = 1;
            }
            if (nodemetric > metricData[whichnode])
            {
               isMin = false;
               markmax[whichnode] = 1;
            }
         }
         if (isMin)
         {
            exData[i] = -1.0f;
         }
         if (isMax)
         {
            exData[i] = 1.0f;
         }
      }
   }
   extremaOut->setColumnForAllNodes(exOutIndex, exData);
   delete[] exData;
   delete[] sourceData;
   delete[] metricData;
   delete[] markmax;
   delete[] markmin;
}