凸壳
交叉口(航空)
特征(语言学)
正多边形
数学
模式识别(心理学)
人工智能
凸集
计算机科学
凸组合
算法
计算机视觉
作者
Zonghao Guo,Xiaosong Zhang,Chang Liu,Xiangyang Ji,Jianbin Jiao,Qixiang Ye
出处
期刊:IEEE Transactions on Circuits and Systems for Video Technology
[Institute of Electrical and Electronics Engineers]
日期:2022-01-01
卷期号:: 1-1
标识
DOI:10.1109/tcsvt.2022.3140248
摘要
Detecting oriented and densely packed objects is a challenging problem considering that the receptive field intersection between objects causes spatial feature aliasing. In this paper, we propose a convex-hull feature adaptation (CFA) approach, with the aim to configure convolutional features in accordance with irregular object layouts. CFA roots in the convex-hull feature representation, which defines a set of dynamically sampled feature points guided by the convex intersection over union (CIoU) to bound object extent. CFA pursues optimal feature assignment by constructing convex-hull sets and iteratively splitting positive or negative convex-hulls. By simultaneously considering overlapping convex-hulls and objects and penalizing convex-hulls shared by multiple objects, CFA defines a systematic way to adapt convolutional features on regular grids to objects of irregular shapes. Experiments on DOTA and SKU110K-R datasets show that CFA achieved new state-of-the-art performance for detecting oriented and densely packed objects. CFA also sets a solid baseline for convex polygon prediction on the MS COCO dataset defined for general object detection. Code is available at github.com/SDL-GuoZonghao/BeyondBoundingBox.
科研通智能强力驱动
Strongly Powered by AbleSci AI