-#ifndef __FPA__IMAGE__ALGORITHM__HXX__
-#define __FPA__IMAGE__ALGORITHM__HXX__
+#ifndef __fpa__Image__Algorithm__hxx__
+#define __fpa__Image__Algorithm__hxx__
-#include <cmath>
-#include <limits>
-#include <itkConstNeighborhoodIterator.h>
+// Send Piotr's code to Anna
+
+#include <itkImage.h>
+#include <fpa/Image/Functors/SimpleNeighborhood.h>
// -------------------------------------------------------------------------
-template< class I, class A >
-fpa::Image::Algorithm< I, A >::
+template< class _TInputImage, class _TOutputImage >
+fpa::Image::Algorithm< _TInputImage, _TOutputImage >::
Algorithm( )
- : Superclass( ),
- m_NeighborhoodOrder( 1 )
+ : Superclass( )
{
+ typedef fpa::Image::Functors::SimpleNeighborhood< _TInputImage::ImageDimension > _TNeigh;
+ typedef itk::Image< TFrontId, _TInputImage::ImageDimension > _TMarks;
+
+ this->m_MarksIdx = this->GetNumberOfRequiredOutputs( );
+ this->itk::ProcessObject::SetNumberOfRequiredOutputs( this->m_MarksIdx + 1 );
+ typename _TMarks::Pointer marks = _TMarks::New( );
+ this->SetNthOutput( this->m_MarksIdx, marks );
+
+ typename _TNeigh::Pointer neigh = _TNeigh::New( );
+ this->SetNeighborhoodFunction( neigh );
}
// -------------------------------------------------------------------------
-template< class I, class A >
-fpa::Image::Algorithm< I, A >::
+template< class _TInputImage, class _TOutputImage >
+fpa::Image::Algorithm< _TInputImage, _TOutputImage >::
~Algorithm( )
{
}
// -------------------------------------------------------------------------
-template< class I, class A >
-bool fpa::Image::Algorithm< I, A >::
-_UpdateResult( _TNode& n )
+template< class _TInputImage, class _TOutputImage >
+void fpa::Image::Algorithm< _TInputImage, _TOutputImage >::
+_BeforeGenerateData( )
{
- bool ret = this->Superclass::_UpdateResult( n );
- this->GetOutput( )->SetPixel( n.Vertex, n.Result );
- return( ret );
+ this->Superclass::_BeforeGenerateData( );
+ this->AllocateOutputs( );
+
+ TNeighborhoodFunction* neighFunc =
+ dynamic_cast< TNeighborhoodFunction* >(
+ this->GetNeighborhoodFunction( )
+ );
+ if( neighFunc == NULL )
+ itkExceptionMacro( << "NeighborhoodFunction not well defined." );
+ neighFunc->SetImage( this->GetInput( ) );
+
+ TVertexFunction* vertexFunc =
+ dynamic_cast< TVertexFunction* >(
+ this->GetVertexFunction( )
+ );
+ if( vertexFunc != NULL )
+ vertexFunc->SetImage( this->GetInput( ) );
}
// -------------------------------------------------------------------------
-template< class I, class A >
-unsigned long fpa::Image::Algorithm< I, A >::
-_NumberOfVertices( ) const
+template< class _TInputImage, class _TOutputImage >
+void fpa::Image::Algorithm< _TInputImage, _TOutputImage >::
+_InitMarks( )
{
- return(
- this->GetInput( )->GetLargestPossibleRegion( ).GetNumberOfPixels( )
- );
+ typedef itk::Image< TFrontId, _TInputImage::ImageDimension > _TMarks;
+ _TMarks* marks =
+ dynamic_cast< _TMarks* >(
+ this->itk::ProcessObject::GetOutput( this->m_MarksIdx )
+ );
+ marks->FillBuffer( 0 );
}
// -------------------------------------------------------------------------
-template< class I, class A >
-typename fpa::Image::Algorithm< I, A >::
-TVertexValue fpa::Image::Algorithm< I, A >::
-_Value( const TVertex& v ) const
+template< class _TInputImage, class _TOutputImage >
+void fpa::Image::Algorithm< _TInputImage, _TOutputImage >::
+_InitResults( const TOutput& init_value )
{
- return( this->GetInput( )->GetPixel( v ) );
+ this->GetOutput( )->FillBuffer( init_value );
}
// -------------------------------------------------------------------------
-template< class I, class A >
-typename fpa::Image::Algorithm< I, A >::
-TResult fpa::Image::Algorithm< I, A >::
-_Result( const TVertex& v ) const
+template< class _TInputImage, class _TOutputImage >
+bool fpa::Image::Algorithm< _TInputImage, _TOutputImage >::
+_IsMarked( const TVertex& v ) const
{
- return( this->GetOutput( )->GetPixel( v ) );
+ typedef itk::Image< TFrontId, _TInputImage::ImageDimension > _TMarks;
+ const _TMarks* marks =
+ dynamic_cast< const _TMarks* >(
+ this->itk::ProcessObject::GetOutput( this->m_MarksIdx )
+ );
+ return( marks->GetPixel( v ) != 0 );
}
// -------------------------------------------------------------------------
-template< class I, class A >
-double fpa::Image::Algorithm< I, A >::
-_Norm( const TVertex& a, const TVertex& b ) const
+template< class _TInputImage, class _TOutputImage >
+void fpa::Image::Algorithm< _TInputImage, _TOutputImage >::
+_Mark( const _TQueueNode& n )
{
- typename I::PointType pa, pb;
- this->GetInput( )->TransformIndexToPhysicalPoint( a, pa );
- this->GetInput( )->TransformIndexToPhysicalPoint( b, pb );
- return( double( pa.EuclideanDistanceTo( pb ) ) );
+ typedef itk::Image< TFrontId, _TInputImage::ImageDimension > _TMarks;
+ _TMarks* marks =
+ dynamic_cast< _TMarks* >(
+ this->itk::ProcessObject::GetOutput( this->m_MarksIdx )
+ );
+ marks->SetPixel( n.Vertex, n.FrontId );
}
// -------------------------------------------------------------------------
-template< class I, class A >
-bool fpa::Image::Algorithm< I, A >::
-_Edge( const TVertex& a, const TVertex& b ) const
+template< class _TInputImage, class _TOutputImage >
+typename fpa::Image::Algorithm< _TInputImage, _TOutputImage >::
+TFrontId fpa::Image::Algorithm< _TInputImage, _TOutputImage >::
+_GetMark( const TVertex& v ) const
{
- unsigned long dist = 0;
- for( unsigned int d = 0; d < I::ImageDimension; d++ )
- dist += std::abs( long( a[ d ] ) - long( b[ d ] ) );
- if( this->m_NeighborhoodOrder == 1 )
- return( dist == 0 || dist == 1 );
- else
- return( dist == 0 || dist == 1 || dist == 2 );
+ typedef itk::Image< TFrontId, _TInputImage::ImageDimension > _TMarks;
+ const _TMarks* marks =
+ dynamic_cast< const _TMarks* >(
+ this->itk::ProcessObject::GetOutput( this->m_MarksIdx )
+ );
+ return( marks->GetPixel( v ) );
}
// -------------------------------------------------------------------------
-template< class I, class A >
-typename fpa::Image::Algorithm< I, A >::
-TCost fpa::Image::Algorithm< I, A >::
-_Cost( const TVertex& a, const TVertex& b ) const
+template< class _TInputImage, class _TOutputImage >
+void fpa::Image::Algorithm< _TInputImage, _TOutputImage >::
+_UpdateResult( const _TQueueNode& n )
{
- static const TCost INF_COST = std::numeric_limits< TCost >::max( );
- if( this->_Edge( a, b ) )
- {
- TCost c = TCost( this->GetInput( )->GetPixel( b ) );
- if( this->m_CostConversion.IsNotNull( ) )
- return( this->m_CostConversion->Evaluate( c ) );
- else
- return( c );
- }
- else
- return( INF_COST );
+ this->GetOutput( )->SetPixel( n.Vertex, n.Result );
}
// -------------------------------------------------------------------------
-template< class I, class A >
-void fpa::Image::Algorithm< I, A >::
-_Neighs( const _TNode& n, _TNodes& N ) const
+template< class _TInputImage, class _TOutputImage >
+typename fpa::Image::Algorithm< _TInputImage, _TOutputImage >::TOutput
+fpa::Image::Algorithm< _TInputImage, _TOutputImage >::
+_GetResult( const TVertex& v ) const
{
- typename I::RegionType reg = this->GetInput( )->GetRequestedRegion( );
-
- N.clear( );
- if( this->m_NeighborhoodOrder == 1 )
- {
- for( unsigned int d = 0; d < I::ImageDimension; d++ )
- {
- for( int i = -1; i <= 1; i += 2 )
- {
- TVertex v = n.Vertex;
- v[ d ] += i;
- if( reg.IsInside( v ) )
- N.push_back( _TNode( v, n.FrontId ) );
- else
- N.push_back( n );
-
- } // rof
-
- } // rof
- }
+ if( this->GetOutput( )->GetLargestPossibleRegion( ).IsInside( v ) )
+ return( this->GetOutput( )->GetPixel( v ) );
else
- {
- typedef itk::ConstNeighborhoodIterator< I > TNeighIt;
- typename I::SizeType nSize;
- nSize.Fill( 1 );
-
- TNeighIt nIt( nSize, this->GetInput( ), reg );
- nIt.SetLocation( n.Vertex );
- for( unsigned int i = 0; i < nIt.Size( ); i++ )
- {
- TVertex idxN = nIt.GetIndex( i );
- if( idxN == n.Vertex )
- continue;
- if( !reg.IsInside( idxN ) )
- continue;
- N.push_back( _TNode( idxN, n.FrontId ) );
-
- } // rof
-
- } // fi
-}
-
-// -------------------------------------------------------------------------
-template< class I, class A >
-void fpa::Image::Algorithm< I, A >::
-_NeighsInDim( const _TNode& n, const unsigned int& d, _TNodes& N )
-{
- typename I::RegionType reg = this->GetInput( )->GetRequestedRegion( );
-
- N.clear( );
- for( int i = -1; i <= 1; i += 2 )
- {
- TVertex v = n.Vertex;
- v[ d ] += i;
- if( reg.IsInside( v ) )
- N.push_back( _TNode( v, n.FrontId ) );
-
- } // rof
+ return( this->m_InitResult );
}
// -------------------------------------------------------------------------
-template< class I, class A >
-void fpa::Image::Algorithm< I, A >::
-_InitializeResults( )
+template< class _TInputImage, class _TOutputImage >
+unsigned int fpa::Image::Algorithm< _TInputImage, _TOutputImage >::
+_GetNumberOfDimensions( ) const
{
+ return( _TInputImage::ImageDimension );
}
-#endif // __FPA__IMAGE__ALGORITHM__HXX__
+#endif // __fpa__Image__Algorithm__hxx__
// eof - $RCSfile$
git://git.creatis.insa-lyon.fr / FrontAlgorithms.git / blobdiff