RESUMEN
The precise segmentation of white blood cells (WBCs) within blood smear images is a significant challenge with implications for both medical research and image processing. Of particular importance is the often neglected task of accurately segmenting WBC nuclei, an aspect that currently lacks dedicated methodologies. This paper introduces a straightforward and efficient method designed to fill this critical gap, providing an effective solution for the efficient segmentation of WBC nuclei. In blood smear imagery, the distinctive coloration of WBCs contrasts with the hues of other blood components. The inherent obscurity of WBCs prompts their segmentation by isolating pixels with minimal intensities. To streamline this process, our proposed method employs the Laplacian pyramid technique to decorrelate pixels in blood smear images, thereby amplifying the contrast. Subsequently, the intensities of pixels constituting blood cells, encompassing WBCs and the background, are modeled using three Gaussian random variables. Capitalizing on this feature, we implement the Gaussian mixture model (GMM) clustering method to determine the optimal threshold value, facilitating a highly precise segmentation of WBC nuclei. The proposed method demonstrates the capability to process images containing a single WBC as well as effectively functioning with images containing multiple cells of this type. Evaluation of the method on the ALL-IDB, ALL-IDB2, CellaVision, and JTSC datasets yielded accuracy values of 0.9802, 0.9725, 0.9772, and 0.9730, respectively. Comparative analysis with state-of-the-art methods revealed a notably comparable performance, underscoring the effectiveness of the proposed approach. The method presented in this article is highly competitive for segmenting the nuclei of WBCs compared to state-of-the-art methods. The three main advantages of our method are its ability to process images containing one or more WBCs, the automatic calculation of threshold values for each processed image, eliminating the need for manual parameter adjustments. Lastly, the method is efficient, as its algorithmic complexity is approximately O ( n m ) .