Unverified50% confidenceSolutionExact time
In the merge step of tiled inference, IoU-based NMS alone is insufficient; intersection-over-smaller (IoS) needs to be added as a merge criterion.
1
Sources
50%
Confidence
Long-term
Relevance
10/13/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedNMS 计算复杂度与检测框数量的平方成正比，候选框数量多时 CPU 上的 NMS 耗时可能超过模型推理本身62% similarUnverifiedOBB adds a rotational degree of freedom compared to HBB, but significantly increases the complexity of algorithms such as IoU computation and NMS.60% similarVerifiedRNNs process sequences in a serial manner and suffer from two major problems: vanishing gradients on long sequences and the inability to perform parallel computation.59% similarUnverifiedSugiyama算法第二步的最小化边交叉被证明是NP完全问题，由Garey和Johnson在1983年证明即使两层情况下最小化交叉数也是NP难的58% similarUnverifiedUnder a unified FLOPs convention, the inference computation required by Reviser is significantly lower than that of multi-round refinement methods and diffusion-based baselines.58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1016429API
curl https://kongchang.com/api/v1/knowledge/claims/1016429MCP
get_claim(id=1016429)