DGtal 1.4.0
Loading...
Searching...
No Matches
testTrueLocalEstimator.cpp File Reference
#include <iostream>
#include "DGtal/base/Common.h"
#include "DGtal/kernel/SpaceND.h"
#include "DGtal/kernel/domains/HyperRectDomain.h"
#include "DGtal/kernel/sets/DigitalSetSelector.h"
#include "DGtal/topology/KhalimskySpaceND.h"
#include "DGtal/topology/SurfelAdjacency.h"
#include "DGtal/topology/SurfelNeighborhood.h"
#include "DGtal/shapes/Shapes.h"
#include "DGtal/shapes/ShapeFactory.h"
#include "DGtal/shapes/GaussDigitizer.h"
#include "DGtal/geometry/curves/GridCurve.h"
#include "DGtal/geometry/curves/ArithmeticalDSSComputer.h"
#include "DGtal/geometry/curves/estimation/CCurveLocalGeometricEstimator.h"
#include "DGtal/geometry/curves/estimation/TrueLocalEstimatorOnPoints.h"
#include "DGtal/geometry/curves/estimation/TrueGlobalEstimatorOnPoints.h"
#include "DGtal/geometry/curves/estimation/ParametricShapeCurvatureFunctor.h"
#include "DGtal/geometry/curves/estimation/ParametricShapeTangentFunctor.h"
#include "DGtal/geometry/curves/estimation/ParametricShapeArcLengthFunctor.h"
#include "DGtal/geometry/curves/estimation/MostCenteredMaximalSegmentEstimator.h"
#include "DGtal/geometry/curves/estimation/CompareLocalEstimators.h"
#include "ConfigTest.h"
Include dependency graph for testTrueLocalEstimator.cpp:

Go to the source code of this file.

Functions

bool testTrueLocalEstimator (const std::string &filename)
 
template<typename Shape >
bool testTrueLocalEstimatorOnShapeDigitization (const string &name, Shape &aShape, double h)
 
int main (int argc, char **argv)
 

Detailed Description

This program is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.

Author
David Coeurjolly (david.nosp@m..coe.nosp@m.urjol.nosp@m.ly@l.nosp@m.iris..nosp@m.cnrs.nosp@m..fr ) Laboratoire d'InfoRmatique en Image et Systèmes d'information - LIRIS (CNRS, UMR 5205), CNRS, France
Jacques-Olivier Lachaud (jacqu.nosp@m.es-o.nosp@m.livie.nosp@m.r.la.nosp@m.chaud.nosp@m.@uni.nosp@m.v-sav.nosp@m.oie..nosp@m.fr ) Laboratory of Mathematics (CNRS, UMR 5807), University of Savoie, France
Date
2011/06/30

Functions for testing class TrueLocalEstimator.

This file is part of the DGtal library.

Definition in file testTrueLocalEstimator.cpp.

Function Documentation

◆ main()

int main ( int argc,
char ** argv )

Definition at line 200 of file testTrueLocalEstimator.cpp.

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 &&
218 ( "Ellipse-4-3-0.3-s1", ellipse, 1 );
219 res = res &&
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 &&
227 ( "Flower-5-0.3-6-0.3-s1", flower, 1 );
228 res = res &&
230 ( "Flower-5-0.3-6-0.3-s0.25", flower, 0.25 );
231
232 return res ? 0 : 1;
233}
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
void beginBlock(const std::string &keyword="")
std::ostream & emphase()
std::ostream & info()
double endBlock()
Trace trace
Definition Common.h:153
bool testTrueLocalEstimator(const std::string &filename)
bool testTrueLocalEstimatorOnShapeDigitization(const string &name, Shape &aShape, double h)

References DGtal::Trace::beginBlock(), DGtal::Trace::emphase(), DGtal::Trace::endBlock(), DGtal::Trace::info(), testTrueLocalEstimator(), testTrueLocalEstimatorOnShapeDigitization(), and DGtal::trace.

◆ testTrueLocalEstimator()

bool testTrueLocalEstimator ( const std::string & filename)

Example of a test. To be completed.

Definition at line 72 of file testTrueLocalEstimator.cpp.

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
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}
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: 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)
Aim: This class is a model of CCellularGridSpaceND. It represents the cubical grid as a cell complex,...
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: 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.
Aim: This concept describes an object that can process a range so as to return one estimated quantity...
Astroid2D< Space > Shape

References DGtal::Trace::info(), DGtal::GridCurve< TKSpace >::initFromVectorStream(), and DGtal::trace.

Referenced by main().

◆ testTrueLocalEstimatorOnShapeDigitization()

template<typename Shape >
bool testTrueLocalEstimatorOnShapeDigitization ( const string & name,
Shape & aShape,
double h )

Definition at line 124 of file testTrueLocalEstimator.cpp.

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}
Aim: A class for computing the Gauss digitization of some Euclidean shape, i.e. its intersection with...
const Point & getUpperBound() const
void attach(ConstAlias< EuclideanShape > shape)
const Point & getLowerBound() const
void init(const RealPoint &xLow, const RealPoint &xUp, typename RealVector::Component gridStep)
Domain getDomain() const
PointsRange getPointsRange() const
Definition GridCurve.h:426
bool initFromVector(const std::vector< Point > &aVectorOfPoints)
bool init(const Point &lower, const Point &upper, bool isClosed)
Specifies the upper and lower bounds for the maximal cells in this space.
static void track2DBoundaryPoints(std::vector< Point > &aVectorOfPoints, const KSpace &K, const SurfelAdjacency< KSpace::dimension > &surfel_adj, const PointPredicate &pp, const SCell &start_surfel)
static SCell findABel(const KSpace &K, const PointPredicate &pp, unsigned int nbtries=1000)
Aim: Represent adjacencies between surfel elements, telling if it follows an interior to exterior ord...
Quantity eval(const ConstIterator &it, const double h=1.) const
void attach(const ParametricShape &aShape)
Represents a signed cell in a cellular grid space by its Khalimsky coordinates and a boolean value.
KSpace K
Domain domain

References DGtal::GaussDigitizer< TSpace, TEuclideanShape >::attach(), DGtal::TrueLocalEstimatorOnPoints< TConstIteratorOnPoints, TParametricShape, TParametricShapeFunctor >::attach(), DGtal::Trace::beginBlock(), domain, DGtal::Trace::emphase(), DGtal::Trace::endBlock(), DGtal::TrueLocalEstimatorOnPoints< TConstIteratorOnPoints, TParametricShape, TParametricShapeFunctor >::eval(), DGtal::Surfaces< TKSpace >::findABel(), DGtal::GaussDigitizer< TSpace, TEuclideanShape >::getDomain(), DGtal::GaussDigitizer< TSpace, TEuclideanShape >::getLowerBound(), DGtal::GridCurve< TKSpace >::getPointsRange(), DGtal::GaussDigitizer< TSpace, TEuclideanShape >::getUpperBound(), DGtal::GaussDigitizer< TSpace, TEuclideanShape >::init(), DGtal::KhalimskySpaceND< dim, TInteger >::init(), DGtal::GridCurve< TKSpace >::initFromVector(), K, DGtal::trace, and DGtal::Surfaces< TKSpace >::track2DBoundaryPoints().

Referenced by main().