代码搜索:Nearest

找到约 1,596 项符合「Nearest」的源代码

代码结果 1,596
www.eeworm.com/read/241807/13115312

m exp2_16.m

%curve interpolation ys=[0 0.9 0.6 1 0 0.1 -0.3 -0.7 -0.9 -0.2]; %已有的样本点ys xs=0:length(ys)-1; %已有的样本点xs x=0:0.1:length(ys)-1;%新的样本点x y1=interp1(xs,ys,x,'nearest'); %插值产生新的样本点y1 y2=interp1(xs,ys,
www.eeworm.com/read/138798/13212222

m knnfwd.m

function [y, l] = knnfwd(net, x) %KNNFWD Forward propagation through a K-nearest-neighbour classifier. % % Description % [Y, L] = KNNFWD(NET, X) takes a matrix X of input vectors (one vector % pe
www.eeworm.com/read/325030/13229558

m exp2_16.m

%curve interpolation ys=[0 0.9 0.6 1 0 0.1 -0.3 -0.7 -0.9 -0.2]; %已有的样本点ys xs=0:length(ys)-1; %已有的样本点xs x=0:0.1:length(ys)-1;%新的样本点x y1=interp1(xs,ys,x,'nearest'); %插值产生新的样本点y1 y2=interp1(xs,ys,
www.eeworm.com/read/240174/13233549

m odd.m

function y=odd(x); %ODD Round towards nearest odd value. % Y=ODD(X) rounds each element of X towards the nearest odd % integer value. If an element of X is even, ODD adds +1 to % this value. X can b
www.eeworm.com/read/238779/13326050

m odd.m

function y=odd(x); %ODD Round towards nearest odd value. % Y=ODD(X) rounds each element of X towards the nearest odd % integer value. If an element of X is even, ODD adds +1 to % this value. X can b
www.eeworm.com/read/136681/13366798

m exp2_16.m

%curve interpolation ys=[0 0.9 0.6 1 0 0.1 -0.3 -0.7 -0.9 -0.2]; %已有的样本点ys xs=0:length(ys)-1; %已有的样本点xs x=0:0.1:length(ys)-1;%新的样本点x y1=interp1(xs,ys,x,'nearest'); %插值产生新的样本点y1 y2=interp1(xs,ys,
www.eeworm.com/read/319970/13438244

m odd.m

function y=odd(x); %ODD Round towards nearest odd value. % Y=ODD(X) rounds each element of X towards the nearest odd % integer value. If an element of X is even, ODD adds +1 to % this value. X can b
www.eeworm.com/read/319404/13452369

m ex1603.m

%例16-3 外插运算方法和误差 x = 0:10; y = sin(x); xi=5:0.25:15; yi=sin(xi); y1=interp1(x,y,xi,'nearest') y1=interp1(x,y,xi,'nearest','extrap'); y2=interp1(x,y,xi,'linear','extrap'); y3=interp1(x,y,xi,'sp
www.eeworm.com/read/314653/13562240

m knnc.m

%KNNC K-Nearest Neighbor Classifier % % [W,K,E] = KNNC(A,K) % [W,K,E] = KNNC(A) % % INPUT % A Dataset % K Number of the nearest neighbors (optional; default: K is % optimized with resp
www.eeworm.com/read/309752/13664923

m gobad.m

close all; clear; clc; %J=imread('cmanJ.tif'); J=imread('b.tif'); se = translate(strel(1), [30 20]); J = imdilate(I,se); J = imrotate(J,45,'nearest','crop'); %imwrite(J,'cmanJother.tif'); ims