File size: 12,943 Bytes
7b7496d | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 | // Copyright (c) 2022, ETH Zurich and UNC Chapel Hill.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// * Neither the name of ETH Zurich and UNC Chapel Hill nor the names of
// its contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
//
// Author: Johannes L. Schoenberger (jsch-at-demuc-dot-de)
#ifndef COLMAP_SRC_OPTIM_BUNDLE_ADJUSTMENT_H_
#define COLMAP_SRC_OPTIM_BUNDLE_ADJUSTMENT_H_
#include <memory>
#include <unordered_set>
#include <Eigen/Core>
#include <ceres/ceres.h>
#include "PBA/pba.h"
#include "base/camera_rig.h"
#include "base/reconstruction.h"
#include "util/alignment.h"
namespace colmap {
struct BundleAdjustmentOptions {
// Loss function types: Trivial (non-robust) and Cauchy (robust) loss.
enum class LossFunctionType { TRIVIAL, SOFT_L1, CAUCHY };
LossFunctionType loss_function_type = LossFunctionType::TRIVIAL;
// Scaling factor determines residual at which robustification takes place.
double loss_function_scale = 1.0;
// Whether to refine the focal length parameter group.
bool refine_focal_length = true;
// Whether to refine the principal point parameter group.
bool refine_principal_point = false;
// Whether to refine the extra parameter group.
bool refine_extra_params = true;
// Whether to refine the extrinsic parameter group.
bool refine_extrinsics = true;
// Whether to print a final summary.
bool print_summary = true;
// Minimum number of residuals to enable multi-threading. Note that
// single-threaded is typically better for small bundle adjustment problems
// due to the overhead of threading.
int min_num_residuals_for_multi_threading = 50000;
// Ceres-Solver options.
ceres::Solver::Options solver_options;
BundleAdjustmentOptions() {
solver_options.function_tolerance = 0.0;
solver_options.gradient_tolerance = 0.0;
solver_options.parameter_tolerance = 0.0;
solver_options.minimizer_progress_to_stdout = false;
solver_options.max_num_iterations = 100;
solver_options.max_linear_solver_iterations = 200;
solver_options.max_num_consecutive_invalid_steps = 10;
solver_options.max_consecutive_nonmonotonic_steps = 10;
solver_options.num_threads = -1;
#if CERES_VERSION_MAJOR < 2
solver_options.num_linear_solver_threads = -1;
#endif // CERES_VERSION_MAJOR
}
// Create a new loss function based on the specified options. The caller
// takes ownership of the loss function.
ceres::LossFunction* CreateLossFunction() const;
bool Check() const;
};
// Configuration container to setup bundle adjustment problems.
class BundleAdjustmentConfig {
public:
BundleAdjustmentConfig();
size_t NumImages() const;
size_t NumPoints() const;
size_t NumConstantCameras() const;
size_t NumConstantPoses() const;
size_t NumConstantTvecs() const;
size_t NumVariablePoints() const;
size_t NumConstantPoints() const;
// Determine the number of residuals for the given reconstruction. The number
// of residuals equals the number of observations times two.
size_t NumResiduals(const Reconstruction& reconstruction) const;
// Add / remove images from the configuration.
void AddImage(const image_t image_id);
bool HasImage(const image_t image_id) const;
void RemoveImage(const image_t image_id);
// Set cameras of added images as constant or variable. By default all
// cameras of added images are variable. Note that the corresponding images
// have to be added prior to calling these methods.
void SetConstantCamera(const camera_t camera_id);
void SetVariableCamera(const camera_t camera_id);
bool IsConstantCamera(const camera_t camera_id) const;
// Set the pose of added images as constant. The pose is defined as the
// rotational and translational part of the projection matrix.
void SetConstantPose(const image_t image_id);
void SetVariablePose(const image_t image_id);
bool HasConstantPose(const image_t image_id) const;
// Set the translational part of the pose, hence the constant pose
// indices may be in [0, 1, 2] and must be unique. Note that the
// corresponding images have to be added prior to calling these methods.
void SetConstantTvec(const image_t image_id, const std::vector<int>& idxs);
void RemoveConstantTvec(const image_t image_id);
bool HasConstantTvec(const image_t image_id) const;
// Add / remove points from the configuration. Note that points can either
// be variable or constant but not both at the same time.
void AddVariablePoint(const point3D_t point3D_id);
void AddConstantPoint(const point3D_t point3D_id);
bool HasPoint(const point3D_t point3D_id) const;
bool HasVariablePoint(const point3D_t point3D_id) const;
bool HasConstantPoint(const point3D_t point3D_id) const;
void RemoveVariablePoint(const point3D_t point3D_id);
void RemoveConstantPoint(const point3D_t point3D_id);
// Access configuration data.
const std::unordered_set<image_t>& Images() const;
const std::unordered_set<point3D_t>& VariablePoints() const;
const std::unordered_set<point3D_t>& ConstantPoints() const;
const std::vector<int>& ConstantTvec(const image_t image_id) const;
private:
std::unordered_set<camera_t> constant_camera_ids_;
std::unordered_set<image_t> image_ids_;
std::unordered_set<point3D_t> variable_point3D_ids_;
std::unordered_set<point3D_t> constant_point3D_ids_;
std::unordered_set<image_t> constant_poses_;
std::unordered_map<image_t, std::vector<int>> constant_tvecs_;
};
// Bundle adjustment based on Ceres-Solver. Enables most flexible configurations
// and provides best solution quality.
class BundleAdjuster {
public:
BundleAdjuster(const BundleAdjustmentOptions& options,
const BundleAdjustmentConfig& config);
bool Solve(Reconstruction* reconstruction);
// Get the Ceres solver summary for the last call to `Solve`.
const ceres::Solver::Summary& Summary() const;
private:
void SetUp(Reconstruction* reconstruction,
ceres::LossFunction* loss_function);
void TearDown(Reconstruction* reconstruction);
void AddImageToProblem(const image_t image_id, Reconstruction* reconstruction,
ceres::LossFunction* loss_function);
void AddPointToProblem(const point3D_t point3D_id,
Reconstruction* reconstruction,
ceres::LossFunction* loss_function);
protected:
void ParameterizeCameras(Reconstruction* reconstruction);
void ParameterizePoints(Reconstruction* reconstruction);
const BundleAdjustmentOptions options_;
BundleAdjustmentConfig config_;
std::unique_ptr<ceres::Problem> problem_;
ceres::Solver::Summary summary_;
std::unordered_set<camera_t> camera_ids_;
std::unordered_map<point3D_t, size_t> point3D_num_observations_;
};
// Bundle adjustment using PBA (GPU or CPU). Less flexible and accurate than
// Ceres-Solver bundle adjustment but much faster. Only supports SimpleRadial
// camera model.
class ParallelBundleAdjuster {
public:
struct Options {
// Whether to print a final summary.
bool print_summary = true;
// Maximum number of iterations.
int max_num_iterations = 50;
// Index of the GPU used for bundle adjustment.
int gpu_index = -1;
// Number of threads for CPU based bundle adjustment.
int num_threads = -1;
// Minimum number of residuals to enable multi-threading. Note that
// single-threaded is typically better for small bundle adjustment problems
// due to the overhead of threading.
int min_num_residuals_for_multi_threading = 50000;
bool Check() const;
};
ParallelBundleAdjuster(const Options& options,
const BundleAdjustmentOptions& ba_options,
const BundleAdjustmentConfig& config);
bool Solve(Reconstruction* reconstruction);
// Get the Ceres solver summary for the last call to `Solve`.
const ceres::Solver::Summary& Summary() const;
// Check whether PBA is supported for the given reconstruction. If the
// reconstruction is not supported, the PBA solver will exit ungracefully.
static bool IsSupported(const BundleAdjustmentOptions& options,
const Reconstruction& reconstruction);
private:
void SetUp(Reconstruction* reconstruction);
void TearDown(Reconstruction* reconstruction);
void AddImagesToProblem(Reconstruction* reconstruction);
void AddPointsToProblem(Reconstruction* reconstruction);
const Options options_;
const BundleAdjustmentOptions ba_options_;
BundleAdjustmentConfig config_;
ceres::Solver::Summary summary_;
size_t num_measurements_;
std::vector<pba::CameraT> cameras_;
std::vector<pba::Point3D> points3D_;
std::vector<pba::Point2D> measurements_;
std::unordered_set<camera_t> camera_ids_;
std::unordered_set<point3D_t> point3D_ids_;
std::vector<int> camera_idxs_;
std::vector<int> point3D_idxs_;
std::vector<image_t> ordered_image_ids_;
std::vector<point3D_t> ordered_point3D_ids_;
std::unordered_map<image_t, int> image_id_to_camera_idx_;
};
class RigBundleAdjuster : public BundleAdjuster {
public:
struct Options {
// Whether to optimize the relative poses of the camera rigs.
bool refine_relative_poses = true;
// The maximum allowed reprojection error for an observation to be
// considered in the bundle adjustment. Some observations might have large
// reprojection errors due to the concatenation of the absolute and relative
// rig poses, which might be different from the absolute pose of the image
// in the reconstruction.
double max_reproj_error = 1000.0;
};
RigBundleAdjuster(const BundleAdjustmentOptions& options,
const Options& rig_options,
const BundleAdjustmentConfig& config);
bool Solve(Reconstruction* reconstruction,
std::vector<CameraRig>* camera_rigs);
private:
void SetUp(Reconstruction* reconstruction,
std::vector<CameraRig>* camera_rigs,
ceres::LossFunction* loss_function);
void TearDown(Reconstruction* reconstruction,
const std::vector<CameraRig>& camera_rigs);
void AddImageToProblem(const image_t image_id, Reconstruction* reconstruction,
std::vector<CameraRig>* camera_rigs,
ceres::LossFunction* loss_function);
void AddPointToProblem(const point3D_t point3D_id,
Reconstruction* reconstruction,
ceres::LossFunction* loss_function);
void ComputeCameraRigPoses(const Reconstruction& reconstruction,
const std::vector<CameraRig>& camera_rigs);
void ParameterizeCameraRigs(Reconstruction* reconstruction);
const Options rig_options_;
// Mapping from images to camera rigs.
std::unordered_map<image_t, CameraRig*> image_id_to_camera_rig_;
// Mapping from images to the absolute camera rig poses.
std::unordered_map<image_t, Eigen::Vector4d*> image_id_to_rig_qvec_;
std::unordered_map<image_t, Eigen::Vector3d*> image_id_to_rig_tvec_;
// For each camera rig, the absolute camera rig poses.
std::vector<std::vector<Eigen::Vector4d>> camera_rig_qvecs_;
std::vector<std::vector<Eigen::Vector3d>> camera_rig_tvecs_;
// The Quaternions added to the problem, used to set the local
// parameterization once after setting up the problem.
std::unordered_set<double*> parameterized_qvec_data_;
};
void PrintSolverSummary(const ceres::Solver::Summary& summary);
} // namespace colmap
#endif // COLMAP_SRC_OPTIM_BUNDLE_ADJUSTMENT_H_
|