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 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416
|
/*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 "BorderFile.h"
#include "BorderFileProjector.h"
#include "BorderProjectionFile.h"
#include "BorderProjectionUnprojector.h"
#include "BrainModelSurface.h"
#include "BrainSet.h"
#include "CommandSurfaceBorderMerge.h"
#include "FileFilters.h"
#include "ProgramParameters.h"
#include "ScriptBuilderParameters.h"
/**
* constructor.
*/
CommandSurfaceBorderMerge::CommandSurfaceBorderMerge()
: CommandBase("-surface-border-merge",
"SURFACE BORDER MERGE")
{
}
/**
* destructor.
*/
CommandSurfaceBorderMerge::~CommandSurfaceBorderMerge()
{
}
/**
* get the script builder parameters.
*/
void
CommandSurfaceBorderMerge::getScriptBuilderParameters(ScriptBuilderParameters& paramsOut) const
{
paramsOut.clear();
paramsOut.addFile("Input Border Projection File",
FileFilters::getBorderProjectionFileFilter());
paramsOut.addFile("Output Border Projection File",
FileFilters::getBorderProjectionFileFilter());
paramsOut.addString("Output Border Projection Name");
paramsOut.addString("Input Border Projection 1 Name");
paramsOut.addString("Input Border Projection 2 Name");
paramsOut.addVariableListOfParameters("Options");
}
/**
* get full help information.
*/
QString
CommandSurfaceBorderMerge::getHelpInformation() const
{
QString helpInfo =
(indent3 + getShortDescription() + "\n"
+ indent6 + parameters->getProgramNameWithoutPath() + " " + getOperationSwitch() + " \n"
+ indent9 + "<input-border-projection-file-name>\n"
+ indent9 + "<output-border-projection-file-name>\n"
+ indent9 + "<output-border-projection-name>\n"
+ indent9 + "<input-border-projection-1-name>\n"
+ indent9 + "<input-border-projection-2-name>\n"
+ indent9 + "[-border-proj additional-input-border-projection-name]\n"
+ indent9 + "[-delete-input-border-projections]\n"
+ indent9 + "[-close-border]\n"
+ indent9 + "[-smooth-junctions \n"
+ indent9 + " coordinate-file-name \n"
+ indent9 + " topology-file-name \n"
+ indent9 + " junction-neighbors \n"
+ indent9 + " number-of-iterations] \n"
+ indent9 + "\n"
+ indent9 + "Merge two or more border projections into a single\n"
+ indent9 + "border projection. An option is provided that will\n"
+ indent9 + "delete all of the input border projections. Use\n"
+ indent9 + "\"-border-proj\" if more than two border projections\n"
+ indent9 + "need to be merged.\n"
+ indent9 + "\n"
+ indent9 + "Use \"-close-border\" if the borders are to be merged into\n"
+ indent9 + "a closed border.\n"
+ indent9 + "\n"
+ indent9 + "Use \"-smooth-junctions\" to smooth the border links \n"
+ indent9 + "around the junctions (the border links that are \n"
+ indent9 + "connected to form the output border). \n"
+ indent9 + "\"junction-neighbors\" is the number of links on both \n"
+ indent9 + "sides of the junction that get smoothed for \n"
+ indent9 + "\"number-of-iterations\". \n"
+ indent9 + "\n");
return helpInfo;
}
/**
* execute the command.
*/
void
CommandSurfaceBorderMerge::executeCommand() throw (BrainModelAlgorithmException,
CommandException,
FileException,
ProgramParametersException,
StatisticException)
{
//
// Get required parameters
//
const QString inputBorderProjectionFileName =
parameters->getNextParameterAsString("Input Border Projection File");
const QString outputBorderProjectionFileName =
parameters->getNextParameterAsString("Output Border Projection File");
const QString outputBorderProjectionName =
parameters->getNextParameterAsString("Output Border Projection Name");
std::vector<QString> inputBorderProjectionNames;
inputBorderProjectionNames.push_back(
parameters->getNextParameterAsString("Input Border Projection 1 Name"));
inputBorderProjectionNames.push_back(
parameters->getNextParameterAsString("Input Border Projection 2 Name"));
//
// Process optional parameters
//
bool smoothFlag = false;
QString smoothCoordFileName;
QString smoothTopoFileName;
int smoothJunctionNeighborsCount = 0;
int smoothJunctionIterations = 0;
bool closeBorderFlag = false;
bool deleteInputBorderProjectionsFlag = false;
while (parameters->getParametersAvailable()) {
const QString paramName =
parameters->getNextParameterAsString("Merge Border Parameter");
if (paramName == "-border-proj") {
inputBorderProjectionNames.push_back(
parameters->getNextParameterAsString("Additional Border Projection Names"));
}
else if (paramName == "-close-border") {
closeBorderFlag = true;
}
else if (paramName == "-delete-input-border-projections") {
deleteInputBorderProjectionsFlag = true;
}
else if (paramName == "-smooth-junctions") {
smoothCoordFileName =
parameters->getNextParameterAsString("Coordinate File Name");
smoothTopoFileName =
parameters->getNextParameterAsString("Topology File Name");
smoothJunctionNeighborsCount =
parameters->getNextParameterAsInt("Junction Neighbors");
smoothJunctionIterations =
parameters->getNextParameterAsInt("Smoothing Iterations");
smoothFlag = true;
}
else {
throw CommandException("Border Merge unrecognized option: \"" +
paramName + "\"");
}
}
//
// Read the border projection file
//
BorderProjectionFile borderProjectionFile;
borderProjectionFile.readFile(inputBorderProjectionFileName);
//
// Create a new border projection
//
BorderProjection borderProjection(outputBorderProjectionName);
//
// Locations of junctions for smoothing
//
std::vector<int> junctionLinks;
//
// loop through input border projections and append
//
std::vector<int> borderProjectionsForDeletion;
const int numInput = static_cast<int>(inputBorderProjectionNames.size());
for (int i = 0; i < numInput; i++) {
if (borderProjection.getNumberOfLinks() > 0) {
junctionLinks.push_back(borderProjection.getNumberOfLinks() - 1);
}
const BorderProjection* bp = getBorderProjectionWithUniqueName(borderProjectionFile,
inputBorderProjectionNames[i]);
borderProjection.append(*bp);
borderProjectionsForDeletion.push_back(borderProjectionFile.getBorderProjectionIndex(bp));
}
//
// Close the border?
//
if (closeBorderFlag) {
const int numLinks = borderProjection.getNumberOfLinks();
if (numLinks > 1) {
//
// Add first link to the end of the border so it closes
//
junctionLinks.push_back(numLinks - 1);
borderProjection.addBorderProjectionLink(*borderProjection.getBorderProjectionLink(0));
}
}
//
// Should input border projections be deleted
//
if (deleteInputBorderProjectionsFlag) {
borderProjectionFile.removeBordersWithIndices(borderProjectionsForDeletion);
}
//
// Should smoothing be performed ?
//
if (smoothFlag &&
(borderProjection.getNumberOfLinks() > 2)) {
//
// Create a brain set
//
BrainSet brainSet(smoothTopoFileName,
smoothCoordFileName,
"",
true);
BrainModelSurface* bms = brainSet.getBrainModelSurface(0);
if (bms == NULL) {
throw CommandException("unable to find surface.");
}
const CoordinateFile* cf = bms->getCoordinateFile();
const TopologyFile* tf = bms->getTopologyFile();
if (tf == NULL) {
throw CommandException("unable to find topology.");
}
const int numNodes = bms->getNumberOfNodes();
if (numNodes == 0) {
throw CommandException("surface contains not nodes.");
}
//
// Place the border projection in a temporary file
//
BorderProjectionFile tempBorderProjectionFile;
tempBorderProjectionFile.addBorderProjection(borderProjection);
//
// Unproject the border
//
BorderProjectionUnprojector unprojector;
BorderFile tempBorderFile;
unprojector.unprojectBorderProjections(*cf,
tempBorderProjectionFile,
tempBorderFile);
//
// Get border
//
if (tempBorderFile.getNumberOfBorders() <= 0) {
throw CommandException("unprojection error.");
}
//
// Get links for smoothing
//
const int numLinks = borderProjection.getNumberOfLinks();
std::vector<bool> smoothFlags(numLinks, false);
for (int m = 0; m < static_cast<int>(junctionLinks.size()); m++) {
const int junctionIndex = junctionLinks[m];
//
// Smooth links before junction
//
int mStart = junctionIndex - smoothJunctionNeighborsCount;
if (mStart < 0) {
//
// flag nodes at start of border
//
for (int n = 0; n <= junctionIndex; n++) {
smoothFlags[n] = true;
}
if (closeBorderFlag) {
//
// wrap around beginning and flag nodes at end of border
//
const int remainingLinks = smoothJunctionNeighborsCount - junctionIndex;
mStart = numLinks - remainingLinks;
if (mStart < 0) {
mStart = 0;
}
for (int n = mStart; n < numLinks; n++) {
smoothFlags[n] = true;
}
}
}
else {
for (int n = mStart; n <= junctionIndex; n++) {
smoothFlags[n] = true;
}
}
//
// Smooth links after junction
//
int mEnd = junctionIndex + smoothJunctionNeighborsCount;
if (mEnd >= numLinks) {
//
// Flag nodes at end of border
//
for (int n = junctionIndex; n <= numLinks; n++) {
smoothFlags[n] = true;
}
if (closeBorderFlag) {
//
// wrap around beginning and flag nodes at start of border
//
const int remainingLinks = mEnd - numLinks;
mEnd = remainingLinks;
if (mEnd > numLinks) {
mEnd = numLinks;
}
for (int n = 0; n < mEnd; n++) {
smoothFlags[n] = true;
}
}
}
else {
for (int n = junctionIndex; n < mEnd; n++) {
smoothFlags[n] = true;
}
}
}
//
// Smooth the border
//
Border* b = tempBorderFile.getBorder(0);
b->smoothBorderLinks(smoothJunctionIterations,
closeBorderFlag,
&smoothFlags);
//
// Reproject the border
//
tempBorderProjectionFile.clear();
BorderFileProjector projector(bms, true);
projector.projectBorderFile(&tempBorderFile,
&tempBorderProjectionFile,
NULL);
//
// Add border projection to output file
//
if (tempBorderProjectionFile.getNumberOfBorderProjections() <= 0) {
throw CommandException("reprojection error.");
}
borderProjectionFile.addBorderProjection(
*tempBorderProjectionFile.getBorderProjection(0));
}
else {
//
// Add to border projection file
//
borderProjectionFile.addBorderProjection(borderProjection);
}
//
// Write the border projection file
//
borderProjectionFile.writeFile(outputBorderProjectionFileName);
}
/**
* get border projection by name and make sure only one.
*/
const BorderProjection*
CommandSurfaceBorderMerge::getBorderProjectionWithUniqueName(const BorderProjectionFile& bpf,
const QString& name) const
throw (CommandException)
{
const BorderProjection* bpFirst = bpf.getFirstBorderProjectionByName(name);
const BorderProjection* bpLast = bpf.getLastBorderProjectionByName(name);
if (bpFirst == bpLast) {
if (bpFirst != NULL) {
return bpFirst;
}
else {
throw CommandException("no border projection with "
+ name
+ " was found.");
}
}
throw CommandException("there is more than one border projection named "
+ name);
}
|