Abstract

Artificial intelligence has become one of the most rapidly developing disciplines in the application field of pattern recognition. In target recognition, sometimes, there are multiple identical or similar copies of the target to be recognized in the image, and it is difficult to classify and estimate by traditional methods. In this case, it is necessary to use the SOM network to separate multiple targets and use the multiple order parameters in the improved SNN to pair the target. The change of its thickness can intuitively reflect the abnormality of its tissue. Therefore, the choroidal thickness of the central fovea can be measured to study the relationship between the choroidal structure and BRVO and arteriosclerosis. The purpose of this study is to further study the correlation between branch retinal vein occlusion and arteriosclerosis by quantitatively measuring retinal vessel diameter and choroidal thickness, to analyze the correlation between different TCM syndrome types of nonischemic BRVO and retinal arteriosclerosis, and to provide theoretical basis for clinical nonischemic BRVO TCM syndrome types and traditional Chinese medicine treatment, so as to reflect its clinical application value. In order to solve the single fixed structure of traditional SNN and poor scalability, combined with the Kohonen layer structure in the self-organizing mapping network, an improved collaborative neural network model is proposed. This paper studies the network training method and operation convergence and analyzes the converged network and the pattern classification results obtained by the network. In order to solve the single fixed structure of traditional SNN and poor scalability, combined with the Kohonen layer structure in the self-organizing mapping network, an improved collaborative neural network model is proposed. The results of our proposed improved model on the MNIST dataset can achieve the same level of current state-of-the-art machine learning classifiers in recognition accuracy with a smaller network size and network complexity.

Full Text
Published version (Free)

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