itkKdTreeBasedKmeansEstimator.h

Go to the documentation of this file.

/*=========================================================================

  Program:   Insight Segmentation & Registration Toolkit
  Module:    $RCSfile: itkKdTreeBasedKmeansEstimator.h,v $
  Language:  C++
  Date:      $Date: 2003/02/23 09:11:40 $
  Version:   $Revision: 1.10 $

  Copyright (c) 2002 Insight Consortium. All rights reserved.
  See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm 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 __itkKdTreeBasedKmeansEstimator_h
#define __itkKdTreeBasedKmeansEstimator_h

#include <vector>
#include "itk_hash_map.h"

#include "itkObject.h"

namespace itk {
namespace Statistics {

template< class TKdTree >
class ITK_EXPORT KdTreeBasedKmeansEstimator: 
    public Object
{
public:
  typedef KdTreeBasedKmeansEstimator Self ;
  typedef Object Superclass;
  typedef SmartPointer<Self> Pointer;
  typedef SmartPointer<const Self> ConstPointer;
  
  itkNewMacro(Self);
 
  itkTypeMacro(KdTreeBasedKmeansEstimator, Obeject);
 
  typedef typename TKdTree::KdTreeNodeType KdTreeNodeType ;
  typedef typename TKdTree::MeasurementType MeasurementType ;
  typedef typename TKdTree::MeasurementVectorType MeasurementVectorType ;
  typedef typename TKdTree::InstanceIdentifier InstanceIdentifier ;
  typedef typename TKdTree::SampleType SampleType ;
  typedef typename KdTreeNodeType::CenteroidType CenteroidType ;
  itkStaticConstMacro(MeasurementVectorSize, unsigned int,
                      TKdTree::MeasurementVectorSize);
//   typedef FixedArray< double, itkGetStaticConstMacro(MeasurementVectorSize) > ParameterType ;
  typedef FixedArray< double, itkGetStaticConstMacro(MeasurementVectorSize) > ParameterType ;
  typedef std::vector< ParameterType > InternalParametersType;
  typedef Array< double > ParametersType;

  void SetParameters(ParametersType& params)
  { m_Parameters = params ; }

  ParametersType& GetParameters() 
  { return m_Parameters ; }

  itkSetMacro( MaximumIteration, int );
  itkGetConstMacro( MaximumIteration, int ); 
 
  itkSetMacro( CenteroidPositionChangesThreshold, double );   
  itkGetConstMacro( CenteroidPositionChangesThreshold, double );   
  
  void SetKdTree(TKdTree* tree) 
  { m_KdTree = tree ; }

  TKdTree* GetKdTree() 
  { return m_KdTree ; }

  itkGetConstMacro( CurrentIteration, int) ;
  itkGetConstMacro( CenteroidPositionChanges, double) ;

  void StartOptimization() ;

  typedef itk::hash_map< InstanceIdentifier, unsigned int > ClusterLabelsType ;

  void SetUseClusterLabels(bool flag)
  { m_UseClusterLabels = flag ; }

  ClusterLabelsType* GetClusterLabels() 
  { return &m_ClusterLabels ; }

protected:
  KdTreeBasedKmeansEstimator() ;
  virtual ~KdTreeBasedKmeansEstimator() {}

  void PrintSelf(std::ostream& os, Indent indent) const;

  void FillClusterLabels(KdTreeNodeType* node, int closestIndex) ;

  class CandidateVector
  {
  public:
    CandidateVector() {}

    struct Candidate
    {
      CenteroidType Centeroid ;
      CenteroidType WeightedCenteroid ;
      int Size ;
    } ; // end of struct

    virtual ~CandidateVector() {} 

    int Size()
    { return static_cast<int>( m_Candidates.size() ); }

    void SetCenteroids(InternalParametersType& centeroids)
    {
      m_Candidates.resize(centeroids.size()) ;
      for (unsigned int i = 0 ; i < centeroids.size() ; i++)
        {
          Candidate candidate ;
          candidate.Centeroid = centeroids[i] ;
          candidate.WeightedCenteroid.Fill(0.0) ;
          candidate.Size = 0 ;
          m_Candidates[i] = candidate ;
        }
    }

    void GetCenteroids(InternalParametersType& centeroids)
    {
      unsigned int i ;
      centeroids.resize(this->Size()) ;
      for (i = 0 ; i < (unsigned int)this->Size() ; i++)
        {
          centeroids[i] = m_Candidates[i].Centeroid ;
        }
    }

    void UpdateCenteroids()
    {
      unsigned int i, j ;
      for (i = 0 ; i < (unsigned int)this->Size() ; i++)
        {
          if (m_Candidates[i].Size > 0)
            {
              for (j = 0 ; j < MeasurementVectorSize ; j++)
                {
                  m_Candidates[i].Centeroid[j] = 
                    m_Candidates[i].WeightedCenteroid[j] / 
                    double(m_Candidates[i].Size) ;
                }
            }
        }
    }

    Candidate& operator[](int index)
    { return m_Candidates[index] ; }
    

  private:
    std::vector< Candidate > m_Candidates ;
  } ; // end of class

  double GetSumOfSquaredPositionChanges(InternalParametersType &previous, 
                                        InternalParametersType &current) ;

  int GetClosestCandidate(ParameterType &measurements, 
                          std::vector< int > &validIndexes) ;

  bool IsFarther(ParameterType &pointA,
                 ParameterType &pointB,
                 MeasurementVectorType &lowerBound,
                 MeasurementVectorType &upperBound) ;

  void Filter(KdTreeNodeType* node, 
              std::vector< int > validIndexes,
              MeasurementVectorType &lowerBound, 
              MeasurementVectorType &upperBound) ;

  void CopyParameters(InternalParametersType &source, InternalParametersType &target) ;

  void CopyParameters(ParametersType &source, InternalParametersType &target) ;

  void CopyParameters(InternalParametersType &source, ParametersType &target) ;

  void GetPoint(ParameterType &point, 
                MeasurementVectorType &measurements)
  {
    for (unsigned int i = 0 ; i < MeasurementVectorSize ; i++)
      {
        point[i] = measurements[i] ;
      }
  }

  void PrintPoint(ParameterType &point)
  {
    std::cout << "[ " ;
    for (unsigned int i = 0 ; i < MeasurementVectorSize ; i++)
      {
        std::cout << point[i] << " " ;
      }
    std::cout << "]" ;
  }

private:
  int m_CurrentIteration ;
  int m_MaximumIteration ;
  double m_CenteroidPositionChanges ;
  double m_CenteroidPositionChangesThreshold ;
  TKdTree* m_KdTree ;
  typename EuclideanDistance< ParameterType >::Pointer m_DistanceMetric ;

  ParametersType m_Parameters ;

  CandidateVector m_CandidateVector ;
  
  ParameterType m_TempVertex ;

  bool m_UseClusterLabels ;
  bool m_GenerateClusterLabels ;
  ClusterLabelsType m_ClusterLabels ;
} ; // end of class

} // end of namespace Statistics
} // end of namespace itk

#ifndef ITK_MANUAL_INSTANTIATION
#include "itkKdTreeBasedKmeansEstimator.txx"
#endif


#endif

---