distance_d.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.
 */
 
 
#ifndef DISTANCE_D_H
#define DISTANCE_D_H
 
#include <cstdlib>
#include <aims/classification/distance.h>
#include <math.h>
 
 
template <class T>
aims::Distance<T>::Distance()
{
}
 
template <class T>
aims::Distance<T>::~Distance()
{
}
 
template <class T>
float aims::Distance<T>::norm1( const std::vector<T>& ind1, const std::vector<T>& ind2, 
                                unsigned int beginIndex, unsigned int endIndex )
{
  unsigned int size1, size2 ;
  size1 = ind1.size() ;
  size2 = ind2.size() ;
  ASSERT( size1 == size2 ) ;
 
  float dist = 0. ;  
  for( unsigned int i = beginIndex ; i <= endIndex ; ++i )
    dist += fabs( double( ind1[i] - ind2[i] ) ) ;   
  return dist ;
}
 
 
template <class T>
float aims::Distance<T>::norm2( const std::vector<T>& ind1, const std::vector<T>& ind2, 
                                unsigned int beginIndex, unsigned int endIndex )
{
  unsigned int size1, size2 ;
  size1 = ind1.size() ;
  size2 = ind2.size() ;
  ASSERT( size1 == size2 ) ;
 
  float dist = 0. ;
  for( unsigned int i = beginIndex ; i <= endIndex ; ++i )
    dist += ( ind1[i] - ind2[i] ) * ( ind1[i] - ind2[i] ) ;
  return sqrt( dist ) ;
}
 
 
template <class T>
float aims::Distance<T>::norm2sqr( const std::vector<T>& ind1, const std::vector<T>& ind2, 
                                   unsigned int beginIndex, unsigned int endIndex )
{    
  unsigned int size1, size2 ;
  size1 = ind1.size() ;
  size2 = ind2.size() ;
  ASSERT( size1 == size2 ) ;
 
  float dist = 0. ;
  for( unsigned int i = beginIndex ; i <= endIndex ; ++i )
    dist += ( ind1[i] - ind2[i] ) * ( ind1[i] - ind2[i] ) ;   
  return dist ;
}
 
 
template <class T>
float aims::Distance<T>::infiniteNorm( const std::vector<T>& ind1, const std::vector<T>& ind2, 
                                       unsigned int beginIndex, unsigned int endIndex )
{
  unsigned int size1, size2 ;
  size1 = ind1.size() ;
  size2 = ind2.size() ;
  ASSERT( size1 == size2 ) ;
 
  float dist = 0., distmax = 0. ;
  for( unsigned int i = beginIndex ; i <= endIndex ; ++i ){
    dist = fabs( double( ind1[i] - ind2[i] ) ) ;   
    if( dist > distmax ) distmax = dist ;
  }
  return distmax ;
}
 
#endif