testCombinDSS.cpp

#include <iostream>
#include <fstream>
#include <list>
#include <vector>

#include "DGtal/base/Common.h"
#include "DGtal/helpers/StdDefs.h"
#include "DGtal/io/boards/Board2D.h"
#include "DGtal/geometry/curves/CombinatorialDSS.h"
#include "DGtal/geometry/curves/ArithmeticalDSS.h"
#include "ConfigTest.h"
#include "DGtal/geometry/curves/CBidirectionalSegmentComputer.h"
#include "DGtal/geometry/curves/GreedySegmentation.h"


using namespace std;
using namespace DGtal;
using namespace Z2i;

// Functions for testing class CombinDSS.


typedef FreemanChain<int> Contour;
typedef FreemanChain<int>::Vector Vector;



bool testCombinatorialDSS() 
{
  typedef Contour::ConstIterator ConstIterator;
  typedef string::const_iterator codeIterator;
  typedef CombinatorialDSS< list<char>::iterator, int> CombinatorialDSS_list;
  typedef CombinatorialDSS<codeIterator, int> CombinatorialDSS_string;

  BOOST_CONCEPT_ASSERT(( CBidirectionalSegmentComputer<CombinatorialDSS_list> ));
  BOOST_CONCEPT_ASSERT(( CBidirectionalSegmentComputer<CombinatorialDSS_string> ));

  trace.beginBlock ( "Test different initialization methods" );

  std::string filename = testPath + "samples/france.fc";
  std::fstream fst;
  fst.open (filename.c_str(), std::ios::in);
  Contour theContour(fst);

  list<char> l;
  for ( string::const_iterator it = theContour.chain.begin(); it != theContour.chain.end(); ++it )
    {
      l.push_back( *it );
    }

  list<char>::iterator it = l.begin();

  CombinatorialDSS_list C1;
  C1.init( it, theContour.firstPoint() );

  CombinatorialDSS_list C2;
  C2.init( C1.begin() );

  CombinatorialDSS_string C3;
  C3.init( theContour );

  CombinatorialDSS_string C4;
  C4.init( theContour.begin() );

  int nbRetract = 0;
  while ( C3.end() != theContour.chain.end() )
    {
      bool b1 = C1.extendForward();
      bool b2 = C2.extendForward();
      bool b3 = C3.extendForward();
      bool b4 = C4.extendForward();
      if ( b1 && b2 && b3 && b4 )
        {
        }
      else if ( !b1 && !b2 && !b3 && !b4 )
        {
          C1.retractForward();
          C2.retractForward();
          C3.retractForward();
          C4.retractForward();
          ++nbRetract;
        }
      else
        {
          cout << b1 << " " << b2 << " " << b3 << " " << b4 << endl;
          cout << C1 << endl;
          cout << C2 << endl;
          cout << C3 << endl;
          cout << C4 << endl;
          return false;
        }
    }
  trace.endBlock();
  return (nbRetract == 3485) ;
}


bool CompareToArithmetical()
{
  typedef string::const_iterator codeIterator;
  typedef CombinatorialDSS<codeIterator, int> TestedType;
  typedef ArithmeticalDSS<Contour::ConstIterator,int,4> ReferenceType;

  trace.beginBlock ( "Comparing to ArithmeticalDSS" );

  std::string filename = testPath + "samples/manche.fc";
  std::fstream fst;
  fst.open (filename.c_str(), std::ios::in);
  Contour theContour(fst);
  Contour::ConstIterator it = theContour.begin();
  TestedType C;
  C.init( it );
  ArithmeticalDSS<FreemanChain<int>::ConstIterator, int, 4> A(it);
  A.extendForward(); 
  bool res = true;
  while ( C.end() != theContour.chain.end() ) 
    {
      bool a = A.extendForward();
      bool c = C.extendForward();
      if ( a ^ c )
        {
          res = false;
          cout << "Extension test error\n";
          break;
        }
      else if ( ! a )
        {
          A.retractForward();
          C.retractForward();
        }
      // Compare positions
      if ( ( C.getFirstPoint() != A.getFirstPoint() ) || ( C.getLastPoint() != A.getLastPoint() )  )
        {
          res = false;
          cout << "Equality test error\n";
          break;
        }
      // Compare arithmetic parameters
      if ( ( C.getA() != A.getA() ) || ( C.getB() != A.getB() ) ||
           ( C.getMu() != A.getMu() ) || ( C.getOmega() != A.getOmega() ) ||
           ( C.getUf() != A.getUf() ) || ( C.getUl() != A.getUl() ) ||
           ( C.getLf() != A.getLf() ) || ( C.getLl() != A.getLl() ) 
         )
        {
          cout << "Arithmetic parameters error\n";
          cout <<  C << endl;
          cout <<  A << endl;
          cout << "getA()    " <<  C.getA()     << " --- " <<  A.getA() << "\n";
          cout << "getB()    " <<  C.getB()     << " --- " <<  A.getB() << "\n";
          cout << "getMu()   " <<  C.getMu()    << " --- " <<  A.getMu() << "\n";
          cout << "getOmega()" <<  C.getOmega() << " --- " <<  A.getOmega() << "\n";
          cout << "getUf()   " <<  C.getUf()    << " --- " <<  A.getUf() << "\n";
          cout << "getUl()   " <<  C.getUl()    << " --- " <<  A.getUl() << "\n";
          cout << "getLf()   " <<  C.getLf()    << " --- " <<  A.getLf() << "\n";
          cout << "getLl()   " <<  C.getLl()    << " --- " <<  A.getLl() << endl;
          res = false;
          break;
        }
    }
  trace.endBlock();
  return res;
}



bool testInGreedySegmentation( )
{

  typedef CombinatorialDSS<string::const_iterator, int> combinDSS;
  typedef GreedySegmentation<combinDSS> combinSegmentation;

  std::string filename = testPath + "samples/BigBall.fc";
  std::fstream fst;
  fst.open (filename.c_str(), std::ios::in);
  Contour theContour(fst);

  trace.beginBlock ( "Test CombinatorialDSS in greedy segmentation" );
  combinSegmentation combin_dec( theContour.chain.begin(), theContour.chain.end(), combinDSS() );
  vector<combinDSS> theCombinDSS;
  for ( combinSegmentation::SegmentComputerIterator i = combin_dec.begin();
       i != combin_dec.end(); ++i ) 
    {
      combinDSS c( *i );
      theCombinDSS.push_back( c );
    } 
  bool ok = ( theCombinDSS.size() == 1593 );
  trace.endBlock();

  return ok;
}


bool showGreedySegmantation()
{
  trace.beginBlock ( "Example testCombinDSS-greedy" );

  typedef CombinatorialDSS<string::const_iterator,int> combinDSS;
  typedef GreedySegmentation<combinDSS> Decomposition;
  typedef ArithmeticalDSS< combinDSS::ConstPointIterator, int, 4> arithDSS;

  std::stringstream ss(stringstream::in | stringstream::out);
  ss << "31 16 11121212121212212121212212122122222322323233323333333323333323303330330030300000100010010010001000101010101111" << endl;
  Contour theContour( ss );

  Decomposition theDecomposition( theContour.chain.begin(), theContour.chain.end(), combinDSS() );
  Point p1( 0, 0 );
  Point p2( 31, 31 );
  Domain domain( p1, p2 );
  Board2D aBoard;
  aBoard << SetMode( domain.className(), "Grid" )
   << domain
   << SetMode( "PointVector", "Grid" )
   << theContour;
  //for each segment
  aBoard << SetMode( "ArithmeticalDSS", "BoundingBox" );
  string className = "ArithmeticalDSS/BoundingBox";
  Point p;
  p.at(0) = 31;
  p.at(1) = 16;
  for ( Decomposition::SegmentComputerIterator i = theDecomposition.begin();
  i != theDecomposition.end(); ++i ) 
    {
      combinDSS segment(*i);
      // set the position of the combinatorilDSS 
      segment.setPosition( p );
      // Since both DSS overlap on one code, the start point of the next one is
      // the penultimate point of the current one.
      p = *( --( --( segment.pointEnd() )));

      // Build an ArithmeticDSS from the CombinatorialDSS.
      arithDSS toShow( segment.pointBegin() );
      while( toShow.end() != segment.pointEnd() )
        {
          toShow.extendForward();
        }
      aBoard << CustomStyle( className, new CustomPenColor( Color::Blue ) ) 
        << toShow; // draw each segment
    } 
  aBoard.saveSVG("testCombinDSS-greedy.svg");
  trace.endBlock();
  return 1;
}


// Standard services - public :
int main( int argc, char** argv )
{
  trace.beginBlock ( "Testing class CombinDSS" );
  trace.info() << "Args:";
  for ( int i = 0; i < argc; ++i )
    trace.info() << " " << argv[ i ];
  trace.info() << endl;

  bool res = testCombinatorialDSS()     
    && CompareToArithmetical() 
    && testInGreedySegmentation()
    && showGreedySegmantation();

  trace.emphase() << ( res ? "Passed." : "Error." ) << endl;
  trace.endBlock();

  return res ? 0 : 1;
}
//                                                                           //