Abstract

Image segmentation plays a very crucial role in computer vision. Computational methods based on JSEG algorithm is used to provide the classification and characterization along with artificial neural networks for pattern recognition. It is possible to run simulations and carry out analyses of the performance of JSEG image segmentation algorithm and artificial neural networks in terms of computational time. A Simulink is created in Matlab software using Neural Network toolbox in order to study the performance of the system. In this paper, four windows of size 9*9, 17*17, 33*33 and 65*65 has been used. Then the corresponding performance of these windows is compared with ANN in terms of their computational time. Image segmentation is a process of separating images into small section that can be used as meaningful objects in computing and searching techniques. These segments are developed by using a number of processing techniques that are clustering, J-fractal image calculation. In Bottom Up approach techniques like JSEG, pixels of image are processed and divided into classes. These classes are used for indentifying image segments, once pixels are labeled using classes. The classes are clustered to divide image pixels and for image segments. Existing JSEG image segmentation technique uses K-Means for clustering. But there are a number of clustering variations of K-means available which can be used for improving results of image segmentation. K means clustering algorithm suffers from problem of over segmentation which is a big problem in process of segmentation in case of JSEG. We will be experimenting with available clustering techniques for building image segmentation. Many of existing segmentation techniques such as direct clustering methods in color space work well on homogeneous color regions. Natural scenes are rich in color and texture. Parameter estimation is a difficult problem and requires good homogeneous region for robust estimation. A new approach called JSEG is proposed towards this goal. This approach does not tend to estimate a specific model for a texture region. It test for the homogeneity of a given color pattern, which is computationally more feasible method. JSEG algorithm can be improved by adding enhanced classification and modified K means clustering.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call