Edge gradient feature and long distance dependency for image semantic segmentation. Issue 1 (30th November 2018)

• Record Type: Journal Article
• Authors: Zhou, Hao; Han, Anqi; Yang, Haodong; Zhang, Jun
• Is Part Of: IET computer vision. Volume 13:Issue 1(2019)
• Page Start: 53
• Page End: 60
• Publication Date: 2018-11-30
• Subjects: object recognition -- neural nets -- object detection -- image classification -- image representation -- image segmentation -- learning (artificial intelligence) -- feature extraction -- computer vision; image global features -- long-distance dependency -- extracting gradient features -- edge gradient feature -- long distance dependency -- image semantic segmentation -- low-level computer vision -- deep convolutional neural networks -- object edges -- difference-pooling module -- object edge gradients -- segmentation results -- pyramid pooling module -- atrous spatial pyramid pooling; Computer vision -- Periodicals; Pattern recognition systems -- Periodicals; 006.37
• DOI: 10.1049/iet-cvi.2018.5035
• Languages: English
• ISSNs: 1751-9632

Abstract

Abstract : Image semantic segmentation is a challenging problem for low‐level computer vision. Recently, deep convolutional neural networks (DCNNs) have been proved to achieve outstanding performance in image semantic segmentation. Most current methods still have some problems in segmenting the object edges and the integrity of objects. In this study, the authors first construct the difference‐pooling module in the DCNNs to extract the object edge gradients and get finer boundary in segmentation results. Then the combination of the pyramid pooling module and the atrous spatial pyramid pooling extracts the image global features and the context structure information by building long‐distance dependency between pixels, which is just like a simple fully connected conditional random field (CRF). Different from other methods, the proposed method does not need extra pre‐processing and post‐processing steps, such as extracting gradient features by the traditional algorithm and building context relationships by CRF. Finally, the experimental results on the PASCAL VOC2012 benchmark indicate that the proposed model can obtain the finer boundaries and more complete parts.