The colonoscopy is the foremost technique for detecting polyps, where accurate segmentation is crucial for effective diagnosis and surgical preparation. Nevertheless, contemporary deep learning-based methods for polyp segmentation face substantial hurdles due to the large amount of labeled data required. To address this, we introduce an innovative semi-supervised learning framework based on cross-pseudo supervision (CPS) and contrastive learning, termed Semi-supervised Polyp Segmentation (SemiPolypSeg), which requires only limited labeled data. First, a new segmentation architecture, the Hybrid Transformer–CNN Segmentation Network (HTCSNet), is proposed to enhance semantic representation and segmentation performance. HTCSNet features a parallel encoder combining transformers and convolutional neural networks, as well as an All-MLP decoder with skip connections to streamline feature fusion and enhance decoding efficiency. Next, the integration of CPS in SemiPolypSeg enforces output consistency across diverse perturbed datasets and models, guided by the consistency loss principle. Finally, patch-wise contrastive loss discerns feature disparities between positive and negative sample pairs as delineated by the projector. Comprehensive evaluation demonstrated our method’s superiority over existing state-of-the-art semi-supervised segmentation algorithms. Specifically, our method achieved Dice Similarity Coefficients (DSCs) of 89.68% and 90.62% on the Kvasir-SEG dataset with 15% and 30% labeled data, respectively, and 89.72% and 90.06% on the CVC-ClinicDB dataset with equivalent ratios.
A belly reconstruction and measurement scheme is conducted on a shape-flexible mannequin with digital image correlation technique. We adopted an integer subpixel image matching process. First, a compound feature including Gaussian combined moment and parameters extracted from gray-level co-occurrence matrix is proposed to track an integer pixel between reference and target deformed images. Second, a mutual learning co-operative particle swarm optimization algorithm is employed to locate the subpixel precisely. Each subpopulation does its own optimization independently. The subpopulations keep information communication and knowledge sharing for co-operative evolution to enhance global searching capability. In addition, the previous optimal information from the former interest point is adopted fully in initializing the particles’ positions of the next interest point, which effectively improves the speed of the convergence. Experimental results indicate that under the high measurement accuracy without any loss, the time-consumption of this scheme is significantly superior to that of the conventional method, particularly at a large number of interest points.