index_at_maximum.h

Go to the documentation of this file.

//
//
/*
    Copyright (C) 2005- 2005, Hammersmith Imanet Ltd
    This file is part of STIR.

    SPDX-License-Identifier: Apache-2.0

    See STIR/LICENSE.txt for details
*/
#include "stir/VectorWithOffset.h"
#include "stir/BasicCoordinate.h"
#include "stir/Array.h"

START_NAMESPACE_STIR

template <class elemT>
int
index_at_maximum(const VectorWithOffset<elemT>& v)
{
  if (v.size() == 0)
    return 0;

  int index_at_max = v.get_min_index();
  elemT max_value = v[index_at_max];
  for (int index = v.get_min_index(); index <= v.get_max_index(); ++index)
    {
      const elemT value = v[index];
      if (value > max_value)
        {
          index_at_max = index;
          max_value = value;
        }
    }
  return index_at_max;
}

template <class elemT>
BasicCoordinate<3, int>
indices_at_maximum(const Array<3, elemT>& input_array)
{
  const elemT current_maximum = input_array.find_max();
  BasicCoordinate<3, int> max_location, min_index, max_index;

  bool found = false;
  min_index[1] = input_array.get_min_index();
  max_index[1] = input_array.get_max_index();
  for (int k = min_index[1]; k <= max_index[1] && !found; ++k)
    {
      min_index[2] = input_array[k].get_min_index();
      max_index[2] = input_array[k].get_max_index();
      for (int j = min_index[2]; j <= max_index[2] && !found; ++j)
        {
          min_index[3] = input_array[k][j].get_min_index();
          max_index[3] = input_array[k][j].get_max_index();
          for (int i = min_index[3]; i <= max_index[3] && !found; ++i)
            {
              if (input_array[k][j][i] == current_maximum)
                {
                  max_location[1] = k;
                  max_location[2] = j;
                  max_location[3] = i;
                }
            }
        }
    }
  found = true;
  return max_location;
}

END_NAMESPACE_STIR