Conference Paper

A mean shift and Non-negative PCA based color image segmentation approach.

DOI: 10.1109/ISSPA.2010.5605433 Conference: 10th International Conference on Information Sciences, Signal Processing and their Applications, ISSPA 2010, Kuala Lumpur, Malaysia, 10-13 May, 2010
Source: DBLP


Image segmentation plays an important role in computer vision systems. An algorithm based on dimension reduction and the mean shift algorithm is used for the segmentation of color images. The Non negative matrix factorization is used for the transformation of the RGB components to a lower dimensional space. The mean shift algorithm is used to cluster the date in the reduced space and hence segment the image.

8 Reads
  • [Show abstract] [Hide abstract]
    ABSTRACT: A novel image segmentation method based on a constraint satisfaction neural network (CSNN) is presented. The new method uses CSNN-based relaxation but with a modified scanning scheme of the image. The pixels are visited with more distant intervals and wider neighborhoods in the first level of the algorithm. The intervals between pixels and their neighborhoods are reduced in the following stages of the algorithm. This method contributes to the formation of more regular segments rapidly and consistently. A cluster validity index to determine the number of segments is also added to complete the proposed method into a fully automatic unsupervised segmentation scheme. The results are compared quantitatively by means of a novel segmentation evaluation criterion. The results are promising.
    Pattern Recognition Letters 12/1999; 20(14-20):1553-1563. DOI:10.1016/S0167-8655(99)00128-2 · 1.55 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Nonnegative matrix factorization (NMF) provides a way for finding a part-based representation of nonnegative data. An important property of NMF is that it can produce a sparse representation of the data; however, in some applications, especially in text clustering, the sparse representation always consists of separated words, which cannot explicitly express the meaning of the basis vector. This paper presents a new descriptive clustering algorithm based on NMF, called DC-NMF that can avoid this separated word problem. In our proposed method, we embrace the phrase-by-document matrix in addition to the commonly used term-by-document matrix. Then, we use conjunct gradient descent to minimize the mean squared error objective function. Finally, we describe each cluster with the highest weighted element corresponding to one particular phrase. Our experimental results indicate that our method can obtain more ldquopurerdquo clusters than other methods.
    The 2008 IEEE International Conference on Granular Computing, GrC 2008, Hangzhou, China, 26-28 August 2008; 01/2008
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed. They differ only slightly in the multiplicative factor used in the update rules. One algorithm can be shown to minimize the conventional least squares error while the other minimizes the generalized Kullback-Leibler divergence. The monotonic convergence of both algorithms can be proven using an auxiliary function analogous to that used for proving convergence of the ExpectationMaximization algorithm. The algorithms can also be interpreted as diagonally rescaled gradient descent, where the rescaling factor is optimally chosen to ensure convergence.
    Advances in neural information processing systems 02/2001; 13.