Unverified50% confidenceTradeoffExact time
OBB adds a rotational degree of freedom compared to HBB, but significantly increases the complexity of algorithms such as IoU computation and NMS.
1
Sources
50%
Confidence
Long-term
Relevance
9/7/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe self-attention mechanism resolves the vanishing gradient problem that RNN architectures face when processing long sequences and inherently supports large-scale parallel computation64% similarUnverifiedNMS 计算复杂度与检测框数量的平方成正比，候选框数量多时 CPU 上的 NMS 耗时可能超过模型推理本身64% similarUnverified精确的 K 近邻搜索（KNN）时间复杂度为 O(n×d)，在数百万级别记忆条目下延迟不可接受，ANN 算法通过牺牲极小精度换取数量级速度提升61% similarUnverifiedOOSM 除回溯重放外还有 Algorithm A（用当前增益近似处理）和 Algorithm B（基于储存协方差进行精确后验修正）等方案，各有计算复杂度与精度权衡61% similarUnverified多元化算力布局在提升韧性的同时，也带来更高的系统集成复杂度和运营成本61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/871748API
curl https://kongchang.com/api/v1/knowledge/claims/871748MCP
get_claim(id=871748)