otbImageRegionSquareTileSplitter.txx 4.64 KB
Newer Older
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
/*=========================================================================

  Program:   ORFEO Toolbox
  Language:  C++
  Date:      $Date$
  Version:   $Revision$


  Copyright (c) Centre National d'Etudes Spatiales. All rights reserved.
  See OTBCopyright.txt for details.


     This software is distributed WITHOUT ANY WARRANTY; without even
     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
     PURPOSE.  See the above copyright notices for more information.

=========================================================================*/
#ifndef __otbImageRegionSquareTileSplitter_txx
#define __otbImageRegionSquareTileSplitter_txx

#include "otbImageRegionSquareTileSplitter.h"
#include "otbMath.h"
#include "otbMacro.h"

namespace otb
{

template <unsigned int VImageDimension>
unsigned int
ImageRegionSquareTileSplitter<VImageDimension>
::GetNumberOfSplits(const RegionType& region, unsigned int requestedNumber)
{
33 34
  unsigned int theoricalNbPixelPerTile = region.GetNumberOfPixels() / requestedNumber;
  unsigned int theoricalTileDimension = static_cast<unsigned int> (vcl_sqrt(static_cast<double>(theoricalNbPixelPerTile)) );
35

36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52
  m_TileDimension = m_TileHint;

  // If we have less than one jpeg 2000 tile, split in sub-tiles
  if(theoricalTileDimension < m_TileHint)
    {
    while(m_TileDimension > theoricalTileDimension)
      {
      m_TileDimension/=2;
      }
    }
    else
      {
      while(2*m_TileDimension < theoricalTileDimension)
        {
        m_TileDimension*=2;
        }
      }
53

54 55
  // Minimal tile size is m_TileSizeAlignment * m_TileSizeAlignment
  if (m_TileDimension < m_TileSizeAlignment)
56
    {
57 58
    otbMsgDevMacro(<< "Warning: clamping tile size to " << m_TileSizeAlignment << " * " << m_TileSizeAlignment);
    m_TileDimension = m_TileSizeAlignment;
59 60 61
    }

  unsigned int numPieces = 1;
62 63
  const SizeType&  regionSize = region.GetSize();
  for (unsigned int j = 0; j < VImageDimension; ++j)
64
    {
65 66
    m_SplitsPerDimension[j] = (regionSize[j] + m_TileDimension - 1) / m_TileDimension;
    numPieces *= m_SplitsPerDimension[j];
67
    }
68 69 70 71

  otbMsgDevMacro(<< "Tile dimension : " << m_TileDimension)
  otbMsgDevMacro(<< "Number of splits per dimension : " << m_SplitsPerDimension[0] << " " <<  m_SplitsPerDimension[1])

72 73 74 75 76 77
  return numPieces;
}

template <unsigned int VImageDimension>
itk::ImageRegion<VImageDimension>
ImageRegionSquareTileSplitter<VImageDimension>
78
::GetSplit(unsigned int i, unsigned int itkNotUsed(numberOfPieces), const RegionType& region)
79 80
{
  RegionType splitRegion;
81
  IndexType  splitIndex;
82

83 84 85 86 87 88
  // Compute the actual number of splits
  unsigned int numPieces = 1;
  for (unsigned int j = 0; j < VImageDimension; ++j)
    {
    numPieces *= m_SplitsPerDimension[j];
    }
89

90 91 92 93 94
  // Sanity check
  if (i >= numPieces)
    {
    itkExceptionMacro("Asked for split number " << i << " but region contains only " << numPieces << " splits");
    }
95

96 97 98 99 100 101 102 103 104 105 106 107
  // First, find the megatile index

  unsigned int tilesPerMegaTilesPerDim = m_TileHint / m_TileDimension;

  if(tilesPerMegaTilesPerDim == 0)
    {
    tilesPerMegaTilesPerDim =1;
    }

  unsigned int tilesPerMegaTiles = tilesPerMegaTilesPerDim*tilesPerMegaTilesPerDim;

  unsigned int remaining = i / tilesPerMegaTiles;
108
  for (unsigned int j = VImageDimension - 1; j > 0; --j)
109
    {
110 111
    splitIndex[j] = tilesPerMegaTilesPerDim * remaining / (m_SplitsPerDimension[VImageDimension - 1 - j] / tilesPerMegaTilesPerDim);
    remaining = remaining % (m_SplitsPerDimension[VImageDimension - 1 - j] / tilesPerMegaTilesPerDim);
112
    }
113
  splitIndex[0] = tilesPerMegaTilesPerDim * remaining;
114

115 116 117 118 119 120 121 122 123 124 125
  // Now splitIndex contains the megaTile index
  remaining = i % tilesPerMegaTiles;
  for (unsigned int j = VImageDimension - 1; j > 0; --j)
    {
    splitIndex[j] += remaining / tilesPerMegaTilesPerDim;
    remaining = remaining % (tilesPerMegaTilesPerDim);
    }
  splitIndex[0]+= remaining;
  
  // Now split index contains the tile index
    
126
  // Transform the split index to the actual coordinates
127 128
  for (unsigned int j = 0; j < VImageDimension; ++j)
    {
129 130
    splitRegion.SetIndex(j, region.GetIndex(j) + m_TileDimension * splitIndex[j]);
    splitRegion.SetSize(j, m_TileDimension);
131
    }
132 133 134 135 136
    
    // Handle the borders
    splitRegion.Crop(region);
    
    return splitRegion;
137 138 139 140 141 142 143 144 145 146 147
}

/**
 *
 */
template <unsigned int VImageDimension>
void
ImageRegionSquareTileSplitter<VImageDimension>
::PrintSelf(std::ostream& os, itk::Indent indent) const
{
  Superclass::PrintSelf(os, indent);
148 149 150 151
  os << indent << "SplitsPerDimension : " << m_SplitsPerDimension << std::endl;
  os << indent << "TileDimension      : " << m_TileDimension << std::endl;
  os << indent << "TileSizeAlignment  : " << m_TileSizeAlignment << std::endl;

152 153 154 155 156
}

} // end namespace itk

#endif