itkmeanshiftmodeseekerbase.txx

DTMK软件开发包,此为开源软件,是一款很好的医学图像开发资源.

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

  Program:   Insight Segmentation & Registration Toolkit
  Module:    $RCSfile: itkMeanShiftModeSeekerBase.txx,v $
  Language:  C++
  Date:      $Date: 2005-08-01 19:23:35 $
  Version:   $Revision: 1.11 $

  Copyright (c) Insight Software 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 __itkMeanShiftModeSeekerBase_txx
#define __itkMeanShiftModeSeekerBase_txx

namespace itk{ 
namespace Statistics{

template< class TSample >
MeanShiftModeSeekerBase< TSample >
::MeanShiftModeSeekerBase()
{
  m_MaximumIteration = 0 ;
  m_CacheMethod = 0 ;
}


template< class TSample >
MeanShiftModeSeekerBase< TSample >
::~MeanShiftModeSeekerBase()
{
}

template< class TSample >
void
MeanShiftModeSeekerBase< TSample >
::PrintSelf(std::ostream& os, Indent indent) const
{
  Superclass::PrintSelf(os,indent);

  os << indent << "InputSample: " ;
  if ( m_InputSample.IsNotNull() )
    {
    os << m_InputSample << std::endl;
    }
  else
    {
    os << "not set." << std::endl ;
    }

  os << indent << "CacheMethod: " ;
  if ( m_CacheMethod.IsNotNull() )
    {
    os << m_CacheMethod << std::endl;
    }
  else
    {
    os << "not set." << std::endl ;
    }

  os << indent << "Maximum iterations: " << m_MaximumIteration << std::endl ;
}

template< class TSample >
void
MeanShiftModeSeekerBase< TSample >
::SetInputSample(const TSample* sample)
{
  if ( m_InputSample != sample )
    {
    m_InputSample = sample ;
    this->Modified() ;
    }
}

template< class TSample >
void
MeanShiftModeSeekerBase< TSample >
::SetCacheMethod(CacheMethodType* method)
{
  if ( m_CacheMethod != method )
    {
    m_CacheMethod = method ;
    this->Modified() ;
    }
}

template< class TSample >
typename MeanShiftModeSeekerBase< TSample >::MeasurementVectorType
MeanShiftModeSeekerBase< TSample >
::Evolve(MeasurementVectorType instance)
{
  if( m_InputSample->GetMeasurementVectorSize() )
    {
    MeasurementVectorTraits::Assert( instance, 
      m_InputSample->GetMeasurementVectorSize(), 
      "Length mismatch: MeanShiftModeSeekerBase::Evolve" );
    }

  MeasurementVectorType queryPoint = instance ;
  MeasurementVectorType newPoint;
  MeasurementVectorType previousPoint = queryPoint ;

  unsigned int currentIteration = 0 ;
  bool retCode = false;

  while ( true )
    {
    if ( m_MaximumIteration > 0 && currentIteration > m_MaximumIteration )
      {
      if ( this->GetDebug() )
        {
        std::cout << "DEBUG: max exceeded." << std::endl ;
        }

      return queryPoint ;
      }

    if ( m_CacheMethod.IsNotNull() )
      {
      if ( !m_CacheMethod->GetMeasurementVector(queryPoint, newPoint) )
        {
        retCode = this->ComputeMode( queryPoint, newPoint ) ;
        if ( retCode )
          {
          m_CacheMethod->SetMeasurementVector( queryPoint, newPoint ) ;
          }
        }
      }
    else
      {
      retCode = this->ComputeMode( queryPoint, newPoint ) ;
      }
    
    if ( !retCode )
      {
      return queryPoint ;
      }

    if ( queryPoint != newPoint && newPoint != previousPoint )
      {
      previousPoint = queryPoint ;
      queryPoint = newPoint ;
      }
    else
      {
      return queryPoint ;
      }
    ++currentIteration ;
    } // end of while
    return queryPoint ; //This is here to avoid compiler warning, but should never occur.
}

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

#endif