18,748 research outputs found

    Nuclei segmentation of histology images based on deep learning and color quantization and analysis of real world pill images

    Get PDF
    Medical image analysis has paved a way for research in the field of medical and biological image analysis through the applications of image processing. This study has special emphasis on nuclei segmentation from digitized histology images and pill segmentation. Cervical cancer is one of the most common malignant cancers affecting women. This can be cured if detected early. Histology image feature analysis is required to classify the squamous epithelium into Normal, CIN1, CIN2 and CIN3 grades of cervical intraepithelial neoplasia (CIN). The nuclei in the epithelium region provide the majority of information regarding the severity of the cancer. Segmentation of nuclei is therefore crucial. This paper provides two methods for nuclei segmentation. The first approach is clustering approach by quantization of the color content in the histology images uses k-means++ clustering. The second approach is deep-learning based nuclei segmentation method works by gathering localized information through the generation of superpixels and training convolutional neural network. The other part of the study covers segmentation of consumer-quality pill images. Misidentified and unidentified pills constitute a safety hazard for both patients and health professionals. An automatic pill identification technique is essential to address this challenge. This paper concentrates on segmenting the pill image, which is crucial step to identify a pill. A color image segmentation algorithm is proposed by generating superpixels using the Simple Linear Iterative Clustering (SLIC) algorithm and merging the superpixels by thresholding the region adjacency graphs. The algorithm manages to supersede the challenges due to various backgrounds and lighting conditions of consumer-quality pill images --Abstract, page iii

    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

    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
    corecore