← Back to branch summary

~ubuntu-branches/ubuntu/trusty/blender/trusty-proposed

« back to all changes in this revision

Viewing changes to extern/libmv/libmv/multiview/euclidean_resection.h

  • Committer: Package Import Robot
  • Author(s): Matteo F. Vescovi
  • Date: 2013-08-14 10:43:49 UTC
  • mfrom: (14.2.19 sid)
  • Revision ID: package-import@ubuntu.com-20130814104349-t1d5mtwkphp12dyj
Tags: 2.68a-3
* Upload to unstable
* debian/: python3.3 Depends simplified
  - debian/control: python3.3 Depends dropped
    for blender-data package
  - 0001-blender_thumbnailer.patch refreshed
* debian/control: libavcodec b-dep versioning dropped

Show diffs side-by-side

added added

removed removed

Lines of Context:
extern/libmv/libmv/multiview/euclidean_resection.h
26
26
 
27
27
namespace libmv {
28
28
namespace euclidean_resection {
29
 
  
 
29
 
30
30
enum ResectionMethod {
31
31
  RESECTION_ANSAR_DANIILIDIS,
32
32
 
48
48
 * \param success_threshold  Threshold of an error which is still considered a success
49
49
 *                           (currently used by EPnP algorithm only)
50
50
 */
51
 
bool EuclideanResection(const Mat2X &x_camera, 
 
51
bool EuclideanResection(const Mat2X &x_camera,
52
52
                        const Mat3X &X_world,
53
53
                        Mat3 *R, Vec3 *t,
54
54
                        ResectionMethod method = RESECTION_EPNP,
67
67
 * \param t         Solution for the camera translation vector
68
68
 * \param method    Resection method
69
69
 */
70
 
bool EuclideanResection(const Mat &x_image, 
 
70
bool EuclideanResection(const Mat &x_image,
71
71
                        const Mat3X &X_world,
72
72
                        const Mat3 &K,
73
73
                        Mat3 *R, Vec3 *t,
101
101
 * This is the algorithm described in: "Linear Pose Estimation from Points or
102
102
 * Lines", by Ansar, A. and Daniilidis, PAMI 2003. vol. 25, no. 5.
103
103
 */
104
 
void EuclideanResectionAnsarDaniilidis(const Mat2X &x_camera, 
 
104
void EuclideanResectionAnsarDaniilidis(const Mat2X &x_camera,
105
105
                                       const Mat3X &X_world,
106
106
                                       Mat3 *R, Vec3 *t);
107
107
/**
121
121
 * \note: the non-linear optimization is not implemented here.
122
122
 */
123
123
bool EuclideanResectionEPnP(const Mat2X &x_camera,
124
 
                            const Mat3X &X_world, 
 
124
                            const Mat3X &X_world,
125
125
                            Mat3 *R, Vec3 *t,
126
126
                            double success_threshold = 1e-3);
127
127
 
128
 
} // namespace euclidean_resection
129
 
} // namespace libmv
 
128
}  // namespace euclidean_resection
 
129
}  // namespace libmv
130
130
 
131
131
 
132
132
#endif /* LIBMV_MULTIVIEW_EUCLIDEAN_RESECTION_H_ */