{'fraction_non_alphanumeric': 0.021439509954058193, 'fraction_numerical': 0.0015313935681470138, 'mean_word_length': 5.535, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A fast K-Means algorithm for the segmentation of echocardiographic images using DBMS-SQL

An efficient K-Means clustering algorithm is proposed using the power of SQL in a relational Database Management environment. Further, this method is applied to segment 2D echocardiography images. We propose this method mainly to improve the speed of segmentation process for further clinical analysis and diagnosis (example: Left Ventricular (LV) boundary detection and other 2D quantitative measurements) of a patient. With few initial image processing steps like median filtering, etc, our proposed K-Means SQL algorithm is applied on the image to identify the segments. Since segmentation alone cannot resolve the anatomical ambiguities present in echocardiogram images, few post segmentation steps like median filtering, Canny edge detection operator, Gaussian sharpening, and morphological operations are applied to obtain venrtricle borders. We identify steps that would normally take more time in conventional K-means algorithm and provide appropriate alternatives in SQL. We compare the conventional K-means algorithm with K-Means SQL algorithm for a set of sample echocardiogram images and the experiments show that our method is superior in terms of quality of segmentation, running time, and scalability.