lsgrmSplitter.txx

#include "lsgrmSplitter.h"

namespace lsgrm
{

enum RelativePosition{
POS_TOP,
POS_RIGHT,
POS_BOTTOM,
POS_LEFT
};

enum NeighborhoodRelativePosition{
  NBH_TOP,
  NBH_TOP_RIGHT,
  NBH_RIGHT,
  NBH_BOTTOM_RIGHT,
  NBH_BOTTOM,
  NBH_BOTTOM_LEFT,
  NBH_LEFT,
  NBH_TOP_LEFT
};

template <class TInputImage>
void SplitOTBImage(TInputImage * imagePtr, // input image
    unsigned int& tileWidth, // width of the tile
    unsigned int& tileHeight, // height of the tile
    const unsigned int margin, // stability margin
    unsigned int &nbTilesX,
    unsigned int &nbTilesY,
    std::vector<ProcessingTile> &m_Tiles)
{

  // Image size
  auto imageWidth = imagePtr->GetLargestPossibleRegion().GetSize()[0];
  auto imageHeight = imagePtr->GetLargestPossibleRegion().GetSize()[1];

  /* Local variables for the next loop */
  unsigned int startX, startY; // Upper left coordinates of the tile.
  unsigned int sizeX, sizeY; // Size of the tiles.

  /* Loop over the tiles*/
  m_Tiles.assign(nbTilesX * nbTilesY, ProcessingTile());
  unsigned int i = 0;
  for(unsigned int row = 0; row < nbTilesY; ++row)
    {
    for(unsigned int col = 0; col < nbTilesX; ++col)
      {

      // Compute current tile start
      startX = col * tileWidth;
      startY = row * tileHeight;

      // Current tile size might be different for right and bottom borders
      if (col == nbTilesX -1)
        {
        sizeX = tileWidth + imageWidth % tileWidth;
        }
      else
        {
        sizeX = tileWidth;
        }
      if (row == nbTilesY -1)
        {
        sizeY = tileHeight + imageHeight % tileHeight;
        }
      else
        {
        sizeY = tileHeight;
        }

      /* Margin at the top ? */
      if( row > 0 )
        {
        m_Tiles[i].margin[POS_TOP] = margin;
        m_Tiles[i].rows[0] = row * tileHeight;
        m_Tiles[i].tileNeighbors[NBH_TOP] = i - nbTilesX;
        }
      else
        {
        // Tile is on the top row --> no top margin
        m_Tiles[i].margin[POS_TOP] = 0;
        m_Tiles[i].rows[0] = 0;
        m_Tiles[i].tileNeighbors[NBH_TOP] = -1;
        }

      /* Margin at the right */
      if( col < nbTilesX - 1 )
        {
        m_Tiles[i].margin[POS_RIGHT] = margin;
        m_Tiles[i].columns[1] = col * tileWidth + sizeX - 1; //sizeX
        m_Tiles[i].tileNeighbors[NBH_RIGHT] = i+1;
        }
      else
        {
        // Tile is on the right column --> no right margin
        m_Tiles[i].margin[POS_RIGHT] = 0;
        m_Tiles[i].columns[1] = imageWidth - 1;
        m_Tiles[i].tileNeighbors[NBH_RIGHT] = -1;
        }

      /* Margin at the bottom */
      if( row < nbTilesY - 1)
        {
        m_Tiles[i].margin[POS_BOTTOM] = margin;
        m_Tiles[i].rows[1] = row * tileHeight + sizeY - 1; // sizeY
        m_Tiles[i].tileNeighbors[NBH_BOTTOM] = i + nbTilesX;
        }
      else
        {
        // Tile is on the bottom --> no bottom margin
        m_Tiles[i].margin[POS_BOTTOM] = 0;
        m_Tiles[i].rows[1] = imageHeight - 1;
        m_Tiles[i].tileNeighbors[NBH_BOTTOM] = -1;
        }

      /* Margin at the left */
      if( col > 0 )
        {
        m_Tiles[i].margin[POS_LEFT] = margin;
        m_Tiles[i].columns[0] = col * tileWidth;
        m_Tiles[i].tileNeighbors[NBH_LEFT] = i-1;
        }
      else
        {
        // Tile is on the left --> no left margin
        m_Tiles[i].margin[POS_LEFT] = 0;
        m_Tiles[i].columns[0] = 0;
        m_Tiles[i].tileNeighbors[NBH_LEFT] = -1;
        }

      /* Store the tile region */
      typename TInputImage::IndexType index;
      index[0] = startX - m_Tiles[i].margin[POS_LEFT];
      index[1] = startY - m_Tiles[i].margin[POS_TOP];
      typename TInputImage::SizeType size;
      size[0] = sizeX + m_Tiles[i].margin[POS_LEFT] + m_Tiles[i].margin[POS_RIGHT];
      size[1] = sizeY + m_Tiles[i].margin[POS_TOP] + m_Tiles[i].margin[POS_BOTTOM];
      typename TInputImage::RegionType region(index, size);
      m_Tiles[i].region = region;

      std::cout << "Tile " << i << ": ";
      region.Print(std::cout);

      /* Is there a neighbor at the rop right */
      if(row > 0 && col < nbTilesX - 1)
        m_Tiles[i].tileNeighbors[NBH_TOP_RIGHT] = i - nbTilesX + 1;
      else
        m_Tiles[i].tileNeighbors[NBH_TOP_RIGHT] = -1;

      /* Is there a neighbor at the bottom right */
      if(col < nbTilesX - 1 && row < nbTilesY - 1)
        m_Tiles[i].tileNeighbors[NBH_BOTTOM_RIGHT] = i + nbTilesX + 1;
      else
        m_Tiles[i].tileNeighbors[NBH_BOTTOM_RIGHT] = -1;

      /* Is there a neighbor at the bottom left */
      if(row < nbTilesY - 1 && col > 0)
        m_Tiles[i].tileNeighbors[NBH_BOTTOM_LEFT] = i + nbTilesX - 1;
      else
        m_Tiles[i].tileNeighbors[NBH_BOTTOM_LEFT] = -1;

      /* Is there a neighbor at the top left */
      if(col > 0 && row > 0)
        m_Tiles[i].tileNeighbors[NBH_TOP_LEFT] = i - nbTilesX - 1;
      else
        m_Tiles[i].tileNeighbors[NBH_TOP_LEFT] = -1;

      i++;
      } // end for(unsigned int col = 0; col < nbTilesX; ++col)

    } // for(unsigned int row = 0; row < nbTilesY; ++row)

}
} // end of namespace lsgrm