Search results for "Clustering"

Simulated Annealing Technique for Fast Learning of SOM Networks

2011

The Self-Organizing Map (SOM) is a popular unsupervised neural network able to provide effective clustering and data visualization for multidimensional input datasets. In this paper, we present an application of the simulated annealing procedure to the SOM learning algorithm with the aim to obtain a fast learning and better performances in terms of quantization error. The proposed learning algorithm is called Fast Learning Self-Organized Map, and it does not affect the easiness of the basic learning algorithm of the standard SOM. The proposed learning algorithm also improves the quality of resulting maps by providing better clustering quality and topology preservation of input multi-dimensi…

Unsupervised Clustering in Personal Photo Collections

2008

In this paper we propose a probabilistic approach for the automatic organization of collected pictures aiming at more effective representation in personal photo albums. Images are analyzed and described in two representation spaces, namely, faces and background. Faces are automatically detected, rectified and represented projecting the face itself in a common low dimensional eigenspace. Backgrounds are represented with low-level visual features based on RGB histogram and Gabor filter energy. Face and background information of each image in the collection is automatically organized by mean-shift clustering technique. Given the particular domain of personal photo libraries, where most of the …

Grounding concepts as emerging clusters in multiple conceptual spaces

2018

A novel framework for symbol grounding in artificial agents is presented, which relies on the key idea that concepts "emerge" implicitly at the perceptual level as clusters of points with similar features forming homogeneous regions in multiple perceptual Conceptual Spaces (pCS). Such spaces describe percepts such as color, texture, shape, and position that in turn are the properties of the objects populating the agent's environment. Objects are represented in a suitable object Conceptual Space where all their features are composed together again using clustering in pCSs. Symbols will be learned from such a tensor space. A detailed description of both the framework and its theoretical found…

Automatic classification of acoustically detected krill aggregations: A case study from Southern Ocean

2022

Acoustic surveys represent the standard methodology to assess the spatial distribution and abundance of pelagic organisms characterized by aggregative behaviour. The species identification of acoustically observed aggregations is usually performed by taking into account the biological sampling and according to expert-based knowledge. The precision of survey estimates, such as total abundance and spatial distribution, strongly depends on the efficiency of acoustic and biological sampling as well as on the species identification. In this context, the automatic identification of specific groups based on energetic and morphological features could improve the species identification process, allo…

SMART TECHNIQUES FOR FAST MEDICAL IMAGE ANALYSIS AND PROCESSING

Medical Imaging has become an important transversal applications and re- search field that embraces a great variety of sciences. Imaging is the central science of measurement in diagnosis and treating diseases. The effort of the technological progress has made possible human imaging starting from a single molecule to the whole body. The open challenge is to treat the huge amount of medical informations with the use of smart and fast techniques that allows clinical and images data analysis and processing. In this ph.D. Thesis, many issues have been addressed and a certain amount of improvement in various fields have been produced, such as biom- etry, organs and tissues segmentation, MRI ther…

Image Segmentation through a Hierarchy of Minimum Spanning Trees

2012

Many approaches have been adopted to solve the problem of image segmentation. Among them a noticeable part is based on graph theory casting the pixels as nodes in a graph. This paper proposes an algorithm to select clusters in the images (corresponding to relevant segments in the image) corresponding to the areas induced in the images through the search of the Minimum Spanning Tree (MST). In particular is is based on a clustering algorithm that extracts clusters computing a hierarchy of Minimum Spanning Trees. The main drawback of this previous algorithm is that the dimension of the cluster is not predictable and a relevant portion of found clusters can be composed by micro-clusters that ar…

Normalised compression distance and evolutionary distance of genomic sequences: comparison of clustering results

2009

Genomic sequences are usually compared using evolutionary distance, a procedure that implies the alignment of the sequences. Alignment of long sequences is a time consuming procedure and the obtained dissimilarity results is not a metric. Recently, the normalised compression distance was introduced as a method to calculate the distance between two generic digital objects and it seems a suitable way to compare genomic strings. In this paper, the clustering and the non-linear mapping obtained using the evolutionary distance and the compression distance are compared, in order to understand if the two distances sets are similar.

Mean shift clustering for personal photo album organization

2008

In this paper we propose a probabilistic approach for the automatic organization of pictures in personal photo album. Images are analyzed in term of faces and low-level visual features of the background. The description of the background is based on RGB color histogram and on Gabor filter energy accounting for texture information. The face descriptor is obtained by projection of detected and rectified faces on a common low dimensional eigenspace. Vectors representing faces and background are clustered in an unsupervised fashion exploiting a mean shift clustering technique. We observed that, given the peculiarity of the domain of personal photo libraries where most of the pictures contain fa…

Fuzzy Smoothed Composition of Local Mapping Transformations for Non-rigid Image Registration

2009

This paper presents a novel method for medical image regis- tration. The global transformation is obtained by composing affine trans- formations, which are recovered locally from given landmarks. Transfor- mations of adjacent regions are smoothed to avoid blocking artifacts, so that a unique continuous and differentiable global function is obtained. Such composition is operated using a technique derived from fuzzy C- means clustering. The method was successfully tested on several datasets; results, both qualitative and quantitative, are shown. Comparisons with other methods are reported. Final considerations on the efficiency of the technique are explained.

Trajectory-based and Sound-based Medical Data Clustering

2022

Challenges in medicine are often faced as interdisciplinary endeav- ors. In such an interdisciplinary view, sonification of medical data provides an additional sensory dimension to highlight often hard- to-find information and details. Some examples of sonification of medical data include Covid genome mapping [5], auditory repre- sentations of tridimensional objects as the brain [4], enhancement of medical imagery through the use of sound [1]. Here, we focus on kidney filtering-efficiency time-evolution data. We consider the estimated glomerular filtration rate (eGFR), the main indicator of kidney efficiency in diabetic kidney disease patients.1 We propose a technique to sonify the eGFR tra…