You can not select more than 25 topics Topics must start with a chinese character,a letter or number, can include dashes ('-') and can be up to 35 characters long.

yolo11_pose.cpp 19 kB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592
  1. // Tencent is pleased to support the open source community by making ncnn available.
  2. //
  3. // Copyright (C) 2025 THL A29 Limited, a Tencent company. All rights reserved.
  4. //
  5. // Licensed under the BSD 3-Clause License (the "License"); you may not use this file except
  6. // in compliance with the License. You may obtain a copy of the License at
  7. //
  8. // https://opensource.org/licenses/BSD-3-Clause
  9. //
  10. // Unless required by applicable law or agreed to in writing, software distributed
  11. // under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
  12. // CONDITIONS OF ANY KIND, either express or implied. See the License for the
  13. // specific language governing permissions and limitations under the License.
  14. // 1. install
  15. // pip3 install -U ultralytics pnnx ncnn
  16. // 2. export yolo11-pose torchscript
  17. // yolo export model=yolo11n-pose.pt format=torchscript
  18. // 3. convert torchscript with static shape
  19. // pnnx yolo11n-pose.torchscript
  20. // 4. modify yolo11n_pose_pnnx.py for dynamic shape inference
  21. // A. modify reshape to support dynamic image sizes
  22. // B. permute tensor before concat and adjust concat axis
  23. // C. drop post-process part
  24. // before:
  25. // v_195 = v_194.view(1, 51, 6400)
  26. // v_201 = v_200.view(1, 51, 1600)
  27. // v_207 = v_206.view(1, 51, 400)
  28. // v_208 = torch.cat((v_195, v_201, v_207), dim=-1)
  29. // ...
  30. // v_254 = v_223.view(1, 65, 6400)
  31. // v_255 = v_238.view(1, 65, 1600)
  32. // v_256 = v_253.view(1, 65, 400)
  33. // v_257 = torch.cat((v_254, v_255, v_256), dim=2)
  34. // ...
  35. // after:
  36. // v_195 = v_194.view(1, 51, -1).transpose(1, 2)
  37. // v_201 = v_200.view(1, 51, -1).transpose(1, 2)
  38. // v_207 = v_206.view(1, 51, -1).transpose(1, 2)
  39. // v_208 = torch.cat((v_195, v_201, v_207), dim=1)
  40. // ...
  41. // v_254 = v_223.view(1, 65, -1).transpose(1, 2)
  42. // v_255 = v_238.view(1, 65, -1).transpose(1, 2)
  43. // v_256 = v_253.view(1, 65, -1).transpose(1, 2)
  44. // v_257 = torch.cat((v_254, v_255, v_256), dim=1)
  45. // return v_257, v_208
  46. // D. modify area attention for dynamic shape inference
  47. // before:
  48. // v_95 = self.model_10_m_0_attn_qkv_conv(v_94)
  49. // v_96 = v_95.view(1, 2, 128, 400)
  50. // v_97, v_98, v_99 = torch.split(tensor=v_96, dim=2, split_size_or_sections=(32,32,64))
  51. // v_100 = torch.transpose(input=v_97, dim0=-2, dim1=-1)
  52. // v_101 = torch.matmul(input=v_100, other=v_98)
  53. // v_102 = (v_101 * 0.176777)
  54. // v_103 = F.softmax(input=v_102, dim=-1)
  55. // v_104 = torch.transpose(input=v_103, dim0=-2, dim1=-1)
  56. // v_105 = torch.matmul(input=v_99, other=v_104)
  57. // v_106 = v_105.view(1, 128, 20, 20)
  58. // v_107 = v_99.reshape(1, 128, 20, 20)
  59. // v_108 = self.model_10_m_0_attn_pe_conv(v_107)
  60. // v_109 = (v_106 + v_108)
  61. // v_110 = self.model_10_m_0_attn_proj_conv(v_109)
  62. // after:
  63. // v_95 = self.model_10_m_0_attn_qkv_conv(v_94)
  64. // v_96 = v_95.view(1, 2, 128, -1)
  65. // v_97, v_98, v_99 = torch.split(tensor=v_96, dim=2, split_size_or_sections=(32,32,64))
  66. // v_100 = torch.transpose(input=v_97, dim0=-2, dim1=-1)
  67. // v_101 = torch.matmul(input=v_100, other=v_98)
  68. // v_102 = (v_101 * 0.176777)
  69. // v_103 = F.softmax(input=v_102, dim=-1)
  70. // v_104 = torch.transpose(input=v_103, dim0=-2, dim1=-1)
  71. // v_105 = torch.matmul(input=v_99, other=v_104)
  72. // v_106 = v_105.view(1, 128, v_95.size(2), v_95.size(3))
  73. // v_107 = v_99.reshape(1, 128, v_95.size(2), v_95.size(3))
  74. // v_108 = self.model_10_m_0_attn_pe_conv(v_107)
  75. // v_109 = (v_106 + v_108)
  76. // v_110 = self.model_10_m_0_attn_proj_conv(v_109)
  77. // 5. re-export yolo11-pose torchscript
  78. // python3 -c 'import yolo11n_pose_pnnx; yolo11n_pose_pnnx.export_torchscript()'
  79. // 6. convert new torchscript with dynamic shape
  80. // pnnx yolo11n_pose_pnnx.py.pt inputshape=[1,3,640,640] inputshape2=[1,3,320,320]
  81. // 7. now you get ncnn model files
  82. // mv yolo11n_pose_pnnx.py.ncnn.param yolo11n_pose.ncnn.param
  83. // mv yolo11n_pose_pnnx.py.ncnn.bin yolo11n_pose.ncnn.bin
  84. // the out blob would be a 2-dim tensor with w=65 h=8400
  85. //
  86. // | bbox-reg 16 x 4 |score(1)|
  87. // +-----+-----+-----+-----+--------+
  88. // | dx0 | dy0 | dx1 | dy1 | 0.1 |
  89. // all /| | | | | |
  90. // boxes | .. | .. | .. | .. | 0.0 |
  91. // (8400)| | | | | . |
  92. // \| | | | | . |
  93. // +-----+-----+-----+-----+--------+
  94. //
  95. //
  96. // | pose (51) |
  97. // +-----------+
  98. // |0.1........|
  99. // all /| |
  100. // boxes |0.0........|
  101. // (8400)| . |
  102. // \| . |
  103. // +-----------+
  104. //
  105. #include "layer.h"
  106. #include "net.h"
  107. #if defined(USE_NCNN_SIMPLEOCV)
  108. #include "simpleocv.h"
  109. #else
  110. #include <opencv2/core/core.hpp>
  111. #include <opencv2/highgui/highgui.hpp>
  112. #include <opencv2/imgproc/imgproc.hpp>
  113. #endif
  114. #include <float.h>
  115. #include <stdio.h>
  116. #include <vector>
  117. struct KeyPoint
  118. {
  119. cv::Point2f p;
  120. float prob;
  121. };
  122. struct Object
  123. {
  124. cv::Rect_<float> rect;
  125. int label;
  126. float prob;
  127. std::vector<KeyPoint> keypoints;
  128. };
  129. static inline float intersection_area(const Object& a, const Object& b)
  130. {
  131. cv::Rect_<float> inter = a.rect & b.rect;
  132. return inter.area();
  133. }
  134. static void qsort_descent_inplace(std::vector<Object>& objects, int left, int right)
  135. {
  136. int i = left;
  137. int j = right;
  138. float p = objects[(left + right) / 2].prob;
  139. while (i <= j)
  140. {
  141. while (objects[i].prob > p)
  142. i++;
  143. while (objects[j].prob < p)
  144. j--;
  145. if (i <= j)
  146. {
  147. // swap
  148. std::swap(objects[i], objects[j]);
  149. i++;
  150. j--;
  151. }
  152. }
  153. // #pragma omp parallel sections
  154. {
  155. // #pragma omp section
  156. {
  157. if (left < j) qsort_descent_inplace(objects, left, j);
  158. }
  159. // #pragma omp section
  160. {
  161. if (i < right) qsort_descent_inplace(objects, i, right);
  162. }
  163. }
  164. }
  165. static void qsort_descent_inplace(std::vector<Object>& objects)
  166. {
  167. if (objects.empty())
  168. return;
  169. qsort_descent_inplace(objects, 0, objects.size() - 1);
  170. }
  171. static void nms_sorted_bboxes(const std::vector<Object>& objects, std::vector<int>& picked, float nms_threshold, bool agnostic = false)
  172. {
  173. picked.clear();
  174. const int n = objects.size();
  175. std::vector<float> areas(n);
  176. for (int i = 0; i < n; i++)
  177. {
  178. areas[i] = objects[i].rect.area();
  179. }
  180. for (int i = 0; i < n; i++)
  181. {
  182. const Object& a = objects[i];
  183. int keep = 1;
  184. for (int j = 0; j < (int)picked.size(); j++)
  185. {
  186. const Object& b = objects[picked[j]];
  187. if (!agnostic && a.label != b.label)
  188. continue;
  189. // intersection over union
  190. float inter_area = intersection_area(a, b);
  191. float union_area = areas[i] + areas[picked[j]] - inter_area;
  192. // float IoU = inter_area / union_area
  193. if (inter_area / union_area > nms_threshold)
  194. keep = 0;
  195. }
  196. if (keep)
  197. picked.push_back(i);
  198. }
  199. }
  200. static inline float sigmoid(float x)
  201. {
  202. return 1.0f / (1.0f + expf(-x));
  203. }
  204. static void generate_proposals(const ncnn::Mat& pred, const ncnn::Mat& pred_points, int stride, const ncnn::Mat& in_pad, float prob_threshold, std::vector<Object>& objects)
  205. {
  206. const int w = in_pad.w;
  207. const int h = in_pad.h;
  208. const int num_grid_x = w / stride;
  209. const int num_grid_y = h / stride;
  210. const int reg_max_1 = 16;
  211. const int num_points = pred_points.w / 3;
  212. for (int y = 0; y < num_grid_y; y++)
  213. {
  214. for (int x = 0; x < num_grid_x; x++)
  215. {
  216. const ncnn::Mat pred_grid = pred.row_range(y * num_grid_x + x, 1);
  217. const ncnn::Mat pred_points_grid = pred_points.row_range(y * num_grid_x + x, 1).reshape(3, num_points);
  218. // find label with max score
  219. int label = 0;
  220. float score = sigmoid(pred_grid[reg_max_1 * 4]);
  221. if (score >= prob_threshold)
  222. {
  223. ncnn::Mat pred_bbox = pred_grid.range(0, reg_max_1 * 4).reshape(reg_max_1, 4).clone();
  224. {
  225. ncnn::Layer* softmax = ncnn::create_layer("Softmax");
  226. ncnn::ParamDict pd;
  227. pd.set(0, 1); // axis
  228. pd.set(1, 1);
  229. softmax->load_param(pd);
  230. ncnn::Option opt;
  231. opt.num_threads = 1;
  232. opt.use_packing_layout = false;
  233. softmax->create_pipeline(opt);
  234. softmax->forward_inplace(pred_bbox, opt);
  235. softmax->destroy_pipeline(opt);
  236. delete softmax;
  237. }
  238. float pred_ltrb[4];
  239. for (int k = 0; k < 4; k++)
  240. {
  241. float dis = 0.f;
  242. const float* dis_after_sm = pred_bbox.row(k);
  243. for (int l = 0; l < reg_max_1; l++)
  244. {
  245. dis += l * dis_after_sm[l];
  246. }
  247. pred_ltrb[k] = dis * stride;
  248. }
  249. float pb_cx = (x + 0.5f) * stride;
  250. float pb_cy = (y + 0.5f) * stride;
  251. float x0 = pb_cx - pred_ltrb[0];
  252. float y0 = pb_cy - pred_ltrb[1];
  253. float x1 = pb_cx + pred_ltrb[2];
  254. float y1 = pb_cy + pred_ltrb[3];
  255. std::vector<KeyPoint> keypoints;
  256. for (int k = 0; k < num_points; k++)
  257. {
  258. KeyPoint keypoint;
  259. keypoint.p.x = (x + pred_points_grid.row(k)[0] * 2) * stride;
  260. keypoint.p.y = (y + pred_points_grid.row(k)[1] * 2) * stride;
  261. keypoint.prob = sigmoid(pred_points_grid.row(k)[2]);
  262. keypoints.push_back(keypoint);
  263. }
  264. Object obj;
  265. obj.rect.x = x0;
  266. obj.rect.y = y0;
  267. obj.rect.width = x1 - x0;
  268. obj.rect.height = y1 - y0;
  269. obj.label = label;
  270. obj.prob = score;
  271. obj.keypoints = keypoints;
  272. objects.push_back(obj);
  273. }
  274. }
  275. }
  276. }
  277. static void generate_proposals(const ncnn::Mat& pred, const ncnn::Mat& pred_points, const std::vector<int>& strides, const ncnn::Mat& in_pad, float prob_threshold, std::vector<Object>& objects)
  278. {
  279. const int w = in_pad.w;
  280. const int h = in_pad.h;
  281. int pred_row_offset = 0;
  282. for (size_t i = 0; i < strides.size(); i++)
  283. {
  284. const int stride = strides[i];
  285. const int num_grid_x = w / stride;
  286. const int num_grid_y = h / stride;
  287. const int num_grid = num_grid_x * num_grid_y;
  288. generate_proposals(pred.row_range(pred_row_offset, num_grid), pred_points.row_range(pred_row_offset, num_grid), stride, in_pad, prob_threshold, objects);
  289. pred_row_offset += num_grid;
  290. }
  291. }
  292. static int detect_yolo11_pose(const cv::Mat& bgr, std::vector<Object>& objects)
  293. {
  294. ncnn::Net yolo11;
  295. yolo11.opt.use_vulkan_compute = true;
  296. // yolo11.opt.use_bf16_storage = true;
  297. // https://github.com/nihui/ncnn-android-yolo11/tree/master/app/src/main/assets
  298. yolo11.load_param("yolo11n_pose.ncnn.param");
  299. yolo11.load_model("yolo11n_pose.ncnn.bin");
  300. // yolo11.load_param("yolo11s_pose.ncnn.param");
  301. // yolo11.load_model("yolo11s_pose.ncnn.bin");
  302. // yolo11.load_param("yolo11m_pose.ncnn.param");
  303. // yolo11.load_model("yolo11m_pose.ncnn.bin");
  304. const int target_size = 640;
  305. const float prob_threshold = 0.25f;
  306. const float nms_threshold = 0.45f;
  307. const float mask_threshold = 0.5f;
  308. int img_w = bgr.cols;
  309. int img_h = bgr.rows;
  310. // ultralytics/cfg/models/v8/yolo11.yaml
  311. std::vector<int> strides(3);
  312. strides[0] = 8;
  313. strides[1] = 16;
  314. strides[2] = 32;
  315. const int max_stride = 32;
  316. // letterbox pad to multiple of max_stride
  317. int w = img_w;
  318. int h = img_h;
  319. float scale = 1.f;
  320. if (w > h)
  321. {
  322. scale = (float)target_size / w;
  323. w = target_size;
  324. h = h * scale;
  325. }
  326. else
  327. {
  328. scale = (float)target_size / h;
  329. h = target_size;
  330. w = w * scale;
  331. }
  332. ncnn::Mat in = ncnn::Mat::from_pixels_resize(bgr.data, ncnn::Mat::PIXEL_BGR2RGB, img_w, img_h, w, h);
  333. // letterbox pad to target_size rectangle
  334. int wpad = (w + max_stride - 1) / max_stride * max_stride - w;
  335. int hpad = (h + max_stride - 1) / max_stride * max_stride - h;
  336. ncnn::Mat in_pad;
  337. ncnn::copy_make_border(in, in_pad, hpad / 2, hpad - hpad / 2, wpad / 2, wpad - wpad / 2, ncnn::BORDER_CONSTANT, 114.f);
  338. const float norm_vals[3] = {1 / 255.f, 1 / 255.f, 1 / 255.f};
  339. in_pad.substract_mean_normalize(0, norm_vals);
  340. ncnn::Extractor ex = yolo11.create_extractor();
  341. ex.input("in0", in_pad);
  342. ncnn::Mat out;
  343. ex.extract("out0", out);
  344. ncnn::Mat out_points;
  345. ex.extract("out1", out_points);
  346. std::vector<Object> proposals;
  347. generate_proposals(out, out_points, strides, in_pad, prob_threshold, proposals);
  348. // sort all proposals by score from highest to lowest
  349. qsort_descent_inplace(proposals);
  350. // apply nms with nms_threshold
  351. std::vector<int> picked;
  352. nms_sorted_bboxes(proposals, picked, nms_threshold);
  353. int count = picked.size();
  354. if (count == 0)
  355. return 0;
  356. const int num_points = out_points.w / 3;
  357. objects.resize(count);
  358. for (int i = 0; i < count; i++)
  359. {
  360. objects[i] = proposals[picked[i]];
  361. // adjust offset to original unpadded
  362. float x0 = (objects[i].rect.x - (wpad / 2)) / scale;
  363. float y0 = (objects[i].rect.y - (hpad / 2)) / scale;
  364. float x1 = (objects[i].rect.x + objects[i].rect.width - (wpad / 2)) / scale;
  365. float y1 = (objects[i].rect.y + objects[i].rect.height - (hpad / 2)) / scale;
  366. for (int j = 0; j < num_points; j++)
  367. {
  368. objects[i].keypoints[j].p.x = (objects[i].keypoints[j].p.x - (wpad / 2)) / scale;
  369. objects[i].keypoints[j].p.y = (objects[i].keypoints[j].p.y - (hpad / 2)) / scale;
  370. }
  371. // clip
  372. x0 = std::max(std::min(x0, (float)(img_w - 1)), 0.f);
  373. y0 = std::max(std::min(y0, (float)(img_h - 1)), 0.f);
  374. x1 = std::max(std::min(x1, (float)(img_w - 1)), 0.f);
  375. y1 = std::max(std::min(y1, (float)(img_h - 1)), 0.f);
  376. objects[i].rect.x = x0;
  377. objects[i].rect.y = y0;
  378. objects[i].rect.width = x1 - x0;
  379. objects[i].rect.height = y1 - y0;
  380. }
  381. return 0;
  382. }
  383. static void draw_objects(const cv::Mat& bgr, const std::vector<Object>& objects)
  384. {
  385. static const char* class_names[] = {"person"};
  386. static const cv::Scalar colors[] = {
  387. cv::Scalar(244, 67, 54),
  388. cv::Scalar(233, 30, 99),
  389. cv::Scalar(156, 39, 176),
  390. cv::Scalar(103, 58, 183),
  391. cv::Scalar(63, 81, 181),
  392. cv::Scalar(33, 150, 243),
  393. cv::Scalar(3, 169, 244),
  394. cv::Scalar(0, 188, 212),
  395. cv::Scalar(0, 150, 136),
  396. cv::Scalar(76, 175, 80),
  397. cv::Scalar(139, 195, 74),
  398. cv::Scalar(205, 220, 57),
  399. cv::Scalar(255, 235, 59),
  400. cv::Scalar(255, 193, 7),
  401. cv::Scalar(255, 152, 0),
  402. cv::Scalar(255, 87, 34),
  403. cv::Scalar(121, 85, 72),
  404. cv::Scalar(158, 158, 158),
  405. cv::Scalar(96, 125, 139)
  406. };
  407. cv::Mat image = bgr.clone();
  408. for (size_t i = 0; i < objects.size(); i++)
  409. {
  410. const Object& obj = objects[i];
  411. const cv::Scalar& color = colors[i % 19];
  412. fprintf(stderr, "%d = %.5f at %.2f %.2f %.2f x %.2f\n", obj.label, obj.prob,
  413. obj.rect.x, obj.rect.y, obj.rect.width, obj.rect.height);
  414. // draw bone
  415. static const int joint_pairs[16][2] = {
  416. {0, 1}, {1, 3}, {0, 2}, {2, 4}, {5, 6}, {5, 7}, {7, 9}, {6, 8}, {8, 10}, {5, 11}, {6, 12}, {11, 12}, {11, 13}, {12, 14}, {13, 15}, {14, 16}
  417. };
  418. static const cv::Scalar bone_colors[] = {
  419. cv::Scalar(0, 255, 0),
  420. cv::Scalar(0, 255, 0),
  421. cv::Scalar(0, 255, 0),
  422. cv::Scalar(0, 255, 0),
  423. cv::Scalar(255, 128, 0),
  424. cv::Scalar(255, 128, 0),
  425. cv::Scalar(255, 128, 0),
  426. cv::Scalar(255, 128, 0),
  427. cv::Scalar(255, 128, 0),
  428. cv::Scalar(255, 51, 255),
  429. cv::Scalar(255, 51, 255),
  430. cv::Scalar(255, 51, 255),
  431. cv::Scalar(51, 153, 255),
  432. cv::Scalar(51, 153, 255),
  433. cv::Scalar(51, 153, 255),
  434. cv::Scalar(51, 153, 255),
  435. };
  436. for (int j = 0; j < 16; j++)
  437. {
  438. const KeyPoint& p1 = obj.keypoints[joint_pairs[j][0]];
  439. const KeyPoint& p2 = obj.keypoints[joint_pairs[j][1]];
  440. if (p1.prob < 0.2f || p2.prob < 0.2f)
  441. continue;
  442. cv::line(image, p1.p, p2.p, bone_colors[j], 2);
  443. }
  444. // draw joint
  445. for (size_t j = 0; j < obj.keypoints.size(); j++)
  446. {
  447. const KeyPoint& keypoint = obj.keypoints[j];
  448. fprintf(stderr, "%.2f %.2f = %.5f\n", keypoint.p.x, keypoint.p.y, keypoint.prob);
  449. if (keypoint.prob < 0.2f)
  450. continue;
  451. cv::circle(image, keypoint.p, 3, color, -1);
  452. }
  453. cv::rectangle(image, obj.rect, color);
  454. char text[256];
  455. sprintf(text, "%s %.1f%%", class_names[obj.label], obj.prob * 100);
  456. int baseLine = 0;
  457. cv::Size label_size = cv::getTextSize(text, cv::FONT_HERSHEY_SIMPLEX, 0.5, 1, &baseLine);
  458. int x = obj.rect.x;
  459. int y = obj.rect.y - label_size.height - baseLine;
  460. if (y < 0)
  461. y = 0;
  462. if (x + label_size.width > image.cols)
  463. x = image.cols - label_size.width;
  464. cv::rectangle(image, cv::Rect(cv::Point(x, y), cv::Size(label_size.width, label_size.height + baseLine)),
  465. cv::Scalar(255, 255, 255), -1);
  466. cv::putText(image, text, cv::Point(x, y + label_size.height),
  467. cv::FONT_HERSHEY_SIMPLEX, 0.5, cv::Scalar(0, 0, 0));
  468. }
  469. cv::imshow("image", image);
  470. cv::waitKey(0);
  471. }
  472. int main(int argc, char** argv)
  473. {
  474. if (argc != 2)
  475. {
  476. fprintf(stderr, "Usage: %s [imagepath]\n", argv[0]);
  477. return -1;
  478. }
  479. const char* imagepath = argv[1];
  480. cv::Mat m = cv::imread(imagepath, 1);
  481. if (m.empty())
  482. {
  483. fprintf(stderr, "cv::imread %s failed\n", imagepath);
  484. return -1;
  485. }
  486. std::vector<Object> objects;
  487. detect_yolo11_pose(m, objects);
  488. draw_objects(m, objects);
  489. return 0;
  490. }