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

ABSTRACT 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.

1 Bookmark
 · 
88 Views
  • 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.
    02/2001;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A general non-parametric technique is proposed for the analysis of a complex multimodal feature space and to delineate arbitrarily shaped clusters in it. The basic computational module of the technique is an old pattern recognition procedure: the mean shift. For discrete data, we prove the convergence of a recursive mean shift procedure to the nearest stationary point of the underlying density function and, thus, its utility in detecting the modes of the density. The relation of the mean shift procedure to the Nadaraya-Watson estimator from kernel regression and the robust M-estimators; of location is also established. Algorithms for two low-level vision tasks discontinuity-preserving smoothing and image segmentation - are described as applications. In these algorithms, the only user-set parameter is the resolution of the analysis, and either gray-level or color images are accepted as input. Extensive experimental results illustrate their excellent performance
    IEEE Transactions on Pattern Analysis and Machine Intelligence 06/2002; · 4.80 Impact Factor
  • [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. 01/1999;