parameter_block_ordering.h 4.1 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394
  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: sameeragarwal@google.com (Sameer Agarwal)
  30. #ifndef CERES_INTERNAL_PARAMETER_BLOCK_ORDERING_H_
  31. #define CERES_INTERNAL_PARAMETER_BLOCK_ORDERING_H_
  32. #include <memory>
  33. #include <vector>
  34. #include "ceres/graph.h"
  35. #include "ceres/internal/disable_warnings.h"
  36. #include "ceres/internal/export.h"
  37. #include "ceres/ordered_groups.h"
  38. #include "ceres/types.h"
  39. namespace ceres::internal {
  40. class Program;
  41. class ParameterBlock;
  42. // Uses an approximate independent set ordering to order the parameter
  43. // blocks of a problem so that it is suitable for use with Schur-
  44. // complement-based solvers. The output variable ordering contains an
  45. // ordering of the parameter blocks and the return value is size of
  46. // the independent set or the number of e_blocks (see
  47. // schur_complement_solver.h for an explanation). Constant parameters
  48. // are added to the end.
  49. //
  50. // The ordering vector has the structure
  51. //
  52. // ordering = [independent set,
  53. // complement of the independent set,
  54. // fixed blocks]
  55. CERES_NO_EXPORT int ComputeSchurOrdering(
  56. const Program& program, std::vector<ParameterBlock*>* ordering);
  57. // Same as above, except that ties while computing the independent set
  58. // ordering are resolved in favour of the order in which the parameter
  59. // blocks occur in the program.
  60. CERES_NO_EXPORT int ComputeStableSchurOrdering(
  61. const Program& program, std::vector<ParameterBlock*>* ordering);
  62. // Use an approximate independent set ordering to decompose the
  63. // parameter blocks of a problem in a sequence of independent
  64. // sets. The ordering covers all the non-constant parameter blocks in
  65. // the program.
  66. CERES_NO_EXPORT void ComputeRecursiveIndependentSetOrdering(
  67. const Program& program, ParameterBlockOrdering* ordering);
  68. // Builds a graph on the parameter blocks of a Problem, whose
  69. // structure reflects the sparsity structure of the Hessian. Each
  70. // vertex corresponds to a parameter block in the Problem except for
  71. // parameter blocks that are marked constant. An edge connects two
  72. // parameter blocks, if they co-occur in a residual block.
  73. CERES_NO_EXPORT std::unique_ptr<Graph<ParameterBlock*>> CreateHessianGraph(
  74. const Program& program);
  75. // Iterate over each of the groups in order of their priority and fill
  76. // summary with their sizes.
  77. CERES_NO_EXPORT void OrderingToGroupSizes(
  78. const ParameterBlockOrdering* ordering, std::vector<int>* group_sizes);
  79. } // namespace ceres::internal
  80. #include "ceres/internal/reenable_warnings.h"
  81. #endif // CERES_INTERNAL_PARAMETER_BLOCK_ORDERING_H_