diff --git a/Modules/IGT/IGTFilters/mitkNavigationDataEvaluationFilter.cpp b/Modules/IGT/IGTFilters/mitkNavigationDataEvaluationFilter.cpp
index 62dcdd2b9f..b49cc29ea5 100644
--- a/Modules/IGT/IGTFilters/mitkNavigationDataEvaluationFilter.cpp
+++ b/Modules/IGT/IGTFilters/mitkNavigationDataEvaluationFilter.cpp
@@ -1,353 +1,225 @@
 /*=========================================================================
 
 Program:   Medical Imaging & Interaction Toolkit
 Language:  C++
 Date:      $Date$
 Version:   $Revision: 16011 $
 
 Copyright (c) German Cancer Research Center, Division of Medical and
 Biological Informatics. All rights reserved.
 See MITKCopyright.txt or http://www.mitk.org/copyright.html for details.
 
 This software is distributed WITHOUT ANY WARRANTY; without even
 the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
 PURPOSE.  See the above copyright notices for more information.
 
 =========================================================================*/
 
 #include "mitkNavigationDataEvaluationFilter.h"
-#include <algorithm>
-
+#include <mitkPointSetStatisticsCalculator.h>
 
 mitk::NavigationDataEvaluationFilter::NavigationDataEvaluationFilter()
 : mitk::NavigationDataToNavigationDataFilter()
 {
 
 }
 
 
 mitk::NavigationDataEvaluationFilter::~NavigationDataEvaluationFilter()
 {
 
 }
 
 void mitk::NavigationDataEvaluationFilter::GenerateData()
 {
 
     this->CreateOutputsForAllInputs(); // make sure that we have the same number of outputs as inputs
     this->CreateMembersForAllInputs();
 
     /* update outputs with tracking data from tools */
     for (unsigned int i = 0; i < this->GetNumberOfOutputs() ; ++i)
     {
       //first copy outputs to inputs
       mitk::NavigationData* output = this->GetOutput(i);
       assert(output);
       const mitk::NavigationData* input = this->GetInput(i);
       assert(input);
       if (input->IsDataValid() == false) {output->SetDataValid(false);}
       else {output->Graft(input);}
 
       //then save statistics
       if(input->IsDataValid())
         {
         m_LoggedPositions[i].push_back(input->GetPosition());
         m_LoggedQuaternions[i].push_back(input->GetOrientation());
         }
       else 
         {
         m_InavildSamples[i]++;
         }
     }
   
 }
 void mitk::NavigationDataEvaluationFilter::CreateMembersForAllInputs()
 {
   while(this->m_LoggedPositions.size() < this->GetNumberOfInputs())
     {
     std::pair<int,std::vector<mitk::Point3D> > newElement(m_LoggedPositions.size(),std::vector<mitk::Point3D>());
     m_LoggedPositions.insert(newElement);
     }
   while(this->m_LoggedQuaternions.size() < this->GetNumberOfInputs())
     {
     std::pair<int,std::vector<mitk::Quaternion> > newElement(m_LoggedQuaternions.size(),std::vector<mitk::Quaternion>());
     m_LoggedQuaternions.insert(newElement);
     }
   while(this->m_InavildSamples.size() < this->GetNumberOfInputs())
     {
     std::pair<int,int> newElement(m_LoggedQuaternions.size(),0);
     m_InavildSamples.insert(newElement);
     }
 
   
 }
 
 void mitk::NavigationDataEvaluationFilter::ResetStatistic()
 {
 for (int i = 0; i < m_LoggedPositions.size(); i++) m_LoggedPositions[i] = std::vector<mitk::Point3D>();
 for (int i = 0; i < m_LoggedQuaternions.size(); i++) m_LoggedQuaternions[i] = std::vector<mitk::Quaternion>();
 for (int i = 0; i < m_InavildSamples.size(); i++) m_InavildSamples[i] = 0;
 }
 
 int mitk::NavigationDataEvaluationFilter::GetNumberOfAnalysedNavigationData(int input)
 {
 return this->m_LoggedPositions[input].size();
 }
 
 
 mitk::Point3D mitk::NavigationDataEvaluationFilter::GetPositionMean(int input)
 {
-return GetMean(m_LoggedPositions[input]);
+mitk::PointSetStatisticsCalculator::Pointer myCalculator = mitk::PointSetStatisticsCalculator::New(VectorToPointSet(m_LoggedPositions[input]));
+return myCalculator->GetPositionMean();
 }
 
 mitk::Vector3D mitk::NavigationDataEvaluationFilter::GetPositionStandardDeviation(int input)
 {
-mitk::Vector3D returnValue;
-std::vector<double> listX = std::vector<double>();
-std::vector<double> listY = std::vector<double>();
-std::vector<double> listZ = std::vector<double>();
-for (int i=0; i<m_LoggedPositions[input].size(); i++)
-  {
-  listX.push_back(m_LoggedPositions[input].at(i)[0]);
-  listY.push_back(m_LoggedPositions[input].at(i)[1]);
-  listZ.push_back(m_LoggedPositions[input].at(i)[2]);
-  }
-returnValue[0] = GetStabw(listX);
-returnValue[1] = GetStabw(listY);
-returnValue[2] = GetStabw(listZ);
-return returnValue;
+mitk::PointSetStatisticsCalculator::Pointer myCalculator = mitk::PointSetStatisticsCalculator::New(VectorToPointSet(m_LoggedPositions[input]));
+return myCalculator->GetPositionStandardDeviation();
 }
 
 mitk::Vector3D mitk::NavigationDataEvaluationFilter::GetPositionSampleStandardDeviation(int input)
 {
-mitk::Vector3D returnValue;
-std::vector<double> listX = std::vector<double>();
-std::vector<double> listY = std::vector<double>();
-std::vector<double> listZ = std::vector<double>();
-for (int i=0; i<m_LoggedPositions[input].size(); i++)
-  {
-  listX.push_back(m_LoggedPositions[input].at(i)[0]);
-  listY.push_back(m_LoggedPositions[input].at(i)[1]);
-  listZ.push_back(m_LoggedPositions[input].at(i)[2]);
-  }
-returnValue[0] = GetSampleStabw(listX);
-returnValue[1] = GetSampleStabw(listY);
-returnValue[2] = GetSampleStabw(listZ);
-return returnValue;
+mitk::PointSetStatisticsCalculator::Pointer myCalculator = mitk::PointSetStatisticsCalculator::New(VectorToPointSet(m_LoggedPositions[input]));
+return myCalculator->GetPositionSampleStandardDeviation();
 }
 
 mitk::Quaternion mitk::NavigationDataEvaluationFilter::GetQuaternionMean(int input)
 {
 return GetMean(m_LoggedQuaternions[input]);
 }
 
 mitk::Quaternion mitk::NavigationDataEvaluationFilter::GetQuaternionStandardDeviation(int input)
 {
 mitk::Quaternion returnValue;
 std::vector<double> list1 = std::vector<double>();
 std::vector<double> list2 = std::vector<double>();
 std::vector<double> list3 = std::vector<double>();
 std::vector<double> list4 = std::vector<double>();
 for (int i=0; i<m_LoggedQuaternions[input].size(); i++)
   {
   list1.push_back(m_LoggedQuaternions[input].at(i)[0]);
   list2.push_back(m_LoggedQuaternions[input].at(i)[1]);
   list3.push_back(m_LoggedQuaternions[input].at(i)[2]);
   list4.push_back(m_LoggedQuaternions[input].at(i)[3]);
   }
-returnValue[0] = GetStabw(list1);
-returnValue[1] = GetStabw(list2);
-returnValue[2] = GetStabw(list3);
-returnValue[3] = GetStabw(list4);
+//returnValue[0] = GetStabw(list1);
+//returnValue[1] = GetStabw(list2);
+//returnValue[2] = GetStabw(list3);
+//returnValue[3] = GetStabw(list4);
 return returnValue;
 }
 
 
 double mitk::NavigationDataEvaluationFilter::GetPositionErrorMean(int input)
 {
-double returnValue = 0.0;
-mitk::Point3D mean = GetMean(m_LoggedPositions[input]);
-
-for(int i=0; i<m_LoggedPositions[input].size(); i++)
-  {
-  returnValue += mean.EuclideanDistanceTo(m_LoggedPositions[input].at(i));
-  }
-returnValue /= m_LoggedPositions[input].size();
-
-return returnValue;
+mitk::PointSetStatisticsCalculator::Pointer myCalculator = mitk::PointSetStatisticsCalculator::New(VectorToPointSet(m_LoggedPositions[input]));
+return myCalculator->GetPositionErrorMean();
 }
 
 double mitk::NavigationDataEvaluationFilter::GetPositionErrorStandardDeviation(int input)
 {
-return GetStabw(GetErrorList(m_LoggedPositions[input]));
+mitk::PointSetStatisticsCalculator::Pointer myCalculator = mitk::PointSetStatisticsCalculator::New(VectorToPointSet(m_LoggedPositions[input]));
+return myCalculator->GetPositionErrorStandardDeviation();
 }
 
 double mitk::NavigationDataEvaluationFilter::GetPositionErrorSampleStandardDeviation(int input)
 {
-return GetSampleStabw(GetErrorList(m_LoggedPositions[input]));
+mitk::PointSetStatisticsCalculator::Pointer myCalculator = mitk::PointSetStatisticsCalculator::New(VectorToPointSet(m_LoggedPositions[input]));
+return myCalculator->GetPositionErrorSampleStandardDeviation();
 }
 
 
 double mitk::NavigationDataEvaluationFilter::GetPositionErrorRMS(int input)
 {
-double returnValue = 0.0;
-
-mitk::Point3D mean = GetMean(m_LoggedPositions[input]);
-
-for(int i=0; i<m_LoggedPositions[input].size(); i++)
-  {
-  returnValue += pow(mean.EuclideanDistanceTo(m_LoggedPositions[input].at(i)),2);
-  }
-returnValue /= m_LoggedPositions[input].size();
-returnValue = sqrt(returnValue);
-
-return returnValue;
+mitk::PointSetStatisticsCalculator::Pointer myCalculator = mitk::PointSetStatisticsCalculator::New(VectorToPointSet(m_LoggedPositions[input]));
+return myCalculator->GetPositionErrorRMS();
 }
 
 double mitk::NavigationDataEvaluationFilter::GetPositionErrorMedian(int input)
 {
-return GetMedian(GetErrorList(m_LoggedPositions[input]));
+mitk::PointSetStatisticsCalculator::Pointer myCalculator = mitk::PointSetStatisticsCalculator::New(VectorToPointSet(m_LoggedPositions[input]));
+return myCalculator->GetPositionErrorMedian();
 }
 
 double mitk::NavigationDataEvaluationFilter::GetPositionErrorMax(int input)
 {
-return GetMax(GetErrorList(m_LoggedPositions[input]));
+mitk::PointSetStatisticsCalculator::Pointer myCalculator = mitk::PointSetStatisticsCalculator::New(VectorToPointSet(m_LoggedPositions[input]));
+return myCalculator->GetPositionErrorMax();
 }
   
 double mitk::NavigationDataEvaluationFilter::GetPositionErrorMin(int input)
 {
-return GetMin(GetErrorList(m_LoggedPositions[input]));
+mitk::PointSetStatisticsCalculator::Pointer myCalculator = mitk::PointSetStatisticsCalculator::New(VectorToPointSet(m_LoggedPositions[input]));
+return myCalculator->GetPositionErrorMin();
 }
 
 int mitk::NavigationDataEvaluationFilter::GetNumberOfInvalidSamples(int input)
 {
 return m_InavildSamples[input];
 }
 
 double mitk::NavigationDataEvaluationFilter::GetPercentageOfInvalidSamples(int input)
 {
 return (m_InavildSamples[input]/(m_InavildSamples[input]+((double)m_LoggedPositions[input].size())))*100.0;
 }
 
