首页> 外国专利> Neural network for improved classification of patterns which adds a best performing trial branch node to the network

Neural network for improved classification of patterns which adds a best performing trial branch node to the network

机译:神经网络,用于改进模式分类,从而为网络增加了性能最佳的试验分支节点

摘要

Each processing element has a number of weights for each input connection. These weights are coefficients of a polynomial equation. The use of quadratic nodes permits discrimination between body pixel and edge pixels, in which an intermediate value is present, using a grey scale image. In the training method of the present invention, the middle layer is initially one leaf node which is connected to each output node. The contribution of each leaf node to the total output error is determined and the weights of the inputs to the leaf nodes are adjusted to minimize the error. The leaf node that has the best chance of improving the total output error is then "converted" into a branch node with two leaves. A branch node selected from a pool of trial branch nodes is used to replace the chosen leaf node. The trial branch nodes are then trained by gradient training to optimize the branch error function. From the set of trial branch nodes, the best performing node is selected and is substituted for the previously-selected leaf node. Two new leaf nodes are then created from the newly-substituted best-performing-branch node. A leaf node is accepted or rejected based upon the number of times it was activated related to the correctness of the classification. Once a leaf node is rejected, it is eliminated from any further operation, thereby minimizing the size of the network. Integer mathematics can be generated within the network so that a separate floating point coprocessor is not required.
机译:每个输入连接的每个处理元素都有许多权重。这些权重是多项式方程的系数。二次节点的使用允许使用灰度图像区分存在中间值的身体像素和边缘像素。在本发明的训练方法中,中间层最初是连接到每个输出节点的一个叶节点。确定每个叶节点对总输出误差的贡献,并调整对叶节点的输入权重以最小化误差。然后,将最有可能改善总输出错误的叶节点“转换”为具有两个叶的分支节点。从试用分支节点池中选择的分支节点用于替换所选叶节点。然后,通过梯度训练对试验分支节点进行训练,以优化分支误差函数。从一组试验分支节点中,选择性能最佳的节点,并替换为先前选择的叶节点。然后从新替代的最佳分支节点创建两个新的叶节点。根据与分类正确性有关的叶节点被激活的次数,接受或拒绝该叶节点。一旦拒绝了叶子节点,则将其从任何进一步的操作中删除,从而将网络的大小最小化。可以在网络内生成整数数学,因此不需要单独的浮点协处理器。

著录项

  • 公开/公告号US5371809A

    专利类型

  • 公开/公告日1994-12-06

    原文格式PDF

  • 申请/专利权人 DESIENO;DUANE D.;

    申请/专利号US19920859828

  • 发明设计人 DUANE D. DESIENO;

    申请日1992-03-30

  • 分类号G06K9/62;

  • 国家 US

  • 入库时间 2022-08-22 04:05:47

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号