Mercurial Hosting > traffic-intelligence
diff include/Motion.hpp @ 200:0a27fa343257
added one test and cleaned the first and last instant mess
author | Nicolas Saunier <nicolas.saunier@polymtl.ca> |
---|---|
date | Fri, 02 Mar 2012 19:32:54 -0500 |
parents | aeab0b88c9b6 |
children | f7ddfc4aeb1e |
line wrap: on
line diff
--- a/include/Motion.hpp Mon Feb 20 19:32:27 2012 -0500 +++ b/include/Motion.hpp Fri Mar 02 19:32:54 2012 -0500 @@ -16,7 +16,7 @@ before saving. */ class FeatureTrajectory { public: - FeatureTrajectory(const int& frameNum, const cv::Point2f& p, const cv::Mat& homography); + FeatureTrajectory(const unsigned int& frameNum, const cv::Point2f& p, const cv::Mat& homography); FeatureTrajectory(TrajectoryPoint2fPtr& _positions, TrajectoryPoint2fPtr& _velocities); @@ -29,9 +29,6 @@ unsigned int getId(void) const { return positions->getId();} void setId(const unsigned int& id) { positions->setId(id);velocities->setId(id);} - void setLost(void) { lost = true;} - bool isLost(void) { return lost;} - unsigned int getFirstInstant(void) {return firstInstant;} unsigned int getLastInstant(void) {return lastInstant;} @@ -47,7 +44,7 @@ /// computes the distance according to the Beymer et al. algorithm bool minMaxSimilarity(const FeatureTrajectory& ft, const int& firstInstant, const int& lastInstant, const float& connectionDistance, const float& segmentationDistance); - void addPoint(const int& frameNum, const cv::Point2f& p, const cv::Mat& homography); + void addPoint(const unsigned int& frameNum, const cv::Point2f& p, const cv::Mat& homography); void shorten(void); @@ -60,7 +57,6 @@ friend std::stringstream& operator<<(std::stringstream& out, const FeatureTrajectory& ft); protected: - bool lost; /// \todo remove /// first frame number unsigned int firstInstant; /// last frame number