torch_openpose.py 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239
  1. import cv2
  2. import numpy as np
  3. import math
  4. from scipy.ndimage.filters import gaussian_filter
  5. import torch
  6. from src1 import util
  7. from src1.model import bodypose_model,bodypose_25_model
  8. model_coco = 'model/body_coco.pth'
  9. model_body25 = 'model/body_25.pth'
  10. np.seterr(divide='ignore', invalid='ignore')
  11. class torch_openpose(object):
  12. def __init__(self, model_type):
  13. if model_type == 'body_25':
  14. self.model = bodypose_25_model()
  15. self.njoint = 26
  16. self.npaf = 52
  17. self.model.load_state_dict(torch.load(model_body25))
  18. else:
  19. self.model = bodypose_model()
  20. self.njoint = 19
  21. self.npaf = 38
  22. self.model.load_state_dict(torch.load(model_coco))
  23. if torch.cuda.is_available():
  24. self.model = self.model.cuda()
  25. self.model.eval()
  26. if self.njoint == 19: #coco
  27. self.limbSeq = [[1, 2], [1, 5], [2, 3], [3, 4], [5, 6], [6, 7], [1, 8], [8, 9], \
  28. [9, 10], [1, 11], [11, 12], [12, 13], [1, 0], [0, 14], [14, 16], \
  29. [0, 15], [15, 17]]
  30. self.mapIdx = [[12, 13],[20, 21],[14, 15],[16, 17],[22, 23],[24, 25],[0, 1],[2, 3],\
  31. [4, 5],[6, 7],[8, 9],[10, 11],[28, 29],[30, 31],[34, 35],[32, 33],\
  32. [36, 37]]
  33. elif self.njoint == 26: #body_25
  34. self.limbSeq = [[1,0],[1,2],[2,3],[3,4],[1,5],[5,6],[6,7],[1,8],[8,9],[9,10],\
  35. [10,11],[8,12],[12,13],[13,14],[0,15],[0,16],[15,17],[16,18],\
  36. [11,24],[11,22],[14,21],[14,19],[22,23],[19,20]]
  37. self.mapIdx = [[30, 31],[14, 15],[16, 17],[18, 19],[22, 23],[24, 25],[26, 27],[0, 1],[6, 7],\
  38. [2, 3],[4, 5], [8, 9],[10, 11],[12, 13],[32, 33],[34, 35],[36,37],[38,39],\
  39. [50,51],[46,47],[44,45],[40,41],[48,49],[42,43]]
  40. def __call__(self, oriImg):
  41. # scale_search = [0.5, 1.0, 1.5, 2.0]
  42. scale_search = [0.5]
  43. boxsize = 368
  44. stride = 8
  45. padValue = 128
  46. thre1 = 0.1
  47. thre2 = 0.05
  48. multiplier = [x * boxsize / oriImg.shape[0] for x in scale_search]
  49. heatmap_avg = np.zeros((oriImg.shape[0], oriImg.shape[1], self.njoint))
  50. paf_avg = np.zeros((oriImg.shape[0], oriImg.shape[1], self.npaf))
  51. for m in range(len(multiplier)):
  52. scale = multiplier[m]
  53. imageToTest = cv2.resize(oriImg, (0, 0), fx=scale, fy=scale, interpolation=cv2.INTER_CUBIC)
  54. imageToTest_padded, pad = util.padRightDownCorner(imageToTest, stride, padValue)
  55. im = np.transpose(np.float32(imageToTest_padded[:, :, :, np.newaxis]), (3, 2, 0, 1)) / 256 - 0.5
  56. im = np.ascontiguousarray(im)
  57. data = torch.from_numpy(im).float()
  58. if torch.cuda.is_available():
  59. data = data.cuda()
  60. # data = data.permute([2, 0, 1]).unsqueeze(0).float()
  61. with torch.no_grad():
  62. heatmap, paf = self.model(data)
  63. heatmap = heatmap.detach().cpu().numpy()
  64. paf = paf.detach().cpu().numpy()
  65. # extract outputs, resize, and remove padding
  66. # heatmap = np.transpose(np.squeeze(net.blobs[output_blobs.keys()[1]].data), (1, 2, 0)) # output 1 is heatmaps
  67. heatmap = np.transpose(np.squeeze(heatmap), (1, 2, 0)) # output 1 is heatmaps
  68. heatmap = cv2.resize(heatmap, (0, 0), fx=stride, fy=stride, interpolation=cv2.INTER_CUBIC)
  69. heatmap = heatmap[:imageToTest_padded.shape[0] - pad[2], :imageToTest_padded.shape[1] - pad[3], :]
  70. heatmap = cv2.resize(heatmap, (oriImg.shape[1], oriImg.shape[0]), interpolation=cv2.INTER_CUBIC)
  71. # paf = np.transpose(np.squeeze(net.blobs[output_blobs.keys()[0]].data), (1, 2, 0)) # output 0 is PAFs
  72. paf = np.transpose(np.squeeze(paf), (1, 2, 0)) # output 0 is PAFs
  73. paf = cv2.resize(paf, (0, 0), fx=stride, fy=stride, interpolation=cv2.INTER_CUBIC)
  74. paf = paf[:imageToTest_padded.shape[0] - pad[2], :imageToTest_padded.shape[1] - pad[3], :]
  75. paf = cv2.resize(paf, (oriImg.shape[1], oriImg.shape[0]), interpolation=cv2.INTER_CUBIC)
  76. heatmap_avg += heatmap_avg + heatmap / len(multiplier)
  77. paf_avg += + paf / len(multiplier)
  78. all_peaks = []
  79. peak_counter = 0
  80. for part in range(self.njoint - 1):
  81. map_ori = heatmap_avg[:, :, part]
  82. one_heatmap = gaussian_filter(map_ori, sigma=3)
  83. map_left = np.zeros(one_heatmap.shape)
  84. map_left[1:, :] = one_heatmap[:-1, :]
  85. map_right = np.zeros(one_heatmap.shape)
  86. map_right[:-1, :] = one_heatmap[1:, :]
  87. map_up = np.zeros(one_heatmap.shape)
  88. map_up[:, 1:] = one_heatmap[:, :-1]
  89. map_down = np.zeros(one_heatmap.shape)
  90. map_down[:, :-1] = one_heatmap[:, 1:]
  91. peaks_binary = np.logical_and.reduce(
  92. (one_heatmap >= map_left, one_heatmap >= map_right, one_heatmap >= map_up, one_heatmap >= map_down, one_heatmap > thre1))
  93. peaks = list(zip(np.nonzero(peaks_binary)[1], np.nonzero(peaks_binary)[0])) # note reverse
  94. peaks_with_score = [x + (map_ori[x[1], x[0]],) for x in peaks]
  95. peak_id = range(peak_counter, peak_counter + len(peaks))
  96. peaks_with_score_and_id = [peaks_with_score[i] + (peak_id[i],) for i in range(len(peak_id))]
  97. all_peaks.append(peaks_with_score_and_id)
  98. peak_counter += len(peaks)
  99. # find connection in the specified sequence, center 29 is in the position 15
  100. limbSeq = self.limbSeq
  101. # the middle joints heatmap correpondence
  102. mapIdx = self.mapIdx
  103. connection_all = []
  104. special_k = []
  105. mid_num = 10
  106. for k in range(len(mapIdx)):
  107. score_mid = paf_avg[:, :, mapIdx[k]]
  108. candA = all_peaks[limbSeq[k][0]]
  109. candB = all_peaks[limbSeq[k][1]]
  110. nA = len(candA)
  111. nB = len(candB)
  112. indexA, indexB = limbSeq[k]
  113. if (nA != 0 and nB != 0):
  114. connection_candidate = []
  115. for i in range(nA):
  116. for j in range(nB):
  117. vec = np.subtract(candB[j][:2], candA[i][:2])
  118. norm = math.sqrt(vec[0] * vec[0] + vec[1] * vec[1])
  119. norm = max(0.001, norm)
  120. vec = np.divide(vec, norm)
  121. startend = list(zip(np.linspace(candA[i][0], candB[j][0], num=mid_num), \
  122. np.linspace(candA[i][1], candB[j][1], num=mid_num)))
  123. vec_x = np.array([score_mid[int(round(startend[I][1])), int(round(startend[I][0])), 0] \
  124. for I in range(len(startend))])
  125. vec_y = np.array([score_mid[int(round(startend[I][1])), int(round(startend[I][0])), 1] \
  126. for I in range(len(startend))])
  127. score_midpts = np.multiply(vec_x, vec[0]) + np.multiply(vec_y, vec[1])
  128. score_with_dist_prior = sum(score_midpts) / len(score_midpts) + min(
  129. 0.5 * oriImg.shape[0] / norm - 1, 0)
  130. criterion1 = len(np.nonzero(score_midpts > thre2)[0]) > 0.8 * len(score_midpts)
  131. criterion2 = score_with_dist_prior > 0
  132. if criterion1 and criterion2:
  133. connection_candidate.append(
  134. [i, j, score_with_dist_prior, score_with_dist_prior + candA[i][2] + candB[j][2]])
  135. connection_candidate = sorted(connection_candidate, key=lambda x: x[2], reverse=True)
  136. connection = np.zeros((0, 5))
  137. for c in range(len(connection_candidate)):
  138. i, j, s = connection_candidate[c][0:3]
  139. if (i not in connection[:, 3] and j not in connection[:, 4]):
  140. connection = np.vstack([connection, [candA[i][3], candB[j][3], s, i, j]])
  141. if (len(connection) >= min(nA, nB)):
  142. break
  143. connection_all.append(connection)
  144. else:
  145. special_k.append(k)
  146. connection_all.append([])
  147. # last number in each row is the total parts number of that person
  148. # the second last number in each row is the score of the overall configuration
  149. subset = -1 * np.ones((0, self.njoint + 1))
  150. candidate = np.array([item for sublist in all_peaks for item in sublist])
  151. for k in range(len(mapIdx)):
  152. if k not in special_k:
  153. partAs = connection_all[k][:, 0]
  154. partBs = connection_all[k][:, 1]
  155. indexA, indexB = np.array(limbSeq[k])
  156. for i in range(len(connection_all[k])): # = 1:size(temp,1)
  157. found = 0
  158. subset_idx = [-1, -1]
  159. for j in range(len(subset)): # 1:size(subset,1):
  160. if subset[j][indexA] == partAs[i] or subset[j][indexB] == partBs[i]:
  161. subset_idx[found] = j
  162. found += 1
  163. if found == 1:
  164. j = subset_idx[0]
  165. if subset[j][indexB] != partBs[i]:
  166. subset[j][indexB] = partBs[i]
  167. subset[j][-1] += 1
  168. subset[j][-2] += candidate[partBs[i].astype(int), 2] + connection_all[k][i][2]
  169. elif found == 2: # if found 2 and disjoint, merge them
  170. j1, j2 = subset_idx
  171. membership = ((subset[j1] >= 0).astype(int) + (subset[j2] >= 0).astype(int))[:-2]
  172. if len(np.nonzero(membership == 2)[0]) == 0: # merge
  173. subset[j1][:-2] += (subset[j2][:-2] + 1)
  174. subset[j1][-2:] += subset[j2][-2:]
  175. subset[j1][-2] += connection_all[k][i][2]
  176. subset = np.delete(subset, j2, 0)
  177. else: # as like found == 1
  178. subset[j1][indexB] = partBs[i]
  179. subset[j1][-1] += 1
  180. subset[j1][-2] += candidate[partBs[i].astype(int), 2] + connection_all[k][i][2]
  181. # if find no partA in the subset, create a new subset
  182. elif not found:
  183. row = -1 * np.ones(self.njoint + 1)
  184. row[indexA] = partAs[i]
  185. row[indexB] = partBs[i]
  186. row[-1] = 2
  187. row[-2] = sum(candidate[connection_all[k][i, :2].astype(int), 2]) + connection_all[k][i][2]
  188. subset = np.vstack([subset, row])
  189. # delete some rows of subset which has few parts occur
  190. deleteIdx = []
  191. for i in range(len(subset)):
  192. if subset[i][-1] < 4 or subset[i][-2] / subset[i][-1] < 0.4:
  193. deleteIdx.append(i)
  194. subset = np.delete(subset, deleteIdx, axis=0)
  195. poses = []
  196. for per in subset:
  197. pose = []
  198. for po in per[:-2]:
  199. if po >= 0:
  200. joint = list(candidate[int(po)][:3])
  201. else:
  202. joint = [0.,0.,0.]
  203. pose.append(joint)
  204. poses.append(pose)
  205. return poses