1.

論文

論文
Wang, Youhua ; Ikeda, Kazushi ; Nakayama, Kenji
出版情報: IEEE Proc. of ICASSP'98, Seattle.  pp.1713-1716,  1998-05-01.  IEEE(Institute of Electrical and Electronics Engineers)
URL: http://hdl.handle.net/2297/6833
2.

論文

論文
Ikeda, Kazushi ; Suzuki, Akihiro ; Nakayama, Kenji
出版情報: IEEE International Conference on Neural Networks - Conference Proceedings.  pp.1896-1900,  1997-06-01.  IEEE(Institute of Electrical and Electronics Engineers)
URL: http://hdl.handle.net/2297/6784
概要: The effects of the quantization of the parameters of a learning machine are discussed. The learning coefficient should be as small as possible for a better estimate of parameters. On the other hand, when the parameters are quantized, it should be relatively larger in order to avoid the paralysis of learning originated from the quantization. How to choose the learning coefficient is given in this paper from the statistical point of view. 続きを見る
3.

論文

論文
Miyoshi, Seiji ; Ikeda, Kazushi ; Nakayama, Kenji
出版情報: IEEE&INNS Proc. of IJCNN'98, Anchorage.  pp.2340-2345,  1998-05-01.  IEEE(Institute of Electrical and Electronics Engineers)
URL: http://hdl.handle.net/2297/6807
4.

論文

論文
Kobori, Hideki ; Ikeda, Kazushi ; Nakayama, Kenji
出版情報: IEEE International Conference on Neural Networks - Conference Proceedings.  pp.804-809,  1996-06-01.  IEEE(Institute of Electrical and Electronics Engineers)
URL: http://hdl.handle.net/2297/6839
概要: 金沢大学理工研究域電子情報学系<br />A model of dynamic associative memories is proposed in this paper. The aim is to find all stored pa tterns, and to distinguish the stored and the spurious patterns. Aihara used chaotic neurons and showed that his model has a nonperiodic associative dynamics. In his model, however, it is difficult to distinguish the stored patterns from the others, because the state of the network changes continually. We propose such a new model of neurons that each neuron changes its output to the other when the accumulation of its internal state exceeds a certain threshold. By computer experiments, we show that the state of the network stays at the stored pattern for a while and then travels around to another pattern, and so on. Furthermore, when the number of the stored patterns is small, the stored and the spurious patterns can be distinguished using interval of the network staying these patterns. 続きを見る
5.

論文

論文
Wang, Youhua ; Ikeda, Kazushi ; Nakayama, Kenji
出版情報: ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing.  Proceedings 3  pp.1713-1716,  1998-01-01.  IEEE
URL: http://hdl.handle.net/2297/3943
概要: 金沢大学大学院自然科学研究科情報システム<br />金沢大学工学部<br />The numerical property of an adaptive filter algorithm is the most important prob lem in practical applications. Most fast adaptive filter algorithms have the numerical instability problem and the fast Newton transversal filter (FNTF) algorithms are no exception. In this paper, we propose a numerically stable fast Newton type adaptive filter algorithm. Two problems are dealt with in the paper. First, we derive the proposed algorithm from the order-update fast least squares (FLS) algorithm. This derivation is direct and simple to understand. Second, we give the stability analysis using a linear time-variant state-space method. The transition matrix of the proposed algorithm is given. The eigenvalues of the ensemble average of the transition matrix are shown to be asymptotically all less than unity. This results in a much improved numerical performance compared with the FNTF algorithms. The computer simulations implemented by using a finite-precision arithmetic have confirmed the validity of our analysis. 続きを見る
6.

論文

論文
Minamimoto, Kazuhiro ; Ikeda, Kazushi ; Nakayama, Kenji
出版情報: IEEE International Conference on Neural Networks - Conference Proceedings.  2  pp.789-794,  1995-11-01.  IEEE(Institute of Electrical and Electronics Engineers)
URL: http://hdl.handle.net/2297/6782
概要: In order to analyze the topological structure of the data space using Kohonen's self-organizing feature map (SOFM), a criterion is discussed. The Euclidian distance between the reference vector and the data, the number of the reference vectors and the topology preserving measure are taken into account, and are combined in a unified criterion. Through computer simulation, it is confirmed that goodness of the different reference topologies, that is dimensions, can be clearly discriminated regardless the parameters. Thus, the unified criterion makes it possible to analyze the essential data space topology. 続きを見る
7.

論文

論文
Motoi, Kosuke ; Ikeda, Kazushi ; Kuwae, Y. ; Yuji, T. ; Higashi, Y. ; Nogawa, Masamichi ; Tanaka, Shinobu ; Yamakoshi, Ken-ichi
出版情報: Annual International Conference of the IEEE Engineering in Medicine and Biology - Proceedings 2006.  pp.5940-5943,  2006-01-01.  Institute of Electrical and Electronics Engineers (IEEE)
URL: http://hdl.handle.net/2297/5486
概要: 山越, 憲一<br />金沢大学ベンチャー・ビジネス・ラボラトリー<br />金沢大学大学院自然科学研究科知的システム創成<br />Monitoring of posture change in sagittal plane and wa lking speed is important for evaluate the effectiveness of rehabilitation program or brace. We have developed a wearable device for monitoring human activity. However, in the previous system, there still remain several drawbacks for practical use such as accuracy in angle measurement, cumbersome cable arrangements, and so on. In order to improve these practical drawbacks, a new sensor system was designed, and its availability was evaluated. The results demonstrated that the accuracy of this system showed superior to that of the previous, and this system appears to be a significant means for quantitative assessment of the patient's motion. ©2006 IEEE. 続きを見る
8.

論文

論文
Ikeda, Kazushi ; Wang, Youhua ; Nakayama, Kenji
出版情報: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences.  E80-A  pp.2286-2290,  1997-11-25.  IEICE 電子情報通信学会
URL: http://hdl.handle.net/2297/24657
概要: 金沢大学理工研究域電子情報学系<br />The numerical property of the recursive least squares (RLS) algorithm has been extensively studied. However, very few investigations are reported concerning the numerical behavior of the predictor-based least squares (PLS) algorithms which provide the same least squares solutions as the RLS algorithm. In Ref. [9], we gave a comparative study on the numerical performances of the RLS and the backward PLS (BPLS) algorithms. It was shown that the numerical property of the BPLS algorithm is much superior to that of the RLS algorithm under a finite-precision arithmetic because several main instability sources encountered in the RLS algorithm do not appear in the BPLS algorithm. This paper theoretically shows the stability of the BPLS algorithm by error propagation analysis. Since the time-variant nature of the BPLS algorithm, we prove the stability of the BPLS algorithm by using the method as shown in Ref. [6]. The expectation of the transition matrix in the BPLS algorithm is analyzed and its eigenvalues are shown to have values within the unit circle. Therefore we can say that the BPLS algorithm is numerically stable. 続きを見る