dynamic_compressed_row_jacobian_writer.cc 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101
  1. // Ceres Solver - A fast non-linear least squares minimizer
  2. // Copyright 2023 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: richie.stebbing@gmail.com (Richard Stebbing)
  30. #include "ceres/dynamic_compressed_row_jacobian_writer.h"
  31. #include <memory>
  32. #include <utility>
  33. #include <vector>
  34. #include "ceres/casts.h"
  35. #include "ceres/compressed_row_jacobian_writer.h"
  36. #include "ceres/dynamic_compressed_row_sparse_matrix.h"
  37. #include "ceres/parameter_block.h"
  38. #include "ceres/program.h"
  39. #include "ceres/residual_block.h"
  40. namespace ceres::internal {
  41. std::unique_ptr<ScratchEvaluatePreparer[]>
  42. DynamicCompressedRowJacobianWriter::CreateEvaluatePreparers(int num_threads) {
  43. return ScratchEvaluatePreparer::Create(*program_, num_threads);
  44. }
  45. std::unique_ptr<SparseMatrix>
  46. DynamicCompressedRowJacobianWriter::CreateJacobian() const {
  47. return std::make_unique<DynamicCompressedRowSparseMatrix>(
  48. program_->NumResiduals(),
  49. program_->NumEffectiveParameters(),
  50. 0 /* max_num_nonzeros */);
  51. }
  52. void DynamicCompressedRowJacobianWriter::Write(int residual_id,
  53. int residual_offset,
  54. double** jacobians,
  55. SparseMatrix* base_jacobian) {
  56. auto* jacobian = down_cast<DynamicCompressedRowSparseMatrix*>(base_jacobian);
  57. // Get the `residual_block` of interest.
  58. const ResidualBlock* residual_block =
  59. program_->residual_blocks()[residual_id];
  60. const int num_residuals = residual_block->NumResiduals();
  61. std::vector<std::pair<int, int>> evaluated_jacobian_blocks;
  62. CompressedRowJacobianWriter::GetOrderedParameterBlocks(
  63. program_, residual_id, &evaluated_jacobian_blocks);
  64. // `residual_offset` is the residual row in the global jacobian.
  65. // Empty the jacobian rows.
  66. jacobian->ClearRows(residual_offset, num_residuals);
  67. // Iterate over each parameter block.
  68. for (const auto& evaluated_jacobian_block : evaluated_jacobian_blocks) {
  69. const ParameterBlock* parameter_block =
  70. program_->parameter_blocks()[evaluated_jacobian_block.first];
  71. const int parameter_block_jacobian_index = evaluated_jacobian_block.second;
  72. const int parameter_block_size = parameter_block->TangentSize();
  73. const double* parameter_jacobian =
  74. jacobians[parameter_block_jacobian_index];
  75. // For each parameter block only insert its non-zero entries.
  76. for (int r = 0; r < num_residuals; ++r) {
  77. for (int c = 0; c < parameter_block_size; ++c, ++parameter_jacobian) {
  78. const double v = *parameter_jacobian;
  79. // Only insert non-zero entries.
  80. if (v != 0.0) {
  81. jacobian->InsertEntry(
  82. residual_offset + r, parameter_block->delta_offset() + c, v);
  83. }
  84. }
  85. }
  86. }
  87. }
  88. } // namespace ceres::internal