-double mitk::NavigationDataEvaluationFilter::GetMedian(std::vector<double> list)
-{
-std::sort(list.begin(), list.end());
-if (list.size() % 2 == 0.) //even
-  {
-  double element1 = list.at(list.size()/2);
-  double element2 = list.at(list.size()/2);
-  return ((element1+element2)/2.0);
-  }
-else //odd
-  {
-  return list.at((list.size())/2);
-  }
-}
-
-std::vector<double> mitk::NavigationDataEvaluationFilter::GetErrorList(std::vector<mitk::Point3D> list)
-{
-std::vector<double> errorList = std::vector<double>();
-mitk::Point3D mean = GetMean(list);
-for(int i=0; i<list.size(); i++)
-  {
-  errorList.push_back(mean.EuclideanDistanceTo(list.at(i)));
-  }
-return errorList;
-}
-
-mitk::Point3D mitk::NavigationDataEvaluationFilter::GetMean(std::vector<mitk::Point3D> list)
-{
-//calculate mean
-mitk::Point3D mean;
-mean.Fill(0);
-
-for (int i=0; i<list.size(); i++)
-  {
-  mean[0] += list.at(i)[0];
-  mean[1] += list.at(i)[1];
-  mean[2] += list.at(i)[2];
-  }
-
-mean[0] /= list.size();
-mean[1] /= list.size();
-mean[2] /= list.size();
-
-return mean;
-
-}
-
-double mitk::NavigationDataEvaluationFilter::GetMax(std::vector<double> list)
-{
-std::sort(list.begin(), list.end());
-return list.at(list.size()-1);
-}
-
-double mitk::NavigationDataEvaluationFilter::GetMin(std::vector<double> list)
-{
-std::sort(list.begin(), list.end());
-return list.at(0);
-}
-
-double mitk::NavigationDataEvaluationFilter::GetStabw(std::vector<double> list)
-{
-double returnValue = 0;
-double mean = GetMean(list);
-for(int i=0; i<list.size(); i++)
-  {
-  returnValue += pow((list.at(i)-mean),2);
-  }
-
-returnValue /= list.size();
-returnValue = sqrt(returnValue);
-return returnValue;
-}
-
-double mitk::NavigationDataEvaluationFilter::GetSampleStabw(std::vector<double> list)
-{
-double returnValue = 0;
-double mean = GetMean(list);
-for(int i=0; i<list.size(); i++)
-  {
-  returnValue += pow((list.at(i)-mean),2);
-  }
-
-returnValue /= (list.size()-1);
-returnValue = sqrt(returnValue);
-return returnValue;
-}
-
-double  mitk::NavigationDataEvaluationFilter::GetMean(std::vector<double> list)
-{
-double mean = 0;
-for(int i=0; i<list.size(); i++)
-  {
-  mean += list.at(i);
-  }
-mean /= list.size();
-return mean;
-}
-
 mitk::Quaternion mitk::NavigationDataEvaluationFilter::GetMean(std::vector<mitk::Quaternion> list)
 {
 //calculate mean
 mitk::Quaternion mean;
 mean[0] = 0;
 mean[1] = 0;
 mean[2] = 0;
 mean[3] = 0;
 
 for (int i=0; i<list.size(); i++)
   {
   mean[0] += list.at(i)[0];
   mean[1] += list.at(i)[1];
   mean[2] += list.at(i)[2];
   mean[3] += list.at(i)[3];
   }
 
 mean[0] /= list.size();
 mean[1] /= list.size();
 mean[2] /= list.size();
 mean[3] /= list.size();
 
 return mean;
+}
+
+mitk::PointSet::Pointer mitk::NavigationDataEvaluationFilter::VectorToPointSet(std::vector<mitk::Point3D> pSet)
+{
+  mitk::PointSet::Pointer returnValue = mitk::PointSet::New();
+  for (int i=0; i<pSet.size(); i++) returnValue->InsertPoint(i,pSet.at(i)); 
+  return returnValue;
 }
