snavely_reprojection_error.h 3.4 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586
  1. // Ceres Solver - A fast non-linear least squares minimizer
  2. // Copyright 2020 Google Inc. All rights reserved.
  3. // http://ceres-solver.org/
  4. //
  5. // Redistribution and use in source and binary forms, with or without
  6. // modification, are permitted provided that the following conditions are met:
  7. //
  8. // * Redistributions of source code must retain the above copyright notice,
  9. // this list of conditions and the following disclaimer.
  10. // * Redistributions in binary form must reproduce the above copyright notice,
  11. // this list of conditions and the following disclaimer in the documentation
  12. // and/or other materials provided with the distribution.
  13. // * Neither the name of Google Inc. nor the names of its contributors may be
  14. // used to endorse or promote products derived from this software without
  15. // specific prior written permission.
  16. //
  17. // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  18. // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19. // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20. // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  21. // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  22. // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  23. // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  24. // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  25. // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  26. // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  27. // POSSIBILITY OF SUCH DAMAGE.
  28. //
  29. // Author: darius.rueckert@fau.de (Darius Rueckert)
  30. //
  31. //
  32. #ifndef CERES_INTERNAL_AUTODIFF_BENCHMARK_SNAVELY_REPROJECTION_ERROR_H_
  33. #define CERES_INTERNAL_AUTODIFF_BENCHMARK_SNAVELY_REPROJECTION_ERROR_H_
  34. #include "ceres/rotation.h"
  35. namespace ceres {
  36. struct SnavelyReprojectionError {
  37. SnavelyReprojectionError(double observed_x, double observed_y)
  38. : observed_x(observed_x), observed_y(observed_y) {}
  39. template <typename T>
  40. inline bool operator()(const T* const camera,
  41. const T* const point,
  42. T* residuals) const {
  43. T ox = T(observed_x);
  44. T oy = T(observed_y);
  45. // camera[0,1,2] are the angle-axis rotation.
  46. T p[3];
  47. ceres::AngleAxisRotatePoint(camera, point, p);
  48. // camera[3,4,5] are the translation.
  49. p[0] += camera[3];
  50. p[1] += camera[4];
  51. p[2] += camera[5];
  52. // Compute the center of distortion. The sign change comes from
  53. // the camera model that Noah Snavely's Bundler assumes, whereby
  54. // the camera coordinate system has a negative z axis.
  55. const T xp = -p[0] / p[2];
  56. const T yp = -p[1] / p[2];
  57. // Apply second and fourth order radial distortion.
  58. const T& l1 = camera[7];
  59. const T& l2 = camera[8];
  60. const T r2 = xp * xp + yp * yp;
  61. const T distortion = T(1.0) + r2 * (l1 + l2 * r2);
  62. // Compute final projected point position.
  63. const T& focal = camera[6];
  64. const T predicted_x = focal * distortion * xp;
  65. const T predicted_y = focal * distortion * yp;
  66. // The error is the difference between the predicted and observed position.
  67. residuals[0] = predicted_x - ox;
  68. residuals[1] = predicted_y - oy;
  69. return true;
  70. }
  71. double observed_x;
  72. double observed_y;
  73. };
  74. } // namespace ceres
  75. #endif // CERES_INTERNAL_AUTODIFF_BENCHMARK_SNAVELY_REPROJECTION_ERROR_H_