OpenGV
A library for solving calibrated central and non-central geometric vision problems
EigensolverSacProblem.hpp
Go to the documentation of this file.
1 /******************************************************************************
2  * Author: Laurent Kneip *
3  * Contact: kneip.laurent@gmail.com *
4  * License: Copyright (c) 2013 Laurent Kneip, ANU. All rights reserved. *
5  * *
6  * Redistribution and use in source and binary forms, with or without *
7  * modification, are permitted provided that the following conditions *
8  * are met: *
9  * * Redistributions of source code must retain the above copyright *
10  * notice, this list of conditions and the following disclaimer. *
11  * * Redistributions in binary form must reproduce the above copyright *
12  * notice, this list of conditions and the following disclaimer in the *
13  * documentation and/or other materials provided with the distribution. *
14  * * Neither the name of ANU nor the names of its contributors may be *
15  * used to endorse or promote products derived from this software without *
16  * specific prior written permission. *
17  * *
18  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"*
19  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE *
20  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE *
21  * ARE DISCLAIMED. IN NO EVENT SHALL ANU OR THE CONTRIBUTORS BE LIABLE *
22  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL *
23  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR *
24  * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER *
25  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT *
26  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY *
27  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF *
28  * SUCH DAMAGE. *
29  ******************************************************************************/
30 
38 #ifndef OPENGV_SAC_PROBLEMS_RELATIVE_POSE_EIGENSOLVERSACPROBLEM_HPP_
39 #define OPENGV_SAC_PROBLEMS_RELATIVE_POSE_EIGENSOLVERSACPROBLEM_HPP_
40 
42 #include <opengv/types.hpp>
44 
48 namespace opengv
49 {
53 namespace sac_problems
54 {
58 namespace relative_pose
59 {
60 
67  public sac::SampleConsensusProblem<eigensolverOutput_t>
68 {
69 public:
74 
82  EigensolverSacProblem(adapter_t & adapter, size_t sampleSize,
83  bool randomSeed = true) :
84  sac::SampleConsensusProblem<model_t> (randomSeed),
85  _adapter(adapter),
86  _sampleSize(sampleSize)
87  {
89  };
90 
101  adapter_t & adapter,
102  size_t sampleSize,
103  const std::vector<int> & indices,
104  bool randomSeed = true) :
105  sac::SampleConsensusProblem<model_t> (randomSeed),
106  _adapter(adapter),
107  _sampleSize(sampleSize)
108  {
109  setIndices(indices);
110  };
111 
116 
120  virtual bool computeModelCoefficients(
121  const std::vector<int> &indices,
122  model_t & outModel) const;
123 
127  virtual void getSelectedDistancesToModel(
128  const model_t & model,
129  const std::vector<int> & indices,
130  std::vector<double> & scores) const;
131 
135  virtual void optimizeModelCoefficients(
136  const std::vector<int> & inliers,
137  const model_t & model,
138  model_t & optimized_model);
139 
143  virtual int getSampleSize() const;
144 
145 protected:
147  adapter_t & _adapter;
149  size_t _sampleSize;
150 };
151 
152 }
153 }
154 }
155 
156 #endif //#ifndef OPENGV_SAC_PROBLEMS_RELATIVE_POSE_EIGENSOLVERSACPROBLEM_HPP_
opengv::relative_pose::RelativeAdapterBase adapter_t
Definition: EigensolverSacProblem.hpp:73
virtual void getSelectedDistancesToModel(const model_t &model, const std::vector< int > &indices, std::vector< double > &scores) const
See parent-class.
The namespace of this library.
Definition: AbsoluteAdapterBase.hpp:47
eigensolverOutput_t model_t
Definition: EigensolverSacProblem.hpp:71
virtual void optimizeModelCoefficients(const std::vector< int > &inliers, const model_t &model, model_t &optimized_model)
See parent-class.
Adapter-class for passing bearing-vector correspondences to the relative-pose algorithms.
void setIndices(const std::vector< int > &indices)
Set the indices_ variable (see member-description).
SampleConsensusProblem(bool randomSeed=true)
Contructor.
Basis-class for Sample-consensus problems. Contains declarations for the three basic functions of a s...
adapter_t & _adapter
Definition: EigensolverSacProblem.hpp:147
A collection of variables used in geometric vision for the computation of calibrated absolute and rel...
size_t _sampleSize
Definition: EigensolverSacProblem.hpp:149
EigensolverSacProblem(adapter_t &adapter, size_t sampleSize, const std::vector< int > &indices, bool randomSeed=true)
Constructor.
Definition: EigensolverSacProblem.hpp:100
Definition: types.hpp:144
Definition: SampleConsensusProblem.hpp:67
Definition: EigensolverSacProblem.hpp:66
Definition: RelativeAdapterBase.hpp:63
virtual ~EigensolverSacProblem()
Definition: EigensolverSacProblem.hpp:115
EigensolverSacProblem(adapter_t &adapter, size_t sampleSize, bool randomSeed=true)
Constructor.
Definition: EigensolverSacProblem.hpp:82
virtual int getSampleSize() const
See parent-class.
void setUniformIndices(int N)
Use this method if you want to use all samples.
virtual size_t getNumberCorrespondences() const =0
Retrieve the number of correspondences.
virtual bool computeModelCoefficients(const std::vector< int > &indices, model_t &outModel) const
See parent-class.