78 research outputs found

    Informational Paradigm, management of uncertainty and theoretical formalisms in the clustering framework: A review

    Get PDF
    Fifty years have gone by since the publication of the first paper on clustering based on fuzzy sets theory. In 1965, L.A. Zadeh had published “Fuzzy Sets” [335]. After only one year, the first effects of this seminal paper began to emerge, with the pioneering paper on clustering by Bellman, Kalaba, Zadeh [33], in which they proposed a prototypal of clustering algorithm based on the fuzzy sets theory

    Segmentation Of Ultisequence Medical Images Using Random Walks Algorithm And Rough Sets Theory

    Get PDF
    Segmentasi imej Magnetic Resonance (MR) merupakan satu tugas klinikal yang mencabar. Selalunya, satu jenis imej MR tidak mencukupi untuk memberikan maklumat yang lengkap mengenai sesuatu tisu patologi atau objek visual dari imej Accurate Magnetic Resonance (MR) image segmentation is a clinically challenging task. More often than not, one type of MRI image is insufficient to provide the complete information about a pathological tissue or a visual object from the imag

    Chronology of brain tumor classification of intelligent systems based on mathematical modeling, simulation and image processing techniques

    Get PDF
    Tumor classification using image processing techniques is becoming a powerful tool nowadays. Based on the importance of this technique, the motivation of this review paper is to present the chronology of brain tumor classification using the digital images and govern the mathematical modeling and simulation of intelligent systems. The intelligent system involves artificial neural network (ANN), fuzzy logic (FL), support vector machine (SVM), and parallel support vector machine (PSVM). The chronology of brain tumor classification presents the latest part of the literature reviews related to the principal, type and interpretation of segmentation and classification of brain tumors via the large digital dataset from magnetic resonance imaging (MRI) images. This paper has been classified the modeling and simulation in classical and automatic models. Around 115 literature reviews in high ranking journal and high citation index are referred. This paper contains 6 contents, including mathematical modeling, numerical simulation, image processing, numerical results and performance, lastly is the conclusion to standardize the frame concept for the future of chronological framework involving the mathematical modeling and simulation. Research outcome to differentiate the tumor classification based on MRI images, modeling and simulation. Future work outlier in segmentation and classification are given in conclusion

    FCM Clustering Algorithms for Segmentation of Brain MR Images

    Get PDF
    The study of brain disorders requires accurate tissue segmentation of magnetic resonance (MR) brain images which is very important for detecting tumors, edema, and necrotic tissues. Segmentation of brain images, especially into three main tissue types: Cerebrospinal Fluid (CSF), Gray Matter (GM), and White Matter (WM), has important role in computer aided neurosurgery and diagnosis. Brain images mostly contain noise, intensity inhomogeneity, and weak boundaries. Therefore, accurate segmentation of brain images is still a challenging area of research. This paper presents a review of fuzzy c-means (FCM) clustering algorithms for the segmentation of brain MR images. The review covers the detailed analysis of FCM based algorithms with intensity inhomogeneity correction and noise robustness. Different methods for the modification of standard fuzzy objective function with updating of membership and cluster centroid are also discussed

    Temporal - spatial recognizer for multi-label data

    Get PDF
    Pattern recognition is an important artificial intelligence task with practical applications in many fields such as medical and species distribution. Such application involves overlapping data points which are demonstrated in the multi- label dataset. Hence, there is a need for a recognition algorithm that can separate the overlapping data points in order to recognize the correct pattern. Existing recognition methods suffer from sensitivity to noise and overlapping points as they could not recognize a pattern when there is a shift in the position of the data points. Furthermore, the methods do not implicate temporal information in the process of recognition, which leads to low quality of data clustering. In this study, an improved pattern recognition method based on Hierarchical Temporal Memory (HTM) is proposed to solve the overlapping in data points of multi- label dataset. The imHTM (Improved HTM) method includes improvement in two of its components; feature extraction and data clustering. The first improvement is realized as TS-Layer Neocognitron algorithm which solves the shift in position problem in feature extraction phase. On the other hand, the data clustering step, has two improvements, TFCM and cFCM (TFCM with limit- Chebyshev distance metric) that allows the overlapped data points which occur in patterns to be separated correctly into the relevant clusters by temporal clustering. Experiments on five datasets were conducted to compare the proposed method (imHTM) against statistical, template and structural pattern recognition methods. The results showed that the percentage of success in recognition accuracy is 99% as compared with the template matching method (Featured-Based Approach, Area-Based Approach), statistical method (Principal Component Analysis, Linear Discriminant Analysis, Support Vector Machines and Neural Network) and structural method (original HTM). The findings indicate that the improved HTM can give an optimum pattern recognition accuracy, especially the ones in multi- label dataset

    Proceedings of the Third International Workshop on Neural Networks and Fuzzy Logic, volume 2

    Get PDF
    Papers presented at the Neural Networks and Fuzzy Logic Workshop sponsored by the National Aeronautics and Space Administration and cosponsored by the University of Houston, Clear Lake, held 1-3 Jun. 1992 at the Lyndon B. Johnson Space Center in Houston, Texas are included. During the three days approximately 50 papers were presented. Technical topics addressed included adaptive systems; learning algorithms; network architectures; vision; robotics; neurobiological connections; speech recognition and synthesis; fuzzy set theory and application, control and dynamics processing; space applications; fuzzy logic and neural network computers; approximate reasoning; and multiobject decision making

    Automatic BIRCH thresholding with features transformation for hierarchical breast cancer clustering

    Get PDF
    Breast cancer is one of the most common diseases diagnosed in women over the world. The balanced iterative reducing and clustering using hierarchies (BIRCH) has been widely used in many applications. However, clustering the patient records and selecting an optimal threshold for the hierarchical clusters still a challenging task. In addition, the existing BIRCH is sensitive to the order of data records and influenced by many numerical and functional parameters. Therefore, this paper proposes a unique BIRCH-based algorithm for breast cancer clustering. We aim at transforming the medical records using the breast screening features into sub-clusters to group the subject cases into malignant or benign clusters. The basic BIRCH clustering is firstly fed by a set of normalized features then we automate the threshold initialization to enhance the tree-based sub-clustering procedure. Additionally, we present a thorough analysis on the performance impact of tuning BIRCH with various relevant linkage functions and similarity measures. Two datasets of the standard breast cancer wisconsin (BCW) benchmarking collection are used to evaluate our algorithm. The experimental results show a clustering accuracy of 97.7% in 0.0004 seconds only, thereby confirming the efficiency of the proposed method in clustering the patient records and making timely decisions

    Efficient Underground Object Detection for Ground Penetrating Radar Signals

    Get PDF
    Ground penetrating radar (GPR) is one of the common sensor system for underground inspection. GPR emits electromagnetic waves which can pass through objects. The reflecting waves are recorded and digitised, and then, the B-scan images are formed. According to the properties of scanning object, GPR creates higher or lower intensity values on the object regions. Thus, these changes in signal represent the properties of scanning object. This paper proposes a 3-step method to detect and discriminate landmines: n-row average-subtraction (NRAS); Min-max normalisation; and image scaling. Proposed method has been tested using 3 common algorithms from the literature. According to the results, it has increased object detection ratio and positive object discrimination (POD) significantly. For artificial neural networks (ANN), POD has increased from 77.4 per cent to 87.7 per cent. And, it has increased from 37.8 per cent to 80.2 per cent, for support vector machines (SVM)
    corecore