Weighted determination algoritm of boundary pixels

While working with digital noise reduction techniques, which are based on theory of convolution matrix and used convolution operation, it necessary to use algorithms to bypass boundary pixels in the image pixel matrix. The problem exists because convolution itself algorithm have peculiarity, it mean that peculiarity convolution kernel used to each element of pixel matrix. That feature characterize a lot of classes of methods which used idea of convolution matrix. There are a lot of primitive ways to solve it, but none of these ways made a consensus between economical use of resources and filling border pixels with colour coding, which is not so far from colours of corresponding pixels. The object of research is pixel matrix of image. The subject of study is algorithms for filling boundary pixels when superimposing a convolution matrix on a pixel matrix of an image. The main target is creating of effective filled algorithm for border pixels which are close to code colour to relation pixels for used in convolution matrix. Filled border pixels will use to operation convolution for each pixels original image. Algorithm of filled border pixels by step of applied convolution kernel anchors to the pixel, when pixel accessing in convolution algorithm goes beyond the pixel matrix of the original image. Algorithm takes into account the «special» cases of overstepping and allows to do fast calculation to determine the colour code of the missing pixel. The algorithm is simple to program and easily integrates with the basic convolution matrix algorithm in digital image defects