Generation of Random Fields for Image Segmentation System

Filtering is perhaps the most fundamental operation of image processing and computer vision. In the broadest sense of the term "filtering", the value of the filtered image at a given location is a function of the values of the input image in a small neighborhood of the same location. A fast implementation of bilateral filtering is presented, which is based on an optimal expansion of the filter kernel into a sum of factorized terms. The terms in this expansion are computed by minimizing the expansion error in the mean-square error sense. This leads to a simple and elegant solution in terms of eigenvectors of a square matrix. In this way, the bilateral filter is applied through computing a few Gaussian convolutions, for which very efficient algorithms are readily available. Proposed system the expansion functions are optimized for the histogram of the input image, leading to improved accuracy. In low contrast images are noise were not removed exactly,so by using markow random fields to denoising the image to get it’s original image.