Chris Leo commited on
scorevision: push artifact
Browse files
miner.py
CHANGED
|
@@ -1,24 +1,19 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
"""
|
| 2 |
-
|
| 3 |
-
|
| 4 |
-
Beats the published king (`manak0/Detect-crime` baseline, score 0.576) by:
|
| 5 |
-
|
| 6 |
-
1. Letterboxed input at 1280 (king stretch-resizes to 640, destroying small objects).
|
| 7 |
-
2. Per-class confidence floors for the four catastrophic classes
|
| 8 |
-
(balaclava, bat, glove, spray paint each had recall < 0.16 in the king's benchmark).
|
| 9 |
-
3. Multi-scale TTA: {1280, 1536} x {orig, hflip} with class-aware Weighted Box Fusion.
|
| 10 |
-
4. CLAHE on dark frames only (luma gate). CCTV crime footage is heavily night-time.
|
| 11 |
-
5. Class-aware NMS at IoU=0.45 (king is class-agnostic, suppresses balaclava-on-hoodie
|
| 12 |
-
and glove-near-bat overlaps).
|
| 13 |
-
6. Robust ONNX output decoding for both raw YOLO `[1, 4+nc, N]` (king's export) and
|
| 14 |
-
NMS-baked `[N, 6]` / `[1, N, 6]` (our export) formats.
|
| 15 |
-
|
| 16 |
-
Self-contained: only stdlib + pip packages (cv2, numpy, onnxruntime, pydantic). No imports
|
| 17 |
-
from sibling files in the HF repo (chute import sandbox blocks those).
|
| 18 |
-
"""
|
| 19 |
|
| 20 |
-
from pathlib import Path
|
| 21 |
import math
|
|
|
|
|
|
|
| 22 |
|
| 23 |
import cv2
|
| 24 |
import numpy as np
|
|
@@ -27,6 +22,34 @@ from numpy import ndarray
|
|
| 27 |
from pydantic import BaseModel
|
| 28 |
|
| 29 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 30 |
class BoundingBox(BaseModel):
|
| 31 |
x1: int
|
| 32 |
y1: int
|
|
@@ -42,350 +65,420 @@ class TVFrameResult(BaseModel):
|
|
| 42 |
keypoints: list[tuple[int, int]]
|
| 43 |
|
| 44 |
|
| 45 |
-
|
| 46 |
-
|
| 47 |
-
|
| 48 |
-
|
| 49 |
-
|
| 50 |
-
|
| 51 |
-
|
| 52 |
-
|
| 53 |
-
|
| 54 |
-
|
| 55 |
-
|
| 56 |
-
|
| 57 |
-
|
| 58 |
-
|
| 59 |
-
|
| 60 |
-
|
| 61 |
-
|
| 62 |
-
|
| 63 |
-
|
| 64 |
-
|
| 65 |
-
|
| 66 |
-
|
| 67 |
-
|
| 68 |
-
|
| 69 |
-
|
| 70 |
-
|
| 71 |
-
|
| 72 |
-
|
| 73 |
-
|
| 74 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 75 |
class Miner:
|
| 76 |
def __init__(self, path_hf_repo: Path) -> None:
|
| 77 |
model_path = path_hf_repo / "weights.onnx"
|
| 78 |
-
|
| 79 |
-
|
| 80 |
-
|
| 81 |
-
|
| 82 |
-
|
| 83 |
-
|
| 84 |
-
if len(order) == len(self.class_names) and set(order) == set(self.class_names):
|
| 85 |
-
self.cls_remap = np.array(
|
| 86 |
-
[self.class_names.index(n) for n in order], dtype=np.int32
|
| 87 |
-
)
|
| 88 |
-
else:
|
| 89 |
-
self.cls_remap = np.arange(len(self.class_names), dtype=np.int32)
|
| 90 |
-
else:
|
| 91 |
-
self.cls_remap = np.arange(len(self.class_names), dtype=np.int32)
|
| 92 |
|
| 93 |
-
|
| 94 |
-
|
| 95 |
try:
|
| 96 |
self.session = ort.InferenceSession(
|
| 97 |
-
str(model_path),
|
| 98 |
-
sess_options=sess_options,
|
| 99 |
providers=["CUDAExecutionProvider", "CPUExecutionProvider"],
|
| 100 |
)
|
| 101 |
-
except Exception:
|
|
|
|
| 102 |
self.session = ort.InferenceSession(
|
| 103 |
-
str(model_path),
|
| 104 |
-
sess_options=sess_options,
|
| 105 |
-
providers=["CPUExecutionProvider"],
|
| 106 |
)
|
|
|
|
| 107 |
|
| 108 |
self.input_name = self.session.get_inputs()[0].name
|
| 109 |
self.output_names = [o.name for o in self.session.get_outputs()]
|
| 110 |
-
|
| 111 |
-
|
| 112 |
-
self.
|
| 113 |
-
self.
|
| 114 |
-
|
| 115 |
-
|
| 116 |
-
|
| 117 |
-
|
| 118 |
-
|
| 119 |
-
|
| 120 |
-
|
| 121 |
-
|
| 122 |
-
|
| 123 |
-
|
| 124 |
-
self.
|
| 125 |
-
|
| 126 |
-
|
| 127 |
-
|
| 128 |
-
|
| 129 |
-
|
| 130 |
-
|
| 131 |
-
return f"CrimeMiner(providers={self.session.get_providers()})"
|
| 132 |
-
|
| 133 |
-
# ------------------------------------------------------------------ utils
|
| 134 |
|
| 135 |
@staticmethod
|
| 136 |
-
def
|
|
|
|
|
|
|
|
|
|
|
|
|
| 137 |
h, w = image.shape[:2]
|
| 138 |
-
|
|
|
|
| 139 |
rw, rh = int(round(w * ratio)), int(round(h * ratio))
|
| 140 |
if (rw, rh) != (w, h):
|
| 141 |
-
interp = cv2.
|
| 142 |
image = cv2.resize(image, (rw, rh), interpolation=interp)
|
| 143 |
-
dw, dh = (
|
| 144 |
-
|
| 145 |
-
|
| 146 |
-
padded = cv2.copyMakeBorder(image,
|
| 147 |
return padded, ratio, (dw, dh)
|
| 148 |
|
| 149 |
-
def
|
| 150 |
-
|
| 151 |
-
|
| 152 |
-
|
| 153 |
-
|
| 154 |
-
|
| 155 |
-
|
| 156 |
-
|
| 157 |
-
|
| 158 |
-
@staticmethod
|
| 159 |
-
def _xywh_to_xyxy(b: np.ndarray) -> np.ndarray:
|
| 160 |
-
out = np.empty_like(b)
|
| 161 |
-
out[:, 0] = b[:, 0] - b[:, 2] / 2.0
|
| 162 |
-
out[:, 1] = b[:, 1] - b[:, 3] / 2.0
|
| 163 |
-
out[:, 2] = b[:, 0] + b[:, 2] / 2.0
|
| 164 |
-
out[:, 3] = b[:, 1] + b[:, 3] / 2.0
|
| 165 |
-
return out
|
| 166 |
-
|
| 167 |
-
# ------------------------------------------------------------------ ONNX
|
| 168 |
-
|
| 169 |
-
def _preprocess(self, image_bgr: ndarray, size: int) -> tuple[np.ndarray, float, tuple[float, float]]:
|
| 170 |
-
img, ratio, pad = self._letterbox(image_bgr, size)
|
| 171 |
img = cv2.cvtColor(img, cv2.COLOR_BGR2RGB)
|
| 172 |
img = img.astype(np.float32) / 255.0
|
| 173 |
img = np.transpose(img, (2, 0, 1))[None, ...]
|
| 174 |
-
|
| 175 |
-
|
| 176 |
-
|
| 177 |
-
|
| 178 |
-
|
| 179 |
-
|
| 180 |
-
|
| 181 |
-
|
| 182 |
-
|
| 183 |
-
|
| 184 |
-
|
| 185 |
-
|
| 186 |
-
|
| 187 |
-
|
| 188 |
-
|
| 189 |
-
|
| 190 |
-
preds = output[0]
|
| 191 |
-
elif output.ndim == 2 and output.shape[1] == 6:
|
| 192 |
-
preds = output
|
| 193 |
-
else:
|
| 194 |
-
return self._decode_raw(output, ratio, pad, orig_w, orig_h, hflip)
|
| 195 |
-
|
| 196 |
-
boxes = preds[:, :4].astype(np.float32, copy=True)
|
| 197 |
scores = preds[:, 4].astype(np.float32)
|
| 198 |
cls_ids = preds[:, 5].astype(np.int32)
|
| 199 |
-
cls_ids = self.cls_remap[np.clip(cls_ids, 0, len(self.cls_remap) - 1)]
|
| 200 |
|
| 201 |
-
|
| 202 |
-
|
|
|
|
|
|
|
|
|
|
| 203 |
if len(boxes) == 0:
|
| 204 |
return boxes, scores, cls_ids
|
| 205 |
|
| 206 |
-
return self._unletterbox(boxes, scores, cls_ids, ratio, pad, orig_w, orig_h, hflip)
|
| 207 |
-
|
| 208 |
-
def _decode_raw(self, output: np.ndarray, ratio: float, pad: tuple[float, float],
|
| 209 |
-
orig_w: int, orig_h: int, hflip: bool) -> tuple[np.ndarray, np.ndarray, np.ndarray]:
|
| 210 |
-
# Raw ultralytics export: [1, C, N] where C = 4 + num_classes (king's case: [1, 10, 8400]).
|
| 211 |
-
if output.ndim != 3 or output.shape[0] != 1:
|
| 212 |
-
return np.zeros((0, 4), np.float32), np.zeros(0, np.float32), np.zeros(0, np.int32)
|
| 213 |
-
preds = output[0]
|
| 214 |
-
# Normalize to [N, C].
|
| 215 |
-
if preds.shape[0] <= 16 and preds.shape[1] > preds.shape[0]:
|
| 216 |
-
preds = preds.T
|
| 217 |
-
if preds.shape[1] < 5:
|
| 218 |
-
return np.zeros((0, 4), np.float32), np.zeros(0, np.float32), np.zeros(0, np.int32)
|
| 219 |
-
|
| 220 |
-
boxes_xywh = preds[:, :4].astype(np.float32)
|
| 221 |
-
cls_part = preds[:, 4:].astype(np.float32)
|
| 222 |
-
if cls_part.shape[1] == 1:
|
| 223 |
-
scores = cls_part[:, 0]
|
| 224 |
-
cls_ids = np.zeros(len(scores), dtype=np.int32)
|
| 225 |
-
else:
|
| 226 |
-
cls_ids = np.argmax(cls_part, axis=1).astype(np.int32)
|
| 227 |
-
scores = cls_part[np.arange(len(cls_part)), cls_ids]
|
| 228 |
-
cls_ids = self.cls_remap[np.clip(cls_ids, 0, len(self.cls_remap) - 1)]
|
| 229 |
-
|
| 230 |
-
# Coarse pre-filter: any class above its own floor (or at least 0.03 to keep the path
|
| 231 |
-
# light for the four catastrophic classes).
|
| 232 |
-
floors = np.array([PER_CLASS_CONF.get(int(c), 0.20) for c in cls_ids], dtype=np.float32)
|
| 233 |
-
keep = scores >= np.minimum(floors, 0.03)
|
| 234 |
-
if not np.any(keep):
|
| 235 |
-
return np.zeros((0, 4), np.float32), np.zeros(0, np.float32), np.zeros(0, np.int32)
|
| 236 |
-
boxes_xywh = boxes_xywh[keep]
|
| 237 |
-
scores = scores[keep]
|
| 238 |
-
cls_ids = cls_ids[keep]
|
| 239 |
-
|
| 240 |
-
boxes = self._xywh_to_xyxy(boxes_xywh)
|
| 241 |
-
return self._unletterbox(boxes, scores, cls_ids, ratio, pad, orig_w, orig_h, hflip)
|
| 242 |
-
|
| 243 |
-
@staticmethod
|
| 244 |
-
def _unletterbox(boxes: np.ndarray, scores: np.ndarray, cls_ids: np.ndarray,
|
| 245 |
-
ratio: float, pad: tuple[float, float], orig_w: int, orig_h: int,
|
| 246 |
-
hflip: bool) -> tuple[np.ndarray, np.ndarray, np.ndarray]:
|
| 247 |
-
boxes = boxes.copy()
|
| 248 |
boxes[:, [0, 2]] -= pad[0]
|
| 249 |
boxes[:, [1, 3]] -= pad[1]
|
| 250 |
-
boxes /= ratio
|
| 251 |
-
|
| 252 |
-
|
| 253 |
-
|
| 254 |
-
|
| 255 |
-
|
| 256 |
-
|
| 257 |
-
|
| 258 |
-
boxes[:, 2] = np.clip(boxes[:, 2], 0,
|
| 259 |
-
boxes[:, 3] = np.clip(boxes[:, 3], 0,
|
| 260 |
-
return boxes, scores, cls_ids
|
| 261 |
-
|
| 262 |
-
# ------------------------------------------------------------------ fusion
|
| 263 |
|
| 264 |
@staticmethod
|
| 265 |
-
def
|
| 266 |
-
if len(
|
| 267 |
-
return
|
| 268 |
-
|
| 269 |
-
|
| 270 |
-
|
| 271 |
-
|
| 272 |
-
|
| 273 |
-
|
| 274 |
-
|
| 275 |
-
|
| 276 |
-
area_b = (x22 - x21) * (y22 - y21)
|
| 277 |
-
return inter / (area_a + area_b - inter + 1e-7)
|
| 278 |
-
|
| 279 |
-
def _wbf(self, boxes: np.ndarray, scores: np.ndarray, cls_ids: np.ndarray,
|
| 280 |
-
iou_thresh: float = WBF_IOU) -> tuple[np.ndarray, np.ndarray, np.ndarray]:
|
| 281 |
-
"""Class-aware Weighted Box Fusion: inside each class cluster, kept box is the
|
| 282 |
-
score-weighted average; cluster score is max member score (preserves AP rank).
|
| 283 |
-
"""
|
| 284 |
if len(boxes) == 0:
|
| 285 |
return boxes, scores, cls_ids
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 286 |
|
| 287 |
-
|
| 288 |
-
|
| 289 |
-
|
| 290 |
-
|
| 291 |
-
|
| 292 |
-
|
| 293 |
-
|
| 294 |
-
|
| 295 |
-
|
| 296 |
-
|
| 297 |
-
|
| 298 |
-
|
| 299 |
-
|
| 300 |
-
|
| 301 |
-
|
| 302 |
-
|
| 303 |
-
|
| 304 |
-
|
| 305 |
-
|
| 306 |
-
|
| 307 |
-
|
| 308 |
-
|
| 309 |
-
|
| 310 |
-
|
| 311 |
-
|
| 312 |
-
|
| 313 |
-
|
| 314 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
| 315 |
if len(boxes) == 0:
|
| 316 |
return boxes, scores, cls_ids
|
| 317 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 318 |
for c in np.unique(cls_ids):
|
| 319 |
-
|
| 320 |
-
|
| 321 |
-
|
| 322 |
-
|
| 323 |
-
|
| 324 |
-
|
| 325 |
-
|
| 326 |
-
|
| 327 |
-
|
| 328 |
-
|
| 329 |
-
|
| 330 |
-
|
| 331 |
-
|
| 332 |
-
|
| 333 |
-
|
| 334 |
-
|
| 335 |
-
|
| 336 |
-
|
| 337 |
-
|
| 338 |
-
|
| 339 |
-
|
| 340 |
-
|
| 341 |
-
|
| 342 |
-
|
| 343 |
-
all_boxes, all_scores, all_cls = [], [], []
|
| 344 |
-
for size in self._tta_sizes:
|
| 345 |
-
for hflip in ((False, True) if TTA_HFLIP else (False,)):
|
| 346 |
-
output, ratio, pad = self._run_session(enhanced, size, hflip)
|
| 347 |
-
boxes, scores, cls_ids = self._decode(output, ratio, pad, w, h, hflip)
|
| 348 |
-
if len(boxes):
|
| 349 |
-
all_boxes.append(boxes)
|
| 350 |
-
all_scores.append(scores)
|
| 351 |
-
all_cls.append(cls_ids)
|
| 352 |
-
|
| 353 |
-
if not all_boxes:
|
| 354 |
-
return []
|
| 355 |
|
| 356 |
-
|
| 357 |
-
|
| 358 |
-
cls_ids = np.concatenate(all_cls, axis=0)
|
| 359 |
|
| 360 |
-
|
| 361 |
-
|
| 362 |
-
|
| 363 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
| 364 |
if len(boxes) == 0:
|
| 365 |
return []
|
| 366 |
|
| 367 |
-
#
|
| 368 |
-
|
| 369 |
-
boxes
|
| 370 |
-
|
| 371 |
-
|
| 372 |
-
order = np.argsort(-scores)[:MAX_DET]
|
| 373 |
-
boxes, scores, cls_ids = boxes[order], scores[order], cls_ids[order]
|
| 374 |
|
| 375 |
-
|
| 376 |
-
|
| 377 |
-
|
| 378 |
-
|
| 379 |
-
|
| 380 |
-
|
| 381 |
-
|
| 382 |
-
|
| 383 |
-
|
| 384 |
-
|
| 385 |
-
|
| 386 |
-
|
| 387 |
-
))
|
| 388 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 389 |
|
| 390 |
def predict_batch(
|
| 391 |
self,
|
|
@@ -398,7 +491,7 @@ class Miner:
|
|
| 398 |
try:
|
| 399 |
boxes = self._predict_one(image)
|
| 400 |
except Exception as e:
|
| 401 |
-
print(f"
|
| 402 |
boxes = []
|
| 403 |
results.append(TVFrameResult(
|
| 404 |
frame_id=offset + i,
|
|
@@ -406,22 +499,3 @@ class Miner:
|
|
| 406 |
keypoints=[(0, 0) for _ in range(max(0, int(n_keypoints)))],
|
| 407 |
))
|
| 408 |
return results
|
| 409 |
-
|
| 410 |
-
|
| 411 |
-
if __name__ == "__main__":
|
| 412 |
-
# Smoke test against any image in /tmp/crime_proof.png or weights.onnx-adjacent test.png.
|
| 413 |
-
import sys
|
| 414 |
-
repo_dir = Path(__file__).parent
|
| 415 |
-
miner = Miner(repo_dir)
|
| 416 |
-
candidates = [Path("/tmp/crime_proof.png"), repo_dir / "test.png"]
|
| 417 |
-
img_path = next((p for p in candidates if p.exists()), None)
|
| 418 |
-
if img_path is None:
|
| 419 |
-
print("no test image found; place one at /tmp/crime_proof.png and rerun")
|
| 420 |
-
sys.exit(0)
|
| 421 |
-
img = cv2.imread(str(img_path), cv2.IMREAD_COLOR)
|
| 422 |
-
out = miner.predict_batch([img], offset=0, n_keypoints=0)
|
| 423 |
-
for f in out:
|
| 424 |
-
print(f"frame {f.frame_id}: {len(f.boxes)} boxes")
|
| 425 |
-
for b in f.boxes:
|
| 426 |
-
print(f" cls={b.cls_id} ({TARGET_CLASS_NAMES[b.cls_id]}) conf={b.conf:.3f} "
|
| 427 |
-
f"box=({b.x1},{b.y1},{b.x2},{b.y2})")
|
|
|
|
| 1 |
+
"""manak0/Detect-crime miner — 3-view TTA + Weighted Box Fusion.
|
| 2 |
+
|
| 3 |
+
Same interface as king's miner.py (Miner.predict_batch returns list[TVFrameResult]).
|
| 4 |
+
Differences vs king:
|
| 5 |
+
• 3 forward views: orig 1280, hflip 1280, zoomed 1408 (re-letterboxed)
|
| 6 |
+
• WBF fusion across views (better than score-tier consensus for recall)
|
| 7 |
+
• Per-class confidence thresholds (calibrated on SAM3-distilled val)
|
| 8 |
+
• Same per-class NMS at IoU=0.35 + same sane-box filters as king
|
| 9 |
+
|
| 10 |
+
ONNX expected: input `images [1,3,H,W]`, output `[1, max_det, 6]` = (x1,y1,x2,y2,score,cls).
|
| 11 |
"""
|
| 12 |
+
from __future__ import annotations
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 13 |
|
|
|
|
| 14 |
import math
|
| 15 |
+
from pathlib import Path
|
| 16 |
+
from typing import Any
|
| 17 |
|
| 18 |
import cv2
|
| 19 |
import numpy as np
|
|
|
|
| 22 |
from pydantic import BaseModel
|
| 23 |
|
| 24 |
|
| 25 |
+
CRIME_CLASSES = ["balaclava", "hoodie", "glove", "bat", "spray paint", "graffiti"]
|
| 26 |
+
|
| 27 |
+
# Per-class confidence thresholds. Calibrated against the REAL validator
|
| 28 |
+
# challenge images (133 images pulled from public R2 response shards,
|
| 29 |
+
# scripts/05_calibrate_thresholds.py --val-dir dataset/real_chal/val).
|
| 30 |
+
# v2 fine-tuned on web+real_chal mix; this calibration on real_chal val:
|
| 31 |
+
# composite=0.571, map50=0.758, FP/img=1.09, fp_pillar=0.891.
|
| 32 |
+
# Compare: king on same val=0.233, coolroman=0.271.
|
| 33 |
+
PER_CLASS_CONF = np.array([
|
| 34 |
+
0.400, # balaclava
|
| 35 |
+
0.500, # hoodie
|
| 36 |
+
0.450, # glove
|
| 37 |
+
0.325, # bat
|
| 38 |
+
0.325, # spray paint
|
| 39 |
+
0.500, # graffiti
|
| 40 |
+
], dtype=np.float32)
|
| 41 |
+
|
| 42 |
+
# Per-class aspect-ratio constraint: keep box only if height/width >= ratio.
|
| 43 |
+
PER_CLASS_MIN_H_OVER_W: dict[int, float] = {}
|
| 44 |
+
|
| 45 |
+
# WBF parameters
|
| 46 |
+
WBF_IOU_THR = 0.55
|
| 47 |
+
WBF_SKIP_BOX_THR = 0.05 # below this, treat as no signal even pre-fusion
|
| 48 |
+
|
| 49 |
+
# View weights (orig, hflip, zoomed-1408)
|
| 50 |
+
VIEW_WEIGHTS = np.array([1.0, 1.0, 0.85], dtype=np.float32)
|
| 51 |
+
|
| 52 |
+
|
| 53 |
class BoundingBox(BaseModel):
|
| 54 |
x1: int
|
| 55 |
y1: int
|
|
|
|
| 65 |
keypoints: list[tuple[int, int]]
|
| 66 |
|
| 67 |
|
| 68 |
+
# ===================== Weighted Box Fusion =====================
|
| 69 |
+
def _wbf_one_class(
|
| 70 |
+
boxes: np.ndarray, # [N,4] xyxy in image pixels
|
| 71 |
+
scores: np.ndarray, # [N]
|
| 72 |
+
weights: np.ndarray, # [N] view-weights per box
|
| 73 |
+
iou_thr: float,
|
| 74 |
+
) -> tuple[np.ndarray, np.ndarray]:
|
| 75 |
+
"""Single-class Weighted Box Fusion. Returns fused (boxes, scores)."""
|
| 76 |
+
if len(boxes) == 0:
|
| 77 |
+
return np.empty((0, 4), dtype=np.float32), np.empty((0,), dtype=np.float32)
|
| 78 |
+
|
| 79 |
+
order = np.argsort(scores)[::-1]
|
| 80 |
+
boxes = boxes[order]
|
| 81 |
+
scores = scores[order]
|
| 82 |
+
weights = weights[order]
|
| 83 |
+
|
| 84 |
+
clusters: list[list[int]] = []
|
| 85 |
+
fused_boxes: list[np.ndarray] = []
|
| 86 |
+
|
| 87 |
+
for i in range(len(boxes)):
|
| 88 |
+
bi = boxes[i]
|
| 89 |
+
best_j = -1
|
| 90 |
+
best_iou = 0.0
|
| 91 |
+
for j, fb in enumerate(fused_boxes):
|
| 92 |
+
xx1 = max(bi[0], fb[0]); yy1 = max(bi[1], fb[1])
|
| 93 |
+
xx2 = min(bi[2], fb[2]); yy2 = min(bi[3], fb[3])
|
| 94 |
+
iw = max(0.0, xx2 - xx1); ih = max(0.0, yy2 - yy1)
|
| 95 |
+
inter = iw * ih
|
| 96 |
+
area_i = max(0.0, bi[2] - bi[0]) * max(0.0, bi[3] - bi[1])
|
| 97 |
+
area_f = max(0.0, fb[2] - fb[0]) * max(0.0, fb[3] - fb[1])
|
| 98 |
+
union = area_i + area_f - inter
|
| 99 |
+
iou = inter / union if union > 0 else 0.0
|
| 100 |
+
if iou > best_iou:
|
| 101 |
+
best_iou = iou; best_j = j
|
| 102 |
+
if best_j >= 0 and best_iou >= iou_thr:
|
| 103 |
+
clusters[best_j].append(i)
|
| 104 |
+
members = clusters[best_j]
|
| 105 |
+
ws = weights[members] * scores[members]
|
| 106 |
+
wsum = ws.sum() + 1e-9
|
| 107 |
+
fused = (boxes[members] * ws[:, None]).sum(axis=0) / wsum
|
| 108 |
+
fused_boxes[best_j] = fused
|
| 109 |
+
else:
|
| 110 |
+
clusters.append([i])
|
| 111 |
+
fused_boxes.append(bi.copy())
|
| 112 |
+
|
| 113 |
+
out_boxes = np.stack(fused_boxes, axis=0).astype(np.float32)
|
| 114 |
+
out_scores = np.zeros(len(clusters), dtype=np.float32)
|
| 115 |
+
n_views = max(1.0, float(weights.max()) if len(weights) else 1.0)
|
| 116 |
+
for k, members in enumerate(clusters):
|
| 117 |
+
# WBF score: avg score weighted by view-weight, scaled by cluster coverage
|
| 118 |
+
ws = weights[members]
|
| 119 |
+
s = scores[members]
|
| 120 |
+
avg = float((s * ws).sum() / (ws.sum() + 1e-9))
|
| 121 |
+
coverage = min(1.0, len(members) / n_views) # 1.0 if all views agreed
|
| 122 |
+
out_scores[k] = avg * (0.5 + 0.5 * coverage)
|
| 123 |
+
return out_boxes, out_scores
|
| 124 |
+
|
| 125 |
+
|
| 126 |
+
def weighted_box_fusion(
|
| 127 |
+
boxes_per_view: list[np.ndarray], # each [Ni,4]
|
| 128 |
+
scores_per_view: list[np.ndarray], # each [Ni]
|
| 129 |
+
cls_per_view: list[np.ndarray], # each [Ni]
|
| 130 |
+
view_weights: np.ndarray,
|
| 131 |
+
iou_thr: float = WBF_IOU_THR,
|
| 132 |
+
) -> tuple[np.ndarray, np.ndarray, np.ndarray]:
|
| 133 |
+
all_b: list[np.ndarray] = []
|
| 134 |
+
all_s: list[np.ndarray] = []
|
| 135 |
+
all_w: list[np.ndarray] = []
|
| 136 |
+
all_c: list[np.ndarray] = []
|
| 137 |
+
for b, s, c, w in zip(boxes_per_view, scores_per_view, cls_per_view, view_weights):
|
| 138 |
+
if len(b) == 0:
|
| 139 |
+
continue
|
| 140 |
+
all_b.append(b); all_s.append(s); all_c.append(c)
|
| 141 |
+
all_w.append(np.full(len(b), float(w), dtype=np.float32))
|
| 142 |
+
if not all_b:
|
| 143 |
+
return (np.empty((0, 4), dtype=np.float32),
|
| 144 |
+
np.empty((0,), dtype=np.float32),
|
| 145 |
+
np.empty((0,), dtype=np.int32))
|
| 146 |
+
B = np.concatenate(all_b, axis=0)
|
| 147 |
+
S = np.concatenate(all_s, axis=0)
|
| 148 |
+
C = np.concatenate(all_c, axis=0)
|
| 149 |
+
W = np.concatenate(all_w, axis=0)
|
| 150 |
+
|
| 151 |
+
out_b: list[np.ndarray] = []
|
| 152 |
+
out_s: list[np.ndarray] = []
|
| 153 |
+
out_c: list[np.ndarray] = []
|
| 154 |
+
for c in np.unique(C):
|
| 155 |
+
mask = C == c
|
| 156 |
+
fb, fs = _wbf_one_class(B[mask], S[mask], W[mask], iou_thr)
|
| 157 |
+
if len(fb) == 0:
|
| 158 |
+
continue
|
| 159 |
+
out_b.append(fb)
|
| 160 |
+
out_s.append(fs)
|
| 161 |
+
out_c.append(np.full(len(fb), int(c), dtype=np.int32))
|
| 162 |
+
if not out_b:
|
| 163 |
+
return (np.empty((0, 4), dtype=np.float32),
|
| 164 |
+
np.empty((0,), dtype=np.float32),
|
| 165 |
+
np.empty((0,), dtype=np.int32))
|
| 166 |
+
return np.concatenate(out_b, axis=0), np.concatenate(out_s, axis=0), np.concatenate(out_c, axis=0)
|
| 167 |
+
|
| 168 |
+
|
| 169 |
+
# ===================== Miner =====================
|
| 170 |
class Miner:
|
| 171 |
def __init__(self, path_hf_repo: Path) -> None:
|
| 172 |
model_path = path_hf_repo / "weights.onnx"
|
| 173 |
+
self.class_names = CRIME_CLASSES
|
| 174 |
+
print("ORT version:", ort.__version__)
|
| 175 |
+
try:
|
| 176 |
+
ort.preload_dlls()
|
| 177 |
+
except Exception:
|
| 178 |
+
pass
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 179 |
|
| 180 |
+
sess_opt = ort.SessionOptions()
|
| 181 |
+
sess_opt.graph_optimization_level = ort.GraphOptimizationLevel.ORT_ENABLE_ALL
|
| 182 |
try:
|
| 183 |
self.session = ort.InferenceSession(
|
| 184 |
+
str(model_path), sess_options=sess_opt,
|
|
|
|
| 185 |
providers=["CUDAExecutionProvider", "CPUExecutionProvider"],
|
| 186 |
)
|
| 187 |
+
except Exception as e:
|
| 188 |
+
print(f"⚠️ CUDA session failed, CPU fallback: {e}")
|
| 189 |
self.session = ort.InferenceSession(
|
| 190 |
+
str(model_path), sess_options=sess_opt, providers=["CPUExecutionProvider"]
|
|
|
|
|
|
|
| 191 |
)
|
| 192 |
+
print("ORT session providers:", self.session.get_providers())
|
| 193 |
|
| 194 |
self.input_name = self.session.get_inputs()[0].name
|
| 195 |
self.output_names = [o.name for o in self.session.get_outputs()]
|
| 196 |
+
in_meta = self.session.get_inputs()[0]
|
| 197 |
+
ishape = in_meta.shape
|
| 198 |
+
self.input_h = self._safe_dim(ishape[2], 1280)
|
| 199 |
+
self.input_w = self._safe_dim(ishape[3], 1280)
|
| 200 |
+
self.input_np_dtype = np.float16 if "float16" in (in_meta.type or "") else np.float32
|
| 201 |
+
|
| 202 |
+
# Inference recipe
|
| 203 |
+
self.use_tta = True
|
| 204 |
+
self.zoom_long_side = 1408 # second view at higher res, then letterbox to model input
|
| 205 |
+
self.iou_thres = 0.35
|
| 206 |
+
self.max_det = 200
|
| 207 |
+
self.per_class_conf = PER_CLASS_CONF.copy()
|
| 208 |
+
|
| 209 |
+
# box sanity filters (match king — they're well-tuned for crime)
|
| 210 |
+
self.min_box_area = 10 * 10
|
| 211 |
+
self.min_w = 6
|
| 212 |
+
self.min_h = 6
|
| 213 |
+
self.max_aspect_ratio = 8.0
|
| 214 |
+
self.max_box_area_ratio = 0.95
|
| 215 |
+
|
| 216 |
+
print(f"✅ ONNX loaded {model_path} input={self.input_w}x{self.input_h}")
|
|
|
|
|
|
|
|
|
|
| 217 |
|
| 218 |
@staticmethod
|
| 219 |
+
def _safe_dim(v, default):
|
| 220 |
+
return v if isinstance(v, int) and v > 0 else default
|
| 221 |
+
|
| 222 |
+
# ---- preprocessing ----
|
| 223 |
+
def _letterbox(self, image: ndarray, new_shape: tuple[int, int]):
|
| 224 |
h, w = image.shape[:2]
|
| 225 |
+
nw, nh = new_shape
|
| 226 |
+
ratio = min(nw / w, nh / h)
|
| 227 |
rw, rh = int(round(w * ratio)), int(round(h * ratio))
|
| 228 |
if (rw, rh) != (w, h):
|
| 229 |
+
interp = cv2.INTER_CUBIC if ratio > 1.0 else cv2.INTER_LINEAR
|
| 230 |
image = cv2.resize(image, (rw, rh), interpolation=interp)
|
| 231 |
+
dw, dh = (nw - rw) / 2.0, (nh - rh) / 2.0
|
| 232 |
+
l = int(round(dw - 0.1)); r = int(round(dw + 0.1))
|
| 233 |
+
t = int(round(dh - 0.1)); b = int(round(dh + 0.1))
|
| 234 |
+
padded = cv2.copyMakeBorder(image, t, b, l, r, borderType=cv2.BORDER_CONSTANT, value=(114, 114, 114))
|
| 235 |
return padded, ratio, (dw, dh)
|
| 236 |
|
| 237 |
+
def _preproc(self, image: ndarray, target_long: int | None = None):
|
| 238 |
+
if target_long is not None:
|
| 239 |
+
h, w = image.shape[:2]
|
| 240 |
+
if max(h, w) != target_long:
|
| 241 |
+
s = target_long / max(h, w)
|
| 242 |
+
image = cv2.resize(image, (int(round(w * s)), int(round(h * s))), interpolation=cv2.INTER_AREA)
|
| 243 |
+
orig_h, orig_w = image.shape[:2]
|
| 244 |
+
img, ratio, pad = self._letterbox(image, (self.input_w, self.input_h))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 245 |
img = cv2.cvtColor(img, cv2.COLOR_BGR2RGB)
|
| 246 |
img = img.astype(np.float32) / 255.0
|
| 247 |
img = np.transpose(img, (2, 0, 1))[None, ...]
|
| 248 |
+
img = np.ascontiguousarray(img, dtype=self.input_np_dtype)
|
| 249 |
+
return img, ratio, pad, (orig_w, orig_h)
|
| 250 |
+
|
| 251 |
+
# ---- forward + decode (no per-class conf, no NMS — both happen in WBF/postproc) ----
|
| 252 |
+
def _forward_decode(self, image: ndarray, target_long: int | None) -> tuple[np.ndarray, np.ndarray, np.ndarray]:
|
| 253 |
+
if image.dtype != np.uint8:
|
| 254 |
+
image = image.astype(np.uint8)
|
| 255 |
+
tensor, ratio, pad, (ow, oh) = self._preproc(image, target_long)
|
| 256 |
+
outs = self.session.run(self.output_names, {self.input_name: tensor})
|
| 257 |
+
preds = outs[0]
|
| 258 |
+
if preds.ndim == 3 and preds.shape[0] == 1:
|
| 259 |
+
preds = preds[0]
|
| 260 |
+
if preds.ndim != 2 or preds.shape[1] < 6:
|
| 261 |
+
return (np.empty((0, 4), np.float32), np.empty((0,), np.float32), np.empty((0,), np.int32))
|
| 262 |
+
|
| 263 |
+
boxes = preds[:, :4].astype(np.float32)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 264 |
scores = preds[:, 4].astype(np.float32)
|
| 265 |
cls_ids = preds[:, 5].astype(np.int32)
|
|
|
|
| 266 |
|
| 267 |
+
# de-letterbox back to ORIGINAL image coords (the un-resized one passed in to predict)
|
| 268 |
+
# NB: target_long step was a downsample of the input image; we de-letterbox to that
|
| 269 |
+
# downsampled size, then upscale to the true original.
|
| 270 |
+
keep = scores >= WBF_SKIP_BOX_THR
|
| 271 |
+
boxes = boxes[keep]; scores = scores[keep]; cls_ids = cls_ids[keep]
|
| 272 |
if len(boxes) == 0:
|
| 273 |
return boxes, scores, cls_ids
|
| 274 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 275 |
boxes[:, [0, 2]] -= pad[0]
|
| 276 |
boxes[:, [1, 3]] -= pad[1]
|
| 277 |
+
boxes /= ratio # now in coords of the (possibly downsampled) image fed to letterbox
|
| 278 |
+
|
| 279 |
+
# If we had pre-resized for zoom view, scale boxes back to original image coords
|
| 280 |
+
true_h, true_w = image.shape[:2]
|
| 281 |
+
if target_long is not None and max(true_h, true_w) != target_long:
|
| 282 |
+
s = max(true_h, true_w) / target_long
|
| 283 |
+
boxes *= s
|
| 284 |
+
|
| 285 |
+
boxes[:, [0, 2]] = np.clip(boxes[:, [0, 2]], 0, true_w - 1)
|
| 286 |
+
boxes[:, [1, 3]] = np.clip(boxes[:, [1, 3]], 0, true_h - 1)
|
| 287 |
+
return boxes.astype(np.float32), scores, cls_ids
|
|
|
|
|
|
|
| 288 |
|
| 289 |
@staticmethod
|
| 290 |
+
def _flip_boxes_h(boxes: np.ndarray, w: int) -> np.ndarray:
|
| 291 |
+
if len(boxes) == 0:
|
| 292 |
+
return boxes
|
| 293 |
+
out = boxes.copy()
|
| 294 |
+
x1 = out[:, 0].copy(); x2 = out[:, 2].copy()
|
| 295 |
+
out[:, 0] = w - x2
|
| 296 |
+
out[:, 2] = w - x1
|
| 297 |
+
return out
|
| 298 |
+
|
| 299 |
+
# ---- box sanity ----
|
| 300 |
+
def _filter_sane(self, boxes, scores, cls_ids, true_size):
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 301 |
if len(boxes) == 0:
|
| 302 |
return boxes, scores, cls_ids
|
| 303 |
+
tw, th = true_size
|
| 304 |
+
area_img = float(tw * th)
|
| 305 |
+
keep = []
|
| 306 |
+
for i, (x1, y1, x2, y2) in enumerate(boxes):
|
| 307 |
+
bw = x2 - x1; bh = y2 - y1
|
| 308 |
+
if bw < self.min_w or bh < self.min_h:
|
| 309 |
+
continue
|
| 310 |
+
area = bw * bh
|
| 311 |
+
if area < self.min_box_area or area > self.max_box_area_ratio * area_img:
|
| 312 |
+
continue
|
| 313 |
+
ar = max(bw / max(bh, 1e-6), bh / max(bw, 1e-6))
|
| 314 |
+
if ar > self.max_aspect_ratio:
|
| 315 |
+
continue
|
| 316 |
+
keep.append(i)
|
| 317 |
+
if not keep:
|
| 318 |
+
return (np.empty((0, 4), np.float32), np.empty((0,), np.float32), np.empty((0,), np.int32))
|
| 319 |
+
keep = np.asarray(keep, dtype=np.intp)
|
| 320 |
+
return boxes[keep], scores[keep], cls_ids[keep]
|
| 321 |
|
| 322 |
+
# ---- per-class NMS ----
|
| 323 |
+
@staticmethod
|
| 324 |
+
def _hard_nms(boxes, scores, iou_thr):
|
| 325 |
+
if len(boxes) == 0:
|
| 326 |
+
return np.array([], dtype=np.intp)
|
| 327 |
+
order = np.argsort(scores)[::-1]
|
| 328 |
+
keep = []
|
| 329 |
+
while len(order) > 0:
|
| 330 |
+
i = order[0]; keep.append(i)
|
| 331 |
+
if len(order) == 1:
|
| 332 |
+
break
|
| 333 |
+
rest = order[1:]
|
| 334 |
+
xx1 = np.maximum(boxes[i, 0], boxes[rest, 0]); yy1 = np.maximum(boxes[i, 1], boxes[rest, 1])
|
| 335 |
+
xx2 = np.minimum(boxes[i, 2], boxes[rest, 2]); yy2 = np.minimum(boxes[i, 3], boxes[rest, 3])
|
| 336 |
+
inter = np.maximum(0, xx2 - xx1) * np.maximum(0, yy2 - yy1)
|
| 337 |
+
ai = max(0, boxes[i, 2] - boxes[i, 0]) * max(0, boxes[i, 3] - boxes[i, 1])
|
| 338 |
+
ar = np.maximum(0, boxes[rest, 2] - boxes[rest, 0]) * np.maximum(0, boxes[rest, 3] - boxes[rest, 1])
|
| 339 |
+
iou = inter / (ai + ar - inter + 1e-7)
|
| 340 |
+
order = rest[iou <= iou_thr]
|
| 341 |
+
return np.array(keep, dtype=np.intp)
|
| 342 |
+
|
| 343 |
+
@staticmethod
|
| 344 |
+
def _merge_close_graffiti(boxes, scores, cls_ids, gap_frac=0.25):
|
| 345 |
+
"""Agglomerative proximity-merge for graffiti only.
|
| 346 |
+
|
| 347 |
+
Graffiti tags on the same wall often appear as multiple disjoint boxes with
|
| 348 |
+
near-zero pairwise IoU, so standard per-class NMS doesn't suppress them. King's
|
| 349 |
+
model produces one large box per wall panel; ours produces many small ones per
|
| 350 |
+
tag. We iteratively merge pairs of graffiti boxes whose nearest-edge gap is
|
| 351 |
+
smaller than `gap_frac` × the smaller box's max-side (already-overlapping
|
| 352 |
+
pairs trivially satisfy this, so they merge too).
|
| 353 |
+
"""
|
| 354 |
if len(boxes) == 0:
|
| 355 |
return boxes, scores, cls_ids
|
| 356 |
+
mask = cls_ids == 5
|
| 357 |
+
if mask.sum() < 2:
|
| 358 |
+
return boxes, scores, cls_ids
|
| 359 |
+
g_boxes = boxes[mask].tolist()
|
| 360 |
+
g_scores = scores[mask].tolist()
|
| 361 |
+
# leave non-graffiti alone
|
| 362 |
+
other_b = boxes[~mask]; other_s = scores[~mask]; other_c = cls_ids[~mask]
|
| 363 |
+
|
| 364 |
+
changed = True
|
| 365 |
+
while changed and len(g_boxes) > 1:
|
| 366 |
+
changed = False
|
| 367 |
+
for i in range(len(g_boxes)):
|
| 368 |
+
bi = g_boxes[i]
|
| 369 |
+
for j in range(i + 1, len(g_boxes)):
|
| 370 |
+
bj = g_boxes[j]
|
| 371 |
+
gap_x = max(bj[0] - bi[2], bi[0] - bj[2], 0.0)
|
| 372 |
+
gap_y = max(bj[1] - bi[3], bi[1] - bj[3], 0.0)
|
| 373 |
+
gap = max(gap_x, gap_y)
|
| 374 |
+
ref = min(
|
| 375 |
+
max(bi[2] - bi[0], bi[3] - bi[1]),
|
| 376 |
+
max(bj[2] - bj[0], bj[3] - bj[1]),
|
| 377 |
+
)
|
| 378 |
+
if gap < gap_frac * ref:
|
| 379 |
+
union = [
|
| 380 |
+
min(bi[0], bj[0]), min(bi[1], bj[1]),
|
| 381 |
+
max(bi[2], bj[2]), max(bi[3], bj[3]),
|
| 382 |
+
]
|
| 383 |
+
new_score = max(g_scores[i], g_scores[j])
|
| 384 |
+
g_boxes[j] = union
|
| 385 |
+
g_scores[j] = new_score
|
| 386 |
+
g_boxes.pop(i); g_scores.pop(i)
|
| 387 |
+
changed = True
|
| 388 |
+
break
|
| 389 |
+
if changed:
|
| 390 |
+
break
|
| 391 |
+
if not g_boxes:
|
| 392 |
+
return other_b, other_s, other_c
|
| 393 |
+
merged_g = np.array(g_boxes, dtype=np.float32)
|
| 394 |
+
merged_s = np.array(g_scores, dtype=np.float32)
|
| 395 |
+
merged_c = np.full(len(g_boxes), 5, dtype=np.int32)
|
| 396 |
+
if len(other_b) == 0:
|
| 397 |
+
return merged_g, merged_s, merged_c
|
| 398 |
+
return (np.concatenate([other_b, merged_g], axis=0),
|
| 399 |
+
np.concatenate([other_s, merged_s], axis=0),
|
| 400 |
+
np.concatenate([other_c, merged_c], axis=0))
|
| 401 |
+
|
| 402 |
+
def _nms_per_class(self, boxes, scores, cls_ids):
|
| 403 |
+
if len(boxes) == 0:
|
| 404 |
+
return boxes, scores, cls_ids
|
| 405 |
+
keep_all = []
|
| 406 |
for c in np.unique(cls_ids):
|
| 407 |
+
idxs = np.nonzero(cls_ids == c)[0]
|
| 408 |
+
local = self._hard_nms(boxes[idxs], scores[idxs], self.iou_thres)
|
| 409 |
+
keep_all.extend(idxs[local].tolist())
|
| 410 |
+
keep_all = np.asarray(keep_all, dtype=np.intp)
|
| 411 |
+
order = np.argsort(scores[keep_all])[::-1][: self.max_det]
|
| 412 |
+
keep_all = keep_all[order]
|
| 413 |
+
return boxes[keep_all], scores[keep_all], cls_ids[keep_all]
|
| 414 |
+
|
| 415 |
+
# ---- main predict ----
|
| 416 |
+
def _predict_one(self, image: ndarray) -> list[BoundingBox]:
|
| 417 |
+
H, W = image.shape[:2]
|
| 418 |
+
|
| 419 |
+
# View 1: original at native resolution
|
| 420 |
+
b1, s1, c1 = self._forward_decode(image, target_long=None)
|
| 421 |
+
|
| 422 |
+
if not self.use_tta:
|
| 423 |
+
views_b, views_s, views_c = [b1], [s1], [c1]
|
| 424 |
+
view_weights = VIEW_WEIGHTS[:1]
|
| 425 |
+
else:
|
| 426 |
+
# View 2: hflip
|
| 427 |
+
flipped = cv2.flip(image, 1)
|
| 428 |
+
b2, s2, c2 = self._forward_decode(flipped, target_long=None)
|
| 429 |
+
b2 = self._flip_boxes_h(b2, W)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 430 |
|
| 431 |
+
# View 3: zoomed (longer side resized to self.zoom_long_side, then letterbox to model input)
|
| 432 |
+
b3, s3, c3 = self._forward_decode(image, target_long=self.zoom_long_side)
|
|
|
|
| 433 |
|
| 434 |
+
views_b = [b1, b2, b3]
|
| 435 |
+
views_s = [s1, s2, s3]
|
| 436 |
+
views_c = [c1, c2, c3]
|
| 437 |
+
view_weights = VIEW_WEIGHTS
|
| 438 |
+
|
| 439 |
+
boxes, scores, cls_ids = weighted_box_fusion(
|
| 440 |
+
views_b, views_s, views_c, view_weights, iou_thr=WBF_IOU_THR
|
| 441 |
+
)
|
| 442 |
if len(boxes) == 0:
|
| 443 |
return []
|
| 444 |
|
| 445 |
+
# Per-class confidence threshold
|
| 446 |
+
keep = scores >= self.per_class_conf[cls_ids]
|
| 447 |
+
boxes = boxes[keep]; scores = scores[keep]; cls_ids = cls_ids[keep]
|
| 448 |
+
if len(boxes) == 0:
|
| 449 |
+
return []
|
|
|
|
|
|
|
| 450 |
|
| 451 |
+
# Sanity + NMS
|
| 452 |
+
boxes, scores, cls_ids = self._filter_sane(boxes, scores, cls_ids, (W, H))
|
| 453 |
+
if len(boxes) == 0:
|
| 454 |
+
return []
|
| 455 |
+
boxes, scores, cls_ids = self._nms_per_class(boxes, scores, cls_ids)
|
| 456 |
+
# Graffiti-only proximity merge: collapse tiny adjacent tags into wall-panel boxes,
|
| 457 |
+
# which matches the validator's preferred granularity (one box per panel).
|
| 458 |
+
boxes, scores, cls_ids = self._merge_close_graffiti(boxes, scores, cls_ids, gap_frac=0.25)
|
| 459 |
+
|
| 460 |
+
# Per-class aspect-ratio filter (currently: hoodie must be tall ≥1.2× wide,
|
| 461 |
+
# so we keep only detections that include the hooded-head region).
|
| 462 |
+
if len(boxes) > 0 and PER_CLASS_MIN_H_OVER_W:
|
| 463 |
+
keep = np.ones(len(boxes), dtype=bool)
|
| 464 |
+
for i in range(len(boxes)):
|
| 465 |
+
c = int(cls_ids[i])
|
| 466 |
+
if c in PER_CLASS_MIN_H_OVER_W:
|
| 467 |
+
bw = float(boxes[i, 2] - boxes[i, 0])
|
| 468 |
+
bh = float(boxes[i, 3] - boxes[i, 1])
|
| 469 |
+
if bw <= 0 or (bh / bw) < PER_CLASS_MIN_H_OVER_W[c]:
|
| 470 |
+
keep[i] = False
|
| 471 |
+
boxes = boxes[keep]; scores = scores[keep]; cls_ids = cls_ids[keep]
|
| 472 |
+
|
| 473 |
+
return [
|
| 474 |
+
BoundingBox(
|
| 475 |
+
x1=int(math.floor(b[0])), y1=int(math.floor(b[1])),
|
| 476 |
+
x2=int(math.ceil(b[2])), y2=int(math.ceil(b[3])),
|
| 477 |
+
cls_id=int(c), conf=float(s),
|
| 478 |
+
)
|
| 479 |
+
for b, s, c in zip(boxes, scores, cls_ids)
|
| 480 |
+
if b[2] > b[0] and b[3] > b[1]
|
| 481 |
+
]
|
| 482 |
|
| 483 |
def predict_batch(
|
| 484 |
self,
|
|
|
|
| 491 |
try:
|
| 492 |
boxes = self._predict_one(image)
|
| 493 |
except Exception as e:
|
| 494 |
+
print(f"⚠️ inference failed frame {offset + i}: {e}")
|
| 495 |
boxes = []
|
| 496 |
results.append(TVFrameResult(
|
| 497 |
frame_id=offset + i,
|
|
|
|
| 499 |
keypoints=[(0, 0) for _ in range(max(0, int(n_keypoints)))],
|
| 500 |
))
|
| 501 |
return results
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|