norms.hpp

Go to the documentation of this file.

/*
 * Copyright(c):
 * Signal Image and Communications (SIC) Department 
 * http://www.sic.sp2mi.univ-poitiers.fr/ 
 *  - University of Poitiers, France http://www.univ-poitiers.fr 
 *  - XLIM  Institute UMR CNRS 7252  http://www.xlim.fr/ 
 * 
 * and 
 * 
 * D2 Fluid, Thermic and Combustion 
 *  - University of Poitiers, France http://www.univ-poitiers.fr 
 *  - PPRIME Institute -  UPR CNRS 3346  http://www.pprime.fr
 *  - ISAE-ENSMA http://www.ensma.fr
 *
 * Contributor(s):
 * The SLIP team,
 * Benoit Tremblais <tremblais_AT_sic.univ-poitiers.fr>,
 * Laurent David <laurent.david_AT_lea.univ-poitiers.fr>, 
 * Ludovic Chatellier <ludovic.chatellier_AT_univ-poitiers.fr>, 
 * Lionel Thomas <lionel.thomas_AT_univ-poitiers.fr>, 
 * Denis Arrivault <arrivault_AT_sic.univ-poitiers.fr>, 
 * Julien Dombre <julien.dombre_AT_univ-poitiers.fr>.
 *
 * Description:
 * The Simple Library of Image Processing (SLIP) is a new image processing 
 * library. It is written in the C++ language following as much as possible 
 * the ISO/ANSI C++ standard. It is consequently compatible with any system  
 * satisfying the ANSI C++ complience. It works on different Unix , Linux ,  
 * Mircrosoft Windows and Mac OS X plateforms. SLIP is a research library that  
 * was created by the Signal, Image and Communications (SIC) departement of  
 * the XLIM, UMR 7252 CNRS Institute in collaboration with the Fluids, Thermic  
 * and Combustion departement of the P', UPR 3346 CNRS Institute of the  
 * University of Poitiers.
 * 
 * The SLIP Library source code has been registered to the APP (French Agency 
 * for the Protection of Programs) by the University of Poitiers and CNRS, 
 * under  registration number IDDN.FR.001.300034.000.S.P.2010.000.21000.

 * http://www.sic.sp2mi.univ-poitiers.fr/slip/
 *
 * This software is governed by the CeCILL-C 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-C 
 * 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-C license and that you accept its terms.
 */



#ifndef SLIP_NORMS_HPP
#define SLIP_NORMS_HPP


#include <algorithm>
#include <numeric>
#include <cassert>
#include <cmath>
#include "complex_cast.hpp"

namespace slip
{

  template<typename Value_T, typename InputIterator>
  inline
  Value_T L22_norm(InputIterator first,
                                   InputIterator last)
  {
    assert(first != last);
    return std::inner_product(first,last,first,Value_T(0));
  }


 

template<typename Value_T, typename InputIterator,typename MaskIterator>
  inline
   Value_T L22_norm_mask(InputIterator first,
                         InputIterator last,
                         MaskIterator mask_first, 
                         typename std::iterator_traits<MaskIterator>::value_type value=typename
                           std::iterator_traits<MaskIterator>::value_type(1))
{
assert(first != last);
    
    Value_T __init = Value_T();
    for (; first != last; ++first,++mask_first)
     {
        if(*mask_first == value)
         {
         __init +=(*first)*(*first);
          }
     }
    return __init;
}

template<typename Value_T,
           typename InputIterator, 
           typename Predicate>
Value_T L22_norm_if(InputIterator first,
                       InputIterator last,
                       Predicate pred)
{
assert(first != last);
    
    Value_T __init = Value_T();
    for (; first != last; ++first)
     {
        if(pred(*first))
         {
         __init +=(*first)*(*first);
          }
     }
    return __init;
}


  template<typename Value_T, typename InputIterator>
  inline
  Value_T L2_norm(InputIterator first,
                                  InputIterator last)
  {
    return std::sqrt(slip::L22_norm<Value_T>(first,last));
  }

template<typename Value_T, typename InputIterator,typename MaskIterator>
  inline
   Value_T L2_norm_mask(InputIterator first,
                         InputIterator last,
                         MaskIterator mask_first, 
                         typename std::iterator_traits<MaskIterator>::value_type value=typename
                           std::iterator_traits<MaskIterator>::value_type(1))
{
return std::sqrt(slip::L22_norm_mask<Value_T>(first,last,mask_first,value));
}


template<typename Value_T,
           typename InputIterator, 
           typename Predicate>
Value_T L2_norm_if(InputIterator first,
                       InputIterator last,
                      Predicate pred)

{
return std::sqrt(slip::L22_norm_if<Value_T>(first,last,pred));
}

