• 検索結果がありません。

A Study of Local Training Algorithm for Feedforward Neural Networks andd Face Image Recognition

N/A
N/A
Protected

Academic year: 2021

シェア "A Study of Local Training Algorithm for Feedforward Neural Networks andd Face Image Recognition "

Copied!
1
0
0

読み込み中.... (全文を見る)

全文

(1)

A Study of Local Training Algorithm for Feedforward Neural Networks andd Face Image Recognition

2005 Masahiro Yoshida

This thesis describes the novel local training algorithms for training feedforward neural networks and the face image recognition by using feedforward nbural networks. After the introduction, in chapter 2, a novel local training based on the RlS(Recursive Least Squares) with penalty function is described. In local training, it is possible to partition the given problem to the neuron level. Therefore, the local trainings improve computational complexity and storage requirements compared to the global approaches. In addition, the penalty function proposed here is derived from a second-order term in the Taylor

series

expansion of the network output for decreasing the influence of the linearization elror in the RLS. As

a

result, it is shown that the proposed training algorithm yields the high perfonnance for the convergence rate. In chapter 3, the local training

based

on the RLS with weight decay is introduced. The proposed algorithm is

based

on modifying the local training algorithm in chapter 2. As

a

result,

because

the equations for weights update among the proposed method is simple, the learning

speed

is faster than the other algorithms. In chapter 4, the face image recognition by using feedforward neural networks has been done. In the previous researches of face image recognition by neural networks, the gray levels on each pixel of the face image have been used for input data. However,

because

the face image

has

usually too many pixels,

a

variety of approaches have

been

required to reduce the number of the input data. The orthogonal transformations

are used

for reduction of input data and the recognition is

done

by feedforward neural networks. In chapter 5, the conclusions of this thesis

are

described.

‑178‑

参照

関連したドキュメント

4 A Hybrid Learning Algorithm for MLP If the input vectors are mapped onto around the apex of the hypercube through the first hidden layer with a sigmoidal nonlinear function,

In the on-line training, a small number of the train- ing data are given in successively, and the network adjusts the connection weights to minimize the output error for the

Different from the tradition LS algorithm, the SDLS introduced stochastic dynamics into the local search that permits temporary increase of error function, thus resulting in escape

By adapting tools from information theory, I construct optimal, nonlinear local statistical predictors for random fields on networks; these take the form of minimal

tandem queue effect may be detected by traffic simulation methods, it is necessary to directly observe the two successive (upstream and local) overall sojourn times for a local

Table 5 presents comparison of power loss, annual cost of UPQC, number of under voltage buses, and number of over current lines before and after installation using DE algorithm in

In this paper we have investigated the stochastic stability analysis problem for a class of neural networks with both Markovian jump parameters and continuously distributed delays..

Key words: Benjamin-Ono equation, time local well-posedness, smoothing effect.. ∗ Faculty of Education and Culture, Miyazaki University, Nishi 1-1, Gakuen kiharudai, Miyazaki