1 January 2016 in International Journal of Computational Intelligence Systems
In this paper we discuss some main image processing techniques in order to propose a classification based upon the output these methods provide. Because despite a particular image analysis technique can be supervised or unsupervised, and can allow or not the existence of fuzzy information at some stage, each technique has been usually designed to...
22 March 2018 in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
In this paper, an efficient and polynomial edge detection algorithm based on a hierarchical graph-partition approach is presented. After transforming a digital image into a graph network, the proposed algorithm proceeds by iteratively dividing the image into regions, and then transforming this hierarchical region map into a sequence of boundary maps. This allows the proposed algorithm to operate naturally with colour or hyperspectral images, as well as to detect edges at different levels of detail in a simultaneous and consistent manner. Such a sequence of edge maps can be seen as jointly approximating the different levels of detail that humans may use when recognizing objects in an image. This idea is taken to base the evaluation methodology of the proposed algorithm, that extends the usual boundary-based evaluation methodology based on the matching of the automatic maps with a set of human ground truth, reference maps. The computational experiences carried out to benchmark the performance of the proposed algorithm over the BSDS500 dataset suggest that the proposed method attains a statistically significant better performance than some well-known detectors as Canny or Sobel.
1 December 2018 in Tatra Mountains Mathematical Publications
In this paper, a comparative assessment of the Image Divide and Link Algorithm (ID&L) in different color spaces is presented. This, in order to show the significance of choosing a specific color space when the algorithm computes the dissimilarity measure between adjacent pixels. Specifically, the algorithm procedure is based on treating a digital image as a graph, assigning a weight to each edge based on the dissimilarity measure between adjacent pixels. Then, the algorithm constructs a spanning forest through a Kruskal scheme to order the edges successively while partitions are obtained. This process is driven until all the pixels of the image are segmented, that is, there are as many regions as pixels. The results of the algorithm which have been compared with those generated using different color spaces are shown.