197 lines
		
	
	
		
			6.2 KiB
		
	
	
	
		
			C++
		
	
	
			
		
		
	
	
			197 lines
		
	
	
		
			6.2 KiB
		
	
	
	
		
			C++
		
	
	
| /**
 | |
|  * @file    testGraph.cpp
 | |
|  * @brief   Unit test for two cameras and four landmarks
 | |
|  * single camera
 | |
|  * @author  Chris Beall
 | |
|  * @author  Frank Dellaert
 | |
|  * @author  Viorela Ila
 | |
|  */
 | |
| 
 | |
| #include <CppUnitLite/TestHarness.h>
 | |
| #include <boost/shared_ptr.hpp>
 | |
| using namespace boost;
 | |
| 
 | |
| #define GTSAM_MAGIC_KEY
 | |
| 
 | |
| #include "NonlinearFactorGraph-inl.h"
 | |
| #include "NonlinearOptimizer-inl.h"
 | |
| #include "Ordering-inl.h"
 | |
| #include "visualSLAM.h"
 | |
| 
 | |
| using namespace std;
 | |
| using namespace gtsam;
 | |
| using namespace gtsam::visualSLAM;
 | |
| using namespace boost;
 | |
| typedef NonlinearOptimizer<Graph,Config> Optimizer;
 | |
| static sharedGaussian sigma(noiseModel::Unit::Create(1));
 | |
| 
 | |
| /* ************************************************************************* */
 | |
| Point3 landmark1(-1.0,-1.0, 0.0);
 | |
| Point3 landmark2(-1.0, 1.0, 0.0);
 | |
| Point3 landmark3( 1.0, 1.0, 0.0);
 | |
| Point3 landmark4( 1.0,-1.0, 0.0);
 | |
| 
 | |
| Pose3 camera1(Matrix_(3,3,
 | |
| 		       1., 0., 0.,
 | |
| 		       0.,-1., 0.,
 | |
| 		       0., 0.,-1.
 | |
| 		       ),
 | |
| 	      Point3(0,0,6.25));
 | |
| 
 | |
| Pose3 camera2(Matrix_(3,3,
 | |
| 		       1., 0., 0.,
 | |
| 		       0.,-1., 0.,
 | |
| 		       0., 0.,-1.
 | |
| 		       ),
 | |
| 	      Point3(0,0,5.00));
 | |
| 
 | |
| /* ************************************************************************* */
 | |
| Graph testGraph() {
 | |
|   Point2 z11(-100, 100);
 | |
| 	Point2 z12(-100,-100);
 | |
| 	Point2 z13( 100,-100);
 | |
| 	Point2 z14( 100, 100);
 | |
| 	Point2 z21(-125, 125);
 | |
| 	Point2 z22(-125,-125);
 | |
| 	Point2 z23( 125,-125);
 | |
| 	Point2 z24( 125, 125);
 | |
| 
 | |
|   shared_ptrK sK(new Cal3_S2(625, 625, 0, 0, 0));
 | |
|   Graph g;
 | |
|   g.add(ProjectionFactor(z11, sigma, 1, 1, sK));
 | |
|   g.add(ProjectionFactor(z12, sigma, 1, 2, sK));
 | |
|   g.add(ProjectionFactor(z13, sigma, 1, 3, sK));
 | |
|   g.add(ProjectionFactor(z14, sigma, 1, 4, sK));
 | |
|   g.add(ProjectionFactor(z21, sigma, 2, 1, sK));
 | |
|   g.add(ProjectionFactor(z22, sigma, 2, 2, sK));
 | |
|   g.add(ProjectionFactor(z23, sigma, 2, 3, sK));
 | |
|   g.add(ProjectionFactor(z24, sigma, 2, 4, sK));
 | |
|   return g;
 | |
| }
 | |
| 
 | |
| /* ************************************************************************* */
 | |
| TEST( Graph, optimizeLM)
 | |
| {
 | |
|   // build a graph
 | |
|   shared_ptr<Graph> graph(new Graph(testGraph()));
 | |
| 	// add 3 landmark constraints
 | |
|   graph->add(PointConstraint(1, landmark1));
 | |
|   graph->add(PointConstraint(2, landmark2));
 | |
|   graph->add(PointConstraint(3, landmark3));
 | |
| 
 | |
|   // Create an initial configuration corresponding to the ground truth
 | |
|   boost::shared_ptr<Config> initialEstimate(new Config);
 | |
|   initialEstimate->insert(1, camera1);
 | |
|   initialEstimate->insert(2, camera2);
 | |
|   initialEstimate->insert(1, landmark1);
 | |
|   initialEstimate->insert(2, landmark2);
 | |
|   initialEstimate->insert(3, landmark3);
 | |
|   initialEstimate->insert(4, landmark4);
 | |
| 
 | |
|   // Create an ordering of the variables
 | |
|   list<Symbol> keys;
 | |
|   keys.push_back("l1");
 | |
|   keys.push_back("l2");
 | |
|   keys.push_back("l3");
 | |
|   keys.push_back("l4");
 | |
|   keys.push_back("x1");
 | |
|   keys.push_back("x2");
 | |
|   shared_ptr<Ordering> ordering(new Ordering(keys));
 | |
| 
 | |
|   // Create an optimizer and check its error
 | |
|   // We expect the initial to be zero because config is the ground truth
 | |
|   Optimizer optimizer(graph, ordering, initialEstimate);
 | |
|   DOUBLES_EQUAL(0.0, optimizer.error(), 1e-9);
 | |
| 
 | |
|   // Iterate once, and the config should not have changed because we started
 | |
|   // with the ground truth
 | |
|   Optimizer afterOneIteration = optimizer.iterate();
 | |
|   DOUBLES_EQUAL(0.0, optimizer.error(), 1e-9);
 | |
| 
 | |
|   // check if correct
 | |
|   CHECK(assert_equal(*initialEstimate,*(afterOneIteration.config())));
 | |
| }
 | |
