function const_evidence_bis(exp1,exp2,stat,base)
% zakia hammal 2004
% stat : traitement d'images statiques(le reste) ou d'une sequence(les notre)
% const_evidence_bis('tous','sour',1,0)
%
% base 0 notre base
% 1 base de yale
% 2 bese de kanade
% 3 base d'ecosse
% tous : pour prendre en considération les moyennes calculer pour toutes les expr
% 'sour' : expression en cours d'analyse
% 4 : taille de la fenetre d'analyse
%
% codage de l'évolution des différents paramettres "d1 d2 ..." dans
% la fenetre glissante en etats de la théorie de l'évidence
% conversion numérique/symbolique des résultats pour chaque fenetre
% glissante
%
% charger la table d'evolution des valeurs des "di" à travers une
% fenettre glissante issue de la fonction "affiche_graphe_dist_fenet"
close all
load list_exp
%%%%
save expr exp2
%%%%
% type : 2 vitesse/ 1 distance
%for (type=1:2),
% pour l'instant on travaille sur les dist
for (type=1:1),
switch exp1
case 'sour',
if(type==2)
load seuils_dist_sour
else
load seuils_dist_sour_D
end
moy_vit_Max = moy_vit_Max_sour ;
moy_vit_Min = moy_vit_Min_sour ;
ecart_vit_Max = ecart_vit_Max_sour;
ecart_vit_Min = ecart_vit_Min_sour;
case 'surp',
if(type==2)
load seuils_dist_surp
else
load seuils_dist_surp_D
end
moy_vit_Max = moy_vit_Max_surp;
moy_vit_Min = moy_vit_Min_surp;
ecart_vit_Max = ecart_vit_Max_surp;
ecart_vit_Min = ecart_vit_Min_surp;
case 'deg ',
if(type==2)
load seuils_dist_deg
else
load seuils_dist_deg_D
end
moy_vit_Max = moy_vit_Max_deg;
moy_vit_Min = moy_vit_Min_deg;
ecart_vit_Max = ecart_vit_Max_deg;
ecart_vit_Min = ecart_vit_Min_deg;
case 'tous',
if(type==2)
builtin('load', char(strcat('fenetre_',exp2)));
load seuils_moy
load seuils_ecart
else
if (stat==0)
builtin('load', char(strcat('fenetre_',exp2,'_D')));
else
builtin('load', char(strcat('fenetre_',exp2,'_yale_D')));
end
load seuils_moy_D
load seuils_ecart_D
list_nom
end
end
%charger les seuils de l'état neutre
if(type==2)
load seuils_neutre
else
load seuils_neutre_D
end
% convention
% -2 : etat C-
% 2 : etat C+
% 0 : etat S
% 1 : doute
[nbr1 nbr2 nbr3] = size(fenetre_glissante)
ecart_vit_Max = abs(med_Max(1,:)-moy_vit_Max(1,:));
ecart_vit_Min = abs(med_Min(1,:)-moy_vit_Min(1,:));
% Nombre de classes
N = 7;
% Le nombre d'elements dans l'espace de discernement
NN = 2^N
%initialisation des tableau des masses d'évidence pour chaque capteur
%codage des exp par des nombres décimal
if (type==2)
S = zeros(nbr2,nbr1,nbr3);
Cp = zeros(nbr2,nbr1,nbr3);
Cm = zeros(nbr2,nbr1,nbr3);
SCp = zeros(nbr2,nbr1,nbr3);
SCm = zeros(nbr2,nbr1,nbr3);
save graphe_conf S Cp Cm SCp SCm list_nom list_figure
m11=zeros(nbr1,nbr3,2,6);
% $$$ m11(:,:,1,1)=42;
% $$$ m11(:,:,1,2)=21;
% $$$ m11(:,:,1,3)=96;
% $$$ m11(:,:,1,4)=106;
% $$$ m11(:,:,1,5)=117;
% $$$ %%
% $$$ m11(:,:,1,6)=127;
m11(:,:,1,1)=34;
m11(:,:,1,2)=29;
m11(:,:,1,3)=96;
m11(:,:,1,4)=98;
m11(:,:,1,5)=125;
%%
m11(:,:,1,6)=127;
m12=zeros(nbr1,nbr3,2,6);
m12(:,:,1,1)=34;
m12(:,:,1,2)=29;
m12(:,:,1,3)=96;
m12(:,:,1,4)=98;
m12(:,:,1,5)=125;
%%
m12(:,:,1,6)=127;
m21=zeros(nbr1,nbr3,2,6);
m21(:,:,1,1)=51;
m21(:,:,1,2)=29;
m21(:,:,1,3)=97;
m21(:,:,1,4)=115;
m21(:,:,1,5)=125;
%%
m21(:,:,1,6)=127;
m22=zeros(nbr1,nbr3,2,6);
m22(:,:,1,1)=51;
m22(:,:,1,2)=29;
m22(:,:,1,3)=97;
m22(:,:,1,4)=115;
m22(:,:,1,5)=125;
%%
m22(:,:,1,6)=127;
m3=zeros(nbr1,nbr3,2,4);
m3(:,:,1,1)=53;
m3(:,:,1,2)=42;
m3(:,:,1,3)=122;
%%
m3(:,:,1,4)=127;
m4=zeros(nbr1,nbr3,2,4);
m4(:,:,1,1)=39;
m4(:,:,1,2)=24;
m4(:,:,1,3)=122;
m4(:,:,1,4)=127;
%m4(:,:,1,5)=122;
m51=zeros(nbr1,nbr3,2,5);
% $$$ m51(:,:,1,1)=18;
% $$$ m51(:,:,1,2)=17;
% $$$ m51(:,:,1,3)=110;
% $$$ m51(:,:,1,4)=126;
% $$$ m51(:,:,1,5)=127;
m51(:,:,1,1)=58;
m51(:,:,1,2)=13;
m51(:,:,1,3)=118;
m51(:,:,1,4)=126;
m51(:,:,1,5)=127;
m52=zeros(nbr1,nbr3,2,5);
m52(:,:,1,1)=58;
m52(:,:,1,2)=13;
m52(:,:,1,3)=118;
m52(:,:,1,4)=126;
m52(:,:,1,5)=127;
switch exp2
case 'sour',
save masse_evide_sour m11 m12 m21 m22 m3 m4 m51 m52;
case 'surp',
save masse_evide_surp m11 m12 m21 m22 m3 m4 m51 m52;
case 'deg',
save masse_evide_deg m11 m12 m21 m22 m3 m4 m51 m52;
%%%%%
%%%%%
%%%%%
case 'col',
save masse_evide_col m11 m12 m21 m22 m3 m4 m51 m52;
case 'trist',
save masse_evide_trist m11 m12 m21 m22 m3 m4 m51 m52;
case 'peur',
save masse_evide_peur m11 m12 m21 m22 m3 m4 m51 m52;
end
else
S_D = zeros(nbr2,nbr1,nbr3);
Cp_D = zeros(nbr2,nbr1,nbr3);
Cm_D = zeros(nbr2,nbr1,nbr3);
SCp_D = zeros(nbr2,nbr1,nbr3);
SCm_D = zeros(nbr2,nbr1,nbr3);
save graphe_conf_D S_D Cp_D Cm_D SCp_D SCm_D list_nom list_figure
m11=zeros(nbr1,nbr3,2,6);
m11(:,:,1,1)=34;
m11(:,:,1,2)=29;
m11(:,:,1,3)=96;
m11(:,:,1,4)=98;
m11(:,:,1,5)=125;
%%
m11(:,:,1,6)=127;
m12=zeros(nbr1,nbr3,2,6);
m12(:,:,1,1)=34;
m12(:,:,1,2)=29;
m12(:,:,1,3)=96;
m12(:,:,1,4)=98;
m12(:,:,1,5)=125;
%%
m12(:,:,1,6)=127;
m21=zeros(nbr1,nbr3,2,6);
m21(:,:,1,1)=51;
m21(:,:,1,2)=29;
m21(:,:,1,3)=97;
m21(:,:,1,4)=115;
m21(:,:,1,5)=125;
%%
m21(:,:,1,6)=127;
m22=zeros(nbr1,nbr3,2,6);
m22(:,:,1,1)=51;
m22(:,:,1,2)=29;
m22(:,:,1,3)=97;
m22(:,:,1,4)=115;
m22(:,:,1,5)=125;
%%
m22(:,:,1,6)=127;
m3=zeros(nbr1,nbr3,2,4);
m3(:,:,1,1)=53;
m3(:,:,1,2)=42;
m3(:,:,1,3)=122;
%%
m3(:,:,1,4)=127;
m4=zeros(nbr1,nbr3,2,4);
m4(:,:,1,1)=39;
m4(:,:,1,2)=24;
m4(:,:,1,3)=122;
%m4(:,:,1,4)=127;
m4(:,:,1,4)=127;
m51=zeros(nbr1,nbr3,2,5);
m51(:,:,1,1)=58;
m51(:,:,1,2)=13;
m51(:,:,1,3)=118;
m51(:,:,1,4)=126;
m51(:,:,1,5)=127;
m52=zeros(nbr1,nbr3,2,5);
m52(:,:,1,1)=58;
m52(:,:,1,2)=13;
m52(:,:,1,3)=118;
m52(:,:,1,4)=126;
m52(:,:,1,5)=127;
switch exp2
case 'sour',
save masse_evide_sour_D m11 m12 m21 m22 m3 m4 m51 m52;
case 'surp',
save masse_evide_surp_D m11 m12 m21 m22 m3 m4 m51 m52;
case 'deg',
save masse_evide_deg_D m11 m12 m21 m22 m3 m4 m51 m52;
case 'col',
save masse_evide_col_D m11 m12 m21 m22 m3 m4 m51 m52;
case 'trist',
save masse_evide_trist_D m11 m12 m21 m22 m3 m4 m51 m52;
case 'peur',
save masse_evide_peur_D m11 m12 m21 m22 m3 m4 m51 m52;
end
end
for (i=1:nbr2), % pour chaque distance nbr2
if (nbr1>1)
temp = squeeze(fenetre_glissante(:,i,:));
else
temp = squeeze(fenetre_glissante(:,i,:))';
end
for (j=1:nbr1), % pour chaque individu nbr1
for (k=1:nbr3), % pour chaque valeur nbr3
par = temp(j,k);
if (par <= moy_vit_Min(1,i)) % état C-
tab_etique(i,j,k) = -2;
seuillage(i,j,k,0,0,1,0,0,type);
%1
else
%2
if (par >= moy_vit_Max(1,i)) % état C+
tab_etique(i,j,k) = 2;
seuillage(i,j,k,0,1,0,0,0,type);
%2
else
%3
if (moy_vit_Min_neut(1,i)<=par) & (par<=moy_vit_Max_neut(1,i)); % état S
tab_etique(i,j,k) = 0;
seuillage(i,j,k,1,0,0,0,0,type);
%3
else
%4
if ((moy_vit_Min(1,i))<par) & (par<moy_vit_Min_neut(1,i)) % doute S/C-
%5
if (par<=(moy_vit_Min(1,i)+ecart_vit_Min(1,i)) & par<(moy_vit_Min_neut(1,i)-ecart_vit_Min_neut(1,i))) % %C-
seuil = abs((par-(moy_vit_Min(1,i)+ecart_vit_Min(1,i)))/(ecart_vit_Min(1,i)));
seuillage(i,j,k,0,0,seuil,0,(1-seuil),type);
没有合适的资源?快使用搜索试试~ 我知道了~
TBM_codes.zip_EEG_EEG classification_high_tea
共203个文件
m:78个
mat:77个
m~:40个
1.该资源内容由用户上传,如若侵权请联系客服进行举报
2.虚拟产品一经售出概不退款(资源遇到问题,请及时私信上传者)
2.虚拟产品一经售出概不退款(资源遇到问题,请及时私信上传者)
版权申诉
0 下载量 6 浏览量
2022-07-14
21:28:54
上传
评论
收藏 1.49MB ZIP 举报
温馨提示
EEG classification using high accuracy TEA
资源推荐
资源详情
资源评论
收起资源包目录
TBM_codes.zip_EEG_EEG classification_high_tea (203个子文件)
const_evidence_bis.m 10KB
const_evidence_bis.m 10KB
affiche_graphe_dist_fenet_bis.m 9KB
affiche_graphe_dist_fenet_bis.m 9KB
const_evidence_bis2.m 6KB
const_evidence_bis2.m 6KB
decodage_decis_demps.m 6KB
decodage_decis_demps.m 6KB
const_evidence_bis1.m 6KB
BS_const_evidence_bis1.m 6KB
seuillage1.m 6KB
seuillage1.m 6KB
BS_display_graphics_ distances_window=affiche_graphe_dist_fenet.m 5KB
affiche_graphe_dist_fenet.m 5KB
affiche_graphe_dist.m 5KB
affiche_graphe_dist.m 5KB
seuillage.m 5KB
seuillage.m 5KB
evol_moy_spe.m 4KB
evol_moy_spe.m 4KB
const_dempster.m 4KB
const_dempster.m 4KB
trait_transit.m 4KB
trait_transit.m 4KB
const_seuils_dist.m 4KB
BS_const_seuils_dist.m 4KB
tab_evaluation.m 4KB
tab_evaluation.m 4KB
orient_levre.m 4KB
orient_levre.m 4KB
const_dempster_bis2.m 4KB
const_dempster_bis2.m 4KB
const_dempster_bis1.m 4KB
BS_const_dempster_bis1.m 4KB
seuillage_bis2.m 3KB
seuillage_bis2.m 3KB
const_evidence.m 3KB
BS_const_evidence.m 3KB
BS_display_state_evidence_ bis=affiche_etat_evid_bis.m 3KB
affiche_etat_evid_bis.m 3KB
BS_decision_tempor.m 2KB
decision_tempor.m 2KB
affiche_carte_evid_exp.m 2KB
BS_display_evidence_map_exp= affiche_carte_evid_exp.m 2KB
affiche_graphe_dist_final.m 2KB
affiche_graphe_dist_final.m 2KB
BS_display_graphics=affiche_graphe.m 2KB
affiche_graphe.m 2KB
rotation.m 2KB
rotation.m 2KB
fonct_etiq_base.m 1KB
fonct_etiq_base.m 1KB
squelette_points.m 1KB
squelette_points.m 1KB
fonct_list_nom.m 1KB
fonct_list_nom.m 1KB
BS_filter_retine.m 1KB
filter_retine.m 1KB
affiche_etat_evid_exp.m 1KB
affiche_etat_evid_exp.m 1KB
segment_seq_exp.m 1KB
segment_seq_exp.m 1KB
const_seuils_vit.m 953B
const_seuils_vit.m 953B
affiche_etat_evid.m 907B
affiche_etat_evid.m 907B
surface_bouche.m 898B
surface_bouche.m 898B
dempster.m 896B
BS_dempster.m 887B
BS_Assign_expressions=concat_exp.m 820B
BS_display_distance_graphics_within_a_sliding_window_bis=affiche_graphe_dist_fenet_bis_final.m 775B
concat_exp.m 737B
affiche_graphe_dist_fenet_bis_final.m 737B
renomer_exp.m 544B
renomer_exp.m 544B
fonct_dist_cour.m 42B
fonct_dist_cour.m 42B
#affiche_graphe_dist_fenet_bis_fin.m# 10KB
#affiche_graphe_dist_fenet_bis.m# 9KB
#decodage_decis_demps.m# 6KB
#const_evidence_bis2.m# 6KB
#const_dempster_bis1.m# 4KB
#decision_tempor_bis2.m# 3KB
#decision_tempor.m# 2KB
matlab.mat 2.07MB
envir.mat 355KB
tab_dist_ca4.mat 150KB
masse_evide_sour.mat 96KB
evolp_sour_pierre.mat 49KB
prew.mat 49KB
decision.mat 38KB
masse_evide_surp0.mat 32KB
masse_evide_deg0.mat 32KB
masse_evide_sour0.mat 31KB
tempor.mat 27KB
fenetre.mat 26KB
tab_dist_ca2.mat 12KB
tab_etique.mat 8KB
masse_dempster_surp2_D.mat 8KB
共 203 条
- 1
- 2
- 3
资源评论
刘良运
- 粉丝: 67
- 资源: 1万+
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
最新资源
- mc.as
- 618家具社群团购清单.xlsx
- Javascript的鼠标手势
- hdmi in视频采集,输出到hdmi out, 支持HDMI指令控制,支持TFTP远程下载图片
- 批量word文件内容替换工具1.0 (批量实现多个 Word 文档文件文字替换利器).exe
- Cartoon GUI Pack 1.2.zip
- 我分享个魔兽内存修改器
- Python毕业设计基于Django的网易云数据分析可视化大屏系统的设计与实现+使用说明+全部资料(优秀项目).zip
- mp3 idv2,idv1,frame分析工具
- 鹈鹕优化算法POA MATLAB源码, 应用案例为函数极值求解以及优化svm进行分类,代码注释详细,可结合自身需求进行应用
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功