Cluster-based fine-to-coarse superpixel segmentation

We propose an improved superpixel segmentation algorithm based on visual saliency and color entropy for online color detection in printed products. This method addresses the issues of low accuracy and slow speed in detecting color deviations in print quality control. The improved superpixel segmentation algorithm consists of three main steps: Firstly, simulating human visual perception to obtain visually salient regions of the image, thereby achieving region-based superpixel segmentation. Secondly, adaptively determining the superpixel size within the salient regions using color information entropy. Finally, the superpixel segmentation method is optimized using hue angle distance based on chromaticity, ultimately achieving a region-based adaptive superpixel segmentation algorithm. Color detection of printed products compares the color mean values of post-printing images under the same superpixel labels, outputting labels with color deviations to identify areas of color differences. The experimental results show that the improved superpixel algorithm introduces color phase distance with better segmentation accuracy, and combines it with human visual perception to better reproduce the color information of printed materials. Using the method described in this article for printing color quality inspection can reduce data computation, quickly detect and mark color difference areas, and provide the degree of color deviation.

Superpixel segmentation targets at grouping pixels in an image into atomic regions whose boundaries align well with the natural object boundaries. This paper first proposes a new feature representation for superpixel segmentation that holistically embraces color, contour, texture, and spatial features. Then, we introduce a clustering-based discriminability measure to iteratively evaluate the importance of different features. Integrating the feature representation and the discriminability measure, we propose a novel content-adaptive superpixel (CAS) segmentation algorithm. CAS is able to automatically and iteratively adjust the weights of different features to fit various properties of image instances. Experiments on several challenging datasets demonstrate that the proposed CAS outperforms the state-of-the-art methods and has a low computational cost.

Superpixel segmentation aims at grouping discretizing pixels into high-level correlative units and reducing the complexity of subsequent tasks, e.g., saliency detection and object tracking. Existing superpixel segmentation algorithms mainly focus on maintaining the geometrical information, while neglecting the irregular structure of superpixels. In this paper, a superpixel segmentation method is proposed to generate approximately structural superpixels with sharp boundary adherence and comprehensive semantic information. The superpixel segmentation is formulated as a square-wise asymmetric partition problem, where the semantic perceptual superpixels are recorded in a square level to preserve abundant semantic information and save storage simultaneously. Moreover, in order to achieve regular-shape superpixel units to better adhere to image boundaries and contours, a combinatorial optimization strategy is devised to achieve an optimal combination of squares and isolated pixels. Experimental comparisons with some state-of-the-art superpixel segmentation methods on the public benchmarks demonstrate the effectiveness of the proposed method quantitatively and qualitatively. In addition, we have applied the method to brain tissue segmentation to illustrate superior performance.

Novel Method for Prostate Cancer Detection Using Super Pixel and ANN Algorithm

Satellite images are always with complex background and shadow areas. These factors can lead to target segmentation break up and recognition with a low accuracy. Aiming at solving these problems, we proposed an aircraft recognition method based on superpixel segmentation and reconstruction. First, we need to estimate the orientation of an aircraft by using histograms of oriented gradients. And then, an improved Simple Linear Iterative Cluster (SLIC) superpixel segmentation algorithm is provided. By comparing texture feature instead of color feature space, we cluster the pixels that are with the same features. Last, through target template images and orientation, we reconstruct the superpixels. Also, the lowest error matching ratio is the recognized target. The test results show that the algorithm is robust to noise and recognize more aircrafts. Especially, when the satellite images with complex background and shadow areas, our method recognizes accuracy better than other methods. It can satisfy the demand of satellite image aircraft recognition.

Deep learning has achieved great success in the field of computer vision, and the precision in image classification and image detection has surpassed humans. Therefore, this paper combines deep learning and medical image segmentation, focusing on how to improve the accuracy and speed of segmentation algorithm of medical exercise rehabilitation image. Aiming at the shortcomings of traditional medical image recognition methods, a medical exercise rehabilitation image segmentation algorithm based on hierarchical features of convolutional neural networks is proposed, this paper calls it as hierarchical features of convolutional neural networks (HFCNN). The algorithm firstly samples the convolution output of multiple layers in the convolutional neural network to a unified scale and combines them to construct a hierarchical feature. This hierarchical feature combines the structural information of objects contained in the shallow layer of the network with the semantic information of objects contained in the deep layers of the network, so it has a strong ability to express. Secondly, the image can be segmented into multiple super pixels by the super pixel segmentation algorithm. The classifier is trained using the hierarchical features of the super pixel, and then the classification result is mapped back to the pixel. Finally, a fully connected conditional random field algorithm including one-potential potential energy and paired potential energy is constructed. The corresponding energy function is used to smooth the classification result of the pixel, and the regional consistency and continuity of the pixel mark are improved. Compared with many classical convolutional neural network algorithms, this algorithm not only accelerates the network convergence speed, shortens the training time, but also significantly improves the accuracy of segmentation algorithm of medical exercise rehabilitation image, showing good practical value.

