A Hybrid Edge Detection Method Based on Fuzzy Set Theory and Cellular Learning Automata

Cellular Learning Automata (CLA) has been used in many fields of image processing such as noise elimination, smoothing, retrieval, fractionated and extraction of the content Characteristics of the images. The edge detection in images and methods if edge detection, have a great role in machine vision and cognizance systems. This method uses operands for analyzing images and digital image processing. Many studios here been conducted till now in edge detection algorithms of various conditions. In this study a new method for edge detection in images with the use of CLA is recommended. The proposed method of edge detection in images was tested with different sizes and the results were compared with Sobel edge detector classic method. The result show that the method based on CLA has a desirable performance in edge detection and compares the images with a more uniformity during a minimum period of time.

Cellular edge detection: Combining cellular automata and cellular learning automata

The mathematical model that aims at determining points in an image at which the image brightness suddenly changes is called edge detection. This study aims to propose a new hybrid method for edge detection. This method is based on cellular learning automata (CLA) and stochastic cellular automata (SCA). In the first part of the proposed method, statistic features of the input image are hired to have primary edge detection. In the next step CLA and SCA are employed to amplify pixels situated on edge and castrate those pixels which are part of the image background. The simulation results are conducted to prove proposed method performance and these results suggest that the proposed method is more efficient in finding edges and outperforms the existing edge detection algorithms.

Edge detection is often used in image processing to find the edge boundaries of image objects and this is important for selecting the edges of image parts. The image edge detection used in this study counts coins in an image, so that it can easily pass through the human eye but not by a computer. In a computer system, it is necessary to provide programs and test data so that the computer can read and count coins like a human. The purpose of this study is to count coins in an image using Canny edge detection and Gaussian filtering methods. The images used in this study are in the form of *jpg and tested using the Visual Studio Code application using OpenCV and Python. The results of this study indicate that the results of the number of coins read from the images inputted to the system can be read properly, with a data accuracy of 90%. Canny's edge detection method can be used to count the number of coins in an image.Keywords: Pengolahan Citra; Deteksi tepi Canny; Gaussian filtering; OpenCV;

During space reconnaissance applications, edge detection from remote sensing imagery plays an important role in the target recognition processing. However, traditional edge detection methods usually only utilize the high-frequency information in one image. Since low-frequency elements may be aliasing with high-frequency parts, the edges extracted may be unconnected under complex topography, different objects and imaging conditions. This paper proposes a novel image edge detection method based on Non-Subsampled Contourlet Transform (NSCT) to keep the object boundary continuously. It transforms the image into Contourlet domain in both high-frequency and low-frequency sub-bands respectively. Depending on the feature of flexible directivity reservation of an image during NSCT, the further edge extraction consists of 3 steps: firstly, the elements of the high-frequency coefficient matrix in Contourlet domain are filtered with high values left using adaptive thresholds. Then the low-frequency edge information is extracted via Canny operator from the low-frequency sub-band information. Finally, to achieve a more consistent edge image, the low-frequency edge image is achieved according to the low-frequency matrix and adopted to compensate the high-frequency image with the isolated noise points eliminated as well. The numerical simulation and practical test results show the higher effectiveness and robustness of the proposed algorithm when comparing with the classical edge detectors, such as Sobel operator, Canny operator, Log operator and Prewitt operator, etc.

Open asynchronous dynamic cellular learning automata and its application to allocation hub location problem

Vertex coloring problem is a combinatorial optimization problem in graph theory in which a color is assigned to each vertex of graph such that no two adjacent vertices have the same color. In this paper a new hybrid algorithm which is obtained from combination of cellular learning automata (CLA) and memetic algorithm (MA) is proposed for solving the vertex coloring problem. CLA is an effective probabilistic learning model combining cellular automata and learning automaton (LA). Irregular CLA (ICLA) is a generalization of CLA in which the restriction of rectangular grid structure in CLA is removed. The proposed algorithm is based on the irregular open CLA (IOCLA) that is an extension of ICLA in which the evolution of CLA is influenced by both local and global environments. Similar to other IOCLA-based algorithms, in the proposed algorithm, local environment is constituted by neighboring LAs of any cell and the global environment consists of a pool of memes in which each meme corresponds to a certain local search method. Each meme is represented by a set of LAs from which the history of the corresponding local search method can be extracted. To show the superiority of the proposed algorithm over some well-known algorithms, several computer experiments have been conducted. The results show that the proposed algorithm performs better than other methods in terms of running time of algorithm and the required number of colors.

In image processing, edge detection is a valuable tool to perform the extraction of features from an image. This detection reduces the amount of information to be processed, since the redundant information (considered less relevant) can be disconsidered. The technique of edge detection consists of determining the points of a digital image whose intensity changes sharply. This changes are, for example, due to the discontinuities of the orientation on a surface. A well known method of edge detection is the Difference of Gaussians (DoG). The method consists of subtracting two Gaussians, where a kernel has a standard deviation smaller than the previous one. The convolution between the subtraction of kernels and the input image results in the edge detection of this image. This paper introduces a method of extracting edges using DoG with kernels based on the q-Gaussian probability distribution, derived from the q-statistic proposed by Constantino Tsallis. To demonstrate the method's potential, we compare the introduced method with the tradicional DoG using Gaussians kernels. The results showed that the proposed method can extract edges with more accurate details.

