If the number of candidates for each pixel grows too large (as is common in algorithms such as Knoll and Yliluoma) then sorting the candidate list for every pixel can have a significant impact on performance. A solution is to instead sort the palette in advance and keep a separate tally of weights for every palette colour. The weights can then be accumulated by iterating linearly through the tally of sorted colours.
特点：负区间平滑非零，避免 ReLU 死区问题。
，这一点在同城约会中也有详细论述
Yeb Havinga (@YebHavinga)，更多细节参见旺商聊官方下载
Материалы по теме: