DGtal  1.5.beta
testTrueLocalEstimator.cpp
Go to the documentation of this file.
1 
33 #include <iostream>
34 #include "DGtal/base/Common.h"
35 #include "DGtal/kernel/SpaceND.h"
36 #include "DGtal/kernel/domains/HyperRectDomain.h"
37 #include "DGtal/kernel/sets/DigitalSetSelector.h"
38 #include "DGtal/topology/KhalimskySpaceND.h"
39 #include "DGtal/topology/SurfelAdjacency.h"
40 #include "DGtal/topology/SurfelNeighborhood.h"
41 
42 #include "DGtal/shapes/Shapes.h"
43 #include "DGtal/shapes/ShapeFactory.h"
44 #include "DGtal/shapes/GaussDigitizer.h"
45 
46 #include "DGtal/geometry/curves/GridCurve.h"
47 #include "DGtal/geometry/curves/ArithmeticalDSSComputer.h"
48 #include "DGtal/geometry/curves/estimation/CCurveLocalGeometricEstimator.h"
49 #include "DGtal/geometry/curves/estimation/TrueLocalEstimatorOnPoints.h"
50 #include "DGtal/geometry/curves/estimation/TrueGlobalEstimatorOnPoints.h"
51 #include "DGtal/geometry/curves/estimation/ParametricShapeCurvatureFunctor.h"
52 #include "DGtal/geometry/curves/estimation/ParametricShapeTangentFunctor.h"
53 #include "DGtal/geometry/curves/estimation/ParametricShapeArcLengthFunctor.h"
54 #include "DGtal/geometry/curves/estimation/MostCenteredMaximalSegmentEstimator.h"
55 #include "DGtal/geometry/curves/estimation/CompareLocalEstimators.h"
56 
57 
58 #include "ConfigTest.h"
59 
61 
62 using namespace std;
63 using namespace DGtal;
64 
66 // Functions for testing class TrueLocalEstimator.
68 
72 bool testTrueLocalEstimator(const std::string &filename)
73 {
74  trace.info() << "Reading GridCurve " << endl;
75  ifstream instream; // input stream
76  instream.open (filename.c_str(), ifstream::in);
77  typedef KhalimskySpaceND<2> Kspace; //space
79  c.initFromVectorStream(instream); //building grid curve
81  Range r = c.getPointsRange();//building range
82 
83  typedef Ball2D<Z2i::Space> Shape;
84  typedef GridCurve<KhalimskySpaceND<2> >::PointsRange Range;
85  typedef Range::ConstIterator ConstIteratorOnPoints;
89 
90  Shape ball(Z2i::Point(0,0), 30);
91 
92 
96 
99  TrueCurvatureEstimator curvatureEstimator;
100  TrueTangentEstimator tangentEstimator;
101  TrueLengthEstimator lengthEstimator;
102 
103  curvatureEstimator.attach( ball );
104  tangentEstimator.attach( ball );
105  lengthEstimator.attach ( ball );
106 
107  ConstIteratorOnPoints it = r.begin();
108  ConstIteratorOnPoints it2 = it+15;
109 
110  trace.info() << "Current point = " << *it << std::endl;
111  trace.info() << "Current point+15 = " << *it2 << std::endl;
112  // TODO: All these estimations consider projections of points from grid curve c on ball.
113  // These are not estimations on the grid curve c. Not sure that make sense.
114  trace.info() << "Eval curvature (begin, h=1) = " << curvatureEstimator.eval(it2, 1.) << std::endl;
115  trace.info() << "Eval tangent (begin, h=1) = " << tangentEstimator.eval(it2, 1.) << std::endl;
116  trace.info() << "Eval length (h=1) = " << lengthEstimator.eval(it, it2, 1.) << std::endl;
117  trace.info() << "Eval ball length (h=1) = " << lengthEstimator.eval() << std::endl;
118 
119  return true;
120 }
121 
122 template <typename Shape>
123 bool
125  Shape & aShape, double h )
126 {
127  using namespace Z2i;
128 
129  trace.beginBlock ( ( "Testing TrueLocalEstimator on digitization of "
130  + name ). c_str() );
131 
132  // Creates a digitizer on the window (xLow, xUp).
133  RealPoint xLow( -10.0, -10.0 );
134  RealPoint xUp( 10.0, 10.0 );
136  dig.attach( aShape ); // attaches the shape.
137  dig.init( xLow, xUp, h );
138 
139  // The domain size is given by the digitizer according to the window
140  // and the step.
141  Domain domain = dig.getDomain();
142 
143  // Create cellular space
144  KSpace K;
145  bool ok = K.init( dig.getLowerBound(), dig.getUpperBound(), true );
146  if ( ! ok )
147  {
148  std::cerr << "[testTrueLocalEstimatorOnShapeDigitization]"
149  << " error in creating KSpace." << std::endl;
150  }
151  else
152  {
153  try
154  {
155  // Extracts shape boundary
157  SCell bel = Surfaces<KSpace>::findABel( K, dig, 10000 );
158  // Getting the consecutive surfels of the 2D boundary
159  std::vector<Point> points;
160  Surfaces<KSpace>::track2DBoundaryPoints( points, K, SAdj, dig, bel );
161  // Create GridCurve
162  GridCurve<KSpace> gridcurve;
163  gridcurve.initFromVector( points );
164 
165  typedef GridCurve<KhalimskySpaceND<2> >::PointsRange Range;
166  typedef Range::ConstIterator ConstIteratorOnPoints;
168 
170  Range r = gridcurve.getPointsRange();//building range
171  curvatureEstimator.attach( aShape );
172 
173  std::cout << "# idx x y kappa" << endl;
174  unsigned int i = 0;
175  for ( ConstIteratorOnPoints it = r.begin(), ite = r.end();
176  it != ite; ++it, ++i )
177  {
178  const RealPoint& x = *it;
179  const double kappa = curvatureEstimator.eval( it, h );
180  std::cout << i << " " << x[0] << " " << x[1]
181  << " " << kappa << std::endl;
182  }
183  }
184  catch ( InputException& e )
185  {
186  std::cerr << "[testTrueLocalEstimatorOnShapeDigitization]"
187  << " error in finding a bel." << std::endl;
188  ok = false;
189  }
190  }
191  trace.emphase() << ( ok ? "Passed." : "Error." ) << endl;
192  trace.endBlock();
193  return ok;
194 }
195 
196 
198 // Standard services - public :
199 
200 int main( int argc, char** argv )
201 {
202  trace.beginBlock ( "Testing class TrueLocalEstimator" );
203  trace.info() << "Args:";
204  for ( int i = 0; i < argc; ++i )
205  trace.info() << " " << argv[ i ];
206  trace.info() << endl;
207 
208  std::string sinus2D4 = testPath + "samples/sinus2D4.dat";
209 
210  bool res = testTrueLocalEstimator(sinus2D4); // && ... other tests
211  trace.emphase() << ( res ? "Passed." : "Error." ) << endl;
212  trace.endBlock();
213 
214  typedef Ellipse2D< Z2i::Space > MyEllipse;
215  MyEllipse ellipse( 1.2, 0.1, 4.0, 3.0, 0.3 );
216  res = res &&
217  testTrueLocalEstimatorOnShapeDigitization<MyEllipse>
218  ( "Ellipse-4-3-0.3-s1", ellipse, 1 );
219  res = res &&
220  testTrueLocalEstimatorOnShapeDigitization<MyEllipse>
221  ( "Ellipse-4-3-0.3-s0.5", ellipse, 0.5 );
222 
223  typedef Flower2D< Z2i::Space > MyFlower;
224  MyFlower flower( 0.5, -2.3, 5.0, 0.7, 6, 0.3 );
225  res = res &&
226  testTrueLocalEstimatorOnShapeDigitization<MyFlower>
227  ( "Flower-5-0.3-6-0.3-s1", flower, 1 );
228  res = res &&
229  testTrueLocalEstimatorOnShapeDigitization<MyFlower>
230  ( "Flower-5-0.3-6-0.3-s0.25", flower, 0.25 );
231 
232  return res ? 0 : 1;
233 }
234 // //
Aim: Model of the concept StarShaped represents any circle in the plane.
Definition: Ball2D.h:61
Aim: model of CConstBidirectionalRange that adapts any range of elements bounded by two iterators [it...
Aim: Model of the concept StarShaped represents any ellipse in the plane.
Definition: Ellipse2D.h:65
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
bool initFromVectorStream(std::istream &in)
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: implements a functor that estimates the arc length of a paramtric curve.
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 associated to a parametric shape or to a subrange associated to a par...
Aim: Computes the true quantity to each element of a range associated to a parametric shape.
Quantity eval(const ConstIterator &it, const double h=1.) const
void attach(const ParametricShape &aShape)
DGtal is the top-level namespace which contains all DGtal functions and types.
Trace trace
Definition: Common.h:153
Represents a signed cell in a cellular grid space by its Khalimsky coordinates and a boolean value.
Aim: This concept describes an object that can process a range so as to return one estimated quantity...
Astroid2D< Space > Shape
KSpace K
Domain domain
int main(int argc, char **argv)
bool testTrueLocalEstimator(const std::string &filename)
bool testTrueLocalEstimatorOnShapeDigitization(const string &name, Shape &aShape, double h)