The algorithm of the rational-based

The algorithm of the rational-based K-SOM quantizer
consists of two main parts which are the SOMFrontEnd
and the SOMCorePE. These are presented in
Algorithms 1 and 2, respectively. The SOMFrontEndpart
is responsible for initialising a codebook C, a
learning rate array . . .; an
r


k; . . .
 
, initialising and controlling
a learning rate index parameter k, and presenting
a pixel Pt for the SOMCorePE-part during the learning
and the pixel-mapping stages. The SOMCore is responsible
for finding the winner codeword for a given pixel
Pt and updating the winner’s weight in the codebook
generation stage or return the winner’s index in the
pixel-mapping stage. It is noted that instead of direct
updating the weight of one winner and many neighbours
for a pixel Pt, the SOMCorePE updates the weight of all
related codewords, i.e. all codewords which are in the
neighbouring radius of the winner codeword. This is
iteratively performed during visits to the codewords (the
first if-then-else in the SOMCorePE-algorithm). The
algorithm is presented in the form that there are
h-instances of SOMCorePE running in parallel. This is
done in order to make it very close to hardware implementation
and operation.

Results (English) 3:

理性的基础k-som量化算法主要分为两部分，是somfrontend和somcorepe。这些都是在算法1和2，分别。的somfrontendpart负责初始化一个码本C，一学习率阵列。一..；RK；。..、初始化和控制一个学习率指数参数K，并提出一个像素的Pt对somcorepe在学习和像素映射阶段。的somcore负责寻找一个给定像素的赢家码字在码本中，更新赢家的权重生成阶段或返回赢家的指数在像素映射阶段。它是指出，而不是直接更新一个赢家和许多邻居的体重一个像素的PT，somcorepe更新所有的重量相关的码字，即所有码字的邻近的赢家码字半径。这是在访问的码字进行的迭代（第一，如果在somcorepe算法一样）。这个算法提出的形式，有somcorepe并行运行的h-instances。这是做了，以便使它非常接近硬件实现和操作。