\ No newline at end of file
diff --git a/Modules/IGT/IGTFilters/mitkNavigationDataEvaluationFilter.h b/Modules/IGT/IGTFilters/mitkNavigationDataEvaluationFilter.h
index a09623301f..fd1b4dfa35 100644
--- a/Modules/IGT/IGTFilters/mitkNavigationDataEvaluationFilter.h
+++ b/Modules/IGT/IGTFilters/mitkNavigationDataEvaluationFilter.h
@@ -1,126 +1,108 @@
 /*=========================================================================
 
 Program:   Medical Imaging & Interaction Toolkit
 Language:  C++
 Date:      $Date$
 Version:   $Revision: 16011 $
 
 Copyright (c) German Cancer Research Center, Division of Medical and
 Biological Informatics. All rights reserved.
 See MITKCopyright.txt or http://www.mitk.org/copyright.html for details.
 
 This software is distributed WITHOUT ANY WARRANTY; without even
 the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
 PURPOSE.  See the above copyright notices for more information.
 
 =========================================================================*/
 
 
 #ifndef MITKNavigationDataEvaluationFilter_H_HEADER_INCLUDED_
 #define MITKNavigationDataEvaluationFilter_H_HEADER_INCLUDED_
 
 #include <mitkNavigationDataToNavigationDataFilter.h>