Background: This study explored the diagnostic potential of image-processing analysis in optical coherence tomography (OCT) images to detect systemic vascular changes in individuals with systemic diseases. Methods: Ocular OCT images from two cohorts diabetic patients and healthy control subjects were analyzed. A novel Superpixel Segmentation (SpS) algorithm was used to process these images and extract optical image density information from ocular vascular tissue. The algorithm was applied to isolate the choroid layer for analysis of its optical properties. The procedure was performed by separate examiners, and both inter- and intra-observer repeatability were assessed. Choroidal area (CA) and choroidal optical image density (COID) metrics were used to assess structural changes in the vascular tissue and predict alterations in the choroidal parameters. Results: A total of 110 diabetic patient eye images and 92 healthy control images were processed. The results showed significant differences in CA and COID between diabetic and healthy eyes, indicating that these parameters could serve as valuable biomarkers for early vascular damage. Conclusions: The use of the SpS algorithm on OCT B-scan images allows for the identification of new parameters linked to ocular vascular damage. These findings suggest that digital image-processing techniques can reveal differences in vascular tissue, offering potential new indicators of pathology.

In recent studies, superpixel segmentation has been integrated into hyperspectral (HS) image classification methods. However, the existing superpixel-based classification methods usually suffer from two serious problems. First, the accuracy and efficiency of current superpixel segmentation approaches cannot meet the demands of practical applications for HS images; second, conventional superpixel-based classification methods generally consider each generated superpixel as a unit for the image classification, which may help to reduce the computing time but result in a significant decrease of the classification accuracy. To solve the problems, we propose a fast region growing based superpixel segmentation (FRGSS) algorithm and a novel texture-adaptive superpixel integration strategy (TASIS) for the HS image classification. Experimental results on real Airborne Visible/Infrared Imaging Spectrometer (AVIRIS) HS images demonstrate that the proposed FRGSS outperforms the state-of-the-art superpixel algorithm. In addition, the superiority of the TASIS is verified compared to the pixel-wise and the conventional superpixel-based classification methods.

We propose a new objective function for clustering. This objective function consists of two components: the entropy rate of a random walk on a graph and a balancing term. The entropy rate favors formation of compact and homogeneous clusters, while the balancing function encourages clusters with similar sizes and penalizes larger clusters that aggressively group samples. We present a novel graph construction for the graph associated with the data and show that this construction induces a matroid--a combinatorial structure that generalizes the concept of linear independence in vector spaces. The clustering result is given by the graph topology that maximizes the objective function under the matroid constraint. By exploiting the submodular and monotonic properties of the objective function, we develop an efficient greedy algorithm. Furthermore, we prove an approximation bound of (1/2) for the optimality of the greedy solution. We validate the proposed algorithm on various benchmarks and show its competitive performances with respect to popular clustering algorithms. We further apply it for the task of superpixel segmentation. Experiments on the Berkeley segmentation data set reveal its superior performances over the state-of-the-art superpixel segmentation algorithms in all the standard evaluation metrics.

There exist almost as many superpixel segmentation algorithms as applications they can be used for. So far, the choice of the right superpixel algorithm for the task at hand is based on their ability to resemble human-made ground truth segmentations (besides runtime and availability). We investigate the equally important question of how stable the segmentations are under image changes as they appear in video data. Further we propose a new quality measure that evaluates how well the segmentation algorithms cover relevant image boundaries. Instead of relying on human-made annotations, that may be biased by semantic knowledge, we present a completely data-driven measure that inherently emphasizes the importance of image boundaries. Our evaluation is based on two recently published datasets coming with ground truth optical flow fields. We discuss how these ground optical truth fields can be used to evaluate segmentation algorithms and compare several existing superpixel algorithms.

Visual based route and boundary detection is a key technology in agricultural automatic navigation systems. The variable illumination and lack of training samples has a bad effect on visual route detection in unstructured farmland environments. In order to improve the robustness of the boundary detection under different illumination conditions, an image segmentation algorithm based on support vector machine was proposed. A superpixel segmentation algorithm was adopted to solve the lack of training samples for a support vector machine. A sufficient number of superpixel samples were selected for extraction of color and texture features, thus a 19-dimensional feature vector was formed. Then, the support vector machine model was trained and used to identify the paddy ridge field in the new picture. The recognition F1 score can reach 90.7%. Finally, Hough transform detection was used to extract the boundary of the ridge field. The total running time of the proposed algorithm is within 0.8 s and can meet the real-time requirements of agricultural machinery.

