File size: 5,330 Bytes
2b5a2b6 | 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 | // 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_ESTIMATORS_FUNDAMENTAL_MATRIX_H_
#define COLMAP_SRC_ESTIMATORS_FUNDAMENTAL_MATRIX_H_
#include <vector>
#include <Eigen/Core>
#include "estimators/homography_matrix.h"
#include "util/alignment.h"
#include "util/types.h"
namespace colmap {
// Fundamental matrix estimator from corresponding point pairs.
//
// This algorithm solves the 7-Point problem and is based on the following
// paper:
//
// Zhengyou Zhang and T. Kanade, Determining the Epipolar Geometry and its
// Uncertainty: A Review, International Journal of Computer Vision, 1998.
// http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.4540
class FundamentalMatrixSevenPointEstimator {
public:
typedef Eigen::Vector2d X_t;
typedef Eigen::Vector2d Y_t;
typedef Eigen::Matrix3d M_t;
// The minimum number of samples needed to estimate a model.
static const int kMinNumSamples = 7;
// Estimate either 1 or 3 possible fundamental matrix solutions from a set of
// corresponding points.
//
// The number of corresponding points must be exactly 7.
//
// @param points1 First set of corresponding points.
// @param points2 Second set of corresponding points
//
// @return Up to 4 solutions as a vector of 3x3 fundamental matrices.
static std::vector<M_t> Estimate(const std::vector<X_t>& points1,
const std::vector<Y_t>& points2);
// Calculate the residuals of a set of corresponding points and a given
// fundamental matrix.
//
// Residuals are defined as the squared Sampson error.
//
// @param points1 First set of corresponding points as Nx2 matrix.
// @param points2 Second set of corresponding points as Nx2 matrix.
// @param F 3x3 fundamental matrix.
// @param residuals Output vector of residuals.
static void Residuals(const std::vector<X_t>& points1,
const std::vector<Y_t>& points2, const M_t& F,
std::vector<double>* residuals);
};
// Fundamental matrix estimator from corresponding point pairs.
//
// This algorithm solves the 8-Point problem based on the following paper:
//
// Hartley and Zisserman, Multiple View Geometry, algorithm 11.1, page 282.
class FundamentalMatrixEightPointEstimator {
public:
typedef Eigen::Vector2d X_t;
typedef Eigen::Vector2d Y_t;
typedef Eigen::Matrix3d M_t;
// The minimum number of samples needed to estimate a model.
static const int kMinNumSamples = 8;
// Estimate fundamental matrix solutions from a set of corresponding points.
//
// The number of corresponding points must be at least 8.
//
// @param points1 First set of corresponding points.
// @param points2 Second set of corresponding points
//
// @return Single solution as a vector of 3x3 fundamental matrices.
static std::vector<M_t> Estimate(const std::vector<X_t>& points1,
const std::vector<Y_t>& points2);
// Calculate the residuals of a set of corresponding points and a given
// fundamental matrix.
//
// Residuals are defined as the squared Sampson error.
//
// @param points1 First set of corresponding points as Nx2 matrix.
// @param points2 Second set of corresponding points as Nx2 matrix.
// @param F 3x3 fundamental matrix.
// @param residuals Output vector of residuals.
static void Residuals(const std::vector<X_t>& points1,
const std::vector<Y_t>& points2, const M_t& F,
std::vector<double>* residuals);
};
} // namespace colmap
#endif // COLMAP_SRC_ESTIMATORS_FUNDAMENTAL_MATRIX_H_
|