A NEW POINTWISE CONVOLUTION IN D EEP N EURAL N ETWORKS THROUGH E XTREMELY F AST AND N ON P ARAMETRIC T RANSFORMS
Anonymous authors
Paper under double-blind review
A BSTRACT
Some conventional transforms such as Discrete Walsh-Hadamard Transform (DWHT) and Discrete Cosine Transform (DCT) have been widely used as feature extractors in image processing but rarely applied in neural networks.
However, we found that these conventional transforms have the ability to capture the cross-channel correlations without any learnable parameters in DNNs.
This paper ﬁrstly proposes to apply conventional transforms on pointwise convolution, showing that such transforms signiﬁcantly reduce the computational complexity of neural networks without accuracy degradation.
Especially for DWHT, it requires no ﬂoating point multiplications but only additions and subtractions, which can considerably reduce computation overheads.
In addition, its fast algorithm further reduces complexity of ﬂoating point addition from O ( n 2 ) to O ( n log n ) .
These non-parametric and low computational properties construct extremely efﬁcient networks in terms of the number of parameters and operations, enjoying accuracy gain.
Our proposed DWHT-based model gained 1.49% accuracy increase with 79.4% reduced parameters and 49.4% reduced FLOPs compared with its baseline model (MoblieNet-V1) on the CIFAR 100 dataset.
I NTRODUCTION
Large Convolutional Neural Networks (CNNs) (Krizhevsky et al., 2012; Simonyan & Zisserman, 2014; He et al., 2016; Szegedy et al., 2016b;a) and automatic Neural Architecture Search (NAS) based networks (Zoph et al., 2018; Liu et al., 2018; Real et al., 2018) have evolved to show remarkable accuracy on various tasks such as image classiﬁcation (Deng et al., 2009; Krizhevsky & Hinton, 2009), object detection (Lin et al., 2014), beneﬁted from huge amount of learnable parameters and computations.
However, these large number of weights and high computational cost enabled only limited applications for mobile devices that require the constraint on memory space being low as well as for devices that require real-time computations (Canziani et al., 2016).
With regard to solving these problems, Howard et al.
; Sandler et al.
; Zhang et al.
(2017b)
; Ma et al.
(2018) proposed parameter and computation efﬁcient blocks while maintaining almost same accuracy compared to other heavy CNN models.
All of these blocks utilized depthwise separable convolution, which deconstructed the standard convolution with the ( 3 × 3 × C ) size for each kernel into spatial information speciﬁc depthwise convolution ( 3 × 3 × 1 ) and channel information speciﬁc pointwise ( 1 × 1 × C ) convolution.
The depthwise separable convolution achieved comparable accuracy compared to standard spatial convolution with hugely reduced parameters and
FLOPs.
These reduced resource requirements made the depthwise separable convolution as well as pointwise convolution (PC) more widely used in modern CNN architectures.
Nevertheless, we point out that the existing PC layer is still computationally expensive and occupies a lot of proportion in the number of weight parameters (Howard et al., 2017).
Although the demand toward PC layer has been and will be growing exponentially in modern neural network architectures, there has been a little research on improving the naive structure of itself.
Therefore, this paper proposes a new PC layer formulated by non-parametric and extremely fast conventional transforms.
Conventional transforms that we applied on CNN models are Discrete
Walsh-Hadamard Transform (DWHT) and Discrete Cosine Transform (DCT), which have widely been used in image processing but rarely been applied in CNNs (Ghosh & Chellappa, 2016).
We empirically found that although both of these transforms do not require any learnable parameters at all, they show the sufﬁcient ability to capture the cross-channel correlations.
This non-parametric property enables our proposed CNN models to be signiﬁcantly compressed in terms of the number of parameters, leading to get the advantages (i.e. efﬁcient distributed training, less communication between server and clients) referred by Iandola et al.
We note that especially DWHT is considered to be a good replacement of the conventional PC layer, as it requires no ﬂoating point multiplications but only additions and subtractions by which the computation overheads of PC layers can signiﬁcantly be reduced.
Furthermore, DWHT can take a strong advantage of its fast version where the computation complexity of the ﬂoating point operations is reduced from O ( n 2 ) to
O ( n log n ) .
These non-parametric and low computational properties construct extremely efﬁcient neural network from the perspective of parameter and computation as well as enjoying accuracy gain.
Our contributions are summarized as follows:
• We propose a new PC layer formulated with conventional transforms which do not require any learnable parameters as well as signiﬁcantly reducing the number of ﬂoating point operations compared to the existing PC layer.
• The great beneﬁts of using the bases of existing transforms come from their fast versions, which drastically decrease computation complexity in neural networks without degrading accuracy.
• We found that applying ReLU after conventional transforms discards important information extracted, leading to signiﬁcant drop in accuracy.
Based on this ﬁnding, we propose the optimal computation block for conventional transforms.
• We also found that the conventional transforms can effectively be used especially for extracting high-level features in neural networks.
Based on this, we propose a new transformbased neural network architecture.
Speciﬁcally, using DWHT, our proposed method yields 1.49%
accuracy gain as well as 79.4% and 49.4% reduced parameters and FLOPs, respectively, compared with its baseline model (MobileNet-V1) on CIFAR 100 dataset.
R ELATED W ORK 2. D ECONSTRUCTION AND D ECOMPOSITION OF C ONVOLUTIONS
For reducing computation complexity of the existing convolution methods, several approaches of rethinking and deconstructing the naive convolution structures have been proposed.
Simonyan &
Zisserman (2014) factorized a large sized kernel (e.g. 5 × 5 ) in a convolution layer into several small size kernels (e.g. 3 × 3 ) with several convolution layers.
Jeon & Kim (2017) pointed out the limitation of existing convolution that it has the ﬁxed receptive ﬁeld.
Consequently, they introduced learnable spatial displacement parameters, showing ﬂexibility of convolution.
Based on Jeon & Kim (2017), Jeon & Kim (2018) proved that the standard convolution can be deconstructed as a single PC layer with the spatially shifted channels.
Based on that, they proposed a very efﬁcient convolution layer, namely active shift layer, by replacing spatial convolutions with shift operations.
It is worth noting that the existing PC layer takes the huge proportion of computation and the number of weight parameters in modern lightweight CNN models (Howard et al., 2017; Sandler et al., 2018; Ma et al., 2018).
Speciﬁcally, MobileNet-V1 (Howard et al., 2017) requires 94%, 74% of the overall computational cost and the overall number of weight parameters for the existing PC layer, respectively.
Therefore, there were attempts to reduce computation complexity of PC layer.
Zhang et al.
(2017b)
proposed ShufﬂeNet-V1 where the features are decomposed into several groups over channels and PC operation was conducted for each group, thus reducing the number of weight parameters and FLOPs by the number of groups G .
However, it was proved in Ma et al.
(2018) that the memory access cost increases as G increases, leading to slower inference speed.
Similarly to the aforementioned methods, our work is to reduce computation complexity and the number of weight parameters in a convolution layer.
However, our objective is more oriented on ﬁnding out mathe- matically efﬁcient algorithms that make the weights in convolution kernels more effective in feature representation as well as efﬁcient in terms of computation.
2. Q UANTIZATION
Quantization in neural networks reduced the number of bits utilized to represent the weights and/or activations.
Vanhoucke et al.
(2011) applied 8-bit quantization on weight parameters, which enabled considerable speed-up with small drop of accuracy.
Gupta et al.
(2015) applied 16-bit ﬁxed point representation with stochastic rounding.
Based on Han et al.
(2015b) which pruned the unimportant weight connections through thresholding the values of weight, Han et al.
(2015a) successfully combined the pruning with 8 bits or less quantization and huffman encoding.
The extreme case of quantized networks was evolved from Courbariaux et al.
(2015), which approximated weights with the binary ( +1 , − 1 ) values.
From the milestone of Courbariaux et al.
(2015), Courbariaux & Bengio (2016)
; Hubara et al.
(2016) constructed Binarized Neural Networks which either stochastically or deterministically binarize the real value weights and activations.
These binarized weights and activations lead to signiﬁcantly reduced run-time by replacing ﬂoating point multiplications with 1-bit
XNOR operations.
Based on Binarized Neural Networks (Courbariaux & Bengio, 2016; Hubara et al., 2016), Local
Binary CNN (Juefei-Xu et al., 2016) proposed a convolution module that utilizes binarized nonlearnable weights in spatial convolution based on Local Binary Patterns, thus replacing multiplications with addition/subtraction operations in spatial convolution.
However, they did not consider reducing computation complexity in PC layer and remained the weights of PC layer learnable ﬂoating point variables.
Our work shares the similarity to Local Binary CNN (Juefei-Xu et al., 2016) in using binary ﬁxed weight values.
However, Local Binary Patterns have some limitations for being applied in CNN since they can only be used in spatial convolution as well as there are no approaches that enable fast computation of them.
2. C ONVENTIONAL T RANSFORMS
In general, several transform techniques have been applied for image processing.
Discrete Cosine
Transform (DCT) has been used as a powerful feature extractor (Dabbaghchian et al., 2010).
For
N -point input sequence, the basis kernel of DCT is deﬁned as a list of cosine values as below:
[Equation]
where m is the index of a basis and captures higher frequency information in the input signal as m increases.
This property led DCT to be widely applied in image/video compression techniques that emphasize the powers of image signals in low frequency regions (Rao & Yip, 2014).
Discrete Walsh Hadamard Transform (DWHT) is a very fast and efﬁcient transform by using only +1 and − 1 elements in kernels.
These binary elements in kernels allow DWHT to perform without any multiplication operations but addition/subtraction operations.
Therefore, DWHT has been widely used for fast feature extraction in many practical applications, such as texture image segmentation (Vard et al., 2011), face recognition (Hassan et al., 2007), and video shot boundary detection (G. & S., 2014).
Further, DWHT can take advantage of a structured-wiring-based fast algorithm (Algorithm 1) as well as allowing very high efﬁciency in encoding the spatial information (Pratt et al., 1969).
The basis kernel matrix of DWHT is deﬁned using the previous kernel matrix as below:
[Equation]
where H 0 = 1 and D ≥ 1 .
In this paper we denote H Dm as the m -th row vector of H D in Eq.
Additionally, we adopt fast DWHT algorithm to reduce computation complexity of PC layer in neural networks, resulting in an extremely fast and efﬁcient neural network.
M ETHOD
We propose a new PC layer which is computed with conventional transforms.
The conventional PC layer can be formulated as follows:
[Equation]
where ( i , j ) is a spatial index, and m is output channel index.
In Eq. 3, N and M are the number of input and output channels, respectively.
X ij ∈ R N is a vector of input X at the spatial index ( i , j ),
W m ∈ R N is a vector of m -th weight W in Eq.
For simplicity, the stride is set as 1 and the bias is omitted in Eq.
Our proposed method is to replace the learnable parameters
W m with the bases in the conventional transforms.
For example, replacing W m with H Dm in Eq.
3, we now can formulate the new multiplication-free PC layer using DWHT.
Similarly, the DCT basis kernels C m in Eq.
1 can substitute for W m in Eq.
3, formulating another new PC layer using DCT.
Note that the normalization factors in the conventional transforms are not applied in the proposed PC layer, because Batch Normalization (Ioffe & Szegedy, 2015) performs a normalization and a linear transform which can be viewed as a normalization in the existing transforms.
The most important beneﬁt of the proposed method comes from the fact that the fast algorithms of the existing transforms can be applied in the proposed PC layers for further reduction of computation.
Directly applying above new PC layer gives computational complexity of O ( N 2 ) .
Adopting the fast algorithms, we can signiﬁcantly reduce the computation complexity of PC layer from O ( N 2 ) to O ( NlogN ) without any change of the computation results.
We demonstrate the pseudo-code of our proposed fast PC layer using DWHT in Algorithm 1 based on the Fast DWHT structure shown in Figure 1a.
In Algorithm 1, for logN iterations, the evenindexed channels and odd-indexed channels are added and subtracted in element-wise manner, respectively.
The resulting elements which were added and subtracted are placed in the ﬁrst N/elements and the last N/ 2 elements of the input of next iteration, respectively.
In this computation process, each iteration requires only N operations of additions or subtractions.
Consequently, Algorithm 1 gives us complexity of O ( NlogN ) in addition or subtraction.
Compared to the existing
PC layer that requires complexity of O ( N 2 ) in multiplication, our method is extremely cheaper than the conventional PC layer in terms of computation costs as shown in Figure 1b and in power consumption of computing devices (Horowitz, 2014).
Note that, similarly to fast DWHT, DCT can also be computed in a fast manner that recursively decomposes the N -point input sequence into two subproblems of N/
-point DCT
(Kok, 1997).
Compared to DWHT, DCT takes advantage of using more natural shapes of cosine basis kernels, which tend to provide better feature extraction performance through capturing the frequency information.
However, DCT inevitably needs multiplications for inner product between C and X vectors, and a look up table (LUT) for computing cosine kernel bases which can increase the processing time and memory access.
On the other hand, as mentioned, the kernels of DWHT consist only of +1 , −which allows for building a multiplication-free module.
Furthermore, any memory access towards kernel bases is not needed if our structured-wiring-based fast DWHT algorithm (Algorithm 1) is applied.
Our comprehensive experiments in Section 3.1 and 3.2 show that DWHT is more efﬁcient than DCT in being applied in PC layer in terms of trade-off between the complexity of computation cost and accuracy.
Note that, for securing more general formulation of our newly deﬁned PC layer, we padded zeros along the channel axis if the number of input channels are less than that of output channels while truncating the output channels when the number of output channels shrink compared to that of input channels as shown in Algorithm 1.
Figure 1a shows the architecture of fast DWHT algorithm described in Algorithm 1.
This structuredwiring-based architecture ensures that the receptive ﬁeld of each output channels is N , which means each output channel is fully reﬂected against all input channels through log 2 N iterations.
This fullyreﬂected property helps to capture the input channel correlations in spite of the computation process of what channel elements will be added and subtracted being structured in a deterministic manner.
For successfully fusing our new PC layer into neural networks, we explored two themes: i) an optimal block search for the proposed PC; ii) an optimal insertion strategy of the proposed block found by i), in a hierarchical manner on the blocks of networks.
We assumed that there are an optimal block unit structure and an optimal hierarchy level (high-, middle-, low-level) blocks in the neural networks favored by these non-learnable transforms.
Therefore, we conducted the experiments for the two aforementioned themes accordingly.
We evaluated the effectiveness for each of our networks by accuracy ﬂuctuation as the number of learnable weight parameters or FLOPs changes.
For comparison, we counted total FLOPs with summation of the number of multiplications, additions and subtractions performed during the inference.
Unless mentioned, we followed the default experimental setting as batch size = 128, training epochs = 200, initial learning rate = 0.1 where 0.94 is multiplied per 2 epochs, and momentum = 0.9 with weight decay value = 5e-4.
In all the experiments, the model accuracy was obtained by taking an average of three training results in every case.
[Figure]
Input: 4D input features X ( B × N × H × W ), output channel M 1: n ← log 2 N 2: if N<M then 3:
ZeroPad1D( X , axis=1)
(cid:46) pad zeros along the channel axis 4: end if 5: for i ← 1 to n do 6: e ← X
[: , :: 2 , : , :] 7: o ← X
X [: , : N/ 2 , : , :] ← e + o 9:
X [: , N/ 2 : , : , :] ← e − o 10: end for 11: if N>M then 12:
X ← X
[: , : M, : , :] 13: end if
3. O PTIMAL B LOCK STRUCTURE FOR THE CONVENTIONAL TRANSFORMS
From a microscopic perspective, the block unit is the basic foundation of neural networks, and it determines the efﬁciency of the weight parameter space and computation costs in terms of accuracy.
Accordingly, to ﬁnd the optimal block structure for our proposed PC layer, our experiments are conducted to replace the existing PC layer blocks with our new PC layer blocks in ShufﬂeNet-V (Ma et al., 2018).
The proposed block and its variant blocks are listed in Figure 2.
Comparing the results of (c) and (d) in Table 1 informs us the important fact that the ReLU (Nair & Hinton, 2010) activation function signiﬁcantly harms the accuracy of our neural networks equipped with the conventional transforms.
We empirically analyzed this phenomenon in Section 4.1.
Additionally, comparing the accuracy results of (b) and (d) in Table 1 denotes that the proposed PC layers are superior to the PC layer which randomly initialized and ﬁxed its weights to be non-learnable.
These results imply that DWHT and DCT kernels can better extract meaningful information of crosschannel correlations compared to the kernels which are carelessly initialized and non-learnable.
Compared to the baseline model in Table 1, (d)-DCT w/o ReLU and (d)-DWHT w/o ReLU blocks show accuracy drop by approximately 2.3% under the condition that 42% and 49.5% of learnable weight parameters and FLOPs are reduced, respectively.
These imply that the proposed blocks (c) and (d) are still inefﬁcient in trade-off between accuracy and computation costs of neural networks, leading us to more explore to ﬁnd out an optimal neural network architecture.
In the next subsection, we address this problem through applying conventional transforms on the optimal hierarchy level features (See Section 3.2).
Based on our comprehensive experiments, we set the block structure (d) as our default proposed block which will be exploited in all the following experiments.
[Figure]
3. O PTIMAL HIERARCHY LEVEL BLOCKS FOR CONVENTIONAL TRANSFORMS
In this section, we search on an optimal hierarchy level where our optimal block which is based on the proposed PC layer is effectively applied in a whole network architecture.
The optimal hierarchy level will allow the proposed network to have the minimal number of learnable weight parameters and FLOPs without accuracy drop, which is made possible by non-parametric and extremely fast conventional transforms.
It is noted that applying our proposed block on the high-level blocks in the network provides much more reduced number of parameters and FLOPs rather than applying on low-level blocks, because channel depth increases exponentially as the layer goes deeper in the network.
[Table] [Table]
-V2 architecture with width hyper-parameter 0.5x, 1x, 1.1x, 1.5x.
Our models were all experimented with 1.1x setting, and each dot in the ﬁgures represents mean accuracy of 3 network instances.
Note that the blue line denotes the indicator of the efﬁciency of weight parameters or FLOPs in terms of accuracy.
The upper left part from the blue line is the superior region while lower right part from blue line is the
In Figure 3, we applied our optimal block (i.e. (d) block in Figure 2) on high- , middle- and low-level blocks, respectively.
In our experiments, we evaluate the performance of the networks depending on the number of blocks where the proposed optimal block is applied.
The model that we have tested is denoted as (transform type)-(# of the proposed blocks)-(hierarchy level in Low (L), Middle (M), and High (H) where the proposed optimal is applied).
For example, DWHT-3-L indicates the neural network model where the ﬁrst three blocks in ShufﬂeNet-V2 consist of the proposed blocks, while the other blocks are the original blocks of ShufﬂeNet-V2.
It is noted that in this experiment, we ﬁx all the blocks with stride = 2 in the baseline model to be original ShufﬂeNet-V2 (Ma et al., 2018) stride = 2 blocks.
Figure 3 shows the performance of the proposed methods depending on the transform types { DCT,
DWHT } , hierarchy levels { L, M, H } and the number of the proposed blocks that replace the original ones in the baseline { 3, 6, 10 } in terms of Top-1 accuracy and the number of learnable weight parameters (or FLOPs).
It is noted that, since the baseline model has only 7 blocks in the middlelevel Stage (i.e. Stage3), we performed the middle-level experiments only for DCT/DWHT-3-M and -7-M models where the proposed blocks are applied from the end of Stage3 in the baseline model.
In
Figure 3, the performance of our 10-H (or 10-L), 6-H (or 6-L), 3-H (or 3-L) models (7-M and 3-M only for middle-level experiments) is listed in ascending order of the number of learnable weight parameters and FLOPs.
As shown in the ﬁrst column of Figure 3, applying our optimal block on the high-level blocks achieved much better trade-off between the number of learnable weight parameters (FLOPs) and accuracy.
Meanwhile, applying on middle- and low-level features suffered, respectively, slightly and severely from the inefﬁciency of the number of weight parameters (FLOPs) with regard to accuracy.
This tendency is shown similarly for both DWHT-based models and DCT-based models, which implies that there can be an optimal hierarchical level of blocks favored by conventional transforms.
Also note that our DWHT-based models showed slightly higher or same accuracy with less FLOPs in all the hierarchy level cases compared to our DCT-based models.
This is because the fast version of DWHT does not require any multiplication but needs much less amount of addition or subtraction operations compared to the fast version of DCT while it also has the sufﬁcient ability to extract cross-channel information with the exquisite wiring-based structure.
For verifying the generality of the proposed method, we also applied our methods into MobileNetV1 (Howard et al., 2017).
Inspired by the above results showing that optimal hierarchy blocks for conventional transforms can be found in the high-level blocks, we replaced high-level blocks of baseline model (MobileNet-V1) and changed the number of proposed blocks that are replaced to verify the effectiveness of the proposed method.
The experimental results are described in Table 2.
Remarkably, as shown in Table 2, our DWHT-6-H model yielded the 1.49% increase in Topaccuracy even under the condition that the 79.4% of parameters and 49.4% of FLOPs are reduced compared with the baseline 1x model.
This outstanding performance improvement comes from the depthwise separable convolutions used in MobileNet-V1, where PC layers play dominant roles in computation costs and memory space, i.e. they consume 94.86% in FLOPs and 74% in the total number of parameters in the whole network (Howard et al., 2017).
The full performance results for all the hierarchy levels { L, M, H } and the number of blocks { 3, 6, 10 } (exceptionally, { 3, 7 } blocks for the middle level experiments) are described in Appendix A.
In Appendix A, based on the comprehensive experiments it can be concluded that i)
the proposed
PC block always shows its better efﬁciency of number of parameters and FLOPs when applied on high-levels compared to when applied on low-level in the network hierarchy; ii) the performance gain start to decrease when the number of transform based PC blocks exceeded a certain capacity of the networks.
[Table]
width hyper-parameter 1x.
We replaced both stride 1, 2 blocks in the baseline model with the optimal block that consist of [ 3 × 3 depthwise convolutionBatch Normalization - ReLU - CTPC - Batch Normalization] in series.
E XPERIMENTS AND A NALYSIS
In this section, we analyze the signiﬁcant accuracy degradation of applying ReLU after our proposed
PC layer.
Additionally, we analyze the active utilization of 3x3 depthwise convolution weight kernel values which takes an auxiliary role for conventional transform being non-learnable.
4. H INDRANCE OF R E LU IN CROSS - CHANNEL REPRESENTABILITY
As shown in Table applying ReLU after conventional transforms signiﬁcantly harmed the accuracy.
This is due to the properties of conventional transform basis kernels that both H Dm in Eq.and C m in Eq.
1 have the same number of positive and negative parameters in the kernels except for m =
and that the distributions of absolute values of positive and negative elements in kernels are almost identical.
These properties let us know that the output channel elements that have under zero value should also be considered during the forward pass; when forwarding X ij in Eq. 3 through the conventional transforms if some important channel elements in X ij that have larger values than others are combined with negative values of C m or H Dm , the important cross-channel information in the output Z ijm in Eq.
3 can reside in the value range under zero.
Figure 4 shows that all the hierarchy level activations from both DCT and DWHT based PC layer have not only positive values but also negative values in almost same proportion.
These negative values possibly include important cross-channel correlation information.
Thus, applying ReLU on activations of PC layers which are based on conventional transforms discards crucial cross-channel information contained in negative values that must be forwarded through, leading to signiﬁcant accuracy drop as shown in the results of Table 1.
Figure 6 empirically demonstrates above theoretical analysis by showing that as the negative value regions are fully ignored (i.e. F = ReLU), the accuracy is signiﬁcantly degraded while fully reﬂecting the negative value regions (i.e. g = 1) shows the best accuracy.
From above kernel value based analysis and its experiment, we do not use non-linear activation function after the proposed PC layer.
4. A CTIVE 3 × 3 DEPTHWISE CONVOLUTION WEIGHTS
In Figure 5 and Appendix B, it is observed that 3 × 3 depthwise convolution weights of last 3 blocks in DWHT-3-H and DCT-3-H have much less near zero values than that of baseline model.
That is, the number of values which are apart from near-zero is much larger on DCT-3-H and DWHT3-H models than on baseline model.
We conjecture that these learnable weights whose values are apart from near-zero were actively ﬁtted to the optimal domain that is favored by conventional transforms.
Consequently, these weights are actively and sufﬁciently utilized to take the auxiliary role for conventional transforms which are non-learnable, deriving accuracy increase compared to the conventional PC layer as shown in Figure 3.
To verify the impact of activeness of these 3 × 3 depthwise convolution weights in the last 3 blocks, we experimented with regularizing these weights varying the weight decay values.
Higher weight decay values strongly regularize the scale of 3 × 3 depthwise convolution weight values in the lastblocks.
Thus, strong constraint on the scale of these weight values hinders active utilization of these weights, which results in accuracy drop as shown in Figure 7.
C ONCLUSION
We propose the new PC layers through conventional transforms.
Our new PC layers allow the neural networks to be efﬁcient in complexity of computation and learnable weight parameters.
Especially for DWHT-based PC layer, its ﬂoating point multiplication-free property enabled extremely efﬁcient in computation overhead.
With the purpose of successfully fusing our PC layers into neural networks, we empirically found the optimal block unit structure and hierarchy level blocks in neural networks for conventional transforms, showing accuracy increase and great representability in cross-channel correlations.
We further intrinsically revealed the hindrance of ReLU toward capturing the cross-channel representability and the activeness of depthwise convolution weights on the last blocks in our proposed neural network.
A G ENERALITY OF APPLYING PROPOSED PC LAYERS IN OTHER N EURAL N ETWORKS
In Figure 8, for the purpose of ﬁnding more deﬁnite hierarchy level of blocks favored by our proposed PC layers, we subdivided our middle level experiment scheme; DCT/DWHT-3-M-Front model denotes the model which applied the proposed blocks from the beginning of Stage3 in the baseline while DCT/DWHT-3-M-Rear model denotes the model which applied the end of
Stage3.
The performance curves of all our proposed models in Figure 8 show that if we apply the proposed optimal block within the ﬁrst 6 blocks in the network, the Top-1 accuracy is mildly or signiﬁcantly deteriorated compared to the required computational cost and number of learnable parameters, informing us the important fact that there are the deﬁnite hierarchy level blocks which are favored or not favored by our proposed PC layers in the network.
B H ISTOGRAM OF 3 × 3 DEPTHWISE CONVOLUTION WEIGHTS IN HIGH - LEVEL BLOCKS
C P ERFORMANCE COMPARISON BETWEEN RCPC AND PROPOSED PC LAYERS
For the purpose of demonstrating the superiority of our proposed DCT/DWHT based PC layers over
RCPC layer in all the hierarchical (i.e. low/mid/high) level layers, we compared the performance trade-off in Figure 10.
It is noted that DCT/DWHT based PC layers almost always get higher accuracy than RCPC layer in all the hierarchical level layers.
Comparing the distance between the orange or green line with the red line in Figure 10, our DCT/DWHT based PC layers showed high efﬁciency in trade-off between accuracy and the computational costs or number of learnable parameters, compared to RCPC layer in almost all the hierarchical levels.
D G ENERALITY OF APPLYING OUR PROPOSED PC LAYERS ON OTHER TASKS
[Table] [Table]
discontinuous criterion in FDDB dataset.
In order to demonstrate the domain-generality of the proposed method, we conducted comprehensive experiments on applying our proposed PC layers to object detection, speciﬁcally to the face detection task.
For face detection schemes such as anchor design, data augmentation and featuremap resolution design, we followed Zhang et al.
(2017a) which is one of the baseline methods in face detection ﬁeld.
It is noted that there is a huge demand on real-time face detection algorithms having high detection accuracy, which leads us to applying our PC layers to a lightweight face detection network.
Therefore, instead of using VGG16 (Simonyan & Zisserman, 2014) as backbone network as in Zhang et al.
(2017a)
, we set MobileNet-V1 0.25x as our baseline backbone model where extra depthwise separable blocks are added for detecting more diverse scales of face in the images.
In this baseline model, we replaced the conventional PC layers within last 3, 6 blocks with our DCT/DWHT based PC layers.
We trained all the models on the WIDER FACE (Yang et al., 2016) train dataset and evaluated on WIDER FACE validation dataset and Face Detection Data Set and Benchmark (FDDB) dataset (Jain & Learned-Miller, 2010).
WIDER FACE validation set has
Easy, Medium and Hard subsets, which correspond to large, medium and small scale faces, respectively.
Validation results of the baseline model and our proposed DCT/DWHT models on WIDER
FACE are described in Table 3.
In Table 3, we note that, overall, our DWHT-3-H and DWHT-6-H models showed comparable or even higher mAP values than the baseline model on all the subsets (Easy, Medium, and Hard) with signiﬁcantly reduced number of learnable parameters and FLOPs.
Especially, DWHT-3-H model achieved 0.27% higher mAP than the baseline model under the condition that 79% of parameters and 16% of FLOPs are reduced on Hard subset.
Regarding DCT-3-H and DCT-6-H models, they showed a solid improvement of mAP on Easy and Medium subsets with signiﬁcantly reduced number of parameters and FLOPs compared to the baseline model.
Additionally, we veriﬁed the effectiveness of the proposed method on the FDDB dataset in Table 4.
We note that our DWHT-6-H and DWHT-3-H models showed comparable or even 0.09% higher
AP than the baseline model with signiﬁcantly reduced number of learnable parameters and FLOPs.
On the other hand, our DCT-6-H and DCT-3-H models showed a small degree of degradation on
AP compared to the baseline model, which is a mild degradation considering the reduced amount of parameters and FLOPs.
Consequently, our comprehensive experiments on both WIDER FACE and FDDB datasets reveal the generality of our proposed method, enabling neural networks to be extremely lightweight and reduce the computational overhead.