Pattern recognition in numerical data sets and color images through the typicality based on the GKPFCM clustering algorithm

5Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We take the concept of typicality from the field of cognitive psychology, and we apply the meaning to the interpretation of numerical data sets and color images through fuzzy clustering algorithms, particularly the GKPFCM, looking to get better information from the processed data. The Gustafson Kessel Possibilistic Fuzzy c-means (GKPFCM) is a hybrid algorithm that is based on a relative typicality (membership degree, Fuzzy c-means) and an absolute typicality (typicality value, Possibilistic c-means). Thus, using both typicalities makes it possible to learn and analyze data as well as to relate the results with the theory of prototypes. In order to demonstrate these results we use a synthetic data set and a digitized image of a glass, in a first example, and images from the Berkley database, in a second example. The results clearly demonstrate the advantages of the information obtained about numerical data sets, taking into account the different meaning of typicalities and the availability of both values with the clustering algorithm used. This approach allows the identification of small homogeneous regions, which are difficult to find. © 2013 B. Ojeda-Magaña et al.

Cite

CITATION STYLE

APA

Ojeda-Magaña, B., Ruelas, R., Corona Nakamura, M. A., Carr Finch, D. W., & Gómez-Barba, L. (2013). Pattern recognition in numerical data sets and color images through the typicality based on the GKPFCM clustering algorithm. Mathematical Problems in Engineering, 2013. https://doi.org/10.1155/2013/716753

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free