DGtal  1.5.beta
testEstimatorComparator.cpp
Go to the documentation of this file.
1 
33 #include <iostream>
34 #include "DGtal/base/Common.h"
35 
36 #include "DGtal/shapes/Shapes.h"
37 #include "DGtal/shapes/ShapeFactory.h"
38 
39 #include "DGtal/geometry/curves/estimation/TrueLocalEstimatorOnPoints.h"
40 
41 #include "DGtal/geometry/curves/estimation/ParametricShapeCurvatureFunctor.h"
42 #include "DGtal/geometry/curves/estimation/ParametricShapeTangentFunctor.h"
43 #include "DGtal/geometry/curves/estimation/ParametricShapeArcLengthFunctor.h"
44 #include "DGtal/geometry/curves/estimation/MostCenteredMaximalSegmentEstimator.h"
45 #include "DGtal/geometry/curves/ArithmeticalDSSComputer.h"
46 
47 #include "DGtal/kernel/SpaceND.h"
48 #include "DGtal/kernel/domains/HyperRectDomain.h"
49 #include "DGtal/kernel/sets/DigitalSetSelector.h"
50 #include "DGtal/topology/KhalimskySpaceND.h"
51 #include "DGtal/topology/SurfelAdjacency.h"
52 #include "DGtal/topology/SurfelNeighborhood.h"
53 
54 #include "DGtal/shapes/GaussDigitizer.h"
55 #include "DGtal/geometry/curves/GridCurve.h"
56 
57 #include "DGtal/geometry/curves/estimation/CompareLocalEstimators.h"
58 
59 
60 #include "ConfigTest.h"
61 
63 
64 using namespace std;
65 using namespace DGtal;
66 
67 
68 template <typename Shape>
69 bool testCompareEstimator(const std::string &name, const Shape & aShape, double h)
70 {
71  using namespace Z2i;
72 
73  trace.beginBlock ( ( "Testing CompareEstimator on digitization of "
74  + name ). c_str() );
75 
76  // Creates a digitizer on the window (xLow, xUp).
77  RealPoint xLow( -10.0, -10.0 );
78  RealPoint xUp( 10.0, 10.0 );
80  dig.attach( aShape ); // attaches the shape.
81  dig.init( xLow, xUp, h );
82 
83  // The domain size is given by the digitizer according to the window
84  // and the step.
85  Domain domain = dig.getDomain();
86 
87  // Create cellular space
88  KSpace K;
89  bool ok = K.init( dig.getLowerBound(), dig.getUpperBound(), true );
90  if ( ! ok )
91  {
92  std::cerr << "[testCompareEstimators]"
93  << " error in creating KSpace." << std::endl;
94  }
95  else
96  try {
97  // Extracts shape boundary
99  SCell bel = Surfaces<KSpace>::findABel( K, dig, 10000 );
100  // Getting the consecutive surfels of the 2D boundary
101  std::vector<Point> points;
102  Surfaces<KSpace>::track2DBoundaryPoints( points, K, SAdj, dig, bel );
103  // Create GridCurve
104  GridCurve<KSpace> gridcurve;
105  gridcurve.initFromVector( points );
106  typedef GridCurve<KhalimskySpaceND<2> >::PointsRange Range;
107  typedef Range::ConstIterator ConstIteratorOnPoints;
108  Range r = gridcurve.getPointsRange();//building range
109 
110  unsigned int nb = 0;
111  unsigned int nbok = 0;
112  //curvature
115  TrueCurvature curvatureEstimator;
116  TrueCurvature curvatureEstimatorBis;
117  curvatureEstimator.attach( aShape );
118  curvatureEstimatorBis.attach( aShape );
119 
121 
122  trace.info()<< "True curvature comparison at "<< *r.begin() << " = "
123  << Comparator::compare(curvatureEstimator,curvatureEstimatorBis, r.begin(), h)
124  << std::endl;
125 
126  typename Comparator::OutputStatistic error =
127  Comparator::compare(curvatureEstimator, curvatureEstimatorBis,
128  r.begin(), r.end(), h);
129 
130  trace.info() << "Nb samples= "<< error.samples()<<std::endl;
131  trace.info() << "Error mean= "<< error.mean()<<std::endl;
132  trace.info() << "Error max= "<< error.max()<<std::endl;
133  nbok += ( ( ( (unsigned int)error.samples() ) == r.size())
134  && (error.max() == 0) )
135  ? 1 : 0;
136  nb++;
137  trace.info() << nbok << "/" << nb << std::endl;
138 
139  //tangents
142 
147  MSTangentEstimator;
148 
149  SegmentComputer sc;
150  Functor f;
151 
152  TrueTangent tang1;
153  MSTangentEstimator tang2(sc, f);
154 
155  tang1.attach( aShape );
156  tang2.init( r.begin(), r.end() );
157 
159 
160  trace.info()<< "Tangent comparison at "<< *r.begin() << " = "
161  << ComparatorTan::compareVectors( tang1, tang2, r.begin(), h)
162  << std::endl;
163 
164  typename ComparatorTan::OutputVectorStatistic error2
165  = ComparatorTan::compareVectors(tang1, tang2, r.begin(), r.end(), h);
166 
167  trace.info()<< "Nb samples= "<< error2.samples()<<std::endl;
168  trace.info()<< "Error mean= "<< error2.mean()<<std::endl;
169  trace.info()<< "Error max= "<< error2.max()<<std::endl;
170  nbok += (error.samples() == r.size())?1:0;
171  nb++;
172  trace.info() << nbok << "/" << nb << std::endl;
173  ok += (nb == nbok);
174 
175  }
176  catch ( InputException& e )
177  {
178  std::cerr << "[testCompareEstimator]"
179  << " error in finding a bel." << std::endl;
180  ok = false;
181  }
182  trace.emphase() << ( ok ? "Passed." : "Error." ) << endl;
183  trace.endBlock();
184  return ok;
185 
186 }
187 
188 
190 // Standard services - public :
191 
192 int main( int argc, char** argv )
193 {
194  trace.beginBlock ( "Testing class CompareLocalEstimator" );
195  trace.info() << "Args:";
196  for ( int i = 0; i < argc; ++i )
197  trace.info() << " " << argv[ i ];
198  trace.info() << endl;
199 
200  typedef Flower2D< Z2i::Space > MyFlower;
201  MyFlower flower( 0.5, -2.3, 5.0, 0.7, 6, 0.3 );
202  bool res = testCompareEstimator<MyFlower>("Flower", flower, 0.25);
203  return res ? 0 : 1;
204 
205 }
206 // //
Aim: This class is a wrapper around ArithmeticalDSS that is devoted to the dynamic recognition of dig...
Aim: Model of the concept StarShaped represents any flower with k-petals in the plane.
Definition: Flower2D.h:65
Aim: A class for computing the Gauss digitization of some Euclidean shape, i.e. its intersection with...
const Point & getLowerBound() const
void attach(ConstAlias< EuclideanShape > shape)
const Point & getUpperBound() const
void init(const RealPoint &xLow, const RealPoint &xUp, typename RealVector::Component gridStep)
Domain getDomain() const
Aim: describes, in a cellular space of dimension n, a closed or open sequence of signed d-cells (or d...
Definition: GridCurve.h:173
PointsRange getPointsRange() const
Definition: GridCurve.h:426
bool initFromVector(const std::vector< Point > &aVectorOfPoints)
Aim: This class is a model of CCellularGridSpaceND. It represents the cubical grid as a cell complex,...
bool init(const Point &lower, const Point &upper, bool isClosed)
Specifies the upper and lower bounds for the maximal cells in this space.
Aim: A model of CLocalCurveGeometricEstimator that assigns to each element of a (sub)range a quantity...
Aim: implements a functor that computes the curvature at a given point of a parametric shape.
Aim: implements a functor that computes the tangent vector at a given point of a parametric shape.
Aim: model of CBidirectionalRangeFromPoint that adapts any range of elements bounded by two iterators...
Aim: A utility class for constructing surfaces (i.e. set of (n-1)-cells).
Definition: Surfaces.h:79
void beginBlock(const std::string &keyword="")
std::ostream & emphase()
std::ostream & info()
double endBlock()
Aim: Computes the true quantity to each element of a range associated to a parametric shape.
void attach(const ParametricShape &aShape)
DGtal is the top-level namespace which contains all DGtal functions and types.
Trace trace
Definition: Common.h:153
Aim: Functor to compare two local geometric estimators.
Represents a signed cell in a cellular grid space by its Khalimsky coordinates and a boolean value.
ArithmeticalDSSComputer< std::vector< Z2i::Point >::const_iterator, int, 4 > SegmentComputer
InHalfPlaneBySimple3x3Matrix< Point, double > Functor
KSpace K
int main(int argc, char **argv)
bool testCompareEstimator(const std::string &name, const Shape &aShape, double h)
bool compare(const Range1 &pts, const Range2 &groundTruth)
Definition: testFP.cpp:98
Domain domain