| 
 | |
| 
 | |
| /* ************************************************************************* */
 | |
| TEST( Graph, optimizeLM2)
 | |
| {
 | |
|   // build a graph
 | |
|   shared_ptr<Graph> graph(new Graph(testGraph()));
 | |
| 	// add 2 camera constraints
 | |
|   graph->add(PoseConstraint(1, camera1));
 | |
|   graph->add(PoseConstraint(2, camera2));
 | |
| 
 | |
|   // Create an initial configuration corresponding to the ground truth
 | |
|   boost::shared_ptr<Config> initialEstimate(new Config);
 | |
|   initialEstimate->insert(1, camera1);
 | |
|   initialEstimate->insert(2, camera2);
 | |
|   initialEstimate->insert(1, landmark1);
 | |
|   initialEstimate->insert(2, landmark2);
 | |
|   initialEstimate->insert(3, landmark3);
 | |
|   initialEstimate->insert(4, landmark4);
 | |
| 
 | |
|   // Create an ordering of the variables
 | |
|   list<Symbol> keys;
 | |
| 
 | |
|   keys.push_back("l1");
 | |
|   keys.push_back("l2");
 | |
|   keys.push_back("l3");
 | |
|   keys.push_back("l4");
 | |
|   keys.push_back("x1");
 | |
|   keys.push_back("x2");
 | |
|   shared_ptr<Ordering> ordering(new Ordering(keys));
 | |
| 
 | |
|   // Create an optimizer and check its error
 | |
|   // We expect the initial to be zero because config is the ground truth
 | |
|   Optimizer optimizer(graph, ordering, initialEstimate);
 | |
|   DOUBLES_EQUAL(0.0, optimizer.error(), 1e-9);
 | |
| 
 | |
|   // Iterate once, and the config should not have changed because we started
 | |
|   // with the ground truth
 | |
|   Optimizer afterOneIteration = optimizer.iterate();
 | |
|   DOUBLES_EQUAL(0.0, optimizer.error(), 1e-9);
 | |
| 
 | |
|   // check if correct
 | |
|   CHECK(assert_equal(*initialEstimate,*(afterOneIteration.config())));
 | |
| }
 | |
| 
 | |
| 
 | |
| /* ************************************************************************* */
 | |
| TEST( Graph, CHECK_ORDERING)
 | |
| {
 | |
|   // build a graph
 | |
|   shared_ptr<Graph> graph(new Graph(testGraph()));
 | |
|   // add 2 camera constraints
 | |
|   graph->add(PoseConstraint(1, camera1));
 | |
|   graph->add(PoseConstraint(2, camera2));
 | |
| 
 | |
|   // Create an initial configuration corresponding to the ground truth
 | |
|   boost::shared_ptr<Config> initialEstimate(new Config);
 | |
|   initialEstimate->insert(1, camera1);
 | |
|   initialEstimate->insert(2, camera2);
 | |
|   initialEstimate->insert(1, landmark1);
 | |
|   initialEstimate->insert(2, landmark2);
 | |
|   initialEstimate->insert(3, landmark3);
 | |
|   initialEstimate->insert(4, landmark4);
 | |
| 
 | |
|   shared_ptr<Ordering> ordering(new Ordering(graph->getOrdering()));
 | |
| 
 | |
|   // Create an optimizer and check its error
 | |
|   // We expect the initial to be zero because config is the ground truth
 | |
|   Optimizer optimizer(graph, ordering, initialEstimate);
 | |
|   DOUBLES_EQUAL(0.0, optimizer.error(), 1e-9);
 | |
| 
 | |
|   // Iterate once, and the config should not have changed because we started
 | |
|   // with the ground truth
 | |
|   Optimizer afterOneIteration = optimizer.iterate();
 | |
|   DOUBLES_EQUAL(0.0, optimizer.error(), 1e-9);
 | |
| 
 | |
|   // check if correct
 | |
|   CHECK(assert_equal(*initialEstimate,*(afterOneIteration.config())));
 | |
| }
 | |
| 
 | |
| /* ************************************************************************* */
 | |
| int main() { TestResult tr; TestRegistry::runAllTests(tr); return 0;}
 | |
| /* ************************************************************************* */
 |