276 research outputs found

    Texture descriptor combining fractal dimension and artificial crawlers

    Get PDF
    Texture is an important visual attribute used to describe images. There are many methods available for texture analysis. However, they do not capture the details richness of the image surface. In this paper, we propose a new method to describe textures using the artificial crawler model. This model assumes that each agent can interact with the environment and each other. Since this swarm system alone does not achieve a good discrimination, we developed a new method to increase the discriminatory power of artificial crawlers, together with the fractal dimension theory. Here, we estimated the fractal dimension by the Bouligand-Minkowski method due to its precision in quantifying structural properties of images. We validate our method on two texture datasets and the experimental results reveal that our method leads to highly discriminative textural features. The results indicate that our method can be used in different texture applications.Comment: 12 pages 9 figures. Paper in press: Physica A: Statistical Mechanics and its Application

    Evaluation of Statistical Features for Medical Image Retrieval

    Get PDF
    In this paper we present a complete system allowing the classification of medical images in order to detect possible diseases present in them. The proposed method is developed in two distinct stages: calculation of descriptors and their classification. In the first stage we compute a vector of thirty-three statistical features: seven are related to statistics of the first level order, fifteen to that of second level where thirteen are calculated by means of co-occurrence matrices and two with absolute gradient; the last thirteen finally are calculated using run-length matrices. In the second phase, using the descriptors already calculated, there is the actual image classification. Naive Bayes, RBF, Support VectorMa- chine, K-Nearest Neighbor, Random Forest and Random Tree classifiers are used. The results obtained from the proposed system show that the analysis carried out both on textured and on medical images lead to have a high accuracy

    Texture Segmentation by Evidence Gathering

    No full text
    A new approach to texture segmentation is presented which uses Local Binary Pattern data to provide evidence from which pixels can be classified into texture classes. The proposed algorithm, which we contend to be the first use of evidence gathering in the field of texture classification, uses Generalised Hough Transform style R-tables as unique descriptors for each texture class and an accumulator is used to store votes for each texture class. Tests on the Brodatz database and Berkeley Segmentation Dataset have shown that our algorithm provides excellent results; an average of 86.9% was achieved over 50 tests on 27 Brodatz textures compared with 80.3% achieved by segmentation by histogram comparison centred on each pixel. In addition, our results provide noticeably smoother texture boundaries and reduced noise within texture regions. The concept is also a "higher order" texture descriptor, whereby the arrangement of texture elements is used for classification as well as the frequency of occurrence that is featured in standard texture operators. This results in a unique descriptor for each texture class based on the structure of texture elements within the image, which leads to a homogeneous segmentation, in boundary and area, of texture by this new technique

    Texture recognition by using artificial neural network

    Get PDF
    This thesis describes the texture recognition by using the Artificial Neural Network (ANN). There are hard to understand on how to perform the texture recognition on any new set of image data. Therefore, to ease up the process on texture recognition, ANN has been chosen as the classifier to enhance the process of the texture recognition. There are thirteen types of Brodatz textures are considered as the dataset for this research and five sets for each type texture with different level of histogram equalized, noise for the training dataset. Backpropagation algorithm is one of the methods for the ANN. After the feature is obtained from the dataset, the feature will be trained and classifier by using theBack-propagation algorithm. All in all, this project will tell us how the Back-propagation classifier help in texture recognition and how to increases the success rate in texture recognition

    A Self-Organizing Neural System for Learning to Recognize Textured Scenes

    Full text link
    A self-organizing ARTEX model is developed to categorize and classify textured image regions. ARTEX specializes the FACADE model of how the visual cortex sees, and the ART model of how temporal and prefrontal cortices interact with the hippocampal system to learn visual recognition categories and their names. FACADE processing generates a vector of boundary and surface properties, notably texture and brightness properties, by utilizing multi-scale filtering, competition, and diffusive filling-in. Its context-sensitive local measures of textured scenes can be used to recognize scenic properties that gradually change across space, as well a.s abrupt texture boundaries. ART incrementally learns recognition categories that classify FACADE output vectors, class names of these categories, and their probabilities. Top-down expectations within ART encode learned prototypes that pay attention to expected visual features. When novel visual information creates a poor match with the best existing category prototype, a memory search selects a new category with which classify the novel data. ARTEX is compared with psychophysical data, and is benchmarked on classification of natural textures and synthetic aperture radar images. It outperforms state-of-the-art systems that use rule-based, backpropagation, and K-nearest neighbor classifiers.Defense Advanced Research Projects Agency; Office of Naval Research (N00014-95-1-0409, N00014-95-1-0657
    corecore