aimsalgo 6.0.0
Neuroimaging image processing
pcastrategy.h
Go to the documentation of this file.
1/* This software and supporting documentation are distributed by
2 * Institut Federatif de Recherche 49
3 * CEA/NeuroSpin, Batiment 145,
4 * 91191 Gif-sur-Yvette cedex
5 * France
6 *
7 * This software is governed by the CeCILL-B license under
8 * French law and abiding by the rules of distribution of free software.
9 * You can use, modify and/or redistribute the software under the
10 * terms of the CeCILL-B license as circulated by CEA, CNRS
11 * and INRIA at the following URL "http://www.cecill.info".
12 *
13 * As a counterpart to the access to the source code and rights to copy,
14 * modify and redistribute granted by the license, users are provided only
15 * with a limited warranty and the software's author, the holder of the
16 * economic rights, and the successive licensors have only limited
17 * liability.
18 *
19 * In this respect, the user's attention is drawn to the risks associated
20 * with loading, using, modifying and/or developing or reproducing the
21 * software by the user in light of its specific status of free software,
22 * that may mean that it is complicated to manipulate, and that also
23 * therefore means that it is reserved for developers and experienced
24 * professionals having in-depth computer knowledge. Users are therefore
25 * encouraged to load and test the software's suitability as regards their
26 * requirements in conditions enabling the security of their systems and/or
27 * data to be ensured and, more generally, to use and operate it in the
28 * same conditions as regards security.
29 *
30 * The fact that you are presently reading this means that you have had
31 * knowledge of the CeCILL-B license and that you accept its terms.
32 */
33
34
35
36#ifndef PCASTRATEGY_H
37#define PCASTRATEGY_H
38
42#include <aims/vector/vector.h>
43#include <vector>
44#include <list>
45
46
47namespace aims {
48 template<class T>
49 class PcaStrategy : public ClassifStrategy<T> {
50 public:
57
58 PcaStrategy( const PcaStrategy<T>& pcaStrat );
59 PcaStrategy( int nbIterations = 50,
60 DistanceType distanceType = NORM2SQR,
61 const std::vector< Individuals<T> >& codeVector = std::vector< Individuals<T> >() ) ;
62 virtual ~PcaStrategy() ;
63 virtual ClassifStrategy<T> * clone() const ;
64
65 virtual void analyse( const std::vector< std::list< Individuals<T> > >& classes ) ;
66 virtual int agregation( const Individuals<T>& individual ) ;
67 virtual bool classificationCompleted( int nbChanges ) ;
68
69 private:
70 virtual float distance( const Individuals<T>& individual, int classe ) ;
71 float (Distance<T>:: * myDistance)( const std::vector<T>& ind1, const std::vector<T>& ind2,
72 unsigned int beginIndex, int endIndex ) ;
73 } ;
74}
75
76#endif
ClassifStrategy(int maxNbOfIterations=50)
virtual void analyse(const std::vector< std::list< Individuals< T > > > &classes)
virtual ~PcaStrategy()
virtual bool classificationCompleted(int nbChanges)
PcaStrategy(const PcaStrategy< T > &pcaStrat)
virtual ClassifStrategy< T > * clone() const
virtual int agregation(const Individuals< T > &individual)