Abstract

The deployment of deep convolutional neural networks (CNNs) is heavily constrained by its high computational costs and parameter redundancy. For this reason, general group convolution (GGC) and depthwise convolution (DWC) were proposed, but they limited the information transfer in the channel dimension. In this paper, a novel and efficient overlapped group convolution (OGC) is proposed to improve the information transfer between channels. In OGC, the input feature maps can be overlapped between different groups. Compared with GGC, OGC has better information transfer in the channel dimension without additional parameters and computational cost. In theory, OGC unifies the standard convolution (SDC), GGC, and DWC. In other words, SDC, GGC, and DWC all belong to the special cases of OGC. In OGC, two flexible hyperparameters are defined, the number of input feature maps in each group (g) and the stride between adjacent groups (s), which make OGC more flexible and can make the trade-off between accuracy and parameters. The performance of OGC is analyzed in terms of parameters, computational cost, accuracy, run time, etc. The classification and object detection tasks are used to evaluate the performance of OGC. Experimental results show that the OGC has higher accuracy and is more efficient than the corresponding SDC, GGC, and DWC. The ratio of the two hyperparameters in OGC has a great impact on accuracy. When 23<sg<67, OGC has higher accuracy than others. The proposed OGC is more stable and robust than GGC.

Full Text
Paper version not known

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 call

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.