Improved CFC algorithm for template decomposition with guaranteed robustness

In this paper, an improved version of CFC algorithm is proposed. The main contribution is the reduction of a dimension in the search space. Moreover, the elements in the reduced search space are entries of control templates of uncoupled CNNs and the corresponding linearly separable Boolean functions are robust in the sense of maximal geometric margin. Illustrative examples demonstrate the efficiency of the proposed method.