tutorial-examples/FMMErosion.cpp

Example of tutorial 1: Local morphological opening of a 3d volume by the Fast Marching Method

See also

Tutorial: Local morphological opening of a 3d volume by the Fast Marching Method

erosion using FMM.

#include <iostream>
#include "DGtal/base/Common.h"

#include "ConfigExamples.h"

//image
#include "DGtal/images/ImageContainerBySTLVector.h"
#include "DGtal/images/ImageContainerBySTLMap.h"
#include "DGtal/base/BasicFunctors.h"
#include "DGtal/kernel/BasicPointPredicates.h"

//IO
#include "DGtal/io/readers/VolReader.h"
#include "DGtal/io/writers/VolWriter.h"

//frontier
#include "DGtal/topology/SurfelAdjacency.h"
#include "DGtal/topology/helpers/FrontierPredicate.h"
#include "DGtal/topology/LightExplicitDigitalSurface.h"

// FMM
#include "DGtal/geometry/volumes/distance/FMM.h"


using namespace std;
using namespace DGtal;
using namespace Z3i;



int main( int argc, char** argv )
{
  trace.beginBlock ( "Example FMMErosion" );
  trace.info() << "Args:";
  for ( int i = 0; i < argc; ++i )
    trace.info() << " " << argv[ i ];
  trace.info() << endl;

  DGtal::trace.beginBlock("image reading..."); 

  string imageFileName = examplesPath + "samples/cat10.vol"; 
  trace.info() << imageFileName <<std::endl; 
  typedef ImageContainerBySTLVector<Domain, bool> BinaryImage; 
  BinaryImage binaryImage = VolReader<BinaryImage>::importVol( imageFileName);

  DGtal::trace.endBlock(); 

  DGtal::trace.beginBlock("Search for a bel..."); 

  //space and starting bel
  KSpace ks;
  Domain domain = binaryImage.domain(); 
  ks.init( domain.lowerBound(), domain.upperBound(), true ); 
  KSpace::SCell bel;

  try { 
    //getting a bel
    bel = Surfaces<KSpace>::findABel( ks, binaryImage, domain.size() );
    trace.info() << "starting bel: " << bel << std::endl;
 
  } catch (DGtal::InputException i) {
    trace.emphase() << "starting bel not found" << std::endl; 
    return 0; 
  }

  DGtal::trace.endBlock(); 

  DGtal::trace.beginBlock("Implicit frontier..."); 

  //implicit frontier 
  typedef functors::FrontierPredicate<KSpace, BinaryImage> SurfelPredicate;
  typedef LightExplicitDigitalSurface<KSpace, SurfelPredicate> Frontier;
  functors::SCellToIncidentPoints<KSpace> toIncidentPoints( ks );
  std::pair<Point,Point> bpair = toIncidentPoints( bel );    
  SurfelPredicate surfelPredicate( ks, binaryImage, 
                                   binaryImage( bpair.first ), 
                                   binaryImage( bpair.second ) );  
  Frontier frontier( ks, surfelPredicate, 
                     SurfelAdjacency<KSpace::dimension>( true ), bel ); 

  DGtal::trace.endBlock();

  const double maximalDistance = 3.0; 

  DGtal::trace.beginBlock("FMM..."); 

  typedef ImageContainerBySTLMap<Domain,double> DistanceImage; 
  typedef DigitalSetFromMap<DistanceImage> AcceptedPointSet; 
  typedef FMM<DistanceImage, AcceptedPointSet, BinaryImage > FMM;

  DistanceImage imageDistance( domain, 0.0 );
  AcceptedPointSet pointSet( imageDistance );
  functors::SCellToInnerPoint<KSpace> toInnerPoint( ks );
  for (Frontier::SurfelConstIterator it = frontier.begin(), itEnd = frontier.end(); 
       it != itEnd; ++it) 
    {
      pointSet.insert( toInnerPoint(*it) ); 
      imageDistance.setValue( toInnerPoint(*it), 0.5 ); 
    }

  FMM fmm( imageDistance, pointSet, binaryImage,
           domain.size(), maximalDistance );
  fmm.compute(); 
  trace.info() << fmm << std::endl;  

  DGtal::trace.endBlock();

  DGtal::trace.beginBlock("Erosion"); 
  trace.info() << "Erosion of radius: " << maximalDistance << std::endl;

  for (AcceptedPointSet::ConstIterator it = pointSet.begin(), itEnd = pointSet.end(); 
       it != itEnd; ++it) 
    {
      binaryImage.setValue(*it, 0); 
    }

  DGtal::trace.endBlock();

  DGtal::trace.beginBlock("image writing..."); 

  string outputFileName = "eroded.vol"; 
  trace.info() << "to " << outputFileName << std::endl; 
  VolWriter<BinaryImage,functors::Cast<unsigned char> >::exportVol(outputFileName, binaryImage);

  DGtal::trace.endBlock(); 


  trace.endBlock();
  return 0;
}
//                                                                           //