3.3. Pseudocode program
Pseudocode adalah suatu deskripsi dari algoritama yang disusun dengan mengikuti struktur bahasa pemrograman yang dapat digambarkan dengan mudah sehingga dapat
dipahami oleh manusia itu sendiri.
3.3.1. Pseudocode Proses pelatihan JST
GRAYSCALE citra_gigi
← imreadfullfilenama_path, nama_file citra_grayscale
← rgb2graycitra_gigi THRESHOLD
[b k] ← sizecitra_grayscale
nilai_threshold ← 130
for x ← 1 to b
for y ← 1 to k
if citra_grayscalex,y nilai_threshold citra_thresholdx,y
← 0 elseif citra_grayscale x,y= nilai_threshold
citra_threshold x,y ← 1
end end
end REDUKSI DATA
citra_threshold[A B]
← citra_threshold pos
← 0 for i
← 1 to 50 for j
← 1 to 5 zi,j
← 0 for k
← 1 to 10 pos
← pos+1 zi,j
← zi,j+aai,pos end
end pos
← 0 end
pos ← 0
for i ← 1 to 5
for j ← 1 to 5
zzj,i ← 0
for k ← 1 to 10
pos ← pos+1
zzj,i ← zzj,i+zpos,i
end end
pos ← 0
end for i
← 1 to 5 for j
← 1 to 5 ifzzi,j==100
Universitas Sumatera Utara
zzi,j ← 0
else ifzzi,j=1 zzi,j=99
zzi,j ← 1
end end
end end
LATIH JST BACKPROPAGATION input
← reduksi_data [A B]
← sizeinput target
← set manual target
← target’ S
← jumlah hidden layer TF
← fungsi transfer BTF
← fungsi pelatihan net
← newffinput, target,[S1 S2...SN-l],{TF1 TF2...TFN-l}, BTF [net,tr]
← train net,input,target; LATIH JST HOPFIELD
input ← reduksi_data
[A B] ← sizeinput
T ← input
T ← T’
Ai=target net
← newhopT
3.3.2. Pseudocode Proses Pengujian JST
GRAYSCALE citra_gigi
← imreadfullfilenama_path, nama_file citra_grayscale
← rgb2graycitra_gigi THRESHOLD
[b k] ← sizecitra_grayscale
nilai_threshold ← 130
for x ← 1 to b
for y ← 1 to k
if citra_grayscalex,y nilai_threshold citra_thresholdx,y
← 0 elseif citra_grayscale x,y= nilai_threshold
citra_threshold x,y ← 1
end end
end REDUKSI DATAUJI
citra_threshold[A B]
← citra_threshold pos
← 0 for i
← 1 to 50 for j
← 1 to 5 zi,j
← 0 for k
← 1 to 10 pos
← pos+1 zi,j
← zi,j+aai,pos
Universitas Sumatera Utara
end end
pos ← 0
end pos
← 0 for i
← 1 to 5 for j
← 1 to 5 zzj,i
← 0 for k
← 1 to 10 pos
← pos+1 zzj,i
← zzj,i+zpos,i end
end pos
← 0 end
for i ← 1 to 5
for j ← 1 to 5
ifzzi,j==100 zzi,j
← 0 else
ifzzi,j=1 zzi,j=99 zzi,j
← 1 end
end end
end PENGUJIAN JST BACKPROPAGATION
datauji
← reduksi_datauji target
← target’ output=simnet, datauji
PENGUJIAN JST HOPFIELD datauji
← reduksi_datauji T
← T’ TS
← time step {}
← initial input delay output=simnet,{TS},{},datauji
Universitas Sumatera Utara
3.4. Perancangan sistem 3.4.1. Perancangan
Kategori