Skip to content
GitLab
Select Git revision
  • master default
Find file BlameHistoryPermalink
otbPixelValuesLinearInterpolation.h 3.17 KiB
1 
/*=========================================================================
2
3 
  Program:   TemporalSmoothing
4 
  Language:  C++
5
6 
  Copyright (c) Remi Cresson (IRSTEA). All rights reserved.
7
8 
  See LICENSE for details.
9
10 
  This software is distributed WITHOUT ANY WARRANTY; without even
11 
  the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
12 
  PURPOSE.  See the above copyright notices for more information.
13
14 
=========================================================================*/
15
16 
#ifndef MODULES_REMOTE_MULTITEMPORALSMOOTHING_INCLUDE_OTBPIXELVALUESLINEARINTERPOLATION_H_
17 
#define MODULES_REMOTE_MULTITEMPORALSMOOTHING_INCLUDE_OTBPIXELVALUESLINEARINTERPOLATION_H_
18
19 
#include <vector>
20
21 
namespace otb
22 
{
23 
namespace Functor
24 
{
25
26 
/** \class PixelValuesLinearInterpolation
27 
 *
28 
 *  \brief: This functor replaces holes in the pixel values with
29 
 *  the linear interpolation of the nearest left and right ones.
30 
 *
31 
 * \ingroup TemporalSmoothing
32 
 */
33 
template <class TSeries>
34 
class PixelValuesLinearInterpolation
35 
{
36 
public:
37
38 
  typedef typename TSeries::ValueType SerieValueType;
39
40 
  // Constructor
41 
  PixelValuesLinearInterpolation(): m_NoDataValue(0) {};
42
43 
  // Destructor
44 
  ~PixelValuesLinearInterpolation(){};
45
46 
  inline void SetIgnoreValue (SerieValueType value)
47 
  {
48 
    m_NoDataValue = value;
49 
  }
50
51 
  inline TSeries operator ()(const TSeries& series)
52 
  {
53
54 
    TSeries interpSeries(series);
55 
    int nDates = series.Size();
56
57 
    if (nDates > 1)
58 
      {
59 
      // Mark the series indices that are around a hole
60 
      std::vector<int> valableIndices;
61
62 
      bool insideHole = (series[0] == m_NoDataValue);
63 
      if (insideHole)
64 
        valableIndices.push_back(-1);
65 
      for (int i = 1 ; i < nDates ; i++)
66 
        {
67 
        if (series[i] != m_NoDataValue)
68 
          {
69 
          if (insideHole)
70 
            {
7172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122
valableIndices.push_back(i); insideHole = false; } } else { if (!insideHole) { valableIndices.push_back(i-1); insideHole = true; } } } // We enter this if there is at least 1 hole unsigned int nbOfHoles = valableIndices.size()/2; if (nbOfHoles > 0) { // Fill the gaps between valableIndices for (unsigned int hole = 0; hole < nbOfHoles ; hole++) { // Indices of hole range int ltIndice = valableIndices[2*hole]; int rtIndice = valableIndices[2*hole+1]; if (ltIndice > -1) { // Linear interpolation for (int k = ltIndice + 1; k < rtIndice ; k++) { SerieValueType a = (series[rtIndice] - series[ltIndice]) / (rtIndice - ltIndice); SerieValueType b = series[ltIndice] - a * ltIndice; interpSeries[k] = a * k + b; } // interpolation } // avoid borders } // iteration over holes }// number of holes > 0 } // nDates > 1 return interpSeries; } private: SerieValueType m_NoDataValue; }; // class PixelValuesLinearInterpolation } // namespace functor } // namespace otb #endif /* MODULES_REMOTE_MULTITEMPORALSMOOTHING_INCLUDE_OTBPIXELVALUESLINEARINTERPOLATION_H_ */