/usr/include/visp/vpMbtKltPolygon.h is in libvisp-dev 2.9.0-3+b2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /****************************************************************************
*
* $Id: vpMbtKltPolygon.h 4661 2014-02-10 19:34:58Z fspindle $
*
* This file is part of the ViSP software.
* Copyright (C) 2005 - 2014 by INRIA. All rights reserved.
*
* This software is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* ("GPL") version 2 as published by the Free Software Foundation.
* See the file LICENSE.txt at the root directory of this source
* distribution for additional information about the GNU GPL.
*
* For using ViSP with software that can not be combined with the GNU
* GPL, please contact INRIA about acquiring a ViSP Professional
* Edition License.
*
* See http://www.irisa.fr/lagadic/visp/visp.html for more information.
*
* This software was developed at:
* INRIA Rennes - Bretagne Atlantique
* Campus Universitaire de Beaulieu
* 35042 Rennes Cedex
* France
* http://www.irisa.fr/lagadic
*
* If you have questions regarding the use of this file, please contact
* INRIA at visp@inria.fr
*
* This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
* WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*
* Description:
* Generic model polygon, containing points of interest.
*
* Authors:
* Romain Tallonneau
* Aurelien Yol
*
*****************************************************************************/
#ifndef vpMbtKltPolygon_h
#define vpMbtKltPolygon_h
#include <visp/vpConfig.h>
#ifdef VISP_HAVE_OPENCV
#include <visp/vpMbtPolygon.h>
#include <visp/vpKltOpencv.h>
#include <visp/vpPlane.h>
#include <visp/vpDisplay.h>
#include <visp/vpGEMM.h>
#include <visp/vpHomography.h>
#include <visp/vpPlot.h>
/*!
\class vpMbtKltPolygon
\brief Implementation of a polygon of the model containing points of interest. It is used by the model-based tracker KLT, and hybrid.
\warning This class is only available if OpenCV is installed, and used.
\ingroup ModelBasedTracking
*/
class VISP_EXPORT vpMbtKltPolygon: public vpMbtPolygon
{
private:
//! the homography in meter
vpMatrix H;
//! normal to the initial plane
vpColVector N;
//! current normal
vpColVector N_cur;
//! inverse of the distance between the plane and the camera at the initial position (speed up computation)
double invd0;
//! cRc0_0n (temporary variable to speed up the computation)
vpColVector cRc0_0n;
//! Initial points and their ID
std::map<int, vpImagePoint> initPoints;
//! Current points and their ID
std::map<int, vpImagePoint> curPoints;
//! Current points indexes and their ID
std::map<int, int> curPointsInd;
//! number of points detected
unsigned int nbPointsCur;
//! initial number of points
unsigned int nbPointsInit;
//! Minimal number of points to be tracked
unsigned int minNbPoint;
//! Boolean to know if there is enough point to be tracked
bool enoughPoints;
//! current camera to plane distance to speed up the computation
double dt;
//! distance between the plane and the camera at the initial position
double d0;
//! Camera parameters
vpCameraParameters cam;
private:
double compute_1_over_Z(const double x, const double y);
void computeP_mu_t(const double x_in, const double y_in, double& x_out, double& y_out, const vpMatrix& cHc0);
bool isTrackedFeature(const int id);
public:
vpMbtKltPolygon();
virtual ~vpMbtKltPolygon();
unsigned int computeNbDetectedCurrent(const vpKltOpencv& _tracker);
void computeHomography(const vpHomogeneousMatrix& _cTc0, vpHomography& cHc0);
void computeInteractionMatrixAndResidu(vpColVector& _R, vpMatrix& _J);
void displayPrimitive(const vpImage<unsigned char>& _I);
void displayPrimitive(const vpImage<vpRGBa>& _I);
/*!
Get the camera parameters of the face.
\return cam : the camera parameters of the face.
*/
inline vpCameraParameters& getCameraParameters(){ return cam; }
inline vpColVector getCurrentNormal() const {return N_cur; }
inline std::map<int, vpImagePoint>& getCurrentPoints() {return curPoints; }
inline std::map<int, int>& getCurrentPointsInd() {return curPointsInd; }
/*!
Get the number of point that was belonging to the face at the initialisation
\return the number of initial point
*/
inline unsigned int getInitialNumberPoint() const { return nbPointsInit;}
/*!
get the number of points detected in the last image.
\warning to have the real number of points, the function computeNbDetectedCurrent
must be called first.
\return the number of points detected in the current image
*/
inline unsigned int getNbPointsCur() const {return nbPointsCur;}
inline bool hasEnoughPoints() const {return enoughPoints;}
void init(const vpKltOpencv& _tracker);
void removeOutliers(const vpColVector& weight, const double &threshold_outlier);
/*!
Set the camera parameters
\param _cam : the new camera parameters
*/
virtual inline void setCameraParameters(const vpCameraParameters& _cam){ cam = _cam; }
void updateMask(IplImage* _mask, unsigned char _nb = 255, unsigned int _shiftBorder = 0);
//###################
// Static Functions
//###################
private:
static bool isInside(const std::vector<vpImagePoint>& roi, const double i, const double j);
static bool intersect(const vpImagePoint& p1, const vpImagePoint& p2, const double i, const double j, const double i_test, const double j_test);
};
#endif
#endif // VISP_HAVE_OPENCV
|