Spaces:
Paused
Paused
Upload 3 files
Browse files
facelib/detection/retinaface/retinaface.py
ADDED
|
@@ -0,0 +1,372 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import cv2
|
| 2 |
+
import numpy as np
|
| 3 |
+
import torch
|
| 4 |
+
import torch.nn as nn
|
| 5 |
+
import torch.nn.functional as F
|
| 6 |
+
from PIL import Image
|
| 7 |
+
from torchvision.models._utils import IntermediateLayerGetter as IntermediateLayerGetter
|
| 8 |
+
|
| 9 |
+
from facelib.detection.align_trans import get_reference_facial_points, warp_and_crop_face
|
| 10 |
+
from facelib.detection.retinaface.retinaface_net import FPN, SSH, MobileNetV1, make_bbox_head, make_class_head, make_landmark_head
|
| 11 |
+
from facelib.detection.retinaface.retinaface_utils import (PriorBox, batched_decode, batched_decode_landm, decode, decode_landm,
|
| 12 |
+
py_cpu_nms)
|
| 13 |
+
|
| 14 |
+
from basicsr.utils.misc import get_device
|
| 15 |
+
# device = torch.device('cuda' if torch.cuda.is_available() else 'cpu')
|
| 16 |
+
device = get_device()
|
| 17 |
+
|
| 18 |
+
|
| 19 |
+
def generate_config(network_name):
|
| 20 |
+
|
| 21 |
+
cfg_mnet = {
|
| 22 |
+
'name': 'mobilenet0.25',
|
| 23 |
+
'min_sizes': [[16, 32], [64, 128], [256, 512]],
|
| 24 |
+
'steps': [8, 16, 32],
|
| 25 |
+
'variance': [0.1, 0.2],
|
| 26 |
+
'clip': False,
|
| 27 |
+
'loc_weight': 2.0,
|
| 28 |
+
'gpu_train': True,
|
| 29 |
+
'batch_size': 32,
|
| 30 |
+
'ngpu': 1,
|
| 31 |
+
'epoch': 250,
|
| 32 |
+
'decay1': 190,
|
| 33 |
+
'decay2': 220,
|
| 34 |
+
'image_size': 640,
|
| 35 |
+
'return_layers': {
|
| 36 |
+
'stage1': 1,
|
| 37 |
+
'stage2': 2,
|
| 38 |
+
'stage3': 3
|
| 39 |
+
},
|
| 40 |
+
'in_channel': 32,
|
| 41 |
+
'out_channel': 64
|
| 42 |
+
}
|
| 43 |
+
|
| 44 |
+
cfg_re50 = {
|
| 45 |
+
'name': 'Resnet50',
|
| 46 |
+
'min_sizes': [[16, 32], [64, 128], [256, 512]],
|
| 47 |
+
'steps': [8, 16, 32],
|
| 48 |
+
'variance': [0.1, 0.2],
|
| 49 |
+
'clip': False,
|
| 50 |
+
'loc_weight': 2.0,
|
| 51 |
+
'gpu_train': True,
|
| 52 |
+
'batch_size': 24,
|
| 53 |
+
'ngpu': 4,
|
| 54 |
+
'epoch': 100,
|
| 55 |
+
'decay1': 70,
|
| 56 |
+
'decay2': 90,
|
| 57 |
+
'image_size': 840,
|
| 58 |
+
'return_layers': {
|
| 59 |
+
'layer2': 1,
|
| 60 |
+
'layer3': 2,
|
| 61 |
+
'layer4': 3
|
| 62 |
+
},
|
| 63 |
+
'in_channel': 256,
|
| 64 |
+
'out_channel': 256
|
| 65 |
+
}
|
| 66 |
+
|
| 67 |
+
if network_name == 'mobile0.25':
|
| 68 |
+
return cfg_mnet
|
| 69 |
+
elif network_name == 'resnet50':
|
| 70 |
+
return cfg_re50
|
| 71 |
+
else:
|
| 72 |
+
raise NotImplementedError(f'network_name={network_name}')
|
| 73 |
+
|
| 74 |
+
|
| 75 |
+
class RetinaFace(nn.Module):
|
| 76 |
+
|
| 77 |
+
def __init__(self, network_name='resnet50', half=False, phase='test'):
|
| 78 |
+
super(RetinaFace, self).__init__()
|
| 79 |
+
self.half_inference = half
|
| 80 |
+
cfg = generate_config(network_name)
|
| 81 |
+
self.backbone = cfg['name']
|
| 82 |
+
|
| 83 |
+
self.model_name = f'retinaface_{network_name}'
|
| 84 |
+
self.cfg = cfg
|
| 85 |
+
self.phase = phase
|
| 86 |
+
self.target_size, self.max_size = 1600, 2150
|
| 87 |
+
self.resize, self.scale, self.scale1 = 1., None, None
|
| 88 |
+
self.mean_tensor = torch.tensor([[[[104.]], [[117.]], [[123.]]]]).to(device)
|
| 89 |
+
self.reference = get_reference_facial_points(default_square=True)
|
| 90 |
+
# Build network.
|
| 91 |
+
backbone = None
|
| 92 |
+
if cfg['name'] == 'mobilenet0.25':
|
| 93 |
+
backbone = MobileNetV1()
|
| 94 |
+
self.body = IntermediateLayerGetter(backbone, cfg['return_layers'])
|
| 95 |
+
elif cfg['name'] == 'Resnet50':
|
| 96 |
+
import torchvision.models as models
|
| 97 |
+
backbone = models.resnet50(pretrained=False)
|
| 98 |
+
self.body = IntermediateLayerGetter(backbone, cfg['return_layers'])
|
| 99 |
+
|
| 100 |
+
in_channels_stage2 = cfg['in_channel']
|
| 101 |
+
in_channels_list = [
|
| 102 |
+
in_channels_stage2 * 2,
|
| 103 |
+
in_channels_stage2 * 4,
|
| 104 |
+
in_channels_stage2 * 8,
|
| 105 |
+
]
|
| 106 |
+
|
| 107 |
+
out_channels = cfg['out_channel']
|
| 108 |
+
self.fpn = FPN(in_channels_list, out_channels)
|
| 109 |
+
self.ssh1 = SSH(out_channels, out_channels)
|
| 110 |
+
self.ssh2 = SSH(out_channels, out_channels)
|
| 111 |
+
self.ssh3 = SSH(out_channels, out_channels)
|
| 112 |
+
|
| 113 |
+
self.ClassHead = make_class_head(fpn_num=3, inchannels=cfg['out_channel'])
|
| 114 |
+
self.BboxHead = make_bbox_head(fpn_num=3, inchannels=cfg['out_channel'])
|
| 115 |
+
self.LandmarkHead = make_landmark_head(fpn_num=3, inchannels=cfg['out_channel'])
|
| 116 |
+
|
| 117 |
+
self.to(device)
|
| 118 |
+
self.eval()
|
| 119 |
+
if self.half_inference:
|
| 120 |
+
self.half()
|
| 121 |
+
|
| 122 |
+
def forward(self, inputs):
|
| 123 |
+
out = self.body(inputs)
|
| 124 |
+
|
| 125 |
+
if self.backbone == 'mobilenet0.25' or self.backbone == 'Resnet50':
|
| 126 |
+
out = list(out.values())
|
| 127 |
+
# FPN
|
| 128 |
+
fpn = self.fpn(out)
|
| 129 |
+
|
| 130 |
+
# SSH
|
| 131 |
+
feature1 = self.ssh1(fpn[0])
|
| 132 |
+
feature2 = self.ssh2(fpn[1])
|
| 133 |
+
feature3 = self.ssh3(fpn[2])
|
| 134 |
+
features = [feature1, feature2, feature3]
|
| 135 |
+
|
| 136 |
+
bbox_regressions = torch.cat([self.BboxHead[i](feature) for i, feature in enumerate(features)], dim=1)
|
| 137 |
+
classifications = torch.cat([self.ClassHead[i](feature) for i, feature in enumerate(features)], dim=1)
|
| 138 |
+
tmp = [self.LandmarkHead[i](feature) for i, feature in enumerate(features)]
|
| 139 |
+
ldm_regressions = (torch.cat(tmp, dim=1))
|
| 140 |
+
|
| 141 |
+
if self.phase == 'train':
|
| 142 |
+
output = (bbox_regressions, classifications, ldm_regressions)
|
| 143 |
+
else:
|
| 144 |
+
output = (bbox_regressions, F.softmax(classifications, dim=-1), ldm_regressions)
|
| 145 |
+
return output
|
| 146 |
+
|
| 147 |
+
def __detect_faces(self, inputs):
|
| 148 |
+
# get scale
|
| 149 |
+
height, width = inputs.shape[2:]
|
| 150 |
+
self.scale = torch.tensor([width, height, width, height], dtype=torch.float32).to(device)
|
| 151 |
+
tmp = [width, height, width, height, width, height, width, height, width, height]
|
| 152 |
+
self.scale1 = torch.tensor(tmp, dtype=torch.float32).to(device)
|
| 153 |
+
|
| 154 |
+
# forawrd
|
| 155 |
+
inputs = inputs.to(device)
|
| 156 |
+
if self.half_inference:
|
| 157 |
+
inputs = inputs.half()
|
| 158 |
+
loc, conf, landmarks = self(inputs)
|
| 159 |
+
|
| 160 |
+
# get priorbox
|
| 161 |
+
priorbox = PriorBox(self.cfg, image_size=inputs.shape[2:])
|
| 162 |
+
priors = priorbox.forward().to(device)
|
| 163 |
+
|
| 164 |
+
return loc, conf, landmarks, priors
|
| 165 |
+
|
| 166 |
+
# single image detection
|
| 167 |
+
def transform(self, image, use_origin_size):
|
| 168 |
+
# convert to opencv format
|
| 169 |
+
if isinstance(image, Image.Image):
|
| 170 |
+
image = cv2.cvtColor(np.asarray(image), cv2.COLOR_RGB2BGR)
|
| 171 |
+
image = image.astype(np.float32)
|
| 172 |
+
|
| 173 |
+
# testing scale
|
| 174 |
+
im_size_min = np.min(image.shape[0:2])
|
| 175 |
+
im_size_max = np.max(image.shape[0:2])
|
| 176 |
+
resize = float(self.target_size) / float(im_size_min)
|
| 177 |
+
|
| 178 |
+
# prevent bigger axis from being more than max_size
|
| 179 |
+
if np.round(resize * im_size_max) > self.max_size:
|
| 180 |
+
resize = float(self.max_size) / float(im_size_max)
|
| 181 |
+
resize = 1 if use_origin_size else resize
|
| 182 |
+
|
| 183 |
+
# resize
|
| 184 |
+
if resize != 1:
|
| 185 |
+
image = cv2.resize(image, None, None, fx=resize, fy=resize, interpolation=cv2.INTER_LINEAR)
|
| 186 |
+
|
| 187 |
+
# convert to torch.tensor format
|
| 188 |
+
# image -= (104, 117, 123)
|
| 189 |
+
image = image.transpose(2, 0, 1)
|
| 190 |
+
image = torch.from_numpy(image).unsqueeze(0)
|
| 191 |
+
|
| 192 |
+
return image, resize
|
| 193 |
+
|
| 194 |
+
def detect_faces(
|
| 195 |
+
self,
|
| 196 |
+
image,
|
| 197 |
+
conf_threshold=0.8,
|
| 198 |
+
nms_threshold=0.4,
|
| 199 |
+
use_origin_size=True,
|
| 200 |
+
):
|
| 201 |
+
"""
|
| 202 |
+
Params:
|
| 203 |
+
imgs: BGR image
|
| 204 |
+
"""
|
| 205 |
+
image, self.resize = self.transform(image, use_origin_size)
|
| 206 |
+
image = image.to(device)
|
| 207 |
+
if self.half_inference:
|
| 208 |
+
image = image.half()
|
| 209 |
+
image = image - self.mean_tensor
|
| 210 |
+
|
| 211 |
+
loc, conf, landmarks, priors = self.__detect_faces(image)
|
| 212 |
+
|
| 213 |
+
boxes = decode(loc.data.squeeze(0), priors.data, self.cfg['variance'])
|
| 214 |
+
boxes = boxes * self.scale / self.resize
|
| 215 |
+
boxes = boxes.cpu().numpy()
|
| 216 |
+
|
| 217 |
+
scores = conf.squeeze(0).data.cpu().numpy()[:, 1]
|
| 218 |
+
|
| 219 |
+
landmarks = decode_landm(landmarks.squeeze(0), priors, self.cfg['variance'])
|
| 220 |
+
landmarks = landmarks * self.scale1 / self.resize
|
| 221 |
+
landmarks = landmarks.cpu().numpy()
|
| 222 |
+
|
| 223 |
+
# ignore low scores
|
| 224 |
+
inds = np.where(scores > conf_threshold)[0]
|
| 225 |
+
boxes, landmarks, scores = boxes[inds], landmarks[inds], scores[inds]
|
| 226 |
+
|
| 227 |
+
# sort
|
| 228 |
+
order = scores.argsort()[::-1]
|
| 229 |
+
boxes, landmarks, scores = boxes[order], landmarks[order], scores[order]
|
| 230 |
+
|
| 231 |
+
# do NMS
|
| 232 |
+
bounding_boxes = np.hstack((boxes, scores[:, np.newaxis])).astype(np.float32, copy=False)
|
| 233 |
+
keep = py_cpu_nms(bounding_boxes, nms_threshold)
|
| 234 |
+
bounding_boxes, landmarks = bounding_boxes[keep, :], landmarks[keep]
|
| 235 |
+
# self.t['forward_pass'].toc()
|
| 236 |
+
# print(self.t['forward_pass'].average_time)
|
| 237 |
+
# import sys
|
| 238 |
+
# sys.stdout.flush()
|
| 239 |
+
return np.concatenate((bounding_boxes, landmarks), axis=1)
|
| 240 |
+
|
| 241 |
+
def __align_multi(self, image, boxes, landmarks, limit=None):
|
| 242 |
+
|
| 243 |
+
if len(boxes) < 1:
|
| 244 |
+
return [], []
|
| 245 |
+
|
| 246 |
+
if limit:
|
| 247 |
+
boxes = boxes[:limit]
|
| 248 |
+
landmarks = landmarks[:limit]
|
| 249 |
+
|
| 250 |
+
faces = []
|
| 251 |
+
for landmark in landmarks:
|
| 252 |
+
facial5points = [[landmark[2 * j], landmark[2 * j + 1]] for j in range(5)]
|
| 253 |
+
|
| 254 |
+
warped_face = warp_and_crop_face(np.array(image), facial5points, self.reference, crop_size=(112, 112))
|
| 255 |
+
faces.append(warped_face)
|
| 256 |
+
|
| 257 |
+
return np.concatenate((boxes, landmarks), axis=1), faces
|
| 258 |
+
|
| 259 |
+
def align_multi(self, img, conf_threshold=0.8, limit=None):
|
| 260 |
+
|
| 261 |
+
rlt = self.detect_faces(img, conf_threshold=conf_threshold)
|
| 262 |
+
boxes, landmarks = rlt[:, 0:5], rlt[:, 5:]
|
| 263 |
+
|
| 264 |
+
return self.__align_multi(img, boxes, landmarks, limit)
|
| 265 |
+
|
| 266 |
+
# batched detection
|
| 267 |
+
def batched_transform(self, frames, use_origin_size):
|
| 268 |
+
"""
|
| 269 |
+
Arguments:
|
| 270 |
+
frames: a list of PIL.Image, or torch.Tensor(shape=[n, h, w, c],
|
| 271 |
+
type=np.float32, BGR format).
|
| 272 |
+
use_origin_size: whether to use origin size.
|
| 273 |
+
"""
|
| 274 |
+
from_PIL = True if isinstance(frames[0], Image.Image) else False
|
| 275 |
+
|
| 276 |
+
# convert to opencv format
|
| 277 |
+
if from_PIL:
|
| 278 |
+
frames = [cv2.cvtColor(np.asarray(frame), cv2.COLOR_RGB2BGR) for frame in frames]
|
| 279 |
+
frames = np.asarray(frames, dtype=np.float32)
|
| 280 |
+
|
| 281 |
+
# testing scale
|
| 282 |
+
im_size_min = np.min(frames[0].shape[0:2])
|
| 283 |
+
im_size_max = np.max(frames[0].shape[0:2])
|
| 284 |
+
resize = float(self.target_size) / float(im_size_min)
|
| 285 |
+
|
| 286 |
+
# prevent bigger axis from being more than max_size
|
| 287 |
+
if np.round(resize * im_size_max) > self.max_size:
|
| 288 |
+
resize = float(self.max_size) / float(im_size_max)
|
| 289 |
+
resize = 1 if use_origin_size else resize
|
| 290 |
+
|
| 291 |
+
# resize
|
| 292 |
+
if resize != 1:
|
| 293 |
+
if not from_PIL:
|
| 294 |
+
frames = F.interpolate(frames, scale_factor=resize)
|
| 295 |
+
else:
|
| 296 |
+
frames = [
|
| 297 |
+
cv2.resize(frame, None, None, fx=resize, fy=resize, interpolation=cv2.INTER_LINEAR)
|
| 298 |
+
for frame in frames
|
| 299 |
+
]
|
| 300 |
+
|
| 301 |
+
# convert to torch.tensor format
|
| 302 |
+
if not from_PIL:
|
| 303 |
+
frames = frames.transpose(1, 2).transpose(1, 3).contiguous()
|
| 304 |
+
else:
|
| 305 |
+
frames = frames.transpose((0, 3, 1, 2))
|
| 306 |
+
frames = torch.from_numpy(frames)
|
| 307 |
+
|
| 308 |
+
return frames, resize
|
| 309 |
+
|
| 310 |
+
def batched_detect_faces(self, frames, conf_threshold=0.8, nms_threshold=0.4, use_origin_size=True):
|
| 311 |
+
"""
|
| 312 |
+
Arguments:
|
| 313 |
+
frames: a list of PIL.Image, or np.array(shape=[n, h, w, c],
|
| 314 |
+
type=np.uint8, BGR format).
|
| 315 |
+
conf_threshold: confidence threshold.
|
| 316 |
+
nms_threshold: nms threshold.
|
| 317 |
+
use_origin_size: whether to use origin size.
|
| 318 |
+
Returns:
|
| 319 |
+
final_bounding_boxes: list of np.array ([n_boxes, 5],
|
| 320 |
+
type=np.float32).
|
| 321 |
+
final_landmarks: list of np.array ([n_boxes, 10], type=np.float32).
|
| 322 |
+
"""
|
| 323 |
+
# self.t['forward_pass'].tic()
|
| 324 |
+
frames, self.resize = self.batched_transform(frames, use_origin_size)
|
| 325 |
+
frames = frames.to(device)
|
| 326 |
+
frames = frames - self.mean_tensor
|
| 327 |
+
|
| 328 |
+
b_loc, b_conf, b_landmarks, priors = self.__detect_faces(frames)
|
| 329 |
+
|
| 330 |
+
final_bounding_boxes, final_landmarks = [], []
|
| 331 |
+
|
| 332 |
+
# decode
|
| 333 |
+
priors = priors.unsqueeze(0)
|
| 334 |
+
b_loc = batched_decode(b_loc, priors, self.cfg['variance']) * self.scale / self.resize
|
| 335 |
+
b_landmarks = batched_decode_landm(b_landmarks, priors, self.cfg['variance']) * self.scale1 / self.resize
|
| 336 |
+
b_conf = b_conf[:, :, 1]
|
| 337 |
+
|
| 338 |
+
# index for selection
|
| 339 |
+
b_indice = b_conf > conf_threshold
|
| 340 |
+
|
| 341 |
+
# concat
|
| 342 |
+
b_loc_and_conf = torch.cat((b_loc, b_conf.unsqueeze(-1)), dim=2).float()
|
| 343 |
+
|
| 344 |
+
for pred, landm, inds in zip(b_loc_and_conf, b_landmarks, b_indice):
|
| 345 |
+
|
| 346 |
+
# ignore low scores
|
| 347 |
+
pred, landm = pred[inds, :], landm[inds, :]
|
| 348 |
+
if pred.shape[0] == 0:
|
| 349 |
+
final_bounding_boxes.append(np.array([], dtype=np.float32))
|
| 350 |
+
final_landmarks.append(np.array([], dtype=np.float32))
|
| 351 |
+
continue
|
| 352 |
+
|
| 353 |
+
# sort
|
| 354 |
+
# order = score.argsort(descending=True)
|
| 355 |
+
# box, landm, score = box[order], landm[order], score[order]
|
| 356 |
+
|
| 357 |
+
# to CPU
|
| 358 |
+
bounding_boxes, landm = pred.cpu().numpy(), landm.cpu().numpy()
|
| 359 |
+
|
| 360 |
+
# NMS
|
| 361 |
+
keep = py_cpu_nms(bounding_boxes, nms_threshold)
|
| 362 |
+
bounding_boxes, landmarks = bounding_boxes[keep, :], landm[keep]
|
| 363 |
+
|
| 364 |
+
# append
|
| 365 |
+
final_bounding_boxes.append(bounding_boxes)
|
| 366 |
+
final_landmarks.append(landmarks)
|
| 367 |
+
# self.t['forward_pass'].toc(average=True)
|
| 368 |
+
# self.batch_time += self.t['forward_pass'].diff
|
| 369 |
+
# self.total_frame += len(frames)
|
| 370 |
+
# print(self.batch_time / self.total_frame)
|
| 371 |
+
|
| 372 |
+
return final_bounding_boxes, final_landmarks
|
facelib/detection/retinaface/retinaface_net.py
ADDED
|
@@ -0,0 +1,196 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import torch
|
| 2 |
+
import torch.nn as nn
|
| 3 |
+
import torch.nn.functional as F
|
| 4 |
+
|
| 5 |
+
|
| 6 |
+
def conv_bn(inp, oup, stride=1, leaky=0):
|
| 7 |
+
return nn.Sequential(
|
| 8 |
+
nn.Conv2d(inp, oup, 3, stride, 1, bias=False), nn.BatchNorm2d(oup),
|
| 9 |
+
nn.LeakyReLU(negative_slope=leaky, inplace=True))
|
| 10 |
+
|
| 11 |
+
|
| 12 |
+
def conv_bn_no_relu(inp, oup, stride):
|
| 13 |
+
return nn.Sequential(
|
| 14 |
+
nn.Conv2d(inp, oup, 3, stride, 1, bias=False),
|
| 15 |
+
nn.BatchNorm2d(oup),
|
| 16 |
+
)
|
| 17 |
+
|
| 18 |
+
|
| 19 |
+
def conv_bn1X1(inp, oup, stride, leaky=0):
|
| 20 |
+
return nn.Sequential(
|
| 21 |
+
nn.Conv2d(inp, oup, 1, stride, padding=0, bias=False), nn.BatchNorm2d(oup),
|
| 22 |
+
nn.LeakyReLU(negative_slope=leaky, inplace=True))
|
| 23 |
+
|
| 24 |
+
|
| 25 |
+
def conv_dw(inp, oup, stride, leaky=0.1):
|
| 26 |
+
return nn.Sequential(
|
| 27 |
+
nn.Conv2d(inp, inp, 3, stride, 1, groups=inp, bias=False),
|
| 28 |
+
nn.BatchNorm2d(inp),
|
| 29 |
+
nn.LeakyReLU(negative_slope=leaky, inplace=True),
|
| 30 |
+
nn.Conv2d(inp, oup, 1, 1, 0, bias=False),
|
| 31 |
+
nn.BatchNorm2d(oup),
|
| 32 |
+
nn.LeakyReLU(negative_slope=leaky, inplace=True),
|
| 33 |
+
)
|
| 34 |
+
|
| 35 |
+
|
| 36 |
+
class SSH(nn.Module):
|
| 37 |
+
|
| 38 |
+
def __init__(self, in_channel, out_channel):
|
| 39 |
+
super(SSH, self).__init__()
|
| 40 |
+
assert out_channel % 4 == 0
|
| 41 |
+
leaky = 0
|
| 42 |
+
if (out_channel <= 64):
|
| 43 |
+
leaky = 0.1
|
| 44 |
+
self.conv3X3 = conv_bn_no_relu(in_channel, out_channel // 2, stride=1)
|
| 45 |
+
|
| 46 |
+
self.conv5X5_1 = conv_bn(in_channel, out_channel // 4, stride=1, leaky=leaky)
|
| 47 |
+
self.conv5X5_2 = conv_bn_no_relu(out_channel // 4, out_channel // 4, stride=1)
|
| 48 |
+
|
| 49 |
+
self.conv7X7_2 = conv_bn(out_channel // 4, out_channel // 4, stride=1, leaky=leaky)
|
| 50 |
+
self.conv7x7_3 = conv_bn_no_relu(out_channel // 4, out_channel // 4, stride=1)
|
| 51 |
+
|
| 52 |
+
def forward(self, input):
|
| 53 |
+
conv3X3 = self.conv3X3(input)
|
| 54 |
+
|
| 55 |
+
conv5X5_1 = self.conv5X5_1(input)
|
| 56 |
+
conv5X5 = self.conv5X5_2(conv5X5_1)
|
| 57 |
+
|
| 58 |
+
conv7X7_2 = self.conv7X7_2(conv5X5_1)
|
| 59 |
+
conv7X7 = self.conv7x7_3(conv7X7_2)
|
| 60 |
+
|
| 61 |
+
out = torch.cat([conv3X3, conv5X5, conv7X7], dim=1)
|
| 62 |
+
out = F.relu(out)
|
| 63 |
+
return out
|
| 64 |
+
|
| 65 |
+
|
| 66 |
+
class FPN(nn.Module):
|
| 67 |
+
|
| 68 |
+
def __init__(self, in_channels_list, out_channels):
|
| 69 |
+
super(FPN, self).__init__()
|
| 70 |
+
leaky = 0
|
| 71 |
+
if (out_channels <= 64):
|
| 72 |
+
leaky = 0.1
|
| 73 |
+
self.output1 = conv_bn1X1(in_channels_list[0], out_channels, stride=1, leaky=leaky)
|
| 74 |
+
self.output2 = conv_bn1X1(in_channels_list[1], out_channels, stride=1, leaky=leaky)
|
| 75 |
+
self.output3 = conv_bn1X1(in_channels_list[2], out_channels, stride=1, leaky=leaky)
|
| 76 |
+
|
| 77 |
+
self.merge1 = conv_bn(out_channels, out_channels, leaky=leaky)
|
| 78 |
+
self.merge2 = conv_bn(out_channels, out_channels, leaky=leaky)
|
| 79 |
+
|
| 80 |
+
def forward(self, input):
|
| 81 |
+
# names = list(input.keys())
|
| 82 |
+
# input = list(input.values())
|
| 83 |
+
|
| 84 |
+
output1 = self.output1(input[0])
|
| 85 |
+
output2 = self.output2(input[1])
|
| 86 |
+
output3 = self.output3(input[2])
|
| 87 |
+
|
| 88 |
+
up3 = F.interpolate(output3, size=[output2.size(2), output2.size(3)], mode='nearest')
|
| 89 |
+
output2 = output2 + up3
|
| 90 |
+
output2 = self.merge2(output2)
|
| 91 |
+
|
| 92 |
+
up2 = F.interpolate(output2, size=[output1.size(2), output1.size(3)], mode='nearest')
|
| 93 |
+
output1 = output1 + up2
|
| 94 |
+
output1 = self.merge1(output1)
|
| 95 |
+
|
| 96 |
+
out = [output1, output2, output3]
|
| 97 |
+
return out
|
| 98 |
+
|
| 99 |
+
|
| 100 |
+
class MobileNetV1(nn.Module):
|
| 101 |
+
|
| 102 |
+
def __init__(self):
|
| 103 |
+
super(MobileNetV1, self).__init__()
|
| 104 |
+
self.stage1 = nn.Sequential(
|
| 105 |
+
conv_bn(3, 8, 2, leaky=0.1), # 3
|
| 106 |
+
conv_dw(8, 16, 1), # 7
|
| 107 |
+
conv_dw(16, 32, 2), # 11
|
| 108 |
+
conv_dw(32, 32, 1), # 19
|
| 109 |
+
conv_dw(32, 64, 2), # 27
|
| 110 |
+
conv_dw(64, 64, 1), # 43
|
| 111 |
+
)
|
| 112 |
+
self.stage2 = nn.Sequential(
|
| 113 |
+
conv_dw(64, 128, 2), # 43 + 16 = 59
|
| 114 |
+
conv_dw(128, 128, 1), # 59 + 32 = 91
|
| 115 |
+
conv_dw(128, 128, 1), # 91 + 32 = 123
|
| 116 |
+
conv_dw(128, 128, 1), # 123 + 32 = 155
|
| 117 |
+
conv_dw(128, 128, 1), # 155 + 32 = 187
|
| 118 |
+
conv_dw(128, 128, 1), # 187 + 32 = 219
|
| 119 |
+
)
|
| 120 |
+
self.stage3 = nn.Sequential(
|
| 121 |
+
conv_dw(128, 256, 2), # 219 +3 2 = 241
|
| 122 |
+
conv_dw(256, 256, 1), # 241 + 64 = 301
|
| 123 |
+
)
|
| 124 |
+
self.avg = nn.AdaptiveAvgPool2d((1, 1))
|
| 125 |
+
self.fc = nn.Linear(256, 1000)
|
| 126 |
+
|
| 127 |
+
def forward(self, x):
|
| 128 |
+
x = self.stage1(x)
|
| 129 |
+
x = self.stage2(x)
|
| 130 |
+
x = self.stage3(x)
|
| 131 |
+
x = self.avg(x)
|
| 132 |
+
# x = self.model(x)
|
| 133 |
+
x = x.view(-1, 256)
|
| 134 |
+
x = self.fc(x)
|
| 135 |
+
return x
|
| 136 |
+
|
| 137 |
+
|
| 138 |
+
class ClassHead(nn.Module):
|
| 139 |
+
|
| 140 |
+
def __init__(self, inchannels=512, num_anchors=3):
|
| 141 |
+
super(ClassHead, self).__init__()
|
| 142 |
+
self.num_anchors = num_anchors
|
| 143 |
+
self.conv1x1 = nn.Conv2d(inchannels, self.num_anchors * 2, kernel_size=(1, 1), stride=1, padding=0)
|
| 144 |
+
|
| 145 |
+
def forward(self, x):
|
| 146 |
+
out = self.conv1x1(x)
|
| 147 |
+
out = out.permute(0, 2, 3, 1).contiguous()
|
| 148 |
+
|
| 149 |
+
return out.view(out.shape[0], -1, 2)
|
| 150 |
+
|
| 151 |
+
|
| 152 |
+
class BboxHead(nn.Module):
|
| 153 |
+
|
| 154 |
+
def __init__(self, inchannels=512, num_anchors=3):
|
| 155 |
+
super(BboxHead, self).__init__()
|
| 156 |
+
self.conv1x1 = nn.Conv2d(inchannels, num_anchors * 4, kernel_size=(1, 1), stride=1, padding=0)
|
| 157 |
+
|
| 158 |
+
def forward(self, x):
|
| 159 |
+
out = self.conv1x1(x)
|
| 160 |
+
out = out.permute(0, 2, 3, 1).contiguous()
|
| 161 |
+
|
| 162 |
+
return out.view(out.shape[0], -1, 4)
|
| 163 |
+
|
| 164 |
+
|
| 165 |
+
class LandmarkHead(nn.Module):
|
| 166 |
+
|
| 167 |
+
def __init__(self, inchannels=512, num_anchors=3):
|
| 168 |
+
super(LandmarkHead, self).__init__()
|
| 169 |
+
self.conv1x1 = nn.Conv2d(inchannels, num_anchors * 10, kernel_size=(1, 1), stride=1, padding=0)
|
| 170 |
+
|
| 171 |
+
def forward(self, x):
|
| 172 |
+
out = self.conv1x1(x)
|
| 173 |
+
out = out.permute(0, 2, 3, 1).contiguous()
|
| 174 |
+
|
| 175 |
+
return out.view(out.shape[0], -1, 10)
|
| 176 |
+
|
| 177 |
+
|
| 178 |
+
def make_class_head(fpn_num=3, inchannels=64, anchor_num=2):
|
| 179 |
+
classhead = nn.ModuleList()
|
| 180 |
+
for i in range(fpn_num):
|
| 181 |
+
classhead.append(ClassHead(inchannels, anchor_num))
|
| 182 |
+
return classhead
|
| 183 |
+
|
| 184 |
+
|
| 185 |
+
def make_bbox_head(fpn_num=3, inchannels=64, anchor_num=2):
|
| 186 |
+
bboxhead = nn.ModuleList()
|
| 187 |
+
for i in range(fpn_num):
|
| 188 |
+
bboxhead.append(BboxHead(inchannels, anchor_num))
|
| 189 |
+
return bboxhead
|
| 190 |
+
|
| 191 |
+
|
| 192 |
+
def make_landmark_head(fpn_num=3, inchannels=64, anchor_num=2):
|
| 193 |
+
landmarkhead = nn.ModuleList()
|
| 194 |
+
for i in range(fpn_num):
|
| 195 |
+
landmarkhead.append(LandmarkHead(inchannels, anchor_num))
|
| 196 |
+
return landmarkhead
|
facelib/detection/retinaface/retinaface_utils.py
ADDED
|
@@ -0,0 +1,421 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
import numpy as np
|
| 2 |
+
import torch
|
| 3 |
+
import torchvision
|
| 4 |
+
from itertools import product as product
|
| 5 |
+
from math import ceil
|
| 6 |
+
|
| 7 |
+
|
| 8 |
+
class PriorBox(object):
|
| 9 |
+
|
| 10 |
+
def __init__(self, cfg, image_size=None, phase='train'):
|
| 11 |
+
super(PriorBox, self).__init__()
|
| 12 |
+
self.min_sizes = cfg['min_sizes']
|
| 13 |
+
self.steps = cfg['steps']
|
| 14 |
+
self.clip = cfg['clip']
|
| 15 |
+
self.image_size = image_size
|
| 16 |
+
self.feature_maps = [[ceil(self.image_size[0] / step), ceil(self.image_size[1] / step)] for step in self.steps]
|
| 17 |
+
self.name = 's'
|
| 18 |
+
|
| 19 |
+
def forward(self):
|
| 20 |
+
anchors = []
|
| 21 |
+
for k, f in enumerate(self.feature_maps):
|
| 22 |
+
min_sizes = self.min_sizes[k]
|
| 23 |
+
for i, j in product(range(f[0]), range(f[1])):
|
| 24 |
+
for min_size in min_sizes:
|
| 25 |
+
s_kx = min_size / self.image_size[1]
|
| 26 |
+
s_ky = min_size / self.image_size[0]
|
| 27 |
+
dense_cx = [x * self.steps[k] / self.image_size[1] for x in [j + 0.5]]
|
| 28 |
+
dense_cy = [y * self.steps[k] / self.image_size[0] for y in [i + 0.5]]
|
| 29 |
+
for cy, cx in product(dense_cy, dense_cx):
|
| 30 |
+
anchors += [cx, cy, s_kx, s_ky]
|
| 31 |
+
|
| 32 |
+
# back to torch land
|
| 33 |
+
output = torch.Tensor(anchors).view(-1, 4)
|
| 34 |
+
if self.clip:
|
| 35 |
+
output.clamp_(max=1, min=0)
|
| 36 |
+
return output
|
| 37 |
+
|
| 38 |
+
|
| 39 |
+
def py_cpu_nms(dets, thresh):
|
| 40 |
+
"""Pure Python NMS baseline."""
|
| 41 |
+
keep = torchvision.ops.nms(
|
| 42 |
+
boxes=torch.Tensor(dets[:, :4]),
|
| 43 |
+
scores=torch.Tensor(dets[:, 4]),
|
| 44 |
+
iou_threshold=thresh,
|
| 45 |
+
)
|
| 46 |
+
|
| 47 |
+
return list(keep)
|
| 48 |
+
|
| 49 |
+
|
| 50 |
+
def point_form(boxes):
|
| 51 |
+
""" Convert prior_boxes to (xmin, ymin, xmax, ymax)
|
| 52 |
+
representation for comparison to point form ground truth data.
|
| 53 |
+
Args:
|
| 54 |
+
boxes: (tensor) center-size default boxes from priorbox layers.
|
| 55 |
+
Return:
|
| 56 |
+
boxes: (tensor) Converted xmin, ymin, xmax, ymax form of boxes.
|
| 57 |
+
"""
|
| 58 |
+
return torch.cat(
|
| 59 |
+
(
|
| 60 |
+
boxes[:, :2] - boxes[:, 2:] / 2, # xmin, ymin
|
| 61 |
+
boxes[:, :2] + boxes[:, 2:] / 2),
|
| 62 |
+
1) # xmax, ymax
|
| 63 |
+
|
| 64 |
+
|
| 65 |
+
def center_size(boxes):
|
| 66 |
+
""" Convert prior_boxes to (cx, cy, w, h)
|
| 67 |
+
representation for comparison to center-size form ground truth data.
|
| 68 |
+
Args:
|
| 69 |
+
boxes: (tensor) point_form boxes
|
| 70 |
+
Return:
|
| 71 |
+
boxes: (tensor) Converted xmin, ymin, xmax, ymax form of boxes.
|
| 72 |
+
"""
|
| 73 |
+
return torch.cat(
|
| 74 |
+
(boxes[:, 2:] + boxes[:, :2]) / 2, # cx, cy
|
| 75 |
+
boxes[:, 2:] - boxes[:, :2],
|
| 76 |
+
1) # w, h
|
| 77 |
+
|
| 78 |
+
|
| 79 |
+
def intersect(box_a, box_b):
|
| 80 |
+
""" We resize both tensors to [A,B,2] without new malloc:
|
| 81 |
+
[A,2] -> [A,1,2] -> [A,B,2]
|
| 82 |
+
[B,2] -> [1,B,2] -> [A,B,2]
|
| 83 |
+
Then we compute the area of intersect between box_a and box_b.
|
| 84 |
+
Args:
|
| 85 |
+
box_a: (tensor) bounding boxes, Shape: [A,4].
|
| 86 |
+
box_b: (tensor) bounding boxes, Shape: [B,4].
|
| 87 |
+
Return:
|
| 88 |
+
(tensor) intersection area, Shape: [A,B].
|
| 89 |
+
"""
|
| 90 |
+
A = box_a.size(0)
|
| 91 |
+
B = box_b.size(0)
|
| 92 |
+
max_xy = torch.min(box_a[:, 2:].unsqueeze(1).expand(A, B, 2), box_b[:, 2:].unsqueeze(0).expand(A, B, 2))
|
| 93 |
+
min_xy = torch.max(box_a[:, :2].unsqueeze(1).expand(A, B, 2), box_b[:, :2].unsqueeze(0).expand(A, B, 2))
|
| 94 |
+
inter = torch.clamp((max_xy - min_xy), min=0)
|
| 95 |
+
return inter[:, :, 0] * inter[:, :, 1]
|
| 96 |
+
|
| 97 |
+
|
| 98 |
+
def jaccard(box_a, box_b):
|
| 99 |
+
"""Compute the jaccard overlap of two sets of boxes. The jaccard overlap
|
| 100 |
+
is simply the intersection over union of two boxes. Here we operate on
|
| 101 |
+
ground truth boxes and default boxes.
|
| 102 |
+
E.g.:
|
| 103 |
+
A ∩ B / A ∪ B = A ∩ B / (area(A) + area(B) - A ∩ B)
|
| 104 |
+
Args:
|
| 105 |
+
box_a: (tensor) Ground truth bounding boxes, Shape: [num_objects,4]
|
| 106 |
+
box_b: (tensor) Prior boxes from priorbox layers, Shape: [num_priors,4]
|
| 107 |
+
Return:
|
| 108 |
+
jaccard overlap: (tensor) Shape: [box_a.size(0), box_b.size(0)]
|
| 109 |
+
"""
|
| 110 |
+
inter = intersect(box_a, box_b)
|
| 111 |
+
area_a = ((box_a[:, 2] - box_a[:, 0]) * (box_a[:, 3] - box_a[:, 1])).unsqueeze(1).expand_as(inter) # [A,B]
|
| 112 |
+
area_b = ((box_b[:, 2] - box_b[:, 0]) * (box_b[:, 3] - box_b[:, 1])).unsqueeze(0).expand_as(inter) # [A,B]
|
| 113 |
+
union = area_a + area_b - inter
|
| 114 |
+
return inter / union # [A,B]
|
| 115 |
+
|
| 116 |
+
|
| 117 |
+
def matrix_iou(a, b):
|
| 118 |
+
"""
|
| 119 |
+
return iou of a and b, numpy version for data augenmentation
|
| 120 |
+
"""
|
| 121 |
+
lt = np.maximum(a[:, np.newaxis, :2], b[:, :2])
|
| 122 |
+
rb = np.minimum(a[:, np.newaxis, 2:], b[:, 2:])
|
| 123 |
+
|
| 124 |
+
area_i = np.prod(rb - lt, axis=2) * (lt < rb).all(axis=2)
|
| 125 |
+
area_a = np.prod(a[:, 2:] - a[:, :2], axis=1)
|
| 126 |
+
area_b = np.prod(b[:, 2:] - b[:, :2], axis=1)
|
| 127 |
+
return area_i / (area_a[:, np.newaxis] + area_b - area_i)
|
| 128 |
+
|
| 129 |
+
|
| 130 |
+
def matrix_iof(a, b):
|
| 131 |
+
"""
|
| 132 |
+
return iof of a and b, numpy version for data augenmentation
|
| 133 |
+
"""
|
| 134 |
+
lt = np.maximum(a[:, np.newaxis, :2], b[:, :2])
|
| 135 |
+
rb = np.minimum(a[:, np.newaxis, 2:], b[:, 2:])
|
| 136 |
+
|
| 137 |
+
area_i = np.prod(rb - lt, axis=2) * (lt < rb).all(axis=2)
|
| 138 |
+
area_a = np.prod(a[:, 2:] - a[:, :2], axis=1)
|
| 139 |
+
return area_i / np.maximum(area_a[:, np.newaxis], 1)
|
| 140 |
+
|
| 141 |
+
|
| 142 |
+
def match(threshold, truths, priors, variances, labels, landms, loc_t, conf_t, landm_t, idx):
|
| 143 |
+
"""Match each prior box with the ground truth box of the highest jaccard
|
| 144 |
+
overlap, encode the bounding boxes, then return the matched indices
|
| 145 |
+
corresponding to both confidence and location preds.
|
| 146 |
+
Args:
|
| 147 |
+
threshold: (float) The overlap threshold used when matching boxes.
|
| 148 |
+
truths: (tensor) Ground truth boxes, Shape: [num_obj, 4].
|
| 149 |
+
priors: (tensor) Prior boxes from priorbox layers, Shape: [n_priors,4].
|
| 150 |
+
variances: (tensor) Variances corresponding to each prior coord,
|
| 151 |
+
Shape: [num_priors, 4].
|
| 152 |
+
labels: (tensor) All the class labels for the image, Shape: [num_obj].
|
| 153 |
+
landms: (tensor) Ground truth landms, Shape [num_obj, 10].
|
| 154 |
+
loc_t: (tensor) Tensor to be filled w/ encoded location targets.
|
| 155 |
+
conf_t: (tensor) Tensor to be filled w/ matched indices for conf preds.
|
| 156 |
+
landm_t: (tensor) Tensor to be filled w/ encoded landm targets.
|
| 157 |
+
idx: (int) current batch index
|
| 158 |
+
Return:
|
| 159 |
+
The matched indices corresponding to 1)location 2)confidence
|
| 160 |
+
3)landm preds.
|
| 161 |
+
"""
|
| 162 |
+
# jaccard index
|
| 163 |
+
overlaps = jaccard(truths, point_form(priors))
|
| 164 |
+
# (Bipartite Matching)
|
| 165 |
+
# [1,num_objects] best prior for each ground truth
|
| 166 |
+
best_prior_overlap, best_prior_idx = overlaps.max(1, keepdim=True)
|
| 167 |
+
|
| 168 |
+
# ignore hard gt
|
| 169 |
+
valid_gt_idx = best_prior_overlap[:, 0] >= 0.2
|
| 170 |
+
best_prior_idx_filter = best_prior_idx[valid_gt_idx, :]
|
| 171 |
+
if best_prior_idx_filter.shape[0] <= 0:
|
| 172 |
+
loc_t[idx] = 0
|
| 173 |
+
conf_t[idx] = 0
|
| 174 |
+
return
|
| 175 |
+
|
| 176 |
+
# [1,num_priors] best ground truth for each prior
|
| 177 |
+
best_truth_overlap, best_truth_idx = overlaps.max(0, keepdim=True)
|
| 178 |
+
best_truth_idx.squeeze_(0)
|
| 179 |
+
best_truth_overlap.squeeze_(0)
|
| 180 |
+
best_prior_idx.squeeze_(1)
|
| 181 |
+
best_prior_idx_filter.squeeze_(1)
|
| 182 |
+
best_prior_overlap.squeeze_(1)
|
| 183 |
+
best_truth_overlap.index_fill_(0, best_prior_idx_filter, 2) # ensure best prior
|
| 184 |
+
# TODO refactor: index best_prior_idx with long tensor
|
| 185 |
+
# ensure every gt matches with its prior of max overlap
|
| 186 |
+
for j in range(best_prior_idx.size(0)): # 判别此anchor是预测哪一个boxes
|
| 187 |
+
best_truth_idx[best_prior_idx[j]] = j
|
| 188 |
+
matches = truths[best_truth_idx] # Shape: [num_priors,4] 此处为每一个anchor对应的bbox取出来
|
| 189 |
+
conf = labels[best_truth_idx] # Shape: [num_priors] 此处为每一个anchor对应的label取出来
|
| 190 |
+
conf[best_truth_overlap < threshold] = 0 # label as background overlap<0.35的全部作为负样本
|
| 191 |
+
loc = encode(matches, priors, variances)
|
| 192 |
+
|
| 193 |
+
matches_landm = landms[best_truth_idx]
|
| 194 |
+
landm = encode_landm(matches_landm, priors, variances)
|
| 195 |
+
loc_t[idx] = loc # [num_priors,4] encoded offsets to learn
|
| 196 |
+
conf_t[idx] = conf # [num_priors] top class label for each prior
|
| 197 |
+
landm_t[idx] = landm
|
| 198 |
+
|
| 199 |
+
|
| 200 |
+
def encode(matched, priors, variances):
|
| 201 |
+
"""Encode the variances from the priorbox layers into the ground truth boxes
|
| 202 |
+
we have matched (based on jaccard overlap) with the prior boxes.
|
| 203 |
+
Args:
|
| 204 |
+
matched: (tensor) Coords of ground truth for each prior in point-form
|
| 205 |
+
Shape: [num_priors, 4].
|
| 206 |
+
priors: (tensor) Prior boxes in center-offset form
|
| 207 |
+
Shape: [num_priors,4].
|
| 208 |
+
variances: (list[float]) Variances of priorboxes
|
| 209 |
+
Return:
|
| 210 |
+
encoded boxes (tensor), Shape: [num_priors, 4]
|
| 211 |
+
"""
|
| 212 |
+
|
| 213 |
+
# dist b/t match center and prior's center
|
| 214 |
+
g_cxcy = (matched[:, :2] + matched[:, 2:]) / 2 - priors[:, :2]
|
| 215 |
+
# encode variance
|
| 216 |
+
g_cxcy /= (variances[0] * priors[:, 2:])
|
| 217 |
+
# match wh / prior wh
|
| 218 |
+
g_wh = (matched[:, 2:] - matched[:, :2]) / priors[:, 2:]
|
| 219 |
+
g_wh = torch.log(g_wh) / variances[1]
|
| 220 |
+
# return target for smooth_l1_loss
|
| 221 |
+
return torch.cat([g_cxcy, g_wh], 1) # [num_priors,4]
|
| 222 |
+
|
| 223 |
+
|
| 224 |
+
def encode_landm(matched, priors, variances):
|
| 225 |
+
"""Encode the variances from the priorbox layers into the ground truth boxes
|
| 226 |
+
we have matched (based on jaccard overlap) with the prior boxes.
|
| 227 |
+
Args:
|
| 228 |
+
matched: (tensor) Coords of ground truth for each prior in point-form
|
| 229 |
+
Shape: [num_priors, 10].
|
| 230 |
+
priors: (tensor) Prior boxes in center-offset form
|
| 231 |
+
Shape: [num_priors,4].
|
| 232 |
+
variances: (list[float]) Variances of priorboxes
|
| 233 |
+
Return:
|
| 234 |
+
encoded landm (tensor), Shape: [num_priors, 10]
|
| 235 |
+
"""
|
| 236 |
+
|
| 237 |
+
# dist b/t match center and prior's center
|
| 238 |
+
matched = torch.reshape(matched, (matched.size(0), 5, 2))
|
| 239 |
+
priors_cx = priors[:, 0].unsqueeze(1).expand(matched.size(0), 5).unsqueeze(2)
|
| 240 |
+
priors_cy = priors[:, 1].unsqueeze(1).expand(matched.size(0), 5).unsqueeze(2)
|
| 241 |
+
priors_w = priors[:, 2].unsqueeze(1).expand(matched.size(0), 5).unsqueeze(2)
|
| 242 |
+
priors_h = priors[:, 3].unsqueeze(1).expand(matched.size(0), 5).unsqueeze(2)
|
| 243 |
+
priors = torch.cat([priors_cx, priors_cy, priors_w, priors_h], dim=2)
|
| 244 |
+
g_cxcy = matched[:, :, :2] - priors[:, :, :2]
|
| 245 |
+
# encode variance
|
| 246 |
+
g_cxcy /= (variances[0] * priors[:, :, 2:])
|
| 247 |
+
# g_cxcy /= priors[:, :, 2:]
|
| 248 |
+
g_cxcy = g_cxcy.reshape(g_cxcy.size(0), -1)
|
| 249 |
+
# return target for smooth_l1_loss
|
| 250 |
+
return g_cxcy
|
| 251 |
+
|
| 252 |
+
|
| 253 |
+
# Adapted from https://github.com/Hakuyume/chainer-ssd
|
| 254 |
+
def decode(loc, priors, variances):
|
| 255 |
+
"""Decode locations from predictions using priors to undo
|
| 256 |
+
the encoding we did for offset regression at train time.
|
| 257 |
+
Args:
|
| 258 |
+
loc (tensor): location predictions for loc layers,
|
| 259 |
+
Shape: [num_priors,4]
|
| 260 |
+
priors (tensor): Prior boxes in center-offset form.
|
| 261 |
+
Shape: [num_priors,4].
|
| 262 |
+
variances: (list[float]) Variances of priorboxes
|
| 263 |
+
Return:
|
| 264 |
+
decoded bounding box predictions
|
| 265 |
+
"""
|
| 266 |
+
|
| 267 |
+
boxes = torch.cat((priors[:, :2] + loc[:, :2] * variances[0] * priors[:, 2:],
|
| 268 |
+
priors[:, 2:] * torch.exp(loc[:, 2:] * variances[1])), 1)
|
| 269 |
+
boxes[:, :2] -= boxes[:, 2:] / 2
|
| 270 |
+
boxes[:, 2:] += boxes[:, :2]
|
| 271 |
+
return boxes
|
| 272 |
+
|
| 273 |
+
|
| 274 |
+
def decode_landm(pre, priors, variances):
|
| 275 |
+
"""Decode landm from predictions using priors to undo
|
| 276 |
+
the encoding we did for offset regression at train time.
|
| 277 |
+
Args:
|
| 278 |
+
pre (tensor): landm predictions for loc layers,
|
| 279 |
+
Shape: [num_priors,10]
|
| 280 |
+
priors (tensor): Prior boxes in center-offset form.
|
| 281 |
+
Shape: [num_priors,4].
|
| 282 |
+
variances: (list[float]) Variances of priorboxes
|
| 283 |
+
Return:
|
| 284 |
+
decoded landm predictions
|
| 285 |
+
"""
|
| 286 |
+
tmp = (
|
| 287 |
+
priors[:, :2] + pre[:, :2] * variances[0] * priors[:, 2:],
|
| 288 |
+
priors[:, :2] + pre[:, 2:4] * variances[0] * priors[:, 2:],
|
| 289 |
+
priors[:, :2] + pre[:, 4:6] * variances[0] * priors[:, 2:],
|
| 290 |
+
priors[:, :2] + pre[:, 6:8] * variances[0] * priors[:, 2:],
|
| 291 |
+
priors[:, :2] + pre[:, 8:10] * variances[0] * priors[:, 2:],
|
| 292 |
+
)
|
| 293 |
+
landms = torch.cat(tmp, dim=1)
|
| 294 |
+
return landms
|
| 295 |
+
|
| 296 |
+
|
| 297 |
+
def batched_decode(b_loc, priors, variances):
|
| 298 |
+
"""Decode locations from predictions using priors to undo
|
| 299 |
+
the encoding we did for offset regression at train time.
|
| 300 |
+
Args:
|
| 301 |
+
b_loc (tensor): location predictions for loc layers,
|
| 302 |
+
Shape: [num_batches,num_priors,4]
|
| 303 |
+
priors (tensor): Prior boxes in center-offset form.
|
| 304 |
+
Shape: [1,num_priors,4].
|
| 305 |
+
variances: (list[float]) Variances of priorboxes
|
| 306 |
+
Return:
|
| 307 |
+
decoded bounding box predictions
|
| 308 |
+
"""
|
| 309 |
+
boxes = (
|
| 310 |
+
priors[:, :, :2] + b_loc[:, :, :2] * variances[0] * priors[:, :, 2:],
|
| 311 |
+
priors[:, :, 2:] * torch.exp(b_loc[:, :, 2:] * variances[1]),
|
| 312 |
+
)
|
| 313 |
+
boxes = torch.cat(boxes, dim=2)
|
| 314 |
+
|
| 315 |
+
boxes[:, :, :2] -= boxes[:, :, 2:] / 2
|
| 316 |
+
boxes[:, :, 2:] += boxes[:, :, :2]
|
| 317 |
+
return boxes
|
| 318 |
+
|
| 319 |
+
|
| 320 |
+
def batched_decode_landm(pre, priors, variances):
|
| 321 |
+
"""Decode landm from predictions using priors to undo
|
| 322 |
+
the encoding we did for offset regression at train time.
|
| 323 |
+
Args:
|
| 324 |
+
pre (tensor): landm predictions for loc layers,
|
| 325 |
+
Shape: [num_batches,num_priors,10]
|
| 326 |
+
priors (tensor): Prior boxes in center-offset form.
|
| 327 |
+
Shape: [1,num_priors,4].
|
| 328 |
+
variances: (list[float]) Variances of priorboxes
|
| 329 |
+
Return:
|
| 330 |
+
decoded landm predictions
|
| 331 |
+
"""
|
| 332 |
+
landms = (
|
| 333 |
+
priors[:, :, :2] + pre[:, :, :2] * variances[0] * priors[:, :, 2:],
|
| 334 |
+
priors[:, :, :2] + pre[:, :, 2:4] * variances[0] * priors[:, :, 2:],
|
| 335 |
+
priors[:, :, :2] + pre[:, :, 4:6] * variances[0] * priors[:, :, 2:],
|
| 336 |
+
priors[:, :, :2] + pre[:, :, 6:8] * variances[0] * priors[:, :, 2:],
|
| 337 |
+
priors[:, :, :2] + pre[:, :, 8:10] * variances[0] * priors[:, :, 2:],
|
| 338 |
+
)
|
| 339 |
+
landms = torch.cat(landms, dim=2)
|
| 340 |
+
return landms
|
| 341 |
+
|
| 342 |
+
|
| 343 |
+
def log_sum_exp(x):
|
| 344 |
+
"""Utility function for computing log_sum_exp while determining
|
| 345 |
+
This will be used to determine unaveraged confidence loss across
|
| 346 |
+
all examples in a batch.
|
| 347 |
+
Args:
|
| 348 |
+
x (Variable(tensor)): conf_preds from conf layers
|
| 349 |
+
"""
|
| 350 |
+
x_max = x.data.max()
|
| 351 |
+
return torch.log(torch.sum(torch.exp(x - x_max), 1, keepdim=True)) + x_max
|
| 352 |
+
|
| 353 |
+
|
| 354 |
+
# Original author: Francisco Massa:
|
| 355 |
+
# https://github.com/fmassa/object-detection.torch
|
| 356 |
+
# Ported to PyTorch by Max deGroot (02/01/2017)
|
| 357 |
+
def nms(boxes, scores, overlap=0.5, top_k=200):
|
| 358 |
+
"""Apply non-maximum suppression at test time to avoid detecting too many
|
| 359 |
+
overlapping bounding boxes for a given object.
|
| 360 |
+
Args:
|
| 361 |
+
boxes: (tensor) The location preds for the img, Shape: [num_priors,4].
|
| 362 |
+
scores: (tensor) The class predscores for the img, Shape:[num_priors].
|
| 363 |
+
overlap: (float) The overlap thresh for suppressing unnecessary boxes.
|
| 364 |
+
top_k: (int) The Maximum number of box preds to consider.
|
| 365 |
+
Return:
|
| 366 |
+
The indices of the kept boxes with respect to num_priors.
|
| 367 |
+
"""
|
| 368 |
+
|
| 369 |
+
keep = torch.Tensor(scores.size(0)).fill_(0).long()
|
| 370 |
+
if boxes.numel() == 0:
|
| 371 |
+
return keep
|
| 372 |
+
x1 = boxes[:, 0]
|
| 373 |
+
y1 = boxes[:, 1]
|
| 374 |
+
x2 = boxes[:, 2]
|
| 375 |
+
y2 = boxes[:, 3]
|
| 376 |
+
area = torch.mul(x2 - x1, y2 - y1)
|
| 377 |
+
v, idx = scores.sort(0) # sort in ascending order
|
| 378 |
+
# I = I[v >= 0.01]
|
| 379 |
+
idx = idx[-top_k:] # indices of the top-k largest vals
|
| 380 |
+
xx1 = boxes.new()
|
| 381 |
+
yy1 = boxes.new()
|
| 382 |
+
xx2 = boxes.new()
|
| 383 |
+
yy2 = boxes.new()
|
| 384 |
+
w = boxes.new()
|
| 385 |
+
h = boxes.new()
|
| 386 |
+
|
| 387 |
+
# keep = torch.Tensor()
|
| 388 |
+
count = 0
|
| 389 |
+
while idx.numel() > 0:
|
| 390 |
+
i = idx[-1] # index of current largest val
|
| 391 |
+
# keep.append(i)
|
| 392 |
+
keep[count] = i
|
| 393 |
+
count += 1
|
| 394 |
+
if idx.size(0) == 1:
|
| 395 |
+
break
|
| 396 |
+
idx = idx[:-1] # remove kept element from view
|
| 397 |
+
# load bboxes of next highest vals
|
| 398 |
+
torch.index_select(x1, 0, idx, out=xx1)
|
| 399 |
+
torch.index_select(y1, 0, idx, out=yy1)
|
| 400 |
+
torch.index_select(x2, 0, idx, out=xx2)
|
| 401 |
+
torch.index_select(y2, 0, idx, out=yy2)
|
| 402 |
+
# store element-wise max with next highest score
|
| 403 |
+
xx1 = torch.clamp(xx1, min=x1[i])
|
| 404 |
+
yy1 = torch.clamp(yy1, min=y1[i])
|
| 405 |
+
xx2 = torch.clamp(xx2, max=x2[i])
|
| 406 |
+
yy2 = torch.clamp(yy2, max=y2[i])
|
| 407 |
+
w.resize_as_(xx2)
|
| 408 |
+
h.resize_as_(yy2)
|
| 409 |
+
w = xx2 - xx1
|
| 410 |
+
h = yy2 - yy1
|
| 411 |
+
# check sizes of xx1 and xx2.. after each iteration
|
| 412 |
+
w = torch.clamp(w, min=0.0)
|
| 413 |
+
h = torch.clamp(h, min=0.0)
|
| 414 |
+
inter = w * h
|
| 415 |
+
# IoU = i / (area(a) + area(b) - i)
|
| 416 |
+
rem_areas = torch.index_select(area, 0, idx) # load remaining areas)
|
| 417 |
+
union = (rem_areas - inter) + area[i]
|
| 418 |
+
IoU = inter / union # store result in iou
|
| 419 |
+
# keep only elements with an IoU <= overlap
|
| 420 |
+
idx = idx[IoU.le(overlap)]
|
| 421 |
+
return keep, count
|