  template<typename Value_T, typename InputIterator>
  inline
  Value_T Euclidean_norm(InputIterator first,
                                                 InputIterator last)
  {
    return slip::L2_norm<Value_T>(first,last);
  }

 template<typename Value_T, typename InputIterator,typename MaskIterator>
  inline
  Value_T Euclidean_norm_mask(InputIterator first,
                                                      InputIterator last,
                              MaskIterator mask_first, 
                              typename std::iterator_traits<MaskIterator>::value_type value=typename
                                                      std::iterator_traits<MaskIterator>::value_type(1))
  {
    return slip::L2_norm_mask<Value_T>(first,last,mask_first,value);
    }


template<typename Value_T, typename InputIterator, typename Predicate>
  inline
  Value_T Euclidean_norm_if(InputIterator first,
                                                      InputIterator last,
                              Predicate pred)
  {
    return slip::L2_norm_if<Value_T>(first,last,pred);
   
 }
 
  template<typename Value_T, typename InputIterator>
  inline
  Value_T L1_norm(InputIterator first,
                                  InputIterator last)
  {
    assert(first != last);
    
    Value_T __init = Value_T(0);
    for (; first != last; ++first)
      __init = __init + std::abs(*first);
    return __init;
  }
template<typename Value_T, typename InputIterator,typename MaskIterator>
  inline
   Value_T L1_norm_mask(InputIterator first,
                         InputIterator last,
                         MaskIterator mask_first, 
                         typename std::iterator_traits<MaskIterator>::value_type value=typename
                                                std::iterator_traits<MaskIterator>::value_type(1))
{
 assert(first != last);
    
    Value_T __init = Value_T(0);
    for (; first != last; ++first,++mask_first)
     {
        if(*mask_first == value)
         {
         __init = __init + std::abs(*first);
          }
     }
    return __init;
 }

template<typename Value_T,
           typename InputIterator, 
           typename Predicate>
Value_T L1_norm_if(InputIterator first,
                       InputIterator last,
                       Predicate pred)
{
assert(first != last);
    
    Value_T __init = Value_T(0);
    for (; first != last; ++first)
     {
         if(pred(*first))
         {
         __init = __init + std::abs(*first);
          }
     }
    return __init;
}

  template<typename Value_T, typename InputIterator>
  inline
  Value_T infinite_norm(InputIterator first,
                                                InputIterator last)
  {
   
    if(first == last)
      return std::abs(*first);
    
    InputIterator result = first;
   
      while (++first != last)
                {
                  
        if (std::abs(*result) < std::abs(*first))
          result = first;
                }
      return std::abs(*result);

  }
 
template<typename Value_T, typename InputIterator,typename MaskIterator>
  inline
   Value_T infinite_norm_mask(InputIterator first,
                         InputIterator last,
                         MaskIterator mask_first, 
                         typename std::iterator_traits<MaskIterator>::value_type value=typename
                                                      std::iterator_traits<MaskIterator>::value_type(1))

{
    if(first == last)
      return std::abs(*first);
   
    InputIterator result = first;
    ++mask_first;
    
      while (++first != last)
                {
                  if(*mask_first==value)
                    {
             if (std::abs(*result) < std::abs(*first))
               {
                result = first;
               }
          
            }
                  ++mask_first;
                }
      return std::abs(*result);

  }


template<typename Value_T,
           typename InputIterator, 
           typename Predicate>
Value_T infinite_norm_if(InputIterator first,
                         InputIterator last,
                                                  Predicate pred)

{
 if(first == last)
      return std::abs(*first);
   
    InputIterator result = first;
   
    
      while (++first != last)
                {
                  if(pred(*first))
                    {
             if (std::abs(*result) < std::abs(*first))
               {
                result = first;
               }
          
            }
                
                }
      return std::abs(*result);
}



}//slip::


#endif //SLIP_NORMS_HPP