Back to Search
Start Over
Improved CFC Algorithm for Template Decomposition with Guaranteed Robustness
- Source :
- 2005 9th International Workshop on Cellular Neural Networks and Their Applications.
- Publication Year :
- 2005
- Publisher :
- IEEE, 2005.
-
Abstract
- 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.
Details
- Database :
- OpenAIRE
- Journal :
- 2005 9th International Workshop on Cellular Neural Networks and Their Applications
- Accession number :
- edsair.doi...........c6efb362e0ebcba766d34330de4bae02