Recently, there is growing attention on one-stage panoptic segmentation methods which aim to segment instances and stuff jointly within a fully convolutional pipeline efficiently. However, most of the existing works directly feed the backbone features to various segmentation heads ignoring the demands for semantic and instance segmentation are different: The former needs semantic-level discriminative features, while the latter requires features to be distinguishable across instances. To alleviate this, we propose to first predict semantic-level and instance-level correlations among different locations that are utilized to enhance the backbone features, and then feed the improved discriminative features into the corresponding segmentation heads, respectively. Specifically, we organize the correlations between a given location and all locations as a continuous sequence and predict it as a whole. Considering that such a sequence can be extremely complicated, we adopt Discrete Fourier Transform (DFT), a tool that can approximate an arbitrary sequence parameterized by amplitudes and phrases. For different tasks, we generate these parameters from the backbone features in a fully convolutional way which is optimized implicitly by corresponding tasks. As a result, these accurate and consistent correlations contribute to producing plausible discriminative features which meet the requirements of the complicated panoptic segmentation task. To verify the effectiveness of our methods, we conduct experiments on several challenging panoptic segmentation datasets and achieve state-of-the-art performance on MS COCO with $45.1$\% PQ and ADE20k with $32.6$\% PQ.
翻译:最近,人们日益关注一个阶段的全光截面分割方法,这些方法旨在高效地将事件和材料在完全进化的管道内联合进行分解,然而,大多数现有工程直接将主干特征反馈给各分块头的骨干特征,而忽视语义和实例分解的要求则不同:前者需要语义层次的区别性特征,而后者则要求能够在不同实例中区分特征。为了缓解这一点,我们提议首先预测不同地点之间的语义层次和实例层次的相关性,用来加强主干特征,然后分别将经过改进的区别特征反馈给相应的分块头。具体地说,我们把一个特定地点和所有地点之间的关系作为一个连续的序列进行组织起来,并从整体上作出预测。考虑到这种顺序可能极为复杂,我们采用了分解式的Fourier变形(DFT)这一工具,这个工具可以对按振动和语句的任意序列参数进行区分。对于不同的任务,我们用完全进化的方式从主干特征产生这些参数,从而以默认的方式满足相应的任务。具体地将一个特定地点和连续的分块之间的关联性关系作为结果。Q-这些精确和连续地将一个连续地将一个连续的分层的分层的分层的分级关系,从而产生出,从而产生出我们的分级的分级的分级的分级的分级的分级的分级的分级数据。