Search results for "Pattern Recognition"
showing 10 items of 2301 documents
A New Linear Initialization in SOM for Biomolecular Data
2009
In the past decade, the amount of data in biological field has become larger and larger; Bio-techniques for analysis of biological data have been developed and new tools have been introduced. Several computational methods are based on unsupervised neural network algorithms that are widely used for multiple purposes including clustering and visualization, i.e. the Self Organizing Maps (SOM). Unfortunately, even though this method is unsupervised, the performances in terms of quality of result and learning speed are strongly dependent from the neuron weights initialization. In this paper we present a new initialization technique based on a totally connected undirected graph, that report relat…
Automatic Detection of Hemangioma through a Cascade of Self-organizing Map Clustering and Morphological Operators
2016
Abstract In this paper we propose a method for the automatic detection of hemangioma regions, consisting of a cascade of algorithms: a Self Organizing Map (SOM) for clustering the image pixels in 25 classes (using a 5x5 output layer) followed by a morphological method of reducing the number of classes (MMRNC) to only two classes: hemangioma and non-hemangioma. We named this method SOM-MMRNC. To evaluate the performance of the proposed method we have used Fuzzy C-means (FCM) for comparison. The algorithms were tested on 33 images; for most images, the proposed method and FCM obtain similar overall scores, within one percent of each other. However, in about 18% of the cases, there is a signif…
A New SOM Initialization Algorithm for Nonvectorial Data
2008
Self Organizing Maps (SOMs) are widely used mapping and clustering algorithms family. It is also well known that the performances of the maps in terms of quality of result and learning speed are strongly dependent from the neuron weights initialization. This drawback is common to all the SOM algorithms, and critical for a new SOM algorithm, the Median SOM (M-SOM), developed in order to map datasets characterized by a dissimilarity matrix. In this paper an initialization technique of M-SOM is proposed and compared to the initialization techniques proposed in the original paper. The results show that the proposed initialization technique assures faster learning and better performance in terms…
Stable Automatic Unsupervised Segmentation of Retinal Vessels Using Self-Organizing Maps and a Modified Fuzzy C-Means Clustering
2011
In this paper an automatic unsupervised method for the segmentation of retinal vessels is proposed. Three features are extracted from the tested image. The features are scaled down by a factor of 2 and mapped into a Self-Organizing Map. A modified Fuzzy C-Means clustering algorithm is used to divide the neuron units of the map in 2 classes. The entire image is again input for the Self-Organizing Map and the class of each pixel will be the class of its best matching unit in the Self-Organizing Map. Finally, the vessel network is post-processed using a hill climbing strategy on the connected components of the segmented image. The experimental evaluation on the DRIVE database shows accurate ex…
Automatic Unsupervised Segmentation of Retinal Vessels Using Self-Organizing Maps and K-Means Clustering
2011
In this paper an automatic unsupervised method for the segmentation of retinal vessels is proposed. A Self-Organizing Map is trained on a portion of the same image that is tested and K-means clustering algorithm is used to divide the map units in 2 classes. The entire image is again input for the Self-Organizing Map, and the class of each pixel will be the class of the best matching unit on the Self-Organizing Map. Finally, the vessel network is post-processed using a hill climbing strategy on the connected components of the segmented image. The experimental evaluation on the publicly available DRIVE database shows accurate extraction of vessels network and a good agreement between our segm…
A neural network approach to movement pattern analysis.
2004
Movements are time-dependent processes and so can be modelled by time-series of coordinates: E.g., each articulation has geometric coordinates; the set of the coordinates of the relevant articulations build a high-dimensional configuration. These configurations--or "patterns"--give reason for analysing movements by means of neural networks: The Kohonen Feature Map (KFM) is a special type of neural network, which (after having been coined by training with appropriate pattern samples) is able to recognize single patterns as members of pattern clusters. This way, for example, the particular configurations of a given movement can be identified as belonging to respective configuration clusters, …
Extraction of ERP from EEG data
2007
In this article, a simple but novel technique for extracting a linear subspace related to event related potentials (ERPs) from ElectroEncephaloGraphy (EEG) data is introduced. The technique consists of a sequence of basic linear operations applied to multidimensional EEG data in a problem-specific manner. The derivation of the proposed technique is given and results with real data are described together with overall conclusions.
Silhouette encoding and synthesis using elliptic Fourier descriptors, and applications to videoconferencing
2004
Abstract This paper investigates the use of elliptic Fourier descriptors as a shape descriptor for encoding the silhouette of a person. Shape descriptors are here used for predicting the shape of silhouettes in missing frames within a sequence. This prediction scheme is applied to the case of generating in-between images in a low frame rate videoconferencing system, where the reconstructed silhouette is used as a binary mask for reducing the computational time for the frame reconstruction.
Quantifying the complexity of short-term heart period variability through K nearest neighbor local linear prediction
2008
The complexity of short-term heart period (HP) variability was quantified exploiting the paradigm that associates the degree of unpredictability of a time series to its dynamical complexity. Complexity was assessed through k-nearest neighbor local linear prediction. A proper selection of the parameter k allowed us to perform either linear or nonlinear prediction, and the comparison of the two approaches to infer the presence of nonlinear dynamics. The method was validated on simulations reproducing linear and nonlinear time series with varying levels of predictability. It was then applied to HP variability series measured from healthy subjects during head-up tilt test, showing that short-te…
Experimental approach for testing the uncoupling between cardiovascular variability series
2002
In cardiovascular variability analysis, the significance of the coupling between two series is commonly assessed by defining a zero level on the magnitude-squared coherence (MSC). Although the use of the conventional value of 0.5 does not consider the dependence of MSC estimates on the analysis parameters, a theoretical threshold Tt is available only for the weighted covariance (WC) estimator. In this study, an experimental threshold for zero coherence Te was derived by a statistical test from the sampling distribution of MSC estimated on completely uncoupled time series. MSC was estimated by the WC method (Parzen window, spectral bandwidth B = 0.015, 0.02, 0.025, 0.03 Hz) and by the parame…