4,798 research outputs found

    Color image segmentation using a self-initializing EM algorithm

    Get PDF
    This paper presents a new method based on the Expectation-Maximization (EM) algorithm that we apply for color image segmentation. Since this algorithm partitions the data based on an initial set of mixtures, the color segmentation provided by the EM algorithm is highly dependent on the starting condition (initialization stage). Usually the initialization procedure selects the color seeds randomly and often this procedure forces the EM algorithm to converge to numerous local minima and produce inappropriate results. In this paper we propose a simple and yet effective solution to initialize the EM algorithm with relevant color seeds. The resulting self initialised EM algorithm has been included in the development of an adaptive image segmentation scheme that has been applied to a large number of color images. The experimental data indicates that the refined initialization procedure leads to improved color segmentation

    Automatic segmentation of skin cancer images using adaptive color clustering

    Get PDF
    This paper presents the development of an adaptive image segmentation algorithm designed for the identification of the skin cancer and pigmented lesions in dermoscopy images. The key component of the developed algorithm is the Adaptive Spatial K-Means (A-SKM) clustering technique that is applied to extract the color features from skin cancer images. Adaptive-SKM is a novel technique that includes the primary features that describe the color smoothness and texture complexity in the process of pixel assignment. The A-SKM has been included in the development of a flexible color-texture image segmentation scheme and the experimental data indicates that the developed algorithm is able to produce accurate segmentation when applied to a large number of skin cancer (melanoma) images

    Fast Color Quantization Using Weighted Sort-Means Clustering

    Full text link
    Color quantization is an important operation with numerous applications in graphics and image processing. Most quantization methods are essentially based on data clustering algorithms. However, despite its popularity as a general purpose clustering algorithm, k-means has not received much respect in the color quantization literature because of its high computational requirements and sensitivity to initialization. In this paper, a fast color quantization method based on k-means is presented. The method involves several modifications to the conventional (batch) k-means algorithm including data reduction, sample weighting, and the use of triangle inequality to speed up the nearest neighbor search. Experiments on a diverse set of images demonstrate that, with the proposed modifications, k-means becomes very competitive with state-of-the-art color quantization methods in terms of both effectiveness and efficiency.Comment: 30 pages, 2 figures, 4 table
    • 

    corecore