itkKLMSegmentationBorder.h

Go to the documentation of this file.

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

  Program:   Insight Segmentation & Registration Toolkit
  Module:    $RCSfile: itkKLMSegmentationBorder.h,v $
  Language:  C++
  Date:      $Date: 2007/12/29 13:14:32 $
  Version:   $Revision: 1.14 $

  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 __itkKLMSegmentationBorder_h
#define __itkKLMSegmentationBorder_h

#include "itkObject.h"
#include "itkSegmentationBorder.h"
#include "itkKLMSegmentationRegion.h"
#include "itkExceptionObject.h"

#include "vnl/vnl_math.h"
#include "vnl/vnl_vector.h"

namespace itk
{

template <class TBorder>
class KLMDynamicBorderArray
{
public:
  bool operator> (const KLMDynamicBorderArray<TBorder>& rhs) const
    {
    if( m_Pointer->GetLambda() == rhs.m_Pointer->GetLambda() )
      {
      if( m_Pointer->GetLambda() < 0 )
        {
        return ( m_Pointer > rhs.m_Pointer );
        }
      else
        {
        // The purpose of this comparison is to not let any one region
        // get more borders than another region.  In the degenerate
        // case of an image where the Lambdas are always equal to some
        // constant C, allowing a single region to be repeatedly
        // merged so that it gains many borders will result in
        // pathologically slow behavior.
        double v1 = vnl_math_max(
          static_cast< double>(m_Pointer->GetRegion1()->GetRegionBorderSize()),
          static_cast< double>(m_Pointer->GetRegion2()->GetRegionBorderSize() ));

        double v2 = vnl_math_max(
          static_cast< double>(rhs.m_Pointer->GetRegion1()->GetRegionBorderSize()),
          static_cast< double>(rhs.m_Pointer->GetRegion2()->GetRegionBorderSize()) );

        return ( v1 > v2 );
        }
      }
    return(m_Pointer->GetLambda() > rhs.m_Pointer->GetLambda() );
    }

  bool operator> (const KLMDynamicBorderArray<TBorder>* rhs) const
    {
    if( m_Pointer->GetLambda() == rhs.m_Pointer->GetLambda() )
      {
      if( m_Pointer->GetLambda() < 0 )
        {
        return ( m_Pointer > rhs.m_Pointer );
        }
      else
        {
        // The purpose of this comparison is to not let any one region
        // get more borders than another region.  In the degenerate
        // case of an image where the Lambdas are always equal to some
        // constant C, allowing a single region to be repeatedly
        // merged so that it gains many borders will result in
        // pathologically slow behavior.
        double v1 = vnl_math_max(
          static_cast< double>(m_Pointer->GetRegion1()->GetRegionBorderSize()),
          static_cast< double>(m_Pointer->GetRegion2()->GetRegionBorderSize() ));

        double v2 = vnl_math_max(
          static_cast< double>(rhs.m_Pointer->GetRegion1()->GetRegionBorderSize()),
          static_cast< double>(rhs.m_Pointer->GetRegion2()->GetRegionBorderSize()) );

        return ( v1 > v2 );
        }
      }
    return(m_Pointer->GetLambda() > rhs.m_Pointer->GetLambda() );
    }

  TBorder *m_Pointer;
};

class KLMSegmentationRegion;

class ITKCommon_EXPORT KLMSegmentationBorder : public SegmentationBorder
{

public:
  typedef KLMSegmentationBorder   Self;
  typedef SegmentationBorder Superclass;
  typedef SmartPointer<Self>  Pointer;
  typedef SmartPointer<const Self>  ConstPointer;

  itkNewMacro(Self);

  itkTypeMacro(KLMSegmentationBorder,SegmentationBorder);

  void SetRegion1(KLMSegmentationRegion *Region1);

  KLMSegmentationRegion *GetRegion1();

  void SetRegion2(KLMSegmentationRegion *Region2);

  KLMSegmentationRegion *GetRegion2();

  itkSetMacro(Lambda, double);
  itkGetConstReferenceMacro(Lambda, double);

  void EvaluateLambda();

  void PrintBorderInfo();

protected:
  KLMSegmentationBorder();

  ~KLMSegmentationBorder();

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

private:
  KLMSegmentationBorder(const Self&); //purposely not implemented
  void operator=(const Self&); //purposely not implemented

  double m_Lambda;
  KLMSegmentationRegion *m_Region1;
  KLMSegmentationRegion *m_Region2;

};


} // end namespace itk


#endif

---