Possibilistic clustering for shape recognition

Clustering methods have been used extensively in computer vision and pattern recognition. Fuzzy clustering has been shown to be advantageous over crisp (or traditional) clustering in that total commitment of a vector to a given class is not required at each iteration. Recently fuzzy clustering methods have shown spectacular ability to detect not only hypervolume clusters, but also clusters which are actually 'thin shells', i.e., curves and surfaces. Most analytic fuzzy clustering approaches are derived from Bezdek's Fuzzy C-Means (FCM) algorithm. The FCM uses the probabilistic constraint that the memberships of a data point across classes sum to one. This constraint was used to generate the membership update equations for an iterative algorithm. Unfortunately, the memberships resulting from FCM and its derivatives do not correspond to the intuitive concept of degree of belonging, and moreover, the algorithms have considerable trouble in noisy environments. Recently, we cast the clustering problem into the framework of possibility theory. Our approach was radically different from the existing clustering methods in that the resulting partition of the data can be interpreted as a possibilistic partition, and the membership values may be interpreted as degrees of possibility of the points belonging to the classes. We constructed an appropriate objective function whose minimum will characterize a good possibilistic partition of the data, and we derived the membership and prototype update equations from necessary conditions for minimization of our criterion function. In this paper, we show the ability of this approach to detect linear and quartic curves in the presence of considerable noise

A simple construction method for sequentially tidying up 2D online freehand sketches

This paper presents a novel constructive approach to sequentially tidying up 2D online freehand sketches for further 3D interpretation in a conceptual design system. Upon receiving a sketch stroke, the system first identifies it as a 2D primitive and then automatically infers its 2D geometric constraints related to previous 2D geometry (if any). Based on recognized 2D constraints, the identified geometry will be modified accordingly to meet its constraints. The modification is realized in one or two sequent geometric constructions in consistence with its degrees of freedom. This method can produce 2D configurations without iterative procedures to solve constraint equations. It is simple and easy to use for a real-time application. Several examples are tested and discussed

A distinct peak-flux distribution of the third class of gamma-ray bursts: A possible signature of X-ray flashes?

Gamma-ray bursts are the most luminous events in the Universe. Going beyond the short-long classification scheme we work in the context of three burst populations with the third group of intermediate duration and softest spectrum. We are looking for physical properties which discriminate the intermediate duration bursts from the other two classes. We use maximum likelihood fits to establish group memberships in the duration-hardness plane. To confirm these results we also use k-means and hierarchical clustering. We use Monte-Carlo simulations to test the significance of the existence of the intermediate group and we find it with 99.8% probability. The intermediate duration population has a significantly lower peak-flux (with 99.94% significance). Also, long bursts with measured redshift have higher peak-fluxes (with 98.6% significance) than long bursts without measured redshifts. As the third group is the softest, we argue that we have {related} them with X-ray flashes among the gamma-ray bursts. We give a new, probabilistic definition for this class of events.Comment: accepted for publication in Ap

A six-parameter space to describe galaxy diversification

Galaxy diversification proceeds by transforming events like accretion, interaction or mergers. These explain the formation and evolution of galaxies that can now be described with many observables. Multivariate analyses are the obvious tools to tackle the datasets and understand the differences between different kinds of objects. However, depending on the method used, redundancies, incompatibilities or subjective choices of the parameters can void the usefulness of such analyses. The behaviour of the available parameters should be analysed before an objective reduction of dimensionality and subsequent clustering analyses can be undertaken, especially in an evolutionary context. We study a sample of 424 early-type galaxies described by 25 parameters, ten of which are Lick indices, to identify the most structuring parameters and determine an evolutionary classification of these objects. Four independent statistical methods are used to investigate the discriminant properties of the observables and the partitioning of the 424 galaxies: Principal Component Analysis, K-means cluster analysis, Minimum Contradiction Analysis and Cladistics. (abridged)Comment: Accepted for publicationin A\&

The State-of-the-Art of Set Visualization

Sets comprise a generic data model that has been used in a variety of data analysis problems. Such problems involve analysing and visualizing set relations between multiple sets defined over the same collection of elements. However, visualizing sets is a non-trivial problem due to the large number of possible relations between them. We provide a systematic overview of state-of-the-art techniques for visualizing different kinds of set relations. We classify these techniques into six main categories according to the visual representations they use and the tasks they support. We compare the categories to provide guidance for choosing an appropriate technique for a given problem. Finally, we identify challenges in this area that need further research and propose possible directions to address these challenges. Further resources on set visualization are available at http://www.setviz.net