Magic Inpainter Express for Windows

The algorithm first describes the region of each non-noice pixel with a multi-dimensional key. This key should contain enough information about the pixel neighbourhood, pixels too close to image boundary or with too many noisy neighbours are excluded. All keys are sorted in special indexed list and then similar procedure is repeated for the noice pixels. For each noice pixel a similar multi-dimensional key is obtained. The keys describing the noisy pixels are then sorted depending of their non-noisy neighbours number. The pixels on the noise region boundary are put in the beginning of the list. When inpaint procedure is started these pixels are first restored. Then algorithm updates all keys with the new pixel values and resorts the noisy keys list. This repeats until all pixels are restored or if the procedure is canceled from the user. The missing pixels values are calculated from the pixels with most similar keys. To find these pixels the algorithm performs multi-dimensional search in the image keys list. In this way Magic Inpainter fills the missing pixels as first transforms the 2D image pixels to a multi-dimensional pixels in the feature-space, and then, when find the closest from it neighbours, replace its color with the nearest neighbour color value.