代码搜索：Gradient

找到约 2,951 项符合「Gradient」的源代码

代码结果 2,951
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/464351/7164850

m p0309.m

[I,map]=imread('3-22.jpg'); imshow(I,map); I=double(I); [Gx,Gy]=gradient(I); % 计算梯度 G=sqrt(Gx.*Gx+Gy.*Gy); % 注意是矩阵点乘 J1=G; figure,imshow(J1,map); % 第一种图像增强 J2=I;
·
www.eeworm.com/read/450826/7476355

asv bp1.asv

net=newff([-1 2; 0 5],[3,1],{'tansig','purelin'},'traingd'); net.trainParam.show = 50; net.trainParam.lr = 0.05; net.trainParam.epochs = 300; net.trainParam.goal = 1e-5; p = [-1 -1 2 2;0 5 0
·
www.eeworm.com/read/448535/7531368

m conjgrad2.m

function [x,X] = conjgrad2(x,grad,hess) % % Apply the conjugate gradient to minimize a function % % function [x,X] = conjgrad2(x,grad,hess) % % x = starting point % grad = the gradient of the f
·
www.eeworm.com/read/442234/7656673

m ex234.m

%******************************************************** %程序：EX234.M %功能：工作空间直接做图法使用实例 %******************************************************** [x,y,z]=peaks(30); %定义图形peaks contour(x,y,z
·
www.eeworm.com/read/440480/7688837

m desccuboid_grad.m

% Cuboid descriptor based on histogrammed gradient. % % Adaptation of Lowe's SIFT descriptor for cuboids. Creates a descriptor for an cuboid % that is fairly robust to small perturbations of the cubo
·
www.eeworm.com/read/435844/7782946

m exm044_3.m

%exm044_3.m F=[1,2,3;4,5,6;7,8,9] Dx=diff(F) %相邻行差分 Dx_2=diff(F,1,2) %相邻列差分。第三输入宗量2表示"列"差分。 [FX,FY]=gradient(F) %数据点步长默认为1 [FX_2,FY_2]=gradient(F,0.5) %数据点步长为0.5
·
www.eeworm.com/read/435615/7789100

c dogleg_.c

/* dogleg.f -- translated by f2c (version 20020621). You must link the resulting object file with the libraries: -lf2c -lm (in that order) */ #include #include "minpack.h" #define min(
·
www.eeworm.com/read/435615/7789104

c dogleg.c

/* dogleg.f -- translated by f2c (version 20020621). You must link the resulting object file with the libraries: -lf2c -lm (in that order) */ #include #include "cminpack.h" #define min
·
www.eeworm.com/read/240795/13197359

m p0309.m

[I,map]=imread('3-22.jpg'); imshow(I,map); I=double(I); [Gx,Gy]=gradient(I); % 计算梯度 G=sqrt(Gx.*Gx+Gy.*Gy); % 注意是矩阵点乘 J1=G; figure,imshow(J1,map); % 第一种图像增强 J2=I;
·
www.eeworm.com/read/323831/13314305

h cqetraces.h

// Copyright (C) 2003 // Gerhard Neumann (gerhard@igi.tu-graz.ac.at) // // This file is part of RL Toolbox. // http://www.igi.tugraz.at/ril_toolbox // // All rights reserved.
·