One of the first steps of feature extraction is edge detection. There are various methods for edge detection such as sobel operator, log method and canny operator but with disadvantages (create noise, image smoothing and discontinuous edge detected). We present an improved method for edge detection. In this method, edge detected by morphology’s operator and their combination and with the use of various structure elements of images in satellite and remote sensing. Keywords: Satellite, Image processing, Edge detection, Multi spectral images

Diabetic retinopathy is one of the most important causes of visual impairment. In this paper, a supervised automatic lesion detection in digital retina images for diagnosis and screening purposes. The aim of this study is to present a supervised approach for exudate detection in fundus images and also to analyze the method to find the optimum structure. Cellular automata model is used as the base for this task. To improve the adaptability and efficiency of the cellular automata, the rules are updating by a learning process to produce the cellular learning automata. Then, the algorithm is transferred to fuzzy domain for the task of digital retina image analysis. Automaton is created with simple and extended Moore neighborhood. Rule selection and rule updating are performed automatically and the score and penalty assignments are applied to the cells toward a segmentation process. To evaluate the proposed method, statistical parameters of sensitivity, specificity and accuracy are used. A comprehensive experiment is then executed comprising two main phases. First all structural parameters of the automaton are optimized in an investigation study and then a comparison is made between the proposed method with six other well-known methods to verify the results. In the best structure the statistical parameters of sensitivity, specificity and accuracy are computed as 96.3%, 98.7% and 96.1% for STARE retina image dataset.

Ultrasound image edge detection based on a novel multiplicative gradient and Canny operator.

Feature Extraction is a long active topic in image processing, and it attracts lots of attention over the last five decades due to its uses in real-life applications. Edge detection method allows users to discover the features of an image for a notable change in the gray level. This texture indicates an ending of one region and the beginning of another in the image. Likewise, over the last few decades, researchers have been exploring to exploit the simple computing model of Cellular Automata (CA) with local neighborhood structure in image processing techniques. The usage of CA in applications of medical image-processing is identified by Kendall Preston [1] in 1979. It is found that edge detection using CA has a potential advantage over traditional approaches for its lightweight nature and computational efficiency. This paper introduces a new technique for image edge detection using two-dimensional CA. The method can use specific rule sets of CA using the Von Neumann neighborhood for edge detection with null boundary conditions. The performance analysis of the scheme is done and compared with some existing standard edge detection techniques. The results obtained from the proposed technique is very promising for feature extraction.

In this paper, a novel edge detection method that computes image gradient using the concept of Center of Mass (COM) is presented. The algorithm runs with a constant number of operations per pixel independently from its scale by using integral image. Compared with the conventional convolutional edge detector such as Sobel edge detector, the proposed method performs faster when region size is larger than 9×9. The proposed method can be used as framework for multi-scale edge detectors when the goal is to achieve fast performance. Experimental results show that edge detection by COM is competent with Canny edge detection.

Wavelet space entropy is the extension of wavelet time entropy in the two-dimensional space, which can make use of the wavelet to detect sudden change in the signal. It's a good method to eliminate the effect of noise, but at the same time, the edge it detects is coarse and not integrated. Canny operator is a classical edge detection operator that has a good localization performance for the edge. It works well for the signal mixed with little noise, but when applied to image with lots of noise, the edge it detects is often submerged by the noise. In this paper, the wavelet space entropy algorithm is improved. Furthermore, the two methods of edge detection are combined in the paper to make full use of the advantage of both methods. Simulation has proved the integrated method to be a better one for edge detection when the image is polluted by noise.

Abstract: Abstract: this study evaluates and compares the performance of two edge detection methods Sobel method and Canny method on batik image. Batik images have unique characteristics and complex patterns, making it difficult to analyze the edges. This study presents a comparison of the results using sobel and canny edge detection methods on batik kawung images both from peak signal-to-noise reatio and from mean squared error. The results showed that canny edge detection was better than sobel method. This can be seen from the results of PSNR and MSE that is 100%. This analysis is determined by considering factors such as the accuracy of edge detection, sensitivity to noise, and the ability to handle the complexity of batik drawing patterns. The results of this study provide a detailed description of the advantages and disadvantages of each method in the image of batik kawung. The conclusions that can be drawn from this study can provide valuable guidance for choosing the optimal edge detection method in image analysis of batik kawung and others. Keywords: batik kawung; canny; MSE; PSNR; sobel Abstrak: Penelitian ini mengevaluasi dan membandingkan kinerja dua metode deteksi tepi metode Sobel dan metode Canny pada citra batik. Gambar batik mempunyai ciri-ciri yang unik dan pola yang kompleks, sehingga menyulitkan analisis tepian. Penelitian ini menyajikan perbandingan hasil menggunakan metode deteksi tepi sobel dan canny pada citra batik kawung baik dari peak signal-to-noise reatio maupun dari mean squared error. Hasil penelitian ini menunjukkan bahwa deteksi tepi canny lebih baik dibandingkan dari metode sobel. Hal ini dapat dilihat dari hasil PSNR dan MSE yang dihasilkan yaitu 100%. Analisis ini ditentukan dengan mempertimbangkan faktor-faktor seperti keakuratan deteksi tepi, kepekaan terhadap noise, dan kemampuan menangani kompleksitas pola gambar batik. Hasil penelitian ini memberikan gambaran secara detail mengenai kelebihan dan kekurangan masing-masing metode pada citra batik kawung. Kesimpulan yang dapat diambil dari penelitian ini dapat memberikan panduan berharga untuk memilih metode deteksi tepi yang optimal dalam analisis citra batik kawung dan yang lainnya. Kata kunci: batik kawung; canny; MSE; PSNR; sobel