linearcomb.h

Go to the documentation of this file.

/* This software and supporting documentation are distributed by
 *     Institut Federatif de Recherche 49
 *     CEA/NeuroSpin, Batiment 145,
 *     91191 Gif-sur-Yvette cedex
 *     France
 *
 * This software is governed by the CeCILL-B license under
 * French law and abiding by the rules of distribution of free software.
 * You can  use, modify and/or redistribute the software under the
 * terms of the CeCILL-B license as circulated by CEA, CNRS
 * and INRIA at the following URL "http://www.cecill.info".
 *
 * As a counterpart to the access to the source code and  rights to copy,
 * modify and redistribute granted by the license, users are provided only
 * with a limited warranty  and the software's author,  the holder of the
 * economic rights,  and the successive licensors  have only  limited
 * liability.
 *
 * In this respect, the user's attention is drawn to the risks associated
 * with loading,  using,  modifying and/or developing or reproducing the
 * software by the user in light of its specific status of free software,
 * that may mean  that it is complicated to manipulate,  and  that  also
 * therefore means  that it is reserved for developers  and  experienced
 * professionals having in-depth computer knowledge. Users are therefore
 * encouraged to load and test the software's suitability as regards their
 * requirements in conditions enabling the security of their systems and/or
 * data to be ensured and,  more generally, to use and operate it in the
 * same conditions as regards security.
 *
 * The fact that you are presently reading this means that you have had
 * knowledge of the CeCILL-B license and that you accept its terms.
 */
 
/*
 *  Linear combination beetween two datas.
 */
#ifndef AIMS_UTILITY_LINEARCOMB_H
#define AIMS_UTILITY_LINEARCOMB_H
 
#include <aims/config/aimsdata_config.h>
#include <cartodata/volume/volume.h>
#include <cartobase/containers/nditerator.h>
 
namespace aims
{ 

  template <class T>
  class AimsLinearCombination
  {
    protected:
      float _num1;
      float _den1;
      float _num2;
      float _den2;
 
    public :
      AimsLinearCombination(float num1,float den1,
                            float num2=0.0,float den2=1.0)
      { ASSERT(den1!=0 && den2!=0);
        _num1 = num1;
        _den1 = den1;
        _num2 = num2;
        _den2 = den2;
      }

      virtual ~AimsLinearCombination() { }

      carto::VolumeRef<T> operator () (
        const carto::rc_ptr<carto::Volume<T> > &data1,
        const carto::rc_ptr<carto::Volume<T> > &data2 );
      carto::VolumeRef<T> operator () (
        const carto::rc_ptr<carto::Volume<T> > &data1);
  };
 

  template <class T>
  class Replacer
  {
  public:
 
    // [NS-2024-01-15] - std::map<T>::find does not work with multichannel (i.e.: VoxelValue<uint8_t, 3>)
    // because std::map<T>::find uses std::less<T> functor to compare multichannel VoxelValue but it
    // implicitely convert VoxelValue to boolean. To fix this bug we uses an std::map type with 
    // VoxelValue comparison support
    typedef typename std::map<T, T, carto::KeyComparatorLess<T> > MapType;
 
    Replacer() {}
    ~Replacer() {}

    inline static void replace( const carto::Volume<T> & ivol,
                                carto::Volume<T> & ovol,
                                const aims::Replacer<T>::MapType & repl );
  };
 
 
  template <class T> inline
  carto::VolumeRef<T> AimsLinearCombination<T>::operator () (
    const carto::rc_ptr<carto::Volume<T> > &data1,
    const carto::rc_ptr<carto::Volume<T> > &data2 )
  {
    if( data1->getSize() != data2->getSize() )
      AimsError("VolumeRef<T> AimsLinearCombination(const rc_ptr<Volume<T> > &,\
                float,float,const rc_ptr<Volume<T> > &,float,float) : \
                sizes must be the same");
 
    carto::VolumeRef<T> comb( data1->getSize(), data1->getBorders() );
    comb.setVoxelSize( data1->getVoxelSize() );
    typename carto::Volume<T>::iterator       it;
    typename carto::Volume<T>::const_iterator it1, it2;
    for( it=comb->begin(), it1=data1->begin(), it2=data2->begin();
        it!=comb->end(); it++, it1++, it2++ )
      *it = (T)((double)*it1 * (double)_num1 / (double)_den1 +
                (double)*it2 * (double)_num2 / (double)_den2 );
    return comb;
  }
 
 
  template <class T> inline
  carto::VolumeRef<T> AimsLinearCombination<T>::operator () (
    const carto::rc_ptr<carto::Volume<T> > &data1 )
  {
    carto::VolumeRef<T> comb( data1->getSize(), data1->getBorders() );
    comb.setVoxelSize( data1->getVoxelSize() );
    typename carto::Volume<T>::iterator       it;
    typename carto::Volume<T>::const_iterator it1;
    for( it=comb->begin(), it1=data1->begin(); it!=comb->end(); it++, it1++ )
        *it = (T)((double)*it1 * (double)_num1 / (double)_den1);
    return comb;
  }
 
  
 
  template <typename T>
  inline void Replacer<T>::replace( const carto::Volume<T> & ivol,
                                    carto::Volume<T> & ovol,
                                    const aims::Replacer<T>::MapType & repl )
  {
    carto::const_line_NDIterator<T> it( &ivol.at(0), ivol.getSize(),
                                        ivol.getStrides(), true );
    const T *p, *pp;
    T *dp;
    int ds;
    std::vector<int> pos;
 
    typename aims::Replacer<T>::MapType::const_iterator im, em = repl.end();
 
    for( ; !it.ended(); ++it )
    {
      p = &*it;
      pos = it.position();
      dp = &ovol.at(pos);
      pos[it.line_direction()]++;
      ds = &ovol.at(pos) - dp;
 
      for( pp=p + it.line_length(); p!=pp; it.inc_line_ptr( p ), dp+=ds )
      {
        im = repl.find( *p );
        if( im != em )
        {
          // if (im->first != (*p))
          //   std::cout << "Found value: " << carto::toString(im->first) << " did not match searched key: " << carto::toString(*p) << std::endl << std::flush;
          *dp = im->second;
        } 
      }
    }
  }
 
}
 
#endif