Visual Servoing Platform version 3.7.0
Loading...
Searching...
No Matches
homographyRansac2DObject.cpp
1/*
2 * ViSP, open source Visual Servoing Platform software.
3 * Copyright (C) 2005 - 2025 by Inria. All rights reserved.
4 *
5 * This software is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
9 * See the file LICENSE.txt at the root directory of this source
10 * distribution for additional information about the GNU GPL.
11 *
12 * For using ViSP with software that can not be combined with the GNU
13 * GPL, please contact Inria about acquiring a ViSP Professional
14 * Edition License.
15 *
16 * See https://visp.inria.fr for more information.
17 *
18 * This software was developed at:
19 * Inria Rennes - Bretagne Atlantique
20 * Campus Universitaire de Beaulieu
21 * 35042 Rennes Cedex
22 * France
23 *
24 * If you have questions regarding the use of this file, please contact
25 * Inria at visp@inria.fr
26 *
27 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
28 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
29 *
30 * Description:
31 * Example of the Ransac homography estimation algorithm.
32 */
33
41
49
50#include <visp3/core/vpConfig.h>
51#include <visp3/core/vpDebug.h>
52#include <visp3/core/vpMath.h>
53#include <visp3/core/vpRotationMatrix.h>
54#include <visp3/core/vpThetaUVector.h>
55#include <visp3/vision/vpHomography.h>
56
57#include <visp3/core/vpDebug.h>
58#include <visp3/core/vpHomogeneousMatrix.h>
59#include <visp3/core/vpMath.h>
60#include <visp3/core/vpPoint.h>
61
62#include <stdlib.h>
63#include <visp3/core/vpRansac.h>
64#include <visp3/io/vpParseArgv.h>
65// List of allowed command line options
66#define GETOPTARGS "h"
67
68#ifdef ENABLE_VISP_NAMESPACE
69using namespace VISP_NAMESPACE_NAME;
70#endif
71
72void usage(const char *name, const char *badparam);
73bool getOptions(int argc, const char **argv);
74
83void usage(const char *name, const char *badparam)
84{
85 fprintf(stdout, "\n\
86Test the Ransac homography estimation algorithm.\n\
87\n\
88SYNOPSIS\n\
89 %s [-h]\n",
90 name);
91
92 fprintf(stdout, "\n\
93OPTIONS: Default\n\
94 -h\n\
95 Print the help.\n");
96
97 if (badparam) {
98 fprintf(stderr, "ERROR: \n");
99 fprintf(stderr, "\nBad parameter [%s]\n", badparam);
100 }
101}
112bool getOptions(int argc, const char **argv)
113{
114 const char *optarg_;
115 int c;
116 while ((c = vpParseArgv::parse(argc, argv, GETOPTARGS, &optarg_)) > 1) {
117
118 switch (c) {
119 case 'h':
120 usage(argv[0], nullptr);
121 return false;
122
123 default:
124 usage(argv[0], optarg_);
125 return false;
126 }
127 }
128
129 if ((c == 1) || (c == -1)) {
130 // standalone param or error
131 usage(argv[0], nullptr);
132 std::cerr << "ERROR: " << std::endl;
133 std::cerr << " Bad argument " << optarg_ << std::endl << std::endl;
134 return false;
135 }
136
137 return true;
138}
139
140int main(int argc, const char **argv)
141{
142#if (defined(VISP_HAVE_LAPACK) || defined(VISP_HAVE_EIGEN3) || defined(VISP_HAVE_OPENCV))
143 try {
144 // Read the command line options
145 if (getOptions(argc, argv) == false) {
146 return EXIT_FAILURE;
147 }
148
149 double L = 0.1;
150 unsigned int nbpt = 11;
151
152 std::vector<vpPoint> P(nbpt); // Point to be tracked
153 std::vector<double> xa(nbpt), ya(nbpt), xb(nbpt), yb(nbpt);
154
155 P[0].setWorldCoordinates(-L, -L, 0); // inlier
156 P[1].setWorldCoordinates(2 * L, -L, 0); // inlier
157 P[2].setWorldCoordinates(L, L, 0); // inlier
158 P[3].setWorldCoordinates(-L, 3 * L, 0); // inlier
159 P[4].setWorldCoordinates(0, 0, L);
160 P[5].setWorldCoordinates(L, -2 * L, L);
161 P[6].setWorldCoordinates(L, -4 * L, 2 * L);
162 P[7].setWorldCoordinates(-2 * L, -L, -3 * L);
163 P[8].setWorldCoordinates(-5 * L, -5 * L, 0); // inlier
164 P[9].setWorldCoordinates(-2 * L, +3 * L, 4 * L);
165 P[10].setWorldCoordinates(-2 * L, -0.5 * L, 0); // inlier
166
167 std::vector<bool> inliers_ground_truth(nbpt, false);
168 inliers_ground_truth[0] = true;
169 inliers_ground_truth[1] = true;
170 inliers_ground_truth[2] = true;
171 inliers_ground_truth[3] = true;
172 inliers_ground_truth[8] = true;
173 inliers_ground_truth[10] = true;
174
175 vpHomogeneousMatrix bMo(0, 0, 1, 0, 0, 0);
176 vpHomogeneousMatrix aMb(0.1, 0.1, 0.1, vpMath::rad(10), 0, vpMath::rad(40));
177 vpHomogeneousMatrix aMo = aMb * bMo;
178 for (unsigned int i = 0; i < nbpt; i++) {
179 P[i].project(aMo);
180 xa[i] = P[i].get_x();
181 ya[i] = P[i].get_y();
182 }
183
184 for (unsigned int i = 0; i < nbpt; i++) {
185 P[i].project(bMo);
186 xb[i] = P[i].get_x();
187 yb[i] = P[i].get_y();
188 }
189 std::cout << "-------------------------------" << std::endl;
190
193 vpColVector n;
194 std::cout << "Compare with built homography H = R + t/d n " << std::endl;
195 vpPlane bp(0, 0, 1, 1);
196 vpHomography aHb_built(aMb, bp);
197 std::cout << "aHb built from the displacement: \n" << aHb_built / aHb_built[2][2] << std::endl;
198
199 aHb_built.computeDisplacement(aRb, aTb, n);
200 std::cout << "Rotation aRb: " << std::endl;
201 std::cout << aRb << std::endl;
202 std::cout << "Translation: aTb" << std::endl;
203 std::cout << (aTb).t() << std::endl;
204 std::cout << "Normal to the plane: n" << std::endl;
205 std::cout << (n).t() << std::endl;
206
207 std::cout << "-------------------------------" << std::endl;
208 vpHomography aHb;
209 std::vector<bool> inliers;
210 double residual;
211 // Suppose px=1000. Set the threshold to 2 pixels => 2/1000
212 // In the data we have 6 inliers. We request that at least 6 are retrieved
213 vpHomography::ransac(xb, yb, xa, ya, aHb, inliers, residual, 6, 2. / 1000);
214
215 std::cout << "aHb estimated using ransac:\n" << aHb << std::endl;
216 std::cout << "Inliers indexes (should be 0,1,2,3,8,10): ";
217 for (unsigned int i = 0; i < inliers.size(); i++)
218 if (inliers[i])
219 std::cout << i << ",";
220 std::cout << std::endl;
221
222 if (inliers == inliers_ground_truth) {
223 std::cout << "Ransac estimation succeed" << std::endl;
224 return EXIT_SUCCESS;
225 }
226 else {
227 std::cout << "Ransac estimation fails" << std::endl;
228 return EXIT_FAILURE;
229 }
230 }
231 catch (const vpException &e) {
232 std::cout << "Catch an exception: " << e << std::endl;
233 return EXIT_FAILURE;
234 }
235#else
236 (void)argc;
237 (void)argv;
238 std::cout << "Cannot run this example: install Lapack, Eigen3 or OpenCV" << std::endl;
239 return EXIT_SUCCESS;
240#endif
241}
Implementation of column vector and the associated operations.
error that can be emitted by ViSP classes.
Definition vpException.h:60
Implementation of an homogeneous matrix and operations on such kind of matrices.
Implementation of an homography and operations on homographies.
static bool ransac(const std::vector< double > &xb, const std::vector< double > &yb, const std::vector< double > &xa, const std::vector< double > &ya, vpHomography &aHb, std::vector< bool > &inliers, double &residual, unsigned int nbInliersConsensus, double threshold, bool normalization=true)
static double rad(double deg)
Definition vpMath.h:129
static bool parse(int *argcPtr, const char **argv, vpArgvInfo *argTable, int flags)
This class defines the container for a plane geometrical structure.
Definition vpPlane.h:56
Implementation of a rotation matrix and operations on such kind of matrices.
Class that consider the case of a translation vector.