Skip to main content
. 2018 Apr 12;18(4):1172. doi: 10.3390/s18041172
Algorithm 1 The Proposed DPSO Method
  • 1:

    Input: Set of candidate channels: {Mj(λ)|j=1,,m}; Number of output channels: n; Pattern P.

  • 2:

    Output: Selected ordered set of n channels; Decided demosaicing order O.

  • 3:

    Initialization:

  • 4:

    Generate population Xi and velocity Vi(1iP)

  • 5:

    [Xgb,Ogb]=findbest(Xipb,P)

  • 6:

    for j = 1 … G do

  • 7:

    for i = 1 … P do

  • 8:

      Xipb=f(MXi,P)<f(MXipb,P)?Xi:Xipb

  • 9:

      Vi=w(Vi1+c1r(XipbXi)+c2r(XgbXi))

  • 10:

      V¯i=reducemat(Vi,p)

  • 11:

      Xi=XiV¯i

  • 12:

    end for

  • 13:

    [Xgb,Ogb]=findbest(Xipb,P)(1iP)

  • 14:

    end for

  • 15:

    return n ordered channels Xgb, demosaicing order Ogb;