Description: Levenberg-Marquardt优化单应性矩阵,也可经过修改用于相机标定参数的优化-Levenberg-Marquardt optimization homography can also be modified for optimization of camera calibration parameters Platform: |
Size: 2048 |
Author:卫东 |
Hits:
Description:
% Train a two layer neural network with the Levenberg-Marquardt
% method.
%
% If desired, it is possible to use regularization by
% weight decay. Also pruned (ie. not fully connected) networks can
% be trained.
%
% Given a set of corresponding input-output pairs and an initial
% network,
% [W1,W2,critvec,iteration,lambda]=marq(NetDef,W1,W2,PHI,Y,trparms)
% trains the network with the Levenberg-Marquardt method.
%
% The activation functions can be either linear or tanh. The
% network architecture is defined by the matrix NetDef which
% has two rows. The first row specifies the hidden layer and the
% second row specifies the output layer.- Train a two layer neural network with the Levenberg-Marquardt method. If desired, it is possible to use regularization by weight decay. Also pruned (ie. not fully connected) networks can be trained. Given a set of corresponding input-output pairs and an initial network, [W1, W2, critvec, iteration, lambda] = marq (NetDef, W1, W2, PHI, Y, trparms) trains the network with the Levenberg-Marquardt method . The activation functions can be either linear or tanh. The network architecture is defined by the matrix NetDef which has two rows. The first row specifies the hidden layer and the second row specifies the output layer. Platform: |
Size: 3072 |
Author:张镇 |
Hits:
Description: Levenberg-Marquardt 信赖域方法求解非线性方程组的Matlab程序-Levenberg-Marquardt trust region method for solving nonlinear equations of the Matlab program Platform: |
Size: 1024 |
Author:蔚无 |
Hits:
Description: 从国外大学上下的Levenberg算法程序-From foreign universities Levenberg algorithm program from top to bottom Platform: |
Size: 877568 |
Author:李冰 |
Hits:
Description: 这里有个Levenberg-Marquardt算法的程序和ppt介绍-Here' s a Levenberg-Marquardt algorithm described procedures and ppt Platform: |
Size: 2695168 |
Author:王毅 |
Hits: