Skip to main content
. 2019 Feb 25;19(4):974. doi: 10.3390/s19040974
Algorithm 1 Generating an adversarial sample.
Require: Popluation Size pop_size
 δ←initialization()
 for i=0→pop_size do
  Pi←Crossover_Operator()
  Pi←Mutation_Operator()
  Compute →S(δ)
  if F(X+δ)>1−F(X+δ) then
   Continue
  else
   Output →δ
  end if
 end for