File size: 5,454 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 | // 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)
#include "base/image.h"
#include "base/pose.h"
#include "base/projection.h"
namespace colmap {
namespace {
static const double kNaN = std::numeric_limits<double>::quiet_NaN();
} // namespace
const int Image::kNumPoint3DVisibilityPyramidLevels = 6;
Image::Image()
: image_id_(kInvalidImageId),
name_(""),
camera_id_(kInvalidCameraId),
registered_(false),
num_points3D_(0),
num_observations_(0),
num_correspondences_(0),
num_visible_points3D_(0),
qvec_(1.0, 0.0, 0.0, 0.0),
tvec_(0.0, 0.0, 0.0),
qvec_prior_(kNaN, kNaN, kNaN, kNaN),
tvec_prior_(kNaN, kNaN, kNaN) {}
void Image::SetUp(const class Camera& camera) {
CHECK_EQ(camera_id_, camera.CameraId());
point3D_visibility_pyramid_ = VisibilityPyramid(
kNumPoint3DVisibilityPyramidLevels, camera.Width(), camera.Height());
}
void Image::TearDown() {
point3D_visibility_pyramid_ = VisibilityPyramid(0, 0, 0);
}
void Image::SetPoints2D(const std::vector<Eigen::Vector2d>& points) {
CHECK(points2D_.empty());
points2D_.resize(points.size());
num_correspondences_have_point3D_.resize(points.size(), 0);
for (point2D_t point2D_idx = 0; point2D_idx < points.size(); ++point2D_idx) {
points2D_[point2D_idx].SetXY(points[point2D_idx]);
}
}
void Image::SetPoints2D(const std::vector<class Point2D>& points) {
CHECK(points2D_.empty());
points2D_ = points;
num_correspondences_have_point3D_.resize(points.size(), 0);
}
void Image::SetPoint3DForPoint2D(const point2D_t point2D_idx,
const point3D_t point3D_id) {
CHECK_NE(point3D_id, kInvalidPoint3DId);
class Point2D& point2D = points2D_.at(point2D_idx);
if (!point2D.HasPoint3D()) {
num_points3D_ += 1;
}
point2D.SetPoint3DId(point3D_id);
}
void Image::ResetPoint3DForPoint2D(const point2D_t point2D_idx) {
class Point2D& point2D = points2D_.at(point2D_idx);
if (point2D.HasPoint3D()) {
point2D.SetPoint3DId(kInvalidPoint3DId);
num_points3D_ -= 1;
}
}
bool Image::HasPoint3D(const point3D_t point3D_id) const {
return std::find_if(points2D_.begin(), points2D_.end(),
[point3D_id](const class Point2D& point2D) {
return point2D.Point3DId() == point3D_id;
}) != points2D_.end();
}
void Image::IncrementCorrespondenceHasPoint3D(const point2D_t point2D_idx) {
const class Point2D& point2D = points2D_.at(point2D_idx);
num_correspondences_have_point3D_[point2D_idx] += 1;
if (num_correspondences_have_point3D_[point2D_idx] == 1) {
num_visible_points3D_ += 1;
}
point3D_visibility_pyramid_.SetPoint(point2D.X(), point2D.Y());
assert(num_visible_points3D_ <= num_observations_);
}
void Image::DecrementCorrespondenceHasPoint3D(const point2D_t point2D_idx) {
const class Point2D& point2D = points2D_.at(point2D_idx);
num_correspondences_have_point3D_[point2D_idx] -= 1;
if (num_correspondences_have_point3D_[point2D_idx] == 0) {
num_visible_points3D_ -= 1;
}
point3D_visibility_pyramid_.ResetPoint(point2D.X(), point2D.Y());
assert(num_visible_points3D_ <= num_observations_);
}
void Image::NormalizeQvec() { qvec_ = NormalizeQuaternion(qvec_); }
Eigen::Matrix3x4d Image::ProjectionMatrix() const {
return ComposeProjectionMatrix(qvec_, tvec_);
}
Eigen::Matrix3x4d Image::InverseProjectionMatrix() const {
return InvertProjectionMatrix(ComposeProjectionMatrix(qvec_, tvec_));
}
Eigen::Matrix3d Image::RotationMatrix() const {
return QuaternionToRotationMatrix(qvec_);
}
Eigen::Vector3d Image::ProjectionCenter() const {
return ProjectionCenterFromPose(qvec_, tvec_);
}
Eigen::Vector3d Image::ViewingDirection() const {
return RotationMatrix().row(2);
}
} // namespace colmap
|