-
+#include <mitkPointSet.h>
 #include <itkQuaternionRigidTransform.h>
 #include <itkTransform.h>
 
 
 namespace mitk {
 
   /**Documentation
   * \brief NavigationDataEvaluationFilter calculates statistical data (mean value, mean error, etc.) on the input navigation data.
   * Input navigation data are set 1:1 on output navigation data.
   *
   * \ingroup IGT
   */
   class MitkIGT_EXPORT NavigationDataEvaluationFilter : public NavigationDataToNavigationDataFilter
   {
 
   public:
 
     mitkClassMacro(NavigationDataEvaluationFilter, NavigationDataToNavigationDataFilter);
     itkNewMacro(Self);
 
     /** @brief Resets all statistics and starts again. */
     void ResetStatistic();
 
     /** @return Returns the number of analysed navigation datas for the specified input (without invalid samples). */
     int GetNumberOfAnalysedNavigationData(int input);
     /** @return Returns the number of invalid samples for the specified input. Invalid samples are ignored for the statistical calculation.*/
     int GetNumberOfInvalidSamples(int input);
     /** @return Returns the percentage of invalid samples in relation to all samples for the specified input.*/
     double GetPercentageOfInvalidSamples(int input);
     /** @return Returns the mean position of the specified input since the start of the statistic (last call of ResetStatistic()) */
     mitk::Point3D GetPositionMean(int input);
     /** @return Returns the standard derivation of each component (x, y and z) of the specified input since the start of the statistic (last call of ResetStatistic()) */
     mitk::Vector3D GetPositionStandardDeviation(int input);
     /** @return Returns the sample standard derivation of each component (x, y and z) of the specified input since the start of the statistic (last call of ResetStatistic()) */
     mitk::Vector3D GetPositionSampleStandardDeviation(int input);
 
     /** @return Returns the mean quaternion of the specified input since the start of the statistic (last call of ResetStatistic()) */
     mitk::Quaternion GetQuaternionMean(int input);
     /** @return Returns the standard derivation of each component of the specified input since the start of the statistic (last call of ResetStatistic()) */
     mitk::Quaternion GetQuaternionStandardDeviation(int input);
     
 
     /** @return Returns the mean distance to the mean postion (=mean error) to the specified input. */
     double GetPositionErrorMean(int input);
     /** @return Returns the standard derivation of the errors of all positions to the specified input. */
     double GetPositionErrorStandardDeviation(int input);
     /** @return Returns the sample standard derivation of the errors of all positions to the specified input. */
     double GetPositionErrorSampleStandardDeviation(int input);
     /** @return Returns the RMS of the errors of all positions to the specified input. */
     double GetPositionErrorRMS(int input);
     /** @return Returns the median of the errors of all positions to the specified input. */
     double GetPositionErrorMedian(int input);
     /** @return Returns the maximum of the errors of all positions to the specified input. */
     double GetPositionErrorMax(int input);
     /** @return Returns the minimum of the errors of all positions to the specified input. */
     double GetPositionErrorMin(int input);
       
   protected:
 
     NavigationDataEvaluationFilter();
     virtual ~NavigationDataEvaluationFilter();
 
     /**Documentation
     * \brief filter execute method
     *
     * transforms navigation data
     */
     virtual void GenerateData();
 
     /** @brief Creates the member variables which store all the statistical data for every input. */
     void CreateMembersForAllInputs();
 
     
     std::map<int,std::vector<mitk::Point3D> > m_LoggedPositions; //a map here, to have one list for every navigation data
     std::map<int,std::vector<mitk::Quaternion> > m_LoggedQuaternions;
     std::map<int,int> m_InavildSamples;
 
-
-    /** @return returns a list with the distances to the mean of the list */
-    std::vector<double> GetErrorList(std::vector<mitk::Point3D> list);
-
-    mitk::Point3D GetMean(std::vector<mitk::Point3D> list);
-
     mitk::Quaternion GetMean(std::vector<mitk::Quaternion> list);
 
-
-    double GetMean(std::vector<double> list);
-
-    double GetMedian(std::vector<double> list);
-
-    double GetMax(std::vector<double> list);
-
-    double GetMin(std::vector<double> list);
-
-    /** @return returns the standard derivation of the list */
-    double GetStabw(std::vector<double> list);
-
-    /** @return returns the sample standard derivation of the list */
-    double GetSampleStabw(std::vector<double> list);
+    mitk::PointSet::Pointer VectorToPointSet(std::vector<mitk::Point3D> pSet);
+    
   };
 } // namespace mitk
 
 #endif /* MITKNavigationDataEvaluationFilter_H_HEADER_INCLUDED_ */