Underwater images commonly suffer from a variety of quality degradations, such as color casts, low contrast, blurring details, and limited visibility. Existing superpixel segmentation algorithms face challenges in achieving superior performance when directly applied to underwater images with quality degradation. In this paper, to alleviate the limitations of superpixel segmentation when applied to underwater scenes, we propose the first underwater superpixel segmentation network (USNet), specifically designed according to the intrinsic characteristics of underwater images. Considering the quality degradation, we propose a multi-scale water-net module (MWM) aimed at enhancing the quality of underwater images before superpixel segmentation. The degradation-aware attention (DA) mechanism is then created and incorporated into MWM to solve light scattering and absorption, which can decrease object visibility and cause blurred edges. By effectively directing the network to prioritize locations that exhibit a considerable decrease in quality, this method enhances the visibility of those specific areas. Additionally, we extract the deep spatial features using the coordinate attention method. Finally, these features are fused with the shallow spatial information using the dynamic spatiality embedding module to embed comprehensive spatial features. Training and testing were conducted on the SUIM dataset, the underwater change detection dataset, and UIEB dataset. Experimental results show that our method achieves the best scores in terms of achievable segmentation accuracy, undersegmentation error, and boundary recall evaluation metrics compared to other methods. Both quantitative and qualitative evaluations demonstrate that our method can handle complicated underwater scenes and outperform existing state-of-the-art segmentation methods.

The water body extraction technology based on superpixel segmentation in SAR images faces challenges such as insufficient precision in extracting fine water boundaries under speckle noise and complex scattering conditions. To address these issues, this paper proposes an enhanced fine water body extraction method based on superpixel segmentation for SAR images. In the superpixel segmentation phase, a simple linear iterative clustering (SLIC) superpixel segmentation algorithm based on eightdirection convolution (referred to as EDC-SLIC algorithm) is introduced. This algorithm constructs three pseudo-channels using eight-direction convolution to replace the three color channels of traditional color images and employs logarithmic difference measurement in the color distance calculation part of the SLIC algorithm, thereby adapting it to the segmentation requirements of SAR images. In the water body information extraction phase, a multi-feature weighted Otsu water body information extraction algorithm integrating superpixels (referred to as MFW-Otsu algorithm) is proposed. This algorithm integrates local mean and variance into a new feature image through weighting, enabling more accurate representation of texture changes in the image and enhancing the algorithm's ability to process complex image structures. The experimental results demonstrate that the EDC-SLIC algorithm and MFW-Otsu algorithm exhibit significant advantages in accuracy, robustness, and practicality. Furthermore, the integration of superpixels effectively improves the algorithm's adaptability to complex scenes, enhances detail processing capabilities, reduces misclassification phenomena, and improves the accuracy of water body information extraction.

Introduction: Magnetic Resonance Imaging (MRI) is essential in diagnosing cervical spondylosis, providing detailed visualization of osseous and soft tissue structures in the cervical spine. However, manual measurements hinder the assessment of cervical spine sagittal balance, leading to time-consuming and error-prone processes. This study presents the Pyramid DBSCAN Simple Linear Iterative Cluster (PDB-SLIC), an automated segmentation algorithm for vertebral bodies in T2-weighted MR images, aiming to streamline sagittal balance assessment for spinal surgeons.Method: PDB-SLIC combines the SLIC superpixel segmentation algorithm with DBSCAN clustering and underwent rigorous testing using an extensive dataset of T2-weighted mid-sagittal MR images from 4,258 patients across ten hospitals in China. The efficacy of PDB-SLIC was compared against other algorithms and networks in terms of superpixel segmentation quality and vertebral body segmentation accuracy. Validation included a comparative analysis of manual and automated measurements of cervical sagittal parameters and scrutiny of PDB-SLIC’s measurement stability across diverse hospital settings and MR scanning machines.Result: PDB-SLIC outperforms other algorithms in vertebral body segmentation quality, with high accuracy, recall, and Jaccard index. Minimal error deviation was observed compared to manual measurements, with correlation coefficients exceeding 95%. PDB-SLIC demonstrated commendable performance in processing cervical spine T2-weighted MR images from various hospital settings, MRI machines, and patient demographics.Discussion: The PDB-SLIC algorithm emerges as an accurate, objective, and efficient tool for evaluating cervical spine sagittal balance, providing valuable assistance to spinal surgeons in preoperative assessment, surgical strategy formulation, and prognostic inference. Additionally, it facilitates comprehensive measurement of sagittal balance parameters across diverse patient cohorts, contributing to the establishment of normative standards for cervical spine MR imaging.

Effective shadow detection and shadow removal can improve the performance of fruit recognition in natural environments and provide technical support for agricultural intelligence. In this study, a superpixel segmentation method was used to divide an image into multiple small regions. Based on the superpixel segmentation results, the shadow regions and the shadowless regions of the orchard images under natural light were compared and studied. Seven shadow saliency features (SSF) were explored and analyzed for shadow detection. The SSF were used to enhance the shadow characteristics. Then, the genetic algorithm (GA) was used to optimize the parameters, and support vector machine recursive feature elimination (SVM-RFE) was used to determine the best feature combination for shadow detection. According to the best feature combination, the support vector machine (SVM) algorithm was used to determine whether each segment of the superpixel segmentation results belonged to the shadow region. Shadow removal was carried out on each detected shadow region, and a natural light image after shadow removal was obtained. Finally, the accuracy of shadow detection was tested. The experimental results showed that the average accuracy of the shadow detection algorithm in this study was 91.91%. As a result, the precision and recall for fruits recognition after shadow removal generally improved.