134 research outputs found

    Cellular automata as a tool for image processing

    Get PDF
    An overview is given on the use of cellular automata for image processing. We first consider the number of patterns that can exist in a neighbourhood, allowing for invariance to certain transformation. These patterns correspond to possible rules, and several schemes are described for automatically learning an appropriate rule set from training data. Two alternative schemes are given for coping with gray level (rather than binary) images without incurring a huge explosion in the number of possible rules. Finally, examples are provided of training various types of cellular automata with various rule identification schemes to perform several image processing tasks

    The identification of cellular automata

    Get PDF
    Although cellular automata have been widely studied as a class of the spatio temporal systems, very few investigators have studied how to identify the CA rules given observations of the patterns. A solution using a polynomial realization to describe the CA rule is reviewed in the present study based on the application of an orthogonal least squares algorithm. Three new neighbourhood detection methods are then reviewed as important preliminary analysis procedures to reduce the complexity of the estimation. The identification of excitable media is discussed using simulation examples and real data sets and a new method for the identification of hybrid CA is introduced

    Image processing using 3-state cellular automata

    Get PDF
    This paper describes the application of cellular automata (CA) to various image processing tasks such as denoising and feature detection. Whereas our previous work mainly dealt with binary images, the current work operates on intensity images. The increased number of cell states (i.e. pixel intensities) leads to a vast increase in the number of possible rules. Therefore, a reduced intensity representation is used, leading to a three state CA that is more practical. In addition, a modified sequential floating forward search mechanism is developed in order to speed up the selection of good rule sets in the CA training stage. Results are compared with our previous method based on threshold decomposition, and are found to be generally superior. The results demonstrate that the CA is capable of being trained to perform many different tasks, and that the quality of these results is in many cases comparable or better than established specialised algorithms

    Localization and segmentation of optic disc in retinal images using circular Hough transform and grow-cut algorithm

    Get PDF
    Automated retinal image analysis has been emerging as an important diagnostic tool for early detection of eye-related diseases such as glaucoma and diabetic retinopathy. In this paper, we have presented a robust methodology for optic disc detection and boundary segmentation, which can be seen as the preliminary step in the development of a computer-assisted diagnostic system for glaucoma in retinal images. The proposed method is based on morphological operations, the circular Hough transform and the grow-cut algorithm. The morphological operators are used to enhance the optic disc and remove the retinal vasculature and other pathologies. The optic disc center is approximated using the circular Hough transform, and the grow-cut algorithm is employed to precisely segment the optic disc boundary. The method is quantitatively evaluated on five publicly available retinal image databases DRIVE, DIARETDB1, CHASE_DB1, DRIONS-DB, Messidor and one local Shifa Hospital Database. The method achieves an optic disc detection success rate of 100% for these databases with the exception of 99.09% and 99.25% for the DRIONS-DB, Messidor, and ONHSD databases, respectively. The optic disc boundary detection achieved an average spatial overlap of 78.6%, 85.12%, 83.23%, 85.1%, 87.93%, 80.1%, and 86.1%, respectively, for these databases. This unique method has shown significant improvement over existing methods in terms of detection and boundary extraction of the optic disc

    Adaptive noise reduction and code matching for IRIS pattern recognition system

    Get PDF
    Among all biometric modalities, iris is becoming more popular due to its high performance in recognizing or verifying individuals. Iris recognition has been used in numerous fields such as authentications at prisons, airports, banks and healthcare. Although iris recognition system has high accuracy with very low false acceptance rate, the system performance can still be affected by noise. Very low intensity value of eyelash pixels or high intensity values of eyelids and light reflection pixels cause inappropriate threshold values, and therefore, degrade the accuracy of system. To reduce the effects of noise and improve the accuracy of an iris recognition system, a robust algorithm consisting of two main components is proposed. First, an Adaptive Fuzzy Switching Noise Reduction (AFSNR) filter is proposed. This filter is able to reduce the effects of noise with different densities by employing fuzzy switching between adaptive median filter and filling method. Next, an Adaptive Weighted Shifting Hamming Distance (AWSHD) is proposed which improves the performance of iris code matching stage and level of decidability of the system. As a result, the proposed AFSNR filter with its adaptive window size successfully reduces the effects ofdifferent types of noise with different densities. By applying the proposed AWSHD, the distance corresponding to a genuine user is reduced, while the distance for impostors is increased. Consequently, the genuine user is more likely to be authenticated and the impostor is more likely to be rejected. Experimental results show that the proposed algorithm with genuine acceptance rate (GAR) of 99.98% and is accurate to enhance the performance of the iris recognition system

    An Approach for the Customized High-Dimensional Segmentation of Remote Sensing Hyperspectral Images

    Get PDF
    Abstract: This paper addresses three problems in the field of hyperspectral image segmentation: the fact that the way an image must be segmented is related to what the user requires and the application; the lack and cost of appropriately labeled reference images; and, finally, the information loss problem that arises in many algorithms when high dimensional images are projected onto lower dimensional spaces before starting the segmentation process. To address these issues, the Multi-Gradient based Cellular Automaton (MGCA) structure is proposed to segment multidimensional images without projecting them to lower dimensional spaces. The MGCA structure is coupled with an evolutionary algorithm (ECAS-II) in order to produce the transition rule sets required by MGCA segmenters. These sets are customized to specific segmentation needs as a function of a set of low dimensional training images in which the user expresses his segmentation requirements. Constructing high dimensional image segmenters from low dimensional training sets alleviates the problem of lack of labeled training images. These can be generated online based on a parametrization of the desired segmentation extracted from a set of examples. The strategy has been tested in experiments carried out using synthetic and real hyperspectral images, and it has been compared to state-of-the-art segmentation approaches over benchmark images in the area of remote sensing hyperspectral imaging.Ministerio de Economía y competitividad; TIN2015-63646-C5-1-RMinisterio de Economía y competitividad; RTI2018-101114-B-I00Xunta de Galicia: ED431C 2017/1
    corecore