2019-09-21 18:04:48 +00:00
|
|
|
// Copyright 2019, Collabora, Ltd.
|
|
|
|
// SPDX-License-Identifier: BSL-1.0
|
|
|
|
/*!
|
|
|
|
* @file
|
|
|
|
* @brief PS Move tracker code.
|
2019-09-26 11:33:57 +00:00
|
|
|
* @author Pete Black <pblack@collabora.com>
|
2019-09-21 18:04:48 +00:00
|
|
|
* @author Jakob Bornecrantz <jakob@collabora.com>
|
2019-10-10 16:29:48 +00:00
|
|
|
* @ingroup aux_tracking
|
2019-09-21 18:04:48 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "xrt/xrt_tracking.h"
|
|
|
|
|
|
|
|
#include "tracking/t_tracking.h"
|
2019-09-26 11:33:57 +00:00
|
|
|
#include "tracking/t_calibration_opencv.h"
|
2019-10-10 16:29:48 +00:00
|
|
|
#include "tracking/t_fusion.h"
|
2019-10-10 16:22:14 +00:00
|
|
|
#include "tracking/t_imu_fusion.h"
|
2019-09-21 18:04:48 +00:00
|
|
|
|
2019-09-28 16:41:20 +00:00
|
|
|
#include "util/u_var.h"
|
2019-09-21 18:04:48 +00:00
|
|
|
#include "util/u_misc.h"
|
|
|
|
#include "util/u_debug.h"
|
|
|
|
#include "util/u_frame.h"
|
|
|
|
#include "util/u_format.h"
|
|
|
|
|
|
|
|
#include "math/m_api.h"
|
2019-10-01 22:08:36 +00:00
|
|
|
#include "math/m_eigen_interop.h"
|
2019-09-21 18:04:48 +00:00
|
|
|
|
|
|
|
#include "os/os_threading.h"
|
|
|
|
|
2019-10-10 16:29:48 +00:00
|
|
|
|
|
|
|
#include "flexkalman/AbsoluteOrientationMeasurement.h"
|
|
|
|
#include "flexkalman/FlexibleKalmanFilter.h"
|
|
|
|
#include "flexkalman/FlexibleUnscentedCorrect.h"
|
|
|
|
#include "flexkalman/PoseSeparatelyDampedConstantVelocity.h"
|
|
|
|
#include "flexkalman/PoseState.h"
|
|
|
|
|
2019-09-21 18:04:48 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <assert.h>
|
|
|
|
#include <pthread.h>
|
|
|
|
|
2019-10-10 16:29:48 +00:00
|
|
|
using State = flexkalman::pose_externalized_rotation::State;
|
|
|
|
using ProcessModel =
|
|
|
|
flexkalman::PoseSeparatelyDampedConstantVelocityProcessModel;
|
2019-09-21 18:04:48 +00:00
|
|
|
|
2019-09-28 16:41:20 +00:00
|
|
|
/*!
|
|
|
|
* Single camera.
|
|
|
|
*/
|
|
|
|
struct View
|
|
|
|
{
|
|
|
|
cv::Mat undistort_map_x;
|
|
|
|
cv::Mat undistort_map_y;
|
|
|
|
cv::Mat rectify_map_x;
|
|
|
|
cv::Mat rectify_map_y;
|
|
|
|
|
|
|
|
std::vector<cv::KeyPoint> keypoints;
|
|
|
|
|
|
|
|
cv::Mat frame_undist;
|
|
|
|
cv::Mat frame_rectified;
|
|
|
|
};
|
|
|
|
|
2019-10-10 16:29:48 +00:00
|
|
|
struct TrackerPSMV
|
2019-09-21 18:04:48 +00:00
|
|
|
{
|
2019-10-10 16:29:48 +00:00
|
|
|
EIGEN_MAKE_ALIGNED_OPERATOR_NEW
|
2019-09-21 18:04:48 +00:00
|
|
|
struct xrt_tracked_psmv base = {};
|
|
|
|
struct xrt_frame_sink sink = {};
|
|
|
|
struct xrt_frame_node node = {};
|
|
|
|
|
|
|
|
//! Frame waiting to be processed.
|
|
|
|
struct xrt_frame *frame;
|
|
|
|
|
|
|
|
//! Thread and lock helper.
|
|
|
|
struct os_thread_helper oth;
|
|
|
|
|
2019-09-28 16:41:20 +00:00
|
|
|
struct
|
|
|
|
{
|
|
|
|
struct xrt_frame_sink *sink;
|
|
|
|
struct xrt_frame *frame;
|
|
|
|
|
|
|
|
cv::Mat rgb[2];
|
|
|
|
} debug;
|
|
|
|
|
2019-09-21 18:04:48 +00:00
|
|
|
//! Have we received a new IMU sample.
|
|
|
|
bool has_imu = false;
|
|
|
|
|
|
|
|
struct
|
|
|
|
{
|
|
|
|
struct xrt_vec3 pos = {};
|
|
|
|
struct xrt_quat rot = {};
|
|
|
|
} fusion;
|
2019-09-26 11:33:57 +00:00
|
|
|
|
2019-09-28 16:41:20 +00:00
|
|
|
View view[2];
|
2019-09-26 11:33:57 +00:00
|
|
|
|
|
|
|
bool calibrated;
|
|
|
|
|
2019-09-28 16:41:20 +00:00
|
|
|
cv::Mat disparity_to_depth;
|
|
|
|
|
2019-09-26 11:33:57 +00:00
|
|
|
cv::Ptr<cv::SimpleBlobDetector> sbd;
|
|
|
|
|
2019-10-10 16:29:48 +00:00
|
|
|
State filter_state;
|
|
|
|
ProcessModel process_model;
|
|
|
|
|
2019-10-10 16:22:14 +00:00
|
|
|
xrt_fusion::SimpleIMUFusion imu;
|
|
|
|
|
2019-09-26 11:33:57 +00:00
|
|
|
xrt_vec3 tracked_object_position;
|
2019-09-21 18:04:48 +00:00
|
|
|
};
|
|
|
|
|
2019-09-28 16:41:20 +00:00
|
|
|
static void
|
|
|
|
refresh_gui_frame(TrackerPSMV &t, struct xrt_frame *xf)
|
|
|
|
{
|
|
|
|
if (t.debug.sink == NULL) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Also dereferences the old frame.
|
|
|
|
u_frame_create_one_off(XRT_FORMAT_R8G8B8, xf->width, xf->height,
|
|
|
|
&t.debug.frame);
|
|
|
|
t.debug.frame->source_sequence = xf->source_sequence;
|
|
|
|
|
|
|
|
int rows = xf->height;
|
|
|
|
int cols = xf->width / 2;
|
|
|
|
|
|
|
|
t.debug.rgb[0] = cv::Mat(rows, // rows
|
|
|
|
cols, // cols
|
|
|
|
CV_8UC3, // channels
|
|
|
|
t.debug.frame->data, // data
|
|
|
|
t.debug.frame->stride); // stride
|
|
|
|
|
|
|
|
t.debug.rgb[1] = cv::Mat(rows, // rows
|
|
|
|
cols, // cols
|
|
|
|
CV_8UC3, // channels
|
|
|
|
t.debug.frame->data + 3 * cols, // data
|
|
|
|
t.debug.frame->stride); // stride
|
|
|
|
}
|
|
|
|
|
2019-10-12 02:22:26 +00:00
|
|
|
|
|
|
|
/*!
|
|
|
|
* @brief Perform per-view (two in a stereo camera image) processing on an
|
|
|
|
* image, before tracking math is performed.
|
|
|
|
*
|
|
|
|
* Right now, this is mainly finding blobs/keypoints.
|
|
|
|
*/
|
2019-09-28 16:41:20 +00:00
|
|
|
static void
|
|
|
|
do_view(TrackerPSMV &t, View &view, cv::Mat &grey, cv::Mat &rgb)
|
|
|
|
{
|
|
|
|
// Undistort the whole image.
|
|
|
|
cv::remap(grey, // src
|
|
|
|
view.frame_undist, // dst
|
|
|
|
view.undistort_map_x, // map1
|
|
|
|
view.undistort_map_y, // map2
|
|
|
|
cv::INTER_LINEAR, // interpolation
|
|
|
|
cv::BORDER_CONSTANT, // borderMode
|
|
|
|
cv::Scalar(0, 0, 0)); // borderValue
|
|
|
|
|
|
|
|
// Rectify the whole image.
|
|
|
|
cv::remap(view.frame_undist, // src
|
|
|
|
view.frame_rectified, // dst
|
|
|
|
view.rectify_map_x, // map1
|
|
|
|
view.rectify_map_y, // map2
|
|
|
|
cv::INTER_LINEAR, // interpolation
|
|
|
|
cv::BORDER_CONSTANT, // borderMode
|
|
|
|
cv::Scalar(0, 0, 0)); // borderValue
|
|
|
|
|
|
|
|
cv::threshold(view.frame_rectified, // src
|
|
|
|
view.frame_rectified, // dst
|
|
|
|
32.0, // thresh
|
|
|
|
255.0, // maxval
|
|
|
|
0); // type
|
|
|
|
|
|
|
|
// tracker_measurement_t m = {};
|
|
|
|
|
|
|
|
// Do blob detection with our masks.
|
|
|
|
//! @todo Re-enable masks.
|
|
|
|
t.sbd->detect(view.frame_rectified, // image
|
|
|
|
view.keypoints, // keypoints
|
|
|
|
cv::noArray()); // mask
|
|
|
|
|
|
|
|
|
|
|
|
// Debug is wanted, draw the keypoints.
|
|
|
|
if (rgb.cols > 0) {
|
|
|
|
cv::drawKeypoints(
|
|
|
|
view.frame_rectified, // image
|
|
|
|
view.keypoints, // keypoints
|
|
|
|
rgb, // outImage
|
|
|
|
cv::Scalar(255, 0, 0), // color
|
|
|
|
cv::DrawMatchesFlags::DRAW_RICH_KEYPOINTS); // flags
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-10-12 02:22:26 +00:00
|
|
|
/*!
|
|
|
|
* @brief Helper struct that keeps the value that produces the lowest "score" as
|
|
|
|
* computed by your functor.
|
|
|
|
*
|
|
|
|
* Having this as a struct with a method, instead of a single "algorithm"-style
|
|
|
|
* function, allows you to keep your complicated filtering logic in your own
|
|
|
|
* loop, just calling in when you have a new candidate for "best".
|
|
|
|
*
|
|
|
|
* @note Create by calling make_lowest_score_finder() with your
|
|
|
|
* function/lambda that takes an element and returns the score, to deduce the
|
|
|
|
* un-spellable typename of the lambda.
|
|
|
|
*
|
|
|
|
* @tparam ValueType The type of a single element value - whatever you want to
|
|
|
|
* assign a score to.
|
|
|
|
* @tparam FunctionType The type of your functor/lambda that turns a ValueType
|
|
|
|
* into a float "score". Usually deduced.
|
|
|
|
*/
|
|
|
|
template <typename ValueType, typename FunctionType> struct FindLowestScore
|
2019-10-01 22:33:48 +00:00
|
|
|
{
|
2019-10-10 16:31:57 +00:00
|
|
|
const FunctionType score_functor;
|
2019-10-01 22:33:48 +00:00
|
|
|
bool got_one{false};
|
2019-10-10 16:31:57 +00:00
|
|
|
ValueType best{};
|
2019-10-12 02:22:26 +00:00
|
|
|
float best_score{0};
|
2019-10-01 22:33:48 +00:00
|
|
|
|
|
|
|
void
|
2019-10-10 16:31:57 +00:00
|
|
|
handle_candidate(ValueType val)
|
2019-10-01 22:33:48 +00:00
|
|
|
{
|
2019-10-12 02:22:26 +00:00
|
|
|
float score = score_functor(val);
|
2019-10-01 22:57:29 +00:00
|
|
|
if (!got_one || score < best_score) {
|
|
|
|
best = val;
|
|
|
|
best_score = score;
|
2019-10-01 22:33:48 +00:00
|
|
|
got_one = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2019-10-01 22:57:29 +00:00
|
|
|
|
|
|
|
//! Factory function for FindLowestScore to deduce the functor type.
|
2019-10-10 16:31:57 +00:00
|
|
|
template <typename ValueType, typename FunctionType>
|
2019-10-12 02:22:26 +00:00
|
|
|
static FindLowestScore<ValueType, FunctionType>
|
|
|
|
make_lowest_score_finder(FunctionType scoreFunctor)
|
2019-10-01 22:57:29 +00:00
|
|
|
{
|
2019-10-12 02:22:26 +00:00
|
|
|
return FindLowestScore<ValueType, FunctionType>{scoreFunctor};
|
2019-10-01 22:57:29 +00:00
|
|
|
}
|
|
|
|
|
2019-10-01 22:33:48 +00:00
|
|
|
//! Convert our 2d point + disparities into 3d points.
|
|
|
|
static cv::Point3f
|
|
|
|
world_point_from_blobs(cv::Point2f left,
|
|
|
|
cv::Point2f right,
|
|
|
|
const cv::Matx44d &disparity_to_depth)
|
|
|
|
{
|
|
|
|
float disp = right.x - left.x;
|
|
|
|
cv::Vec4d xydw(left.x, left.y, disp, 1.0f);
|
|
|
|
// Transform
|
|
|
|
cv::Vec4d h_world = disparity_to_depth * xydw;
|
|
|
|
|
|
|
|
// Divide by scale to get 3D vector from homogeneous
|
|
|
|
// coordinate. invert x while we are here.
|
|
|
|
cv::Point3f world_point(-h_world[0] / h_world[3],
|
|
|
|
h_world[1] / h_world[3],
|
|
|
|
h_world[2] / h_world[3]);
|
|
|
|
|
|
|
|
return world_point;
|
|
|
|
}
|
2019-10-12 02:22:26 +00:00
|
|
|
/*!
|
|
|
|
* @brief Perform tracking computations on a frame of video data.
|
|
|
|
*/
|
2019-09-21 18:04:48 +00:00
|
|
|
static void
|
2019-10-01 17:21:08 +00:00
|
|
|
process(TrackerPSMV &t, struct xrt_frame *xf)
|
2019-09-21 18:04:48 +00:00
|
|
|
{
|
2019-10-12 02:22:26 +00:00
|
|
|
// Only IMU data: nothing to do
|
2019-09-21 18:04:48 +00:00
|
|
|
if (xf == NULL) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2019-10-12 02:22:26 +00:00
|
|
|
// Wrong type of frame: unreference and return?
|
2019-09-28 16:41:20 +00:00
|
|
|
if (xf->format != XRT_FORMAT_L8) {
|
|
|
|
xrt_frame_reference(&xf, NULL);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2019-09-26 11:33:57 +00:00
|
|
|
if (!t.calibrated) {
|
2019-09-28 16:41:20 +00:00
|
|
|
bool ok = calibration_get_stereo(
|
|
|
|
"PS4_EYE", // name
|
|
|
|
xf->width, // width
|
|
|
|
xf->height, // height
|
|
|
|
false, // use_fisheye
|
|
|
|
&t.view[0].undistort_map_x, // l_undistort_map_x
|
|
|
|
&t.view[0].undistort_map_y, // l_undistort_map_y
|
|
|
|
&t.view[0].rectify_map_x, // l_rectify_map_x
|
|
|
|
&t.view[0].rectify_map_y, // l_rectify_map_y
|
|
|
|
&t.view[1].undistort_map_x, // r_undistort_map_x
|
|
|
|
&t.view[1].undistort_map_y, // r_undistort_map_y
|
|
|
|
&t.view[1].rectify_map_x, // r_rectify_map_x
|
|
|
|
&t.view[1].rectify_map_y, // r_rectify_map_y
|
|
|
|
&t.disparity_to_depth); // disparity_to_depth
|
|
|
|
|
|
|
|
if (ok) {
|
2019-09-26 11:33:57 +00:00
|
|
|
printf("loaded calibration for camera!\n");
|
|
|
|
t.calibrated = true;
|
2019-09-28 16:41:20 +00:00
|
|
|
} else {
|
|
|
|
xrt_frame_reference(&xf, NULL);
|
|
|
|
return;
|
2019-09-26 11:33:57 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-09-28 16:41:20 +00:00
|
|
|
// Create the debug frame if needed.
|
|
|
|
refresh_gui_frame(t, xf);
|
2019-09-26 11:33:57 +00:00
|
|
|
|
2019-09-28 16:41:20 +00:00
|
|
|
t.view[0].keypoints.clear();
|
|
|
|
t.view[1].keypoints.clear();
|
2019-09-26 11:33:57 +00:00
|
|
|
|
2019-09-28 16:41:20 +00:00
|
|
|
int cols = xf->width / 2;
|
|
|
|
int rows = xf->height;
|
|
|
|
int stride = xf->stride;
|
2019-09-26 11:33:57 +00:00
|
|
|
|
2019-09-28 16:41:20 +00:00
|
|
|
cv::Mat l_grey(rows, cols, CV_8UC1, xf->data, stride);
|
|
|
|
cv::Mat r_grey(rows, cols, CV_8UC1, xf->data + cols, stride);
|
2019-09-26 11:33:57 +00:00
|
|
|
|
2019-09-28 16:41:20 +00:00
|
|
|
do_view(t, t.view[0], l_grey, t.debug.rgb[0]);
|
|
|
|
do_view(t, t.view[1], r_grey, t.debug.rgb[1]);
|
2019-09-26 11:33:57 +00:00
|
|
|
|
2019-10-01 22:57:29 +00:00
|
|
|
cv::Point3f last_point(t.tracked_object_position.x,
|
|
|
|
t.tracked_object_position.y,
|
|
|
|
t.tracked_object_position.z);
|
2019-10-12 02:22:26 +00:00
|
|
|
auto nearest_world =
|
|
|
|
make_lowest_score_finder<cv::Point3f>([&](cv::Point3f world_point) {
|
2019-10-01 22:57:29 +00:00
|
|
|
//! @todo don't really need the square root to be done here.
|
|
|
|
return cv::norm(world_point - last_point);
|
|
|
|
});
|
2019-09-28 16:41:20 +00:00
|
|
|
// do some basic matching to come up with likely disparity-pairs.
|
2019-10-01 22:57:29 +00:00
|
|
|
|
2019-10-01 22:33:48 +00:00
|
|
|
const cv::Matx44d disparity_to_depth =
|
|
|
|
static_cast<cv::Matx44d>(t.disparity_to_depth);
|
2019-10-01 22:57:29 +00:00
|
|
|
|
|
|
|
for (const cv::KeyPoint &l_keypoint : t.view[0].keypoints) {
|
|
|
|
cv::Point2f l_blob = l_keypoint.pt;
|
|
|
|
|
2019-10-12 02:22:26 +00:00
|
|
|
auto nearest_blob = make_lowest_score_finder<cv::Point2f>(
|
2019-10-01 22:57:29 +00:00
|
|
|
[&](cv::Point2f r_blob) { return l_blob.x - r_blob.x; });
|
|
|
|
|
|
|
|
for (const cv::KeyPoint &r_keypoint : t.view[1].keypoints) {
|
|
|
|
cv::Point2f r_blob = r_keypoint.pt;
|
2019-09-26 11:33:57 +00:00
|
|
|
// find closest point on same-ish scanline
|
2019-10-01 22:33:48 +00:00
|
|
|
if ((l_blob.y < r_blob.y + 3) &&
|
2019-10-01 22:57:29 +00:00
|
|
|
(l_blob.y > r_blob.y - 3)) {
|
|
|
|
nearest_blob.handle_candidate(r_blob);
|
2019-09-26 11:33:57 +00:00
|
|
|
}
|
|
|
|
}
|
2019-10-01 22:57:29 +00:00
|
|
|
//! @todo do we need to avoid claiming the same counterpart
|
|
|
|
//! several times?
|
|
|
|
if (nearest_blob.got_one) {
|
2019-10-01 22:33:48 +00:00
|
|
|
cv::Point3f pt = world_point_from_blobs(
|
2019-10-01 22:57:29 +00:00
|
|
|
l_blob, nearest_blob.best, disparity_to_depth);
|
|
|
|
nearest_world.handle_candidate(pt);
|
2019-09-26 11:33:57 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-10-01 22:33:48 +00:00
|
|
|
if (nearest_world.got_one) {
|
2019-10-01 22:57:29 +00:00
|
|
|
cv::Point3f world_point = nearest_world.best;
|
2019-09-26 11:33:57 +00:00
|
|
|
// update internal state
|
|
|
|
|
2019-10-01 22:08:36 +00:00
|
|
|
map_vec3(t.tracked_object_position) =
|
2019-10-01 22:33:48 +00:00
|
|
|
Eigen::Map<Eigen::Vector3f>(&world_point.x);
|
2019-09-26 11:33:57 +00:00
|
|
|
}
|
|
|
|
|
2019-09-28 16:41:20 +00:00
|
|
|
if (t.debug.frame != NULL) {
|
|
|
|
t.debug.sink->push_frame(t.debug.sink, t.debug.frame);
|
|
|
|
t.debug.rgb[0] = cv::Mat();
|
|
|
|
t.debug.rgb[1] = cv::Mat();
|
|
|
|
}
|
|
|
|
|
2019-09-21 18:04:48 +00:00
|
|
|
xrt_frame_reference(&xf, NULL);
|
2019-09-28 16:41:20 +00:00
|
|
|
xrt_frame_reference(&t.debug.frame, NULL);
|
2019-10-10 16:29:48 +00:00
|
|
|
bool corrected = false;
|
|
|
|
if (nearest_world.got_one) {
|
2019-10-10 22:47:29 +00:00
|
|
|
Eigen::Vector3f position = map_vec3(t.tracked_object_position);
|
2019-10-10 16:29:48 +00:00
|
|
|
|
|
|
|
auto measurement =
|
|
|
|
xrt_fusion::AbsolutePositionLeverArmMeasurement{
|
|
|
|
position.cast<double>(),
|
|
|
|
//! @todo something less arbitrary for the lever arm?
|
|
|
|
//! This puts the origin approximately under the PS
|
|
|
|
//! button.
|
|
|
|
Eigen::Vector3d(0., 0.09, 0.),
|
|
|
|
//! @todo this should depend on distance
|
|
|
|
// Weirdly, this is where *not* applying the
|
|
|
|
// disparity-to-distance/rectification/etc would
|
|
|
|
// simplify things, since the measurement variance is
|
|
|
|
// related to the image sensor. 1.e-4 means 1cm std dev.
|
|
|
|
// Not sure how to estimate the depth variance without
|
|
|
|
// some research.
|
|
|
|
Eigen::Vector3d(1.e-4, 1.e-4, 4.e-4)};
|
|
|
|
|
|
|
|
//! @todo predict and use actual dt - right now only IMU updates
|
|
|
|
//! this time.
|
|
|
|
// flexkalman::predict(t.filter_state, t.process_model, 1.0
|
|
|
|
// / 60.);
|
|
|
|
if (flexkalman::correctUnscented(t.filter_state, measurement)) {
|
|
|
|
corrected = true;
|
|
|
|
} else {
|
|
|
|
fprintf(stderr,
|
|
|
|
"Got non-finite something when filtering "
|
|
|
|
"tracker!\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!corrected) {
|
|
|
|
// We don't have anything to correct with, so we must manually
|
|
|
|
// run post-correct.
|
|
|
|
t.filter_state.postCorrect();
|
|
|
|
}
|
2019-09-21 18:04:48 +00:00
|
|
|
}
|
|
|
|
|
2019-10-12 02:22:26 +00:00
|
|
|
/*!
|
|
|
|
* @brief Tracker processing thread function
|
|
|
|
*/
|
2019-09-21 18:04:48 +00:00
|
|
|
static void
|
|
|
|
run(TrackerPSMV &t)
|
|
|
|
{
|
|
|
|
struct xrt_frame *frame = NULL;
|
|
|
|
|
|
|
|
os_thread_helper_lock(&t.oth);
|
|
|
|
|
|
|
|
while (os_thread_helper_is_running_locked(&t.oth)) {
|
|
|
|
// No data
|
|
|
|
if (!t.has_imu || t.frame == NULL) {
|
|
|
|
os_thread_helper_wait_locked(&t.oth);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!os_thread_helper_is_running_locked(&t.oth)) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Take a reference on the current frame, this keeps it alive
|
|
|
|
// if it is replaced during the consumer processing it, but
|
|
|
|
// we no longer need to hold onto the frame on the queue we
|
|
|
|
// just move the pointer.
|
|
|
|
frame = t.frame;
|
|
|
|
t.frame = NULL;
|
|
|
|
|
|
|
|
// Unlock the mutex when we do the work.
|
|
|
|
os_thread_helper_unlock(&t.oth);
|
|
|
|
|
2019-10-01 17:21:08 +00:00
|
|
|
process(t, frame);
|
2019-09-21 18:04:48 +00:00
|
|
|
|
|
|
|
// Have to lock it again.
|
|
|
|
os_thread_helper_lock(&t.oth);
|
|
|
|
}
|
|
|
|
|
|
|
|
os_thread_helper_unlock(&t.oth);
|
|
|
|
}
|
|
|
|
|
2019-10-12 02:22:26 +00:00
|
|
|
/*!
|
|
|
|
* @brief Retrieves a pose from the filter.
|
|
|
|
*/
|
2019-09-21 18:04:48 +00:00
|
|
|
static void
|
|
|
|
get_pose(TrackerPSMV &t,
|
2019-10-11 14:38:40 +00:00
|
|
|
enum xrt_input_name name,
|
2019-09-21 18:04:48 +00:00
|
|
|
struct time_state *timestate,
|
|
|
|
timepoint_ns when_ns,
|
|
|
|
struct xrt_space_relation *out_relation)
|
|
|
|
{
|
|
|
|
os_thread_helper_lock(&t.oth);
|
|
|
|
|
|
|
|
// Don't do anything if we have stopped.
|
|
|
|
if (!os_thread_helper_is_running_locked(&t.oth)) {
|
|
|
|
os_thread_helper_unlock(&t.oth);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2019-10-11 14:38:40 +00:00
|
|
|
if (name == XRT_INPUT_PSMV_BALL_CENTER_POSE) {
|
|
|
|
out_relation->pose.position = t.tracked_object_position;
|
|
|
|
out_relation->pose.orientation.x = 0.0f;
|
|
|
|
out_relation->pose.orientation.y = 0.0f;
|
|
|
|
out_relation->pose.orientation.z = 0.0f;
|
|
|
|
out_relation->pose.orientation.w = 1.0f;
|
|
|
|
|
|
|
|
out_relation->relation_flags = (enum xrt_space_relation_flags)(
|
|
|
|
XRT_SPACE_RELATION_POSITION_VALID_BIT |
|
|
|
|
XRT_SPACE_RELATION_POSITION_TRACKED_BIT);
|
|
|
|
|
|
|
|
os_thread_helper_unlock(&t.oth);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2019-10-10 16:29:48 +00:00
|
|
|
auto predicted_state =
|
|
|
|
flexkalman::getPrediction(t.filter_state, t.process_model,
|
|
|
|
/*! @todo compute dt here */ 0.024);
|
2019-09-26 11:33:57 +00:00
|
|
|
// out_relation->pose.position = t.fusion.pos;
|
2019-10-10 16:29:48 +00:00
|
|
|
map_vec3(out_relation->pose.position) =
|
|
|
|
predicted_state.position().cast<float>();
|
|
|
|
map_quat(out_relation->pose.orientation) =
|
|
|
|
predicted_state.getQuaternion().cast<float>();
|
2019-09-21 18:04:48 +00:00
|
|
|
|
|
|
|
//! @todo assuming that orientation is actually currently tracked.
|
|
|
|
out_relation->relation_flags = (enum xrt_space_relation_flags)(
|
|
|
|
XRT_SPACE_RELATION_POSITION_VALID_BIT |
|
|
|
|
XRT_SPACE_RELATION_POSITION_TRACKED_BIT |
|
|
|
|
XRT_SPACE_RELATION_ORIENTATION_VALID_BIT |
|
|
|
|
XRT_SPACE_RELATION_ORIENTATION_TRACKED_BIT);
|
|
|
|
|
|
|
|
os_thread_helper_unlock(&t.oth);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
imu_data(TrackerPSMV &t,
|
|
|
|
time_duration_ns delta_ns,
|
|
|
|
struct xrt_tracking_sample *sample)
|
|
|
|
{
|
|
|
|
os_thread_helper_lock(&t.oth);
|
|
|
|
|
|
|
|
// Don't do anything if we have stopped.
|
|
|
|
if (!os_thread_helper_is_running_locked(&t.oth)) {
|
|
|
|
os_thread_helper_unlock(&t.oth);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
float dt = time_ns_to_s(delta_ns);
|
2019-10-10 16:22:14 +00:00
|
|
|
t.imu.handleAccel(map_vec3(sample->accel_m_s2).cast<double>(), dt);
|
|
|
|
t.imu.handleGyro(map_vec3(sample->gyro_rad_secs).cast<double>(), dt);
|
|
|
|
t.imu.postCorrect();
|
|
|
|
|
2019-10-10 16:29:48 +00:00
|
|
|
//! @todo use better measurements instead of the above "simple fusion"
|
|
|
|
flexkalman::predict(t.filter_state, t.process_model, dt);
|
|
|
|
auto meas = flexkalman::AbsoluteOrientationMeasurement{
|
2019-10-15 08:32:35 +00:00
|
|
|
Eigen::Quaterniond(
|
|
|
|
Eigen::AngleAxisd(EIGEN_PI, Eigen::Vector3d::UnitY())) *
|
|
|
|
t.imu.getQuat(),
|
|
|
|
Eigen::Vector3d::Constant(0.01)};
|
2019-10-10 16:29:48 +00:00
|
|
|
if (!flexkalman::correctUnscented(t.filter_state, meas)) {
|
|
|
|
fprintf(stderr,
|
|
|
|
"Got non-finite something when filtering IMU!\n");
|
|
|
|
} else {
|
|
|
|
map_quat(t.fusion.rot) =
|
|
|
|
t.filter_state.getQuaternion().cast<float>();
|
|
|
|
}
|
2019-09-21 18:04:48 +00:00
|
|
|
|
|
|
|
os_thread_helper_unlock(&t.oth);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
frame(TrackerPSMV &t, struct xrt_frame *xf)
|
|
|
|
{
|
|
|
|
os_thread_helper_lock(&t.oth);
|
|
|
|
|
|
|
|
// Don't do anything if we have stopped.
|
|
|
|
if (!os_thread_helper_is_running_locked(&t.oth)) {
|
|
|
|
os_thread_helper_unlock(&t.oth);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
xrt_frame_reference(&t.frame, xf);
|
|
|
|
// Wake up the thread.
|
|
|
|
os_thread_helper_signal_locked(&t.oth);
|
|
|
|
|
|
|
|
os_thread_helper_unlock(&t.oth);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
break_apart(TrackerPSMV &t)
|
|
|
|
{
|
|
|
|
os_thread_helper_stop(&t.oth);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
*
|
|
|
|
* C wrapper functions.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
extern "C" void
|
|
|
|
t_psmv_push_imu(struct xrt_tracked_psmv *xtmv,
|
|
|
|
time_duration_ns delta_ns,
|
|
|
|
struct xrt_tracking_sample *sample)
|
|
|
|
{
|
|
|
|
auto &t = *container_of(xtmv, TrackerPSMV, base);
|
|
|
|
imu_data(t, delta_ns, sample);
|
|
|
|
}
|
|
|
|
|
|
|
|
extern "C" void
|
|
|
|
t_psmv_get_tracked_pose(struct xrt_tracked_psmv *xtmv,
|
2019-10-11 14:38:40 +00:00
|
|
|
enum xrt_input_name name,
|
2019-09-21 18:04:48 +00:00
|
|
|
struct time_state *timestate,
|
|
|
|
timepoint_ns when_ns,
|
|
|
|
struct xrt_space_relation *out_relation)
|
|
|
|
{
|
|
|
|
auto &t = *container_of(xtmv, TrackerPSMV, base);
|
2019-10-11 14:38:40 +00:00
|
|
|
get_pose(t, name, timestate, when_ns, out_relation);
|
2019-09-21 18:04:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
extern "C" void
|
|
|
|
t_psmv_fake_destroy(struct xrt_tracked_psmv *xtmv)
|
|
|
|
{
|
|
|
|
auto &t = *container_of(xtmv, TrackerPSMV, base);
|
|
|
|
(void)t;
|
|
|
|
// Not the real destroy function
|
|
|
|
}
|
|
|
|
|
|
|
|
extern "C" void
|
|
|
|
t_psmv_sink_push_frame(struct xrt_frame_sink *xsink, struct xrt_frame *xf)
|
|
|
|
{
|
|
|
|
auto &t = *container_of(xsink, TrackerPSMV, sink);
|
|
|
|
frame(t, xf);
|
|
|
|
}
|
|
|
|
|
|
|
|
extern "C" void
|
|
|
|
t_psmv_node_break_apart(struct xrt_frame_node *node)
|
|
|
|
{
|
|
|
|
auto &t = *container_of(node, TrackerPSMV, node);
|
|
|
|
break_apart(t);
|
|
|
|
}
|
|
|
|
|
|
|
|
extern "C" void
|
|
|
|
t_psmv_node_destroy(struct xrt_frame_node *node)
|
|
|
|
{
|
|
|
|
auto t_ptr = container_of(node, TrackerPSMV, node);
|
|
|
|
os_thread_helper_destroy(&t_ptr->oth);
|
|
|
|
|
2019-09-28 16:41:20 +00:00
|
|
|
// Tidy variable setup.
|
|
|
|
u_var_remove_root(t_ptr);
|
|
|
|
|
2019-09-21 18:04:48 +00:00
|
|
|
delete t_ptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
extern "C" void *
|
|
|
|
t_psmv_run(void *ptr)
|
|
|
|
{
|
|
|
|
auto &t = *(TrackerPSMV *)ptr;
|
|
|
|
run(t);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
*
|
|
|
|
* Exported functions.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
extern "C" int
|
|
|
|
t_psmv_start(struct xrt_tracked_psmv *xtmv)
|
|
|
|
{
|
|
|
|
auto &t = *container_of(xtmv, TrackerPSMV, base);
|
2019-10-01 17:21:13 +00:00
|
|
|
return os_thread_helper_start(&t.oth, t_psmv_run, &t);
|
2019-09-21 18:04:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
extern "C" int
|
|
|
|
t_psmv_create(struct xrt_frame_context *xfctx,
|
|
|
|
struct xrt_colour_rgb_f32 *rgb,
|
|
|
|
struct xrt_tracked_psmv **out_xtmv,
|
|
|
|
struct xrt_frame_sink **out_sink)
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s\n", __func__);
|
|
|
|
|
|
|
|
auto &t = *(new TrackerPSMV());
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
t.base.get_tracked_pose = t_psmv_get_tracked_pose;
|
|
|
|
t.base.push_imu = t_psmv_push_imu;
|
|
|
|
t.base.destroy = t_psmv_fake_destroy;
|
|
|
|
t.base.colour = *rgb;
|
|
|
|
t.sink.push_frame = t_psmv_sink_push_frame;
|
|
|
|
t.node.break_apart = t_psmv_node_break_apart;
|
|
|
|
t.node.destroy = t_psmv_node_destroy;
|
|
|
|
t.fusion.rot.x = 0.0f;
|
|
|
|
t.fusion.rot.y = 0.0f;
|
|
|
|
t.fusion.rot.z = 0.0f;
|
|
|
|
t.fusion.rot.w = 1.0f;
|
|
|
|
|
|
|
|
ret = os_thread_helper_init(&t.oth);
|
|
|
|
if (ret != 0) {
|
|
|
|
delete (&t);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int hack = 0;
|
|
|
|
switch (hack++) {
|
|
|
|
case 0:
|
|
|
|
t.fusion.pos.x = -0.3f;
|
|
|
|
t.fusion.pos.y = 1.3f;
|
|
|
|
t.fusion.pos.z = -0.5f;
|
|
|
|
break;
|
|
|
|
case 1:
|
|
|
|
t.fusion.pos.x = 0.3f;
|
|
|
|
t.fusion.pos.y = 1.3f;
|
|
|
|
t.fusion.pos.z = -0.5f;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
t.fusion.pos.x = 0.0f;
|
|
|
|
t.fusion.pos.y = 0.8f + hack * 0.1f;
|
|
|
|
t.fusion.pos.z = -0.5f;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2019-09-26 11:33:57 +00:00
|
|
|
// clang-format off
|
|
|
|
cv::SimpleBlobDetector::Params blob_params;
|
|
|
|
blob_params.filterByArea = false;
|
|
|
|
blob_params.filterByConvexity = false;
|
|
|
|
blob_params.filterByInertia = false;
|
|
|
|
blob_params.filterByColor = true;
|
|
|
|
blob_params.blobColor = 255; // 0 or 255 - color comes from binarized image?
|
|
|
|
blob_params.minArea = 1;
|
|
|
|
blob_params.maxArea = 1000;
|
|
|
|
blob_params.maxThreshold = 51; // using a wide threshold span slows things down bigtime
|
|
|
|
blob_params.minThreshold = 50;
|
|
|
|
blob_params.thresholdStep = 1;
|
|
|
|
blob_params.minDistBetweenBlobs = 5;
|
|
|
|
blob_params.minRepeatability = 1; // need this to avoid error?
|
|
|
|
// clang-format on
|
|
|
|
|
|
|
|
t.sbd = cv::SimpleBlobDetector::create(blob_params);
|
2019-09-21 18:04:48 +00:00
|
|
|
xrt_frame_context_add(xfctx, &t.node);
|
|
|
|
|
2019-09-28 16:41:20 +00:00
|
|
|
// Everything is safe, now setup the variable tracking.
|
|
|
|
u_var_add_root(&t, "PSMV Tracker", true);
|
|
|
|
u_var_add_sink(&t, &t.debug.sink, "Debug");
|
|
|
|
|
2019-09-21 18:04:48 +00:00
|
|
|
*out_sink = &t.sink;
|
|
|
|
*out_xtmv = &t.base;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|