This paper presents a variation of fuzzy c-means (FCM) algorithm that provides image clustering. The proposed algorithm incorporates the local spatial information and gray level information in a novel fuzzy way. The new algorithm is called fuzzy local information C-Means (FLICM). FLICM can overcome the disadvantages of the known fuzzy c-means algorithms and at the same time enhances the clustering performance. The major characteristic of FLICM is the use of a fuzzy local (both spatial and gray level) similarity measure, aiming to guarantee noise insensitiveness and image detail preservation. Furthermore, the proposed algorithm is fully free of the empirically adjusted parameters (a, ¿_g, ¿_s, etc.) incorporated into all other fuzzy c-means algorithms proposed in the literature. Experiments performed on synthetic and real-world images show that FLICM algorithm is effective and efficient, providing robustness to noisy images.

This paper presents a novel fast model for active contours to detect objects in an image, based on techniques of curve evolution. The proposed model can detect objects whose boundaries are not necessarily defined by gradient, based on the minimization of a fuzzy energy, which can be seen as a particular case of a minimal partition problem. This fuzzy energy is used as the model motivation power evolving the active contour, which will stop on the desired object boundary. However, the stopping term does not depend on the gradient of the image, as most of the classical active contours, but instead is related to the image color and spatial segments. The fuzziness of the energy provides a balanced technique with a strong ability to reject ldquoweakrdquo local minima. Moreover, this approach converges to the desired object boundary very fast, since it does not solve the Euler-Lagrange equations of the underlying problem, but, instead, calculates the fuzzy energy alterations directly. The theoretical properties and various experiments presented demonstrate that the proposed fuzzy energy-based active contour is better and more robust than classical snake methods based on the gradient or other kind of energies.

In this paper, the use of clustering algorithms for decision-level data fusion is proposed. Person authentication results coming from several modalities (e.g., still image, speech), are combined by using fuzzy k-means (FKM), fuzzy vector quantization (FVQ) algorithms, and median radial basis function (MRBF) network. The quality measure of the modalities data is used for fuzzification. Two modifications of the FKM and FVQ algorithms, based on a novel fuzzy vector distance definition, are proposed to handle the fuzzy data and utilize the quality measure. Simulations show that fuzzy clustering algorithms have better performance compared to the classical clustering algorithms and other known fusion algorithms. MRBF has better performance especially when two modalities are combined. Moreover, the use of the quality via the proposed modified algorithms increases the performance of the fusion system

In this paper, the generalized fuzzy mathematical morphology (GFMM) is proposed, based on a novel definition of the fuzzy inclusion indicator (FII). FII is a fuzzy set used as a measure of the inclusion of a fuzzy set into another, that is proposed to be a fuzzy set. It is proven that the FII obeys a set of axioms, which are proposed to be extensions of the known axioms that any inclusion indicator should obey, and which correspond to the desirable properties of any mathematical morphology operation. The GFMM provides a very powerful and flexible tool for morphological operations. The binary and grayscale mathematical morphologies can be considered as special cases of the proposed GFMM. An application for robust skeletonization and shape decomposition of two-dimensional (2-D) and three-dimensional (3-D) objects is presented. Simulation examples show that the object reconstruction from their skeletal subsets that can be achieved by using the GFMM is better than by using the binary mathematical morphology in most cases. Furthermore, the use of the GFMM for skeletonization and shape decomposition preserves the shape and the location of the skeletal subsets and spines.

In this paper, the fuzzy scalar median (FSM) is proposed, defined by using ordering of fuzzy numbers based on fuzzy minimum and maximum operations defined by using the extension principle. Alternatively, the FSM is defined from the minimization of a fuzzy distance measure, and the equivalence of the two definitions is proven. Then, the fuzzy vector median (FVM) is proposed as an extension of vector median, based on a novel distance definition of fuzzy vectors, which satisfy the property of angle decomposition. By defining properly the fuzziness of a value, the combination of the basic properties of the classical scalar and vector median (VM) filter with other desirable characteristics can be succeeded.

In this paper, the morphological skeleton interpolation (MSI) algorithm is presented. It is an efficient, shape-based interpolation method used for interpolating slices in a three-dimensional (3-D) binary object. It is based on morphological skeletonization, which is used for two-dimensional (2-D) slice representation. The proposed morphological skeleton matching process provides translation, rotation, and scaling information at the same time. The interpolated slices preserve the shape of the original object slices, when the slices have similar shapes. It can also modify the shape of an object when the successive slices do not have similar shapes. Applications on artificial and real data are also presented.