Abstract
Semantic segmentation aims to assign correct class labels per pixel on an image. In particular, semantic segmentation has difficulties in particular along the boundary of objects. Recently, ELKPPNet has been proposed, which improves the performance of semantic segmentation by adding edge loss term into the conventional semantic segmentation algorithm. In extracts edge from the end of the network, which is used in the computation of loss. In this paper, we present U-Net based networks which adopt the edge loss of the ELKPPNet. Presented algorithm computes edge by additional network flow in the U-Net. Two different network structures are investigated. One computes edge at the end of decoder in encoder-decoder of the U-Net. The other computes edge from the start of decoder in U-Net. Experimental results show that integrating edge information in semantic segmentation improves performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Institute of Control, Robotics and Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