\ No newline at end of file
diff --git a/Modules/ImageStatistics/mitkPointSetStatisticsCalculator.cpp b/Modules/ImageStatistics/mitkPointSetStatisticsCalculator.cpp
index 4695c93783..9756a6977a 100644
--- a/Modules/ImageStatistics/mitkPointSetStatisticsCalculator.cpp
+++ b/Modules/ImageStatistics/mitkPointSetStatisticsCalculator.cpp
@@ -1,28 +1,247 @@
 /*=========================================================================
 
 Program:   Medical Imaging & Interaction Toolkit
 Language:  C++
 Date:      $Date: 2009-05-12 19:56:03 +0200 (Di, 12 Mai 2009) $
 Version:   $Revision: 17179 $
 
 Copyright (c) German Cancer Research Center, Division of Medical and
 Biological Informatics. All rights reserved.
 See MITKCopyright.txt or http://www.mitk.org/copyright.html for details.
 
 This software is distributed WITHOUT ANY WARRANTY; without even
 the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
 PURPOSE.  See the above copyright notices for more information.
 
 =========================================================================*/
 
 
 #include "mitkPointSetStatisticsCalculator.h"
 
 mitk::PointSetStatisticsCalculator::PointSetStatisticsCalculator()
 {
+  m_PointSet = mitk::PointSet::New();
 }
 
+mitk::PointSetStatisticsCalculator::PointSetStatisticsCalculator(mitk::PointSet::Pointer pSet)
+{
+  m_PointSet = pSet;
+}
 
 mitk::PointSetStatisticsCalculator::~PointSetStatisticsCalculator()
 {
-}
\ No newline at end of file
+}
+
+void mitk::PointSetStatisticsCalculator::SetPointSet(mitk::PointSet::Pointer pSet)
+{
+  if (pSet.IsNull()) return;
+  m_PointSet = pSet;
+}
+
+std::vector<mitk::Point3D> mitk::PointSetStatisticsCalculator::PointSetToVector(mitk::PointSet::Pointer pSet)
+{
+  std::vector<mitk::Point3D> returnValue = std::vector<mitk::Point3D>();
+  for (int i=0; i<pSet->GetSize(); i++) returnValue.push_back(pSet->GetPoint(i));
+  return returnValue;
+}
+
+double mitk::PointSetStatisticsCalculator::GetMax(std::vector<double> list)
+{
+std::sort(list.begin(), list.end());
+return list.at(list.size()-1);
+}
+
+double mitk::PointSetStatisticsCalculator::GetMin(std::vector<double> list)
+{
+std::sort(list.begin(), list.end());
+return list.at(0);
+}
+
+double mitk::PointSetStatisticsCalculator::GetStabw(std::vector<double> list)
+{
+double returnValue = 0;
+double mean = GetMean(list);
+for(int i=0; i<list.size(); i++)
+  {
+  returnValue += pow((list.at(i)-mean),2);
+  }
+
+returnValue /= list.size();
+returnValue = sqrt(returnValue);
+return returnValue;
+}
+
+double mitk::PointSetStatisticsCalculator::GetSampleStabw(std::vector<double> list)
+{
+double returnValue = 0;
+double mean = GetMean(list);
+for(int i=0; i<list.size(); i++)
+  {
+  returnValue += pow((list.at(i)-mean),2);
+  }
+
+returnValue /= (list.size()-1);
+returnValue = sqrt(returnValue);
+return returnValue;
+}
+
+double mitk::PointSetStatisticsCalculator::GetMean(std::vector<double> list)
+{
+double mean = 0;
+for(int i=0; i<list.size(); i++)
+  {
+  mean += list.at(i);
+  }
+mean /= list.size();
+return mean;
+}
+
+double mitk::PointSetStatisticsCalculator::GetMedian(std::vector<double> list)
+{
+std::sort(list.begin(), list.end());
+if (list.size() % 2 == 0.) //even
+  {
+  double element1 = list.at(list.size()/2);
+  double element2 = list.at(list.size()/2);
+  return ((element1+element2)/2.0);
+  }
+else //odd
+  {
+  return list.at((list.size())/2);
+  }
+}
+
+mitk::Point3D mitk::PointSetStatisticsCalculator::GetMean(std::vector<mitk::Point3D> list)
+{
+//calculate mean
+mitk::Point3D mean;
+mean.Fill(0);
+
+for (int i=0; i<list.size(); i++)
+  {
+  mean[0] += list.at(i)[0];
+  mean[1] += list.at(i)[1];
+  mean[2] += list.at(i)[2];
+  }
+
+mean[0] /= list.size();
+mean[1] /= list.size();
+mean[2] /= list.size();
+
+return mean;
+}
+
+double mitk::PointSetStatisticsCalculator::GetPositionErrorMean()
+{
+double returnValue = 0.0;
+
+std::vector<mitk::Point3D> pSet = PointSetToVector(m_PointSet);
+
+mitk::Point3D mean = GetMean(pSet);
+
+for(int i=0; i<pSet.size(); i++)
+  {
+  returnValue += mean.EuclideanDistanceTo(pSet.at(i));
+  }
+returnValue /= pSet.size();
+
+return returnValue;
+}
+
+double mitk::PointSetStatisticsCalculator::GetPositionErrorStandardDeviation()
+{
+return GetStabw(GetErrorList(PointSetToVector(m_PointSet)));
+}
+
+double mitk::PointSetStatisticsCalculator::GetPositionErrorSampleStandardDeviation()
+{
+return GetSampleStabw(GetErrorList(PointSetToVector(m_PointSet)));
+}
+
+
+double mitk::PointSetStatisticsCalculator::GetPositionErrorRMS()
+{
+double returnValue = 0.0;
+
+std::vector<mitk::Point3D> pSet = PointSetToVector(m_PointSet);
+
+mitk::Point3D mean = GetMean(pSet);
+
+for(int i=0; i<pSet.size(); i++)
+  {
+  returnValue += pow(mean.EuclideanDistanceTo(pSet.at(i)),2);
+  }
+returnValue /= pSet.size();
+returnValue = sqrt(returnValue);
+
+return returnValue;
+}
+
+double mitk::PointSetStatisticsCalculator::GetPositionErrorMedian()
+{
+return GetMedian(GetErrorList(PointSetToVector(m_PointSet)));
+}
+
+double mitk::PointSetStatisticsCalculator::GetPositionErrorMax()
+{
+return GetMax(GetErrorList(PointSetToVector(m_PointSet)));
+}
+  
+double mitk::PointSetStatisticsCalculator::GetPositionErrorMin()
+{
+return GetMin(GetErrorList(PointSetToVector(m_PointSet)));
+}
+
+std::vector<double> mitk::PointSetStatisticsCalculator::GetErrorList(std::vector<mitk::Point3D> list)
+{
+std::vector<double> errorList = std::vector<double>();
+mitk::Point3D mean = GetMean(list);
+for(int i=0; i<list.size(); i++)
+  {
+  errorList.push_back(mean.EuclideanDistanceTo(list.at(i)));
+  }
+return errorList;
+}
+
+mitk::Vector3D mitk::PointSetStatisticsCalculator::GetPositionStandardDeviation()
+{
+mitk::Vector3D returnValue;
+std::vector<mitk::Point3D> pSet = PointSetToVector(m_PointSet);
+std::vector<double> listX = std::vector<double>();
+std::vector<double> listY = std::vector<double>();
+std::vector<double> listZ = std::vector<double>();
+for (int i=0; i<pSet.size(); i++)
+  {
+  listX.push_back(pSet.at(i)[0]);
+  listY.push_back(pSet.at(i)[1]);
+  listZ.push_back(pSet.at(i)[2]);
+  }
+returnValue[0] = GetStabw(listX);
+returnValue[1] = GetStabw(listY);
+returnValue[2] = GetStabw(listZ);
+return returnValue;
+}
+
+mitk::Vector3D mitk::PointSetStatisticsCalculator::GetPositionSampleStandardDeviation()
+{
+mitk::Vector3D returnValue;
+std::vector<mitk::Point3D> pSet = PointSetToVector(m_PointSet);
+std::vector<double> listX = std::vector<double>();
+std::vector<double> listY = std::vector<double>();
+std::vector<double> listZ = std::vector<double>();
+for (int i=0; i<pSet.size(); i++)
+  {
+  listX.push_back(pSet.at(i)[0]);
+  listY.push_back(pSet.at(i)[1]);
+  listZ.push_back(pSet.at(i)[2]);
+  }
+returnValue[0] = GetSampleStabw(listX);
+returnValue[1] = GetSampleStabw(listY);
+returnValue[2] = GetSampleStabw(listZ);
+return returnValue;
+}
+
+mitk::Point3D mitk::PointSetStatisticsCalculator::GetPositionMean()
+{
+return GetMean(PointSetToVector(m_PointSet));
+}
diff --git a/Modules/ImageStatistics/mitkPointSetStatisticsCalculator.h b/Modules/ImageStatistics/mitkPointSetStatisticsCalculator.h
index fa1f0c36fe..f1f53e5015 100644
--- a/Modules/ImageStatistics/mitkPointSetStatisticsCalculator.h
+++ b/Modules/ImageStatistics/mitkPointSetStatisticsCalculator.h
@@ -1,74 +1,110 @@
 /*=========================================================================
 
 Program:   Medical Imaging & Interaction Toolkit
 Language:  C++
 Date:      $Date: 2009-05-12 19:56:03 +0200 (Di, 12 Mai 2009) $
 Version:   $Revision: 17179 $
 
 Copyright (c) German Cancer Research Center, Division of Medical and
 Biological Informatics. All rights reserved.
 See MITKCopyright.txt or http://www.mitk.org/copyright.html for details.
 
 This software is distributed WITHOUT ANY WARRANTY; without even
 the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
 PURPOSE.  See the above copyright notices for more information.
 
 =========================================================================*/
 
 
 #ifndef _MITK_PointSetSTATISTICSCALCULATOR_H
 #define _MITK_PointSetSTATISTICSCALCULATOR_H
 
 #include <itkObject.h>
 #include "ImageStatisticsExports.h"
 #include <mitkPointSet.h>
 
 namespace mitk
 {
 
 /**
  * \brief Class for calculating statistics (like standard derivation, RMS, mean, etc.) for a PointSet.
  */
 class ImageStatistics_EXPORT PointSetStatisticsCalculator : public itk::Object
 {
-public:
-
-  //TODO: move this to an abstract class?
-  struct Statistics
-  {
-    unsigned int N;
-    double Min;
-    double Max;
-    double Mean;
-    double Median;
-    double StandardDerivation;
-    double SampleStandardDerivation;
-    double RMS;
-
-    void Reset()
-    {
-      N = 0;
-      Min = 0.0;
-      Max = 0.0;
-      Mean = 0.0;
-      Median = 0.0;
-      StandardDerivation = 0.0;
-      SampleStandardDerivation = 0.0;
-      RMS = 0.0;
-    }
-  };
-
-
+public: 
+  
   mitkClassMacro( PointSetStatisticsCalculator, itk::Object );
   itkNewMacro( PointSetStatisticsCalculator );
 
+  mitkNewMacro1Param(PointSetStatisticsCalculator,mitk::PointSet::Pointer)
+
+  /** @brief Sets the point set which will be analysed. */
+  void SetPointSet(mitk::PointSet::Pointer pSet);
+
+  /** @return Returns the mean position of the analysed point set.*/
+  mitk::Point3D GetPositionMean();
+  
+  /** @return Returns the standard derivation of each component (x, y and z) of the analysed point set.*/
+  mitk::Vector3D GetPositionStandardDeviation();
+  
+  /** @return Returns the sample standard derivation of each component (x, y and z) of the analysed point set.*/
+  mitk::Vector3D GetPositionSampleStandardDeviation();
+
+  /** @return Returns the mean distance to the mean postion (=mean error) of the analysed point set. */
+  double GetPositionErrorMean();
+  
+  /** @return Returns the standard derivation of the errors of all positions of the analysed point set. */
+  double GetPositionErrorStandardDeviation();
+ 
+  /** @return Returns the sample standard derivation of the errors of all positions of the analysed point set. */
+  double GetPositionErrorSampleStandardDeviation();
+
+  /** @return Returns the RMS of the errors of all positions of the analysed point set. */
+  double GetPositionErrorRMS();
+ 
+  /** @return Returns the median of the errors of all positions of the analysed point set. */
+  double GetPositionErrorMedian();
+ 
+  /** @return Returns the maximum of the errors of all positions of the analysed point set. */
+  double GetPositionErrorMax();
+ 
+  /** @return Returns the minimum of the errors of all positions of the analysed point set. */
+  double GetPositionErrorMin();
+
+  
+
  
 protected:
   
   PointSetStatisticsCalculator();
+  PointSetStatisticsCalculator(mitk::PointSet::Pointer);
   virtual ~PointSetStatisticsCalculator();
+
+  /** @return Returns a list with the distances to the mean of the list */
+  std::vector<double> GetErrorList(std::vector<mitk::Point3D> list);
+
+  mitk::Point3D GetMean(std::vector<mitk::Point3D> list);
+
+  /** @brief Converts a point set to a vector of Point3D. */
+  std::vector<mitk::Point3D> PointSetToVector(mitk::PointSet::Pointer pSet);
+
+  mitk::PointSet::Pointer m_PointSet;
+
+  double GetMean(std::vector<double> list);
+
+  double GetMedian(std::vector<double> list);
+
+  double GetMax(std::vector<double> list);
+
+  double GetMin(std::vector<double> list);
+
+  /** @return returns the standard derivation of the list */
+  double GetStabw(std::vector<double> list);
+
+  /** @return returns the sample standard derivation of the list */
+  double GetSampleStabw(std::vector<double> list);
 };
 
 }
 
 #endif // #define _MITK_PointSetSTATISTICSCALCULATOR_H
\ No newline at end of file