Performance evaluation of simple linear iterative clustering algorithm on medical image processing.

This paper investigates the application of the Simple Linear Iterative Clustering (SLIC) algorithm for complex object image segmentation, on the example of images of human body injuries. The study solves the problem of the lack of quantitative evidence regarding SLIC's algorithm performance in high-precision area and boundary assessment of the lesion on a digital image of a human body with a wound injury on it. A comprehensive methodology is developed to evaluate SLIC's algorithm efficacy across various complex images and image resolutions. The research utilizes a combined dataset of 3696 wound images from the Foot Ulcer Segmentation Challenge (FUSeg) and WoundSeg datasets. Bayesian optimization is utilized to fine-tune SLIC algorithm hyperparameters, focusing on the number of segments and compactness. Results indicate that SLIC algorithm demonstrates consistent performance across different implementations, achieving Dice scores around 0.84 and Soft Boundary F1 scores around 0.55. The study reveals that the optimal number of segments for SLIC algorithm can be defined relative to the spatial dimensions of the input image, with maximal image dimension *2 being the most effective value. A thorough analysis of various segmentation metrics is conducted, including IoU, Dice Score, and Boundary F1 Score. The research introduces and employs the Soft Boundary F1 Score – modification of Boundary F1 Score, a novel metric designed to provide a more nuanced evaluation of boundary detection accuracy while offering a smoother optimization landscape. This metric proves particularly valuable in assessing the performance of SLIC algorithm in image with complex objects on them segmentation tasks. Importantly, this research presents an idealized SLIC-based segmentation approach, where superpixels are optimally combined using ground-truth masks to establish an upper bound of performance. This idealized SLIC algorithm segmentation is compared with a pre-trained on the FUSeg dataset UNet model, showcasing superior generalization capability across diverse wound types. On the WoundSeg dataset, the idealized SLIC algorithm approach achieved a Dice score of 0.84, significantly outperforming the UNet model (0.12 Dice score). As a result, this study provides valuable insights for improving complex objects segmentation methods and highlights the need for further research on developing effective methods for superpixel classification in real-world scenarios. The findings also highlight the potential of SLIC-based approaches in addressing the challenges of diverse data types and limited training data.

For better analyzing and adopting superpixel methods in image segmentation, an improved Simple Linear Iterative Clustering (SLIC) algorithm is put forward, which sustains that homogeneous regions show high consistence during clustering. Firstly, a primary iteration of SLIC approach is employed to generate uniform superpixels. Then an update strategy is introduced to determine whether to recluster the candidate region. In homogeneous regions, a cluster center often shows relatively small deviation of last position in spatial-color feature space when local iteration occurs, which can be regarded as redundant computation and be reduced. Experimental results show that the strategy brings a remarkable increased efficiency for traditional SLIC without significant affection on segmentation results.

To segment the tumor region precisely is a prerequisite for ultrasound navigation and treatment. In this paper, a normalized cut method to segment tumor ultrasound image is proposed by means of simple linear iterative clustering for pre-segmentation procedure. The first step, we use simple linear iterative clustering algorithm to divide the image into a number of homogeneous over-segmented regions. Then, these regions are regarded as nodes, and a similarity matrix is constructed by comparing the histograms of each two regions. Finally, we apply the Ncut method to merging the over-segmented regions, then the image segmentation process is completed. The results show that the proposed segmentation scheme handles the strong speckle noise, low contrast, and weak edges well in ultrasound image. Our method has high segmentation precision and computation efficiency than the pixel-based Ncut method.

Change detection is one of the fundamental applications of synthetic aperture radar (SAR) images. However, speckle noise presented in SAR images has a negative effect on change detection, leading to frequent false alarms in the mapping products. In this research, a novel two-phase object-based deep learning approach is proposed for multi-temporal SAR image change detection. Compared with traditional methods, the proposed approach brings two main innovations. One is to classify all pixels into three categories rather than two categories: unchanged pixels, changed pixels caused by strong speckle (false changes), and changed pixels formed by real terrain variation (real changes). The other is to group neighbouring pixels into superpixel objects such as to exploit local spatial context. Two phases are designed in the methodology: (1) Generate objects based on the simple linear iterative clustering (SLIC) algorithm, and discriminate these objects into changed and unchanged classes using fuzzy c-means (FCM) clustering and a deep PCANet. The prediction of this Phase is the set of changed and unchanged superpixels. (2) Deep learning on the pixel sets over the changed superpixels only, obtained in the first phase, to discriminate real changes from false changes. SLIC is employed again to achieve new superpixels in the second phase. Low rank and sparse decomposition are applied to these new superpixels to suppress speckle noise significantly. A further clustering step is applied to these new superpixels via FCM. A new PCANet is then trained to classify two kinds of changed superpixels to achieve the final change maps. Numerical experiments demonstrate that, compared with benchmark methods, the proposed approach can distinguish real changes from false changes effectively with significantly reduced false alarm rates, and achieve up to 99.71% change detection accuracy using multi-temporal SAR imagery.

In view interpolation, information missing often exists in initial depth map, moreover, disocclusion regions usually occur along the foreground object boundaries after 3D warping. Generally, initial depth map and warped depth map have a strong influence on the performance of view interpolation. However, most of existing view interpolation algorithms only emphasize hole filling of the warped color image. In this paper, a superpixel-based method is proposed for initial depth map enhancement and warped depth map hole filling. Firstly, the color image is segmented using simple linear iterative clustering (SLIC) algorithm, and after that, the associated depth map is segmented with the same label. Then, the depthmissing pixels are recovered by considering color and depth superpixel information jointly. Additionally, holes of the disocclusion regions in the warped depth map can also be filled efficiently via superpixel-based segmentation. Experimental results show that with the proposed method the quality of the interpolated view has been improved significantly in terms of both subjective and objective evaluations.

Alzheimer's Disease (AD) poses many challenges to healthcare systems for elderly people in the world, for which an accurate diagnosis of AD is therefore a crucial task. Positron Emission Tomography (PET) images and machine learning can be used to support this purpose. Brain atlases are common tools used to extract features from PET images, and choosing a proper brain map is extremely important. In this work, we propose a novel method to learn the very first PET-driven brain mapping based on Support Vector Machine (SVM) coefficients and Simple Linear Iterative Clustering (SLIC) algorithm, which is addressed as C-Atlas. When compared with predefined atlases on classification task, C-atlas experimentally proved to be more adapted for AD diagnosis both in terms of feature extraction and selection. The results suggest that it is possible to build an adapted brain mapping for a specific disease, and that the proposed method can also be used as an effective mean to support the analysis and comparison of brain diseases at multiple scales.

Abstract. The Factor analysis and target transformation (FATT) is an effective method to test for the presence of particular mineral on Martian surface. It has been used both in thermal infrared (Thermal Emission Spectrometer, TES) and near-infrared (Compact Reconnaissance Imaging Spectrometer for Mars, CRISM) hyperspectral data. FATT derived a set of orthogonal eigenvectors from a mixed system and typically selected first 10 eigenvectors to least square fit the library mineral spectra. However, minerals present only in a limited pixels will be ignored because its weak spectral features compared with full image signatures. Here, we proposed a superpixel based FATT method to detect the mineral distributions on Mars. The simple linear iterative clustering (SLIC) algorithm was used to partition the CRISM image into multiple connected image regions with spectral homogeneous to enhance the weak signatures by increasing their proportion in a mixed system. A least square fitting was used in target transformation and performed to each region iteratively. Finally, the distribution of the specific minerals in image was obtained, where fitting residual less than a threshold represent presence and otherwise absence. We validate our method by identifying carbonates in a well analysed CRISM image in Nili Fossae on Mars. Our experimental results indicate that the proposed method work well both in simulated and real data sets.

Road detection aims at detecting the (drivable) road surface ahead vehicle and plays a crucial role in driver assistance system. To improve the accuracy and robustness of road detection approaches in complex environments, a new road detection method based on CNN (convolutional neural network) and MRF (markov random field) is proposed. The original road image is segmented into super-pixels of uniform size using simple linear iterative clustering (SLIC) algorithm. On this basis, we train the CNN which can automatically learn the features that are most beneficial to classification. Then, the trained CNN is applied to classify road region and non-road region. Finally, based on the relationship between the super-pixels neighborhood, we utilize MRF to optimize the classification results of CNN. Quantitative and qualitative experiments on the publicly datasets demonstrate that the proposed method is robust in complex environments. Furthermore, compared with state-of-the-art algorithms, the approach provides the better performance.

Registration between the baseline and follow-up lung computed tomography (CT) volumes plays an important role in computer-aided diagnosis and following-up care during adaptive radiotherapy. Diffeomorphic log-Demons as state of the art in Demons implementations is restricted to relatively small deformations, low accuracy, and ignoring some prior structural features. In this paper, an automated superpixel-borders-guided deformation image registration (SBG-DIR) algorithm is proposed. The proposed SBG-DIR method uses the simple linear iterative clustering (SLIC) algorithm to automated superpixels generation. Incorporation of superpixel borders into registration algorithm is implemented by a new similarity criterion based on the binary volume representation of superpixel borders. The binary volume representation enables accurate preserving motion boundaries, contributes to a faster convergence of the objective function and eliminates errors caused by manual interaction. In addition, a subtraction volume is produced by the intensity difference between the first time point CT volume and its warped follow-up CT volume. The subtraction volume can be used for detection of tumor tissue growth or shrinkage, which is an essential part of a CT-based diagnosis. Moreover, to ensure the topology preservation of biological objects, our proposed SBG-DIR method is implemented in the space of diffeomorphisms, in which meaningful biological shapes can be found. Compared with the state-of-the-art Demons, the proposed SBG-DIR method doesn’t require any additional optimization, yields a faster convergence and is more accurate and efficient in recovering large deformations. Experimental results indicate that the proposed SBG-DIR method performed better than the state-of-the-art Demons algorithms.

Video is a rich information source containing both audio and visual information along with motion information embedded in it. Applications such as e-learning, live TV, video on demand, traffic monitoring, etc. need an efficient video retrieval strategy. Content-based video retrieval and superpixel segmentation are two diverse application areas of computer vision. In this work, we are presenting an algorithm for content-based video retrieval with help of Integration of Curvelet transform and Simple Linear Iterative Clustering (ICTSLIC) algorithm. Proposed algorithm consists of two steps: off line processing and online processing. In offline processing, keyframes of the database videos are extracted by employing features: Pearson Correlation Coefficient (PCC) and color moments (CM) and on the extracted keyframes superpixel generation algorithm ICTSLIC is applied. The superpixels generated by applying ICTSLIC on keyframes are used to represent database videos. On other side, in online processing, ICTSLIC superpixel segmentation is applied on query frame and the superpixels generated by segmentation are used to represent query frame. Then videos similar to query frame are retrieved through matching done by calculation of Euclidean distance between superpixels of query frame and database keyframes. Results of the proposed method are irrespective of query frame features such as camera motion, object’s pose, orientation and motion due to the incorporation of ICTSLIC superpixels as base feature for matching and retrieval purpose. The proposed method is tested on the dataset comprising of different categories of video clips such as animations, serials, personal interviews, news, movies and songs which is publicly available. For evaluation, the proposed method randomly picks frames from database videos, instead of selecting keyframes as query frames. Experiments were conducted on the developed dataset and the performance is assessed with different parameters Precision, Recall, Jaccard Index, Accuracy and Specificity. The experimental results shown that the proposed method is performing better than the other state-of-art methods.

Over recent decades, remote sensing has emerged as an effective tool for improving agriculture productivity. In particular, many works have dealt with the problem of identifying characteristics or phenomena of crops and orchards on different scales using remote sensed images. Since the natural processes are scale dependent and most of them are hierarchically structured, the determination of optimal study scales is mandatory in understanding these processes and their interactions. The concept of multi-scale/multi-resolution inherent to OBIA methodologies allows the scale problem to be dealt with. But for that multi-scale and hierarchical segmentation algorithms are required. The question that remains unsolved is to determine the suitable scale segmentation that allows different objects and phenomena to be characterized in a single image. In this work, an adaptation of the Simple Linear Iterative Clustering (SLIC) algorithm to perform a multi-scale hierarchical segmentation of satellite images is proposed. The selection of the optimal multi-scale segmentation for different regions of the image is carried out by evaluating the intra-variability and inter-heterogeneity of the regions obtained on each scale with respect to the parent-regions defined by the coarsest scale. To achieve this goal, an objective function, that combines weighted variance and the global Moran index, has been used. Two different kinds of experiment have been carried out, generating the number of regions on each scale through linear and dyadic approaches. This methodology has allowed, on the one hand, the detection of objects on different scales and, on the other hand, to represent them all in a single image. Altogether, the procedure provides the user with a better comprehension of the land cover, the objects on it and the phenomena occurring.

Cropland classification can be used to monitor cropland distribution and its change over time. In this letter, a new superpixel-based cropland classification method is proposed for synthetic aperture radar (SAR) imagery through the integration of statistical texture, polarization, and spatial information. First, the method combines random forest algorithm and superpixels, which are generated using simple linear iterative clustering algorithm with polarization features of Pauli decomposition and spatial information. Superpixel-based spatial context information is used to reduce the influence of coherent speckle and misclassification in cropland blocks. Second, <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$G^{0}$ </tex-math></inline-formula> statistical texture feature is used to reduce the interference of background targets such as woodland in cropland classification. Comparison experiments of different methods using C-band airborne SAR (AIRSAR) polarimetric data acquired in early July show that the proposed method has better classification performance, with an overall accuracy of 88.62%. The classification accuracy of corn and soybean is above 95% and 91%, respectively. The <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$G^{0}$ </tex-math></inline-formula> statistical texture feature is helpful to eliminate woodland that may cause crop misclassification using single-date SAR image.

Recognition of necrotic regions in MRI images of chronic spinal cord injury based on superpixel

This paper presents a new virtual view synthesis method with depth map preprocessing and superpixel segmentation based hole filling. First, in order to reduce the ghosting artifacts caused by the misalignment between depth and texture, the depth image is preprocessed through expanding the regions of foreground objects. Virtual view images are then generated using the depth-image-based rendering algorithm. Second, the original reference color image is segmented into superpixels using simple linear iterative clustering algorithm. Finally, an oriented hole filling method is utilized to fill the disoccluded regions. For each hole pixel, instead of using exemplar patches, a set of candidate superpixels is selected from SLIC segmentations to form the sample space, and the best matching superpixel with the minimum cost is chosen to fill the hole. Experimental results demonstrate that comparing with the state-of-the-art methods, the subjective and objective quality of the synthesized virtual view images are substantially improved with the proposed method.

Salient object segmentation is well known for detecting and segmenting objects using saliency map as input. In this paper, we propose a salient object segmentation method which integrates saliency, superpixel, and background connectivity prior. First, our method extracts the superpixels of an image by the simple linear iterative clustering algorithm. Second, based on superpixel representation, we use background connectivity prior to characterize the spatial layout of each superpixel in a color space with respect to the image boundary. Third, considering both saliency and background connectivity values, we label four kinds of superpixel-level seeds and feed them to superpixel-level GrabCut method. Because superpixel representation generates only a few seeds, the optimization of GrabCut method converges fast. Finally, for further improvement, we crop a rectangular region which contains the segmented object obtained in the third step and apply GrabCut at the pixel level to produce the final segmentation result. Experimental results on eight typical datasets demonstrate that in terms of both performance and computational efficiency, the proposed segmentation method outperforms existing state-of-the-art methods.