• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.5
• /
• pp.561-570
• /
• 1989

In this paper, we describe the theoretical analysis and optical implementation of real-time associative memory based on the modified Hopfield neural network model by using a commerical LCTV connected to computer graphic as the real-time memory mask and adding one mask line to the momory mask in order to optically obtain the time-varing thresholding values of the modified Hopfield model.

• Proceedings of the KIEE Conference
• /
• 1990.07a
• /
• pp.539-541
• /
• 1990

A new neural network model, based on the Hopfield's crossbar associative network, is presented and shown to be an effective tool for the NP-Complete problems. This model is applied to a class of layer assignment problems for VLSI routing. The results indicate that this modified Hopfield model improves stability and accuracy.

• The Journal of Information Technology
• /
• v.7 no.2
• /
• pp.43-54
• /
• 2004

Since Dr. John J. Hopfield has proposed the HOpfield network, it has been widely applied to the pattern recognition and the routing optimization. The method of Jian-Hua Li improved efficiency of Hopfield network which input pattern's weights are regenerated by SVD(singluar value decomposition). This paper deals with Li's Hopfield Network by linear pre-processing. Linear pre-processing is used for increasing orthogonality of input pattern set. Two methods of pre-processing are used, Hadamard method and random method. In manner of success rate, radom method improves maximum 30 percent than the original and hadamard method improves maximum 15 percent. In manner of success time, random method decreases maximum 5 iterations and hadamard method decreases maximum 2.5 iterations.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.3
• /
• pp.48-56
• /
• 1995

This paper presents a method of implementing efficient optical flow estimation for dynamic scene analysis using the hierarchical Hopfield neural networks. Given the two consequent inages, Zhou and Chellappa suggested the Hopfield neural network for computing the optical flow. The major problem of this algorithm is that Zhou and Chellappa's network accompanies self-feedback term, which forces them to check the energy change every iteration and only to accept the case where the lower the energy level is guaranteed. This is not only undesirable but also inefficient in implementing the Hopfield network. The another problem is that this model cannot allow the exact computation of optical flow in the case that the disparities of the moving objects are large. This paper improves the Zhou and Chellapa's problems by modifying the structure of the network to satisfy the convergence condition of the Hopfield model and suggesting the hierarchical algorithm, which enables the computation of the optical flow using the hierarchical structure even in the presence of large disparities.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.710-713
• /
• 1995

Hopfield networks have been applied to the problem of linear system identification. In this paper, Hopfield network based parameter identification scheme of non-linear dynamic systems is proposed. Simulation results demonstrate that Hopfield network can be used effectively for the identification of non-linear systems assuming that the system states and their time derivatives are available. Therefore, the proposed scheme can be applied in fault detection and isolation(FDI) and adaptive control of non-linear systems where the Hopfield networks perform on-line identification of system parameters.

• Structural Engineering and Mechanics
• /
• v.7 no.5
• /
• pp.485-502
• /
• 1999

Using the continuous Hopfield network model as the basis to solve the general crisp and fuzzy constrained optimization problem is presented and examined. The model lies in its transformation to a parallel algorithm which distributes the work of numerical optimization to several simultaneously computing processors. The method is applied to different structural engineering design problems that demonstrate this usefulness, satisfaction or potential. The computing algorithm has been given and discussed for a designer who can program it without difficulty.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.160-160
• /
• 2000

An optimization approach is used to solve the division problem of working area, and a cost function is defined to represent the constraints on the solution, which is then mapped onto the Hopfield neural network for minimization. Each neuron in the network represents a possible combination among many components. Division is achieved by initializing each neuron that represents a possible combination and then allowing the network settle down into a stable state. The network uses the initialized inputs and the compatibility measures among components in order to divide working area.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.2
• /
• pp.234-237
• /
• 1991

A new neural network model, based on the Hopfield crossbar associative network, is presented and shown to be an effective tool for the NP-Complete problems. This model is applied to a class of layer assignment problems for VLSI routing. The results indicate that this modified Hopfield model, improves stability and accuracy.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.329-331
• /
• 2000

데이터 클러스터링은 서로 유사한 성질을 갖는 데이터들은 동일한 클러스터에 분류하고, 이질적인 데이터는 다른 클러스터에 분류하여, 클러스터 내의 유사성은 최대로 하고 클러스터와 클러스터사이의 유사성을 최소로 하는 것을 말한다. 데이터 클러스터링은 데이터 마이닝, 기계 학습, 패턴 인식, 통계 분야 등에 다양하게 활용되고 있다. Hopfield 네트워크는 조합적 최적화 문제를 해결하는데 사용되어 좋은 결과를 나타내고 있다. 본 논문에서는 Hopfield 네트워크를 사용하여 데이터 클러스터링 문제를 해결하는 알고리즘을 연구하였고, 실험을 통해 기존의 방법과 비교하였다.

• Journal of the Chungcheong Mathematical Society
• /
• v.34 no.3
• /
• pp.221-234
• /
• 2021

We introduce high-order Hopfield neural networks with Leakage delays. Furthermore, we study the uniqueness and existence of Hopfield artificial neural networks having the weighted pseudo almost periodic forcing terms on finite delay. Our analysis is based on the differential inequality techniques and the Banach contraction mapping principle.