Search results for "Methodologie"
showing 10 items of 2141 documents
An Approach to the Concept of Soft Fuzzy Proximity
2014
The purpose of this paper is to introduce the concept of soft fuzzy proximity. Firstly, we give the definitions of soft fuzzy proximity and Katsaras soft fuzzy proximity, and also we investigate the relations between the soft fuzzy proximity and slightly modified version of Katsaras soft fuzzy proximity. Secondly, we induce a soft fuzzy topology from a given soft fuzzy proximity by using soft fuzzy closure operator. Then, we obtain the initial soft fuzzy proximity from a given family of soft fuzzy proximities. So, we describe products in the category of soft fuzzy proximities. Finally, we show that a family of all soft fuzzy proximities on a given set constitutes a complete lattice.
Different averages of a fuzzy set with an application to vessel segmentation
2005
Image segmentation is a major problem in image processing, particularly in medical image analysis. A great number of segmentation procedures produce intermediate gray-scale images that can be understood as fuzzy sets. Additionally, some segmentation procedures tend to leave free tuning parameters (very influential in the final binary image) for the user. These different binary images can be easily aggregated (into a fuzzy set) by making use of fuzzy set theory. In any case, a single binary image is required so our interest is to associate a crisp set to a given fuzzy set in an intelligent and unsupervised manner. The main idea of this paper is to define the averages of a given fuzzy set by …
A Combined Fuzzy and Probabilistic Data Descriptor for Distributed CBIR
2009
With the wide diffusion of digital image acquisition devices, the cost of managing hundreds of digital images is quickly increasing. Currently, the main way to search digital image libraries is by keywords given by the user. However, users usually add ambiguos keywords for large set of images. A content-based system intended to automatically find a query image, or similar images, within the whole collection is needed. In our work we address the scenario where medical image collections, which nowadays are rapidly expanding in quantity and heterogeneity, are shared in a distributed system to support diagnostic and preventive medicine. Our goal is to produce an efficient content-based descript…
Unsupervised tissue classification of brain MR images for voxel-based morphometry analysis
2016
In this article, a fully unsupervised method for brain tissue segmentation of T1-weighted MRI 3D volumes is proposed. The method uses the Fuzzy C-Means (FCM) clustering algorithm and a Fully Connected Cascade Neural Network (FCCNN) classifier. Traditional manual segmentation methods require neuro-radiological expertise and significant time while semiautomatic methods depend on parameter's setup and trial-and-error methodologies that may lead to high intraoperator/interoperator variability. The proposed method selects the most useful MRI data according to FCM fuzziness values and trains the FCCNN to learn to classify brain’ tissues into White Matter, Gray Matter, and Cerebro-Spinal Fluid in …
Fuzzy C-Means Inspired Free Form Deformation Technique for Registration
2009
This paper presents a novel method aimed to free form deformation function approximation for purpose of image registration. The method is currently feature-based. The algorithm is inspired to concepts derived from Fuzzy C-means clustering technique such as membership degree and cluster centroids. After algorithm explanation, tests and relative results obtained are presented and discussed. Finally, considerations on future improvements are elucidated.
Scalable Clustering by Iterative Partitioning and Point Attractor Representation
2016
Clustering very large datasets while preserving cluster quality remains a challenging data-mining task to date. In this paper, we propose an effective scalable clustering algorithm for large datasets that builds upon the concept of synchronization. Inherited from the powerful concept of synchronization, the proposed algorithm, CIPA (Clustering by Iterative Partitioning and Point Attractor Representations), is capable of handling very large datasets by iteratively partitioning them into thousands of subsets and clustering each subset separately. Using dynamic clustering by synchronization, each subset is then represented by a set of point attractors and outliers. Finally, CIPA identifies the…
Paradigm of tunable clustering using Binarization of Consensus Partition Matrices (Bi-CoPaM) for gene discovery
2013
Copyright @ 2013 Abu-Jamous et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Clustering analysis has a growing role in the study of co-expressed genes for gene discovery. Conventional binary and fuzzy clustering do not embrace the biological reality that some genes may be irrelevant for a problem and not be assigned to a cluster, while other genes may participate in several biological functions and should simultaneously belong to multiple clusters. Also, these algorithms cannot generate tight cluster…
Comparison of Internal Clustering Validation Indices for Prototype-Based Clustering
2017
Clustering is an unsupervised machine learning and pattern recognition method. In general, in addition to revealing hidden groups of similar observations and clusters, their number needs to be determined. Internal clustering validation indices estimate this number without any external information. The purpose of this article is to evaluate, empirically, characteristics of a representative set of internal clustering validation indices with many datasets. The prototype-based clustering framework includes multiple, classical and robust, statistical estimates of cluster location so that the overall setting of the paper is novel. General observations on the quality of validation indices and on t…
Aspects and Potentiality of Unconventional Modelling of Processes in Sporting Events
1999
This paper describes how inexact processes as presented in sporting events can be recorded, analysed, and evaluated by means of neural networks and fuzzy modelling.
Keypoint descriptor matching with context-based orientation estimation
2014
Abstract This paper presents a matching strategy to improve the discriminative power of histogram-based keypoint descriptors by constraining the range of allowable dominant orientations according to the context of the scene under observation. This can be done when the descriptor uses a circular grid and quantized orientation steps, by computing or providing a global reference orientation based on the feature matches. The proposed matching strategy is compared with the standard approaches used with the SIFT and GLOH descriptors and the recent rotation invariant MROGH and LIOP descriptors. A new evaluation protocol based on an approximated overlap error is presented to provide an effective an…