Search

Visual Cryptography (VC) is a process employed for the maintenance of secret information by hiding the secret messages that are embedded within the images. Typically, an image is partitioned into a number of shares that are stacked over one another in order to reconstruct back the original image accurately. The major limitation that existed in the traditional VC techniques is pixel expansion, in which pixel expansion is replaced with a number of sub-pixels in individual share, which causes a considerable impact on the contrast and resolution of the image that further gradually decreases the quality of the image. VC is named for its essential characteristics, such as transmitting the images with two or more shares with an equal number of black pixels and color pixel distribution. The secret message can be decrypted using Human Visual System (HVS). In this paper, 50 research papers are reviewed based on various classification algorithms, which are effectively used for the VC technique. The classification algorithms are categorized into three types, namely, meta-heuristic, heuristic, and evolutionary, and the research issues and challenges confronted by the existing techniques are reported in this survey. Moreover, the analysis is done based on the existing research works by considering the classification algorithms, tools, and evaluation metrics. [ABSTRACT FROM AUTHOR]

Urban green spaces (UGS) play a crucial role in the urban environmental system by aiding in mitigating the urban heat island effect, promoting sustainable urban development, and ensuring the physical and mental well-being of residents. The utilization of remote sensing imagery enables the real-time surveying and mapping of UGS. By analyzing the spatial distribution and spectral information of a UGS, it can be found that the UGS constitutes a kind of low-rank feature. Thus, the accuracy of the UGS segmentation model is not heavily dependent on the depth of neural networks. On the contrary, emphasizing the preservation of more surface texture features and color information contributes significantly to enhancing the model's segmentation accuracy. In this paper, we proposed a UGS segmentation model, which was specifically designed according to the unique characteristics of a UGS, named the Green Space Reverse Pixel Shuffle Network (GSRPnet). GSRPnet is a straightforward but effective model, which uses an improved RPS-ResNet as the feature extraction backbone network to enhance its ability to extract UGS features. Experiments conducted on GaoFen-2 remote sensing imagery and the Wuhan Dense Labeling Dataset (WHDLD) demonstrate that, in comparison with other methods, GSRPnet achieves superior results in terms of precision, F1-score, intersection over union, and overall accuracy. It demonstrates smoother edge performance in UGS border regions and excels at identifying discrete small-scale UGS. Meanwhile, the ablation experiments validated the correctness of the hypotheses and methods we proposed in this paper. Additionally, GSRPnet's parameters are merely 17.999 M, and this effectively demonstrates that the improvement in accuracy of GSRPnet is not only determined by an increase in model parameters. [ABSTRACT FROM AUTHOR]

Superpixel segmentation can get the middle features in image processing, effectively reduce the dimensionality of the image, and is widely used in image processing fields. To get the regular and compact superpixels in real-time, a superpixel segmentation algorithm based on image density is proposed in this paper. Firstly, the image is uniformly divided according to the number of superpixels to be obtained. Secondly, to get the clustering ability of the pixels, the density image is produced. Thirdly, the seed is chosen in each sub-region block according to the density and then the superpixels are obtained by clustering. During the clustering process, the pixel around the seed should be added into the superpixel if it meets the conditions, and the small supeipixels are merged into the big superpixels around them. Finally, the result shows that the proposed algorithm has the best segmentation effect, and a good balance in accuracy, regularity, and time cost. [ABSTRACT FROM AUTHOR]

Local neighborhood information plays an important role in robust fuzzy clustering-related segmentation algorithms, and how to construct local information items is the key to robust fuzzy clustering. Based on existing local information constraints, this paper proposes a model to describe the hierarchy relationship of local neighborhood windows in the master–slave neighborhood model, which combines spatial distance with gray information to suppress the influence of noise on current pixel clustering, and can also well control the balance of noise suppression and detail preservation. Based on this model, this paper proposes a robust fuzzy clustering segmentation algorithm with master-slave neighborhood information constraints. When constraining the neighborhood pixels of a pixel (that is the master neighborhood pixels), the algorithm will further constrain the pixels in the neighborhood window around the master neighborhood pixel (that is the salve neighborhood pixels), thus enhancing the robustness of the algorithm. Experiments results show that the proposed algorithm has good segmentation performance and strong anti-noise performance, even significantly outperforms existing state-of-the-art robust fuzzy clustering-related algorithms in the presence of high noise. [ABSTRACT FROM AUTHOR]

Deep neural networks have achieved remarkable results in the field of polarimetric synthetic aperture radar (PolSAR) image classification. However, PolSAR is affected by speckle imaging, resulting in PolSAR images usually containing a large amount of speckle noise, which usually leads to the poor spatial consistency of classification results and insufficient classification accuracy. Semantic segmentation methods based on deep learning can realize the task of image segmentation and classification at the same time, producing fine-grained and smooth classification maps. However, these approaches require enormous labeled data sets, which are laborious and time-consuming. Due to these issues, a new multi-modal contrastive fully convolutional network, named MCFCN, is proposed for PolSAR image classification in this paper, which combines multi-modal features of the same pixel as inputs to the model based on a fully convolutional network and accomplishes the classification task using only a small amount of labeled data through contrastive learning. In addition, to describe the PolSAR terrain targets more comprehensively and enhance the robustness of the classifier, a pixel overlapping classification strategy is proposed, which can not only improve the classification accuracy effectively but also enhance the stability of the method. The experiments demonstrate that compared with existing classification methods, the classification results of the proposed method for three real PolSAR datasets have higher classification accuracy. [ABSTRACT FROM AUTHOR]

Height estimation has long been a pivotal topic within measurement and remote sensing disciplines, with monocular height estimation offering wide-ranging data sources and convenient deployment. This paper addresses the existing challenges in monocular height estimation methods, namely the difficulty in simultaneously achieving high-quality instance-level height and edge reconstruction, along with high computational complexity. This paper presents a comprehensive solution for monocular height estimation in remote sensing, termed HeightFormer, combining multilevel interactions and image-adaptive classification–regression. It features the Multilevel Interaction Backbone (MIB) and Image-adaptive Classification–regression Height Generator (ICG). MIB supplements the fixed sample grid in the CNN of the conventional backbone network with tokens of different interaction ranges. It is complemented by a pixel-, patch-, and feature map-level hierarchical interaction mechanism, designed to relay spatial geometry information across different scales and introducing a global receptive field to enhance the quality of instance-level height estimation. The ICG dynamically generates height partition for each image and reframes the traditional regression task, using a refinement from coarse to fine classification–regression that significantly mitigates the innate ill-posedness issue and drastically improves edge sharpness. Finally, the study conducts experimental validations on the Vaihingen and Potsdam datasets, with results demonstrating that our proposed method surpasses existing techniques. [ABSTRACT FROM AUTHOR]

Mass segmentation is one of the fundamental tasks used when identifying breast cancer due to the comprehensive information it provides, including the location, size, and border of the masses. Despite significant improvement in the performance of the task, certain properties of the data, such as pixel class imbalance and the diverse appearance and sizes of masses, remain challenging. Recently, there has been a surge in articles proposing to address pixel class imbalance through the formulation of the loss function. While demonstrating an enhancement in performance, they mostly fail to address the problem comprehensively. In this paper, we propose a new perspective on the calculation of the loss that enables the binary segmentation loss to incorporate the sample-level information and region-level losses in a hybrid loss setting. We propose two variations of the loss to include mass size and density in the loss calculation. Also, we introduce a single loss variant using the idea of utilizing mass size and density to enhance focal loss. We tested the proposed method on benchmark datasets: CBIS-DDSM and INbreast. Our approach outperformed the baseline and state-of-the-art methods on both datasets. [ABSTRACT FROM AUTHOR]

Space-borne synthetic aperture radar (SAR), as an all-weather observation sensor, is an important means in modern information electronic warfare. Since SAR is a broadband active radar system, radio frequency interference (RFI) in the same frequency band will affect the normal observation of the SAR system. Untangling the above problem, this research explores a quick and accurate method for detecting and segmenting RFI-contaminated images. The purpose of the current method is to quickly detect the existence of RFI and to locate it in massive SAR data. Based on deep learning, the method shown in this paper realizes the existence of RFI by determining the presence or absence of interference in the image domain and then performs pixel-level image segmentation on Sentinel-1 RFI-affected quick-look images to locate RFI. Considering the need to quickly detect RFI in massive SAR data, an improved network based on MobileNet is proposed, which replaces some inverted residual blocks in the network with ghost blocks, reducing the number of network parameters and the inference time to 6.1 ms per image. Further, this paper also proposes an improved network called the Smart Interference Segmentation Network (SISNet), which is based on U2Net and replaces the convolution of the VGG blocks in U2Net with a residual convolution and introduces attention mechanisms and a modified RFB module to improve the segmentation mIoU to 87.46% on average. Experiment results and statistical analysis based on the MID dataset and PAIS dataset show that the proposed methods can achieve quicker detection than other CNNs while ensuring a certain accuracy and can significantly improve segmentation performance under the same conditions compared to the original U2Net and other semantic segmentation networks. [ABSTRACT FROM AUTHOR]

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 mult-iscale 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. [ABSTRACT FROM AUTHOR]

Segmenting small infrared targets presents a significant challenge for traditional image processing architectures due to the inherent lack of texture, minimal shape information, and their sparse pixel representation within images. The conventional UNet architecture, while proficient in general segmentation tasks, inadequately addresses the nuances of small infrared target segmentation due to its reliance on downsampling operations, such as pooling, which often results in the loss of critical target information. This paper introduces the Channel Spatial Attention Nested UNet (CSAN-UNet), an innovative architecture designed specifically to enhance the detection and segmentation of small infrared targets. Central to CSAN-UNet's design is the Cascaded Channel and Spatial Convolutional Attention Module (CSCAM), a novel component that adaptively enhances multi-level features and mitigates the loss of target information attributable to downsampling processes. Additionally, the Channel-priority and Spatial Attention Cascade Module (CPSAM) represents another pivotal advancement within CSAN-UNet, prioritizing channel-level adjustments alongside spatial attention mechanisms to efficiently extract deep semantic information pertinent to small infrared targets. Empirical validation conducted on two public datasets confirms that CSAN-UNet surpasses existing state-of-the-art algorithms in segmentation performance, while simultaneously reducing computational overhead. [ABSTRACT FROM AUTHOR]

In order to balance accuracy and real‐time performance in semantic segmentation, this paper proposes a real‐time semantic segmentation algorithm model based on attention mechanism and multi‐branch feature fusion using Fast convolutional neural network model (Fast‐SCNN). In this method, the spatial detail feature enhancement branch is introduced to enhance spatial detail features firstly. Then, through rational design of fusion module, the feature information of each branch is optimized to achieve better fusion of deep and shallow features. At the end of the feature fusion module, an adaptive feature enhancement focus module is introduced to capture the interdependence between remote pixels. The experimental results show that the proposed algorithm achieves 71.55% segmentation accuracy on Cityscapes dataset, the reasoning speed FPS is 97.6 frames/s, and the number of parameters is 1.39 M, which verifies the effectiveness of the network model constructed by the algorithm. Code is available at https://github.com/ccchhheeennn/model. [ABSTRACT FROM AUTHOR]

Accurate retinal fluid segmentation on Optical Coherence Tomography (OCT) images plays an important role in diagnosing and treating various eye diseases. The art deep models have shown promising performance on OCT image segmentation given pixel-wise annotated training data. However, the learned model will achieve poor performance on OCT images that are obtained from different devices (domains) due to the domain shift issue. This problem largely limits the real-world application of OCT image segmentation since the types of devices usually are different in each hospital. In this paper, we study the task of cross-domain OCT fluid segmentation, where we are given a labeled dataset of the source device (domain) and an unlabeled dataset of the target device (domain). The goal is to learn a model that can perform well on the target domain. To solve this problem, in this paper, we propose a novel Structure-guided Cross-Attention Network (SCAN), which leverages the retinal layer structure to facilitate domain alignment. Our SCAN is inspired by the fact that the retinal layer structure is robust to domains and can reflect regions that are important to fluid segmentation. In light of this, we build our SCAN in a multi-task manner by jointly learning the retinal structure prediction and fluid segmentation. To exploit the mutual benefit between layer structure and fluid segmentation, we further introduce a cross-attention module to measure the correlation between the layer-specific feature and the fluid-specific feature encouraging the model to concentrate on highly relative regions during domain alignment. Moreover, an adaptation difficulty map is evaluated based on the retinal structure predictions from different domains, which enforces the model focus on hard regions during structure-aware adversarial learning. Extensive experiments on the three domains of the RETOUCH dataset demonstrate the effectiveness of the proposed method and show that our approach produces state-of-the-art performance on cross-domain OCT fluid segmentation. [ABSTRACT FROM AUTHOR]

This paper presents a study of the segmentation of medical images. The paper provides a solid introduction to image enhancement along with image segmentation fundamentals. In the first step, the morphological operations are employed to ensure image detail protection and noise-immunity. The objective of using morphological operations is to remove the defects in the texture of the image. Secondly, the Fuzzy C-Means (FCM) clustering algorithm is used to modify membership function based only on the spatial neighbors instead of the distance between pixels within local spatial neighbors and cluster centers. The proposed technique is very simple to implement and significantly fast since it is not necessary to compute the distance between the neighboring pixels and the cluster centers. It is also efficient when dealing with noisy images because of its ability to efficiently improve the membership partition matrix. Simulation results are performed on different medical image modalities. Ultrasonic (Us), X-ray (Mammogram), Computed Tomography (CT), Positron Emission Tomography (PET), and Magnetic Resonance (MR) images are the main medical image modalities used in this work. The obtained results illustrate that the proposed technique can achieve good results with a short time and efficient image segmentation. Simulation results on different image modalities show that the proposed technique can achieve segmentation accuracies of 98.83%, 99.71%, 99.83%, 99.85%, and 99.74% for Us, Mammogram, CT, PET, and MRI images, respectively. [ABSTRACT FROM AUTHOR]

The segmentation process requires separating the image region into sub-regions of similar properties. Each sub-region has a group of pixels having the same characteristics, such as texture or intensity. This paper suggests an efficient hybrid segmentation approach for different medical image modalities based on particle swarm optimization (PSO) and improved fast fuzzy C-means clustering (IFFCM) algorithms. An extensive comparative study on different medical images is presented between the proposed approach and other different previous segmentation techniques. The existing medical image segmentation techniques incorporate clustering, thresholding, graph-based, edge-based, active contour, region-based, and watershed algorithms. This paper extensively analyzes and summarizes the comparative investigation of these techniques. Finally, a prediction of the improvement involves the combination of these techniques is suggested. The obtained results demonstrate that the proposed hybrid medical image segmentation approach provides superior outcomes in terms of the examined evaluation metrics compared to the preceding segmentation techniques. [ABSTRACT FROM AUTHOR]

In this paper, we extend Open-set Semantic Segmentation (OSS) into a new image segmentation task called Generalized Open-set Semantic Segmentation (GOSS). Previously, with well-known OSS, the intelligent agents only detect unknown regions without further processing, limiting their perception capacity of the environment. It stands to reason that further analysis of the detected unknown pixels would be beneficial for agents' decision-making. Therefore, we propose GOSS, which holistically unifies the abilities of two well-defined segmentation tasks, i.e. OSS and generic segmentation. Specifically, GOSS classifies pixels as belonging to known classes, and clusters (or groups) of pixels of unknown class are labelled as such. We propose a metric that balances the pixel classification and clustering aspects to evaluate this newly expanded task. Moreover, we build benchmark tests on existing datasets and propose neural architectures as baselines. Our experiments on multiple benchmarks demonstrate the effectiveness of our baselines. Code is made available at https://github.com/JHome1/GOSS_Segmentor. [ABSTRACT FROM AUTHOR]

The study of biotic nomenclature has resulted from gene expression profiling using integrated image analysis techniques. The study emphasized in this paper confers Modified Intuitionistic Fuzzy Clustering Method (MIFCM) for spot segmentation of microarray image. In order to achieve the basic condition of intuitionism, a generator using Intuitionistic Fuzzy set (IFS) is used. MIFCM approach considers degree of uncertainty, value of association and value of non-association to determine similarity between the microarray spot data points which further helps in clustering. For non-association value calculation, Sugeno's [47] and Yager's [30] [44] fuzzy complement generator [49] with intuitionism approach is proposed in this work. To achieve elementary level of intuitionism [49] , MIFCM is integrated with Hausdorff distance metrics [43]. The Hausdorff distance metrics is used to quantify the distance metrics betwixt microarray image pixel and cluster centers. The study discusses the constraints of the evolutionary Fuzzy C-Means (FCM) method [4] and adoption of new fuzzy complement generator which overcomes limitations to increase the clustering efficiency. Further, the paper presents detailed methodology of calculating the parameters required to convert crisp spot data of microarray image into fuzzy set which will be input to the next stage of kernel induced clustering using MIFCM technique. [ABSTRACT FROM AUTHOR]

Instance segmentation is a computer vision task that aims to give each pixel in an image an instance-specific label. Recently, researchers have shown growing interest in real-time instance segmentation. In this paper, we propose a novel center-based real-time instance segmentation method (CenterInst), which follows the FastInst meta-architecture. Key design aspects include a center-guided query selector, a center-guided sampling-based query decoder, and a lightweight dual-path decoder. The center-guided query selector selects queries via the per-pixel prediction of center point probabilities, avoiding excessive query proposals for single instances. The center-guided sampling-based query decoder adaptively generates local sampling points based on center positions, employing adaptive mixing to update queries without irrelevant sampling disturbances. The lightweight dual-path decoder enhances inference speed and maintains accuracy via pixel decoding on every layer during training but only utilizing the final layer's decoder during inference. The experimental results show CenterInst achieves superior accuracy and speed compared to state-of-the-art real-time instance segmentation methods. [ABSTRACT FROM AUTHOR]

This paper provides a comprehensive review of graph-based image segmentation methods. Various graph-based algorithms and their applications are explored, including multiple surface segmentation, saliency detection, and colour-texture segmentation. This work introduced a superpixel algorithm and Simple Linear Iterative Clustering (SLIC) algorithm to segment an image using a graph representation. The results show that graph-based methods like SLIC can effectively model images as graphs and optimize segmentation to group visually coherent pixels while respecting intensity variations and spatial proximity between pixels. The key concepts, importance of image segmentation, and challenges are also discussed. While the demonstration provides basic validation of graph-based principles, opportunities remain for improvement such as incorporating edge features and neural networks to address oversegmentation issues. Overall, the review and experimental results highlight the effectiveness of graph-based segmentation methods in computer vision domains. [ABSTRACT FROM AUTHOR]

In the realm of digital image applications, image processing technology occupies a pivotal position, with image segmentation serving as a foundational component. As the digital image application domain expands across industries, the conventional segmentation techniques increasingly challenge to cater to modern demands. To address this gap, this paper introduces an MCMC-based image segmentation algorithm based on the Markov Random Field (MRF) model, marking a significant stride in the field. The novelty of this research lies in its method that capitalizes on domain information in pixel space, amplifying the local segmentation precision of image segmentation algorithms. Further innovation is manifested in the development of an adaptive segmentation image denoising algorithm based on MCMC sampling. This algorithm not only elevates image segmentation outcomes, but also proficiently denoises the image. In the experimental results, MRF-MCMC achieves better segmentation performance, with an average segmentation accuracy of 94.26% in Lena images, significantly superior to other common image segmentation algorithms. In addition, the study proposes that the denoising model outperforms other algorithms in peak signal-to-noise ratio and structural similarity in environments with noise standard deviations of 15, 25, and 50. In essence, these experimental findings affirm the efficacy of this study, opening avenues for refining digital image segmentation methodologies. [ABSTRACT FROM AUTHOR]

While existing supervised semantic segmentation methods have shown significant performance improvements, they heavily rely on large‐scale pixel‐level annotated data. To reduce this dependence, recent research has proposed semi‐supervised learning‐based methods that have achieved great success. However, almost all these works are mainly dedicated to image semantic segmentation, while semi‐supervised video semantic segmentation (SVSS) has been barely explored. Due to the significant difference between video data and image, simply adapting semi‐supervised image semantic segmentation approaches to SVSS may neglect the inherent temporal correlations in video frames. This paper presents a novel method (named TRACL) with temporal reconstruction (TR) and adaptive consistency loss (ACL) for SVSS, aiming to fully utilize the temporal relations of internal frames in video clip. The authors' TR method implements the reconstruction from the feature and output levels to narrow the distribution gap between internal video frames. Specifically, considering the underlying data distribution, the authors construct Gaussian models for each category, and use probability density function to obtain the similarity between different feature maps for temporal feature reconstruction. The authors' ACL can adaptively select two pixel‐wise consistency loss including Flow Consistency Loss and Reconstruction Consistency Loss, providing stronger supervision signals for unlabelled frames during model training. Additionally, the authors extend their method to unlabelled video for more training data by employing mean‐teacher structure. Extensive experiments on three datasets including Cityscapes, Camvid and VSPW demonstrate that the authors' proposed method outperforms previous state‐of‐the‐art methods. [ABSTRACT FROM AUTHOR]

This research paper is about method of detection of free region and obstacle region by combining image segmentation and frame subtraction method. The application will be further study to be used by Unmanned Aerial Vehicles (UAVs). This method intends to minimize the weight of UAV by avoiding heavy sensors. Objective of this research is to utilize the pixel expansion of object to find free region. K-means segmentation will be used to separate the interest area from the background. Then, segmented image frame will be subtracted and then divided into several grids and the amount of subtracted pixel that has been set into yellow and black color of each grid will be calculated with respect to distance given. The expansion of pixel will be detected as, the distance between image frame coming closer, number of obstacle pixel will be higher. The application of simple LIDAR that emits single ray to frontal obstacle will initiate the camera to capture image frame to be further analyze. Experiment was carried out in close environment with different cases and total of 100 images has been captured that consist of texture obstacle, texture-less obstacle, and multiple obstacles. The findings showed bearable results as the free region detection is 88.0% for texture obstacle and up to 84.0% of free region were successfully detected for texture-less obstacle. Due to lack of cues and texture in texture-less object, the algorithm had difficulties detecting the center of object that expands in static form. [ABSTRACT FROM AUTHOR]

Thermal inkjet printing can generate more than 300,000 droplets of picoliter scale within one second stably, and the image analysis workflow is used to quantify the positive and negative values of the droplets. In this paper, the SimpleBlobDetector detection algorithm is used to identify and localize droplets with a volume of 24 pL in bright field images and suppress bright spots and scratches when performing droplet location identification. The polynomial surface fitting of the pixel grayscale value of the fluorescence channel image can effectively compensate and correct the image vignetting caused by the optical path, and the compensated fluorescence image can accurately classify positive and negative droplets by the k-means clustering algorithm. 20 µL of the sample solution in the result reading chip can produce more than 100,000 effective droplets. The effective droplet identification correct rate of 20 images of random statistical samples can reach more than 99% and the classification accuracy of positive and negative droplets can reach more than 98% on average. This paper overcomes the problem of effectively classifying positive and negative droplets caused by the poor image quality of photographed picolitre ddPCR droplets caused by optical hardware limitations. [ABSTRACT FROM AUTHOR]

Edge Detection is the first stage in the image division into separate parts. Image division is the partitioning of a digital image to the different zones or the set of pixels. Edge detection is one of the techniques applied in digital image processing often. The purpose of detecting pixels is to match the edges in the image. Filtering, Enhancement, and Detection are three steps in edge detection. Images are usually destroyed by casual changes in intensity intervals called noise or confusion. some noise variations include salt and pepper, pulse, and Gaussian. However, there is a relation between edge detection power and noise reduction. Using filters to the noise reduction causes the loss of edge detection power. For facilitating the edges detection, it is essential for the determination of pixels' intensity constraints in their neighborhood. Many points in an image have a nontransparent slope, and all of them are not the edges of the joint space. Therefore, some of the linear and nonlinear methods such as Sobel, Prewitt, and Robert have to be used to determine the edge points. The fuzzy logic and the system based on it, is one of the most effective methods for edge detection. This paper presents an optimized rule-based fuzzy inference system and designs the efficiency mask matric. The simulation results for edge detection are presented using the traditional edge detection techniques, including Binary Filter, Sobel Filter, Prewitt Filter, and Robert Filter. Also, it is presented using the fuzzy approach. The simulation results show that the designed fuzzy system has been able to detect the edges of the image more accurately and help to increase the sharpness and quality of the edges. Therefore, the proposed method has more accurate and more reliable results and reduces false edge detection comparison to the traditional methods. [ABSTRACT FROM AUTHOR]

In this paper, we design a complex-valued UNet (CV-UNet) architecture for radar complex data. This method selected the two-dimensional distributed complex-valued information after imaging as the feature, making full use of the amplitude and phase information in radar data, which is more suitable for the target segmentation with a small dataset. At the same time, an improved loss function is proposed to reduce the impact of the class imbalance problem. Compared to the real-valued UNet, UNet+, and UNet++ methods, the effectiveness and superiority of the CV-UNet are verified. The simulation results indicate that complex-valued operations can greatly improve the performance of segmentation, and our proposed loss function can effectively balance the loss values of different pixels to further improve the segmentation accuracy. [ABSTRACT FROM AUTHOR]

Image segmentation is the process of partitioning an image into multiple segments where the goal is to simplify the representation of the image and make the image more meaningful and easier to analyze. In particular, semantic segmentation is an approach of detecting the classes of objects, based on each pixel. In the past, most semantic segmentation models were for only one single style, such as urban street views, medical images, or even manga. In this paper, we propose a semantic segmentation model called the Dual-Pyramid Wide Residual Network (DPWRN) to solve the segmentation on cross-style datasets, which is suitable for diverse segmentation applications. The DPWRN integrated the Pyramid of Kernel paralleled with Dilation (PKD) and Multi-Feature Fusion (MFF) to improve the accuracy of segmentation. To evaluate the generalization of the DPWRN and its superiority over most state-of-the-art models, three datasets with completely different styles are tested in the experiments. As a result, our model achieves 75.95% of mIoU on CamVid, 83.60% of F1-score on DRIVE, and 86.87% of F1-score on eBDtheque. This verifies that the DPWRN can be generalized and shows its superiority in semantic segmentation on cross-style datasets. [ABSTRACT FROM AUTHOR]

Real-time semantic segmentation, as a key technique for scene understanding, has been an important research topic in the field of computer vision in recent years. However, existing models are unable to achieve good segmentation accuracy on mobile devices due to their huge computational overhead, which makes it difficult to meet actual industrial requirements. To address the problems faced by current semantic segmentation tasks, this paper proposes a lightweight bilateral asymmetric residual network (LBARNet) for real-time semantic segmentation. First, we propose the bilateral asymmetric residual (BAR) module. This module learns multi-scale feature representations with strong semantic information at different stages of the semantic information extraction branch, thus improving pixel classification performance. Secondly, the spatial information extraction (SIE) module is constructed in the spatial detail extraction branch to capture multi-level local features of the shallow network to compensate for the lost geometric information in the downsampling stage. At the same time, we design the attention mechanism perception (AMP) module in the jump connection part to enhance the contextual representation. Finally, we design the dual branch feature fusion (DBF) module to exploit the correspondence between higher-order features and lower-order features to fuse spatial and semantic information appropriately. The experimental results show that LBARNet, without any pre-training and pre-processing and using only 0.6M parameters, achieves 70.8% mloU and 67.2% mloU on the Cityscapes dataset and Camvid dataset, respectively. LBARNet maintain a high segmentation accuracy while using a smaller number of parameters compared to most existing state-of-the-art models. [Display omitted] • This paper proposes a Bilateral Asymmetric Residual (BAR) module, a Spatial Information Extraction (SIE) module, an Attention Mechanism Perception (AMP) module and a Dual Branch Feature Fusion (DBF) module. • A Lightweight Bilateral Asymmetric Residual Network (LBARNet) for real-time image semantic segmentation is proposed in this article. • The experimental results show that LBARNet achieves 70.8% and 67.2% segmentation accuracy on two challenging datasets (Cityscapes and CamVid) using only 0.6M parameters. [ABSTRACT FROM AUTHOR]

In the medical image-processing field brain tumor segmentation is aquintessential task. Thereby early diagnosis gives us a chance of increasing survival rate. It will be way much complex and time consuming when comes to processing large amount of MRI images manually, so for that we need an automatic way of brain tumor image segmentation process. This paper aims to gives a comparative study of brain tumor segmentation, which are MRI-based. So recent methods of automatic segmentation along with advanced techniques gives us an improved result and can solve issue better than any other methods. Therefore, this paper brings comparative analysis of three models such as Deformable model of Fuzzy C-Mean clustering (DMFCM), Adaptive Cluster with Super Pixel Segmentation (ACSP) and Grey Wolf Optimization based ACSP (GWO_ACSP) and these are tested on CANCER IMAGE ACHRCHIEVE which is a preparation information base containing High Grade and Low-Grade astrocytoma tumors. Here boundaries including Accuracy, Dice coefficient, Jaccard score and MCC are assessed and along these lines produce the outcomes. From this examination the test consequences of Grey Wolf Optimization based ACSP (GWO_ACSP) gives better answer for mind tumor division issue. [ABSTRACT FROM AUTHOR]

This paper proposes a novel three‐dimensional convolution neural network‐based modified bidirectional long short‐term memory with pelican optimization (3D CNN based MBiLSTM with PO) algorithm for multiclass ovarian tumor detection. Initially, the International Collaboration on Cancer Reporting endometrial cancer dataset images are provided in pre‐processing phase, which uses a pre‐emphasis filter to process the input image. In the segmentation phase, pre‐processed data is then partitioned into diverse subgroups (i.e., pixels), which minimizes the complexity of images. In this paper, a factorization‐based active contour technique is employed in the effective segmentation of images. The segmented features are then extracted and classified using the 3D CNN‐MBiLSTM with PO algorithm. Finally, the experimental results are conducted and compared with various other approaches for various performance metrics. Each metric is evaluated with respect to the different number of iterations. The accuracy, sensitivity, and specificity have reached a higher value of 98.5%, 96%, and 98.25%, respectively. [ABSTRACT FROM AUTHOR]

Pixel-level crack detection is crucial in pavement performance assessment. Current deep learning-based detection methods first encode input images by multi-scale feature maps, then decode them to the output that has the same size as input. This process will lose detailed crack information. To tackle this problem, this paper proposed a novel network architecture, Enhanced High-Resolution Semantic Network (EHRS-Net), to maintain and enhance detailed information of the feature maps through convolution procedure, thus, improving the overall crack detection accuracy. The contributions of this paper are: (1) Proposed Resolution Maintain Flow (RMF), which is featured by three different semantic representation extraction flows in parallel with semantic information exchange; (2) Proposed Stacked Atrous Spatial Pyramid Pooling (SASPP) module to enhance the output of the semantic features; (3) Developed a new hybrid loss function to fit proposed network architecture. The proposed methods are evaluated on two pavement crack datasets: an expanded public crack forest dataset (CFD-ex) and a new dataset called HRSD (high-resolution semantic dataset). Comprehensive comparative experiments proved the superiority of the proposed method for pavement crack detection (93.353 % mPA (mean pixel accuracy) and 78.328% mIoU (mean intersection over union) on CFD-ex; 77.159% mIoU on HRSD), especially for tiny cracks and noised pavement cracks. [ABSTRACT FROM AUTHOR]

Copyright of Journal of South China University of Technology (Natural Science Edition) is the property of South China University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Automatic segmentation of skin lesions is a critical step in Computer Aided Diagnosis (CAD) of melanoma. However, due to the blurring of the lesion boundary, uneven color distribution, and low image contrast, resulting in poor segmentation result. Aiming at the problem of difficult segmentation of skin lesions, this paper proposes an Attention-based Dual-path Feature Fusion Network (ADFFNet) for automatic skin lesion segmentation. Firstly, in the spatial path, a Boundary Refinement (BR) module is designed for the output of low-level features to filter out irrelevant background information and retain more boundary details of the lesion area. Secondly, in the context path, a Multi-scale Feature Selection (MFS) module is constructed for high-level feature output to capture multi-scale context information and use the attention mechanism to filter out redundant semantic information. Finally, we design a Dual-path Feature Fusion (DFF) module, which uses high-level global attention information to guide the step-by-step fusion of high-level semantic features and low-level detail features, which is beneficial to restore image detail information and further improve the pixel-level segmentation accuracy of skin lesion. In the experiment, the ISIC 2018 and PH2 datasets are employed to evaluate the effectiveness of the proposed method. It achieves a performance of 0.890/ 0.925 and 0.933 /0.954 on the F1-score and SE index, respectively. Comparative analysis with state-of-the-art segmentation methods reveals that the ADFFNet algorithm exhibits superior segmentation performance. [ABSTRACT FROM AUTHOR]

Transformer can build global relationships between pixels and enhance pixel representation. The existing methods only establish the context relationship from the whole image but will reduce the representation between the category areas. In addition, the existing methods based on the transformer self-attention do not combine the advantages of convolution and transformer, resulting in more calculation parameters of the model. In order to solve these two problems, this paper proposes to enhance the segmentation accuracy and performance by enhancing the relationship between image-level regions and the relationship between semantic level pixels. First, we design a refined division feature (RDF) module to enhance the channel representation and thus the same locale representation. Second, we design a transformer based on convolution (CTrans), which first computes the relationship between similar pixels and enhances the pixel representation. Then, the feature map is compressed and enriched to reduce the computational load of CTrans, and finally the relationship between pixels is established from a global perspective. We design a refined division feature module based on transformer for semantic image segmentation (RFT) model combining RDF and CTrans module. The experimental results show that the mIoU result of our method in Cityscapes test data set is 81.9%, and the model parameter is 64.6M, which is superior to other methods in terms of data. In addition, we conducted visualization experiments with Cityscapes and Pascal voc 2012 datasets with other methods, and the results showed that our method was superior to other methods. [ABSTRACT FROM AUTHOR]

Superpixel segmentation has been widely used in computer vision as a preprocessing to reduce the number of image primitives for subsequent image processing tasks. Simple Linear Iterative Clustering (SLIC) is the most popular superpixel segmentation algorithm in the literature, which is an iterative algorithm. The basic SLIC technique includes two main steps named Assignment and Update steps, and their data dependency is the main problem to speed up execution of the basic SLIC algorithm. It is also well known that this algorithm is not memory efficient, which is the main bottleneck in applying basic SLIC in low-power applications. In this paper, we have proposed a new structure for SLIC implementation. This new structure replaces the cluster-based search operation with pixel-based process in the Assignment step that gains considerable speed improvement. This new technique simply removes the data dependency in the SLIC structure. In the proposed method, the distance index, the main parameter computed in the Assignment step, no longer is needed to be stored in memory. This leads to a significant improvement in the memory efficiency of the proposed structure. The proposed structure is implemented on the Virtex-5 FPGA family, and the results show about 26 % in memory improvement compared to basic SLIC. According to the implementation results, the proposed technique process 143 frames per second for an input image of 300 × 400 pixel resolution which is far faster than real-time process requirements. [ABSTRACT FROM AUTHOR]

Synthetic aperture radar (SAR) ship detection is of significant importance in military and commercial applications. However, a high similarity in intensity and spatial distribution of scattering characteristics between the ship target and harbor facilities, along with a fuzzy sea-land boundary due to the strong speckle noise, result in a low detection accuracy and high false alarm rate for SAR ship detection with complex inshore scenes. In this paper, a new inshore ship detection method based on multi-modality saliency is proposed to overcome these challenges. Four saliency maps are established from different perspectives: an ocean-buffer saliency map (OBSM) outlining more accurate coastline under speckle noises; a local stability saliency map (LSSM) addressing pixel spatial distribution; a super-pixel saliency map (SPSM) extracting critical region-based features for inshore ship detection; and an intensity saliency map (ISM) to highlight target pixels with intensity distribution. By combining these saliency maps, ship targets in complex inshore scenes can be successfully detected. The method provides a novel interdisciplinary perspective (surface metrology) for SAR image segmentation, discovers the difference in spatial characteristics of SAR image elements, and proposes a novel robust CFAR procedure for background clutter fitting. Experiments on a public SAR ship detection dataset (SSDD) shows that our method achieves excellent detection performance, with a low false alarm rate, in offshore scenes, inshore scenes, inshore scenes with confusing metallic port facilities, and large-scale scenes. The results outperform several widely used methods, such as CFAR-based methods and super-pixel methods. [ABSTRACT FROM AUTHOR]

In order to solve the problem of noise sensitivity and low precision in image segmentation, a new image segmentation method based on super-pixel with neighborhood constrained and multi-level FCM clustering is proposed. Firstly, an improved SLIC algorithm of FCM is designed based on the local pixel region of the image to get the refined super-pixel. Then, the improved FCM clustering algorithm is combined with the spatial relationship of neighborhood super-pixel to mark the super-pixel categories. In order to verify the effectiveness of the algorithm, the artificial synthetic image with noise and natural image without noise are used for comparison experiments. The experimental result show the algorithm proposed in this paper can not only suppress the noise, but also improve the processing accuracy. [ABSTRACT FROM AUTHOR]

Object attention maps generated by image classifiers are usually used as priors for weakly supervised semantic segmentation. However, attention maps usually locate the most discriminative object parts. The lack of integral object localization maps heavily limits the performance of weakly supervised segmentation approaches. This paper attempts to investigate a novel way to identify entire object regions in a weakly supervised manner. We observe that image classifiers’ attention maps at different training phases may focus on different parts of the target objects. Based on this observation, we propose an online attention accumulation (OAA) strategy that utilizes the attention maps at different training phases to obtain more integral object regions. Specifically, we maintain a cumulative attention map for each target category in each training image and utilize it to record the discovered object regions at different training phases. Albeit OAA can effectively mine more object regions for most images, for some training images, the range of the attention movement is not large, limiting the generation of integral object attention regions. To overcome this problem, we propose incorporating an attention drop layer into the online attention accumulation process to enlarge the range of attention movement during training explicitly. Our method (OAA) can be plugged into any classification network and progressively accumulate the discriminative regions into cumulative attention maps as the training process goes. Additionally, we also explore utilizing the final cumulative attention maps to serve as the pixel-level supervision, which can further assist the network in discovering more integral object regions. When applying the resulting attention maps to the weakly supervised semantic segmentation task, our approach improves the existing state-of-the-art methods on the PASCAL VOC 2012 segmentation benchmark, achieving a mIoU score of 67.2 percent on the test set. [ABSTRACT FROM AUTHOR]

The accurate segmentation of the optic disc (OD) in fundus images is a crucial step for the analysis of many retinal diseases. However, because of problems such as vascular occlusion, parapapillary atrophy (PPA), and low contrast, accurate OD segmentation is still a challenging task. Therefore, this paper proposes a multiple preprocessing hybrid level set model (HLSM) based on area and shape for OD segmentation. The area-based term represents the difference of average pixel values between the inside and outside of a contour, while the shape-based term measures the distance between a prior shape model and the contour. The average intersection over union (IoU) of the proposed method was 0.9275, and the average four-side evaluation (FSE) was 4.6426 on a public dataset with narrow-angle fundus images. The IoU was 0.8179 and the average FSE was 3.5946 on a wide-angle fundus image dataset compiled from a hospital. The results indicate that the proposed multiple preprocessing HLSM is effective in OD segmentation. [ABSTRACT FROM AUTHOR]

Given a natural language expression and an image/video, the goal of referring segmentation is to produce the pixel-level masks of the entities described by the subject of the expression. Previous approaches tackle this problem by implicit feature interaction and fusion between visual and linguistic modalities in a one-stage manner. However, human tends to solve the referring problem in a progressive manner based on informative words in the expression, i.e., first roughly locating candidate entities and then distinguishing the target one. In this paper, we propose a cross-modal progressive comprehension (CMPC) scheme to effectively mimic human behaviors and implement it as a CMPC-I (Image) module and a CMPC-V (Video) module to improve referring image and video segmentation models. For image data, our CMPC-I module first employs entity and attribute words to perceive all the related entities that might be considered by the expression. Then, the relational words are adopted to highlight the target entity as well as suppress other irrelevant ones by spatial graph reasoning. For video data, our CMPC-V module further exploits action words based on CMPC-I to highlight the correct entity matched with the action cues by temporal graph reasoning. In addition to the CMPC, we also introduce a simple yet effective Text-Guided Feature Exchange (TGFE) module to integrate the reasoned multimodal features corresponding to different levels in the visual backbone under the guidance of textual information. In this way, multi-level features can communicate with each other and be mutually refined based on the textual context. Combining CMPC-I or CMPC-V with TGFE can form our image or video version referring segmentation frameworks and our frameworks achieve new state-of-the-art performances on four referring image segmentation benchmarks and three referring video segmentation benchmarks respectively. Our code is available at https://github.com/spyflying/CMPC-Refseg. [ABSTRACT FROM AUTHOR]

Superpixel-based segmentation has been widely used as a primary prepossessing step to simplify the subsequent image processing tasks. Since determining the number of clusters is subjective and varies based on the type of image, the segmentation algorithm may provide over-segmented or under-segmented superpixels. This paper proposes an image segmentation method to improve the SLIC superpixel by region merging. It aims to improve the segmentation accuracy without defining a precise number of superls. The color difference between superpixels is employed as a homogeneity criterion for the merging process. The Berkeley dataset is used with different quantitative performance metrics to evaluate the proposed model's performance. Results obtained from probabilistic rand index (PRI), boundary recall, and under-segmentation error proved the ability of the proposed algorithm to provide comparable segmentation with a reduced number of clusters. [ABSTRACT FROM AUTHOR]

In order to improve the security effect of image information, this paper studies the reversible information hiding of the digital images combined with the pixel combination algorithm and proposes an improved simulated annealing algorithm using the incremental calculation method of statistical functions. Moreover, according to the gray gradient information contained in the image, this paper proposes an automatic threshold determination algorithm suitable for the unimodal gray distribution images and uses this algorithm to complete the threshold determination and binary segmentation of all images. In addition, this paper optimizes the model by transforming the isolated pores inside the model and removing the isolated matrix area. Through comparative experiments, it can be seen that the reversible information hiding method for digital images based on the pixel combination algorithm proposed in this paper has a good image information confidentiality effect. [ABSTRACT FROM AUTHOR]

Aiming at the problem of low efficiency and insufficient accuracy of threshold solution in multithreshold sculpture image segmentation, this paper proposes a threshold segmentation algorithm for sculpture images based on sparse decomposition. In this paper, sparse decomposition is introduced to optimize the model to reduce the impact of local noise on segmentation accuracy, and an energy functional based on pixel coconstraint is built to make up for the defect that pixels cannot retain local details. At the same time, the weighted sum of elite solution sets is used to determine Neighborhood centers increase communication between groups. Experiments show that compared with other algorithms, the above method has significant advantages in convergence efficiency and accuracy. [ABSTRACT FROM AUTHOR]

This paper addresses the task of detecting and recognizing human-object interactions (HOI) in images. Considering the intrinsic complexity and structural nature of the task, we introduce a cascaded parsing network (CP-HOI) for a multi-stage, structured HOI understanding. At each cascade stage, an instance detection module progressively refines HOI proposals and feeds them into a structured interaction reasoning module. Each of the two modules is also connected to its predecessor in the previous stage, enabling efficient cross-stage information propagation. The structured interaction reasoning module is built upon a graph parsing neural network (GPNN), which efficiently models potential HOI structures as graphs and mines rich context for comprehensive relation understanding. In particular, GPNN infers a parse graph that i) interprets meaningful HOI structures by a learnable adjacency matrix, and ii) predicts action (edge) labels. Within an end-to-end, message-passing framework, GPNN blends learning and inference, iteratively parsing HOI structures and reasoning HOI representations (i.e., instance and relation features). Further beyond relation detection at a bounding-box level, we make our framework flexible to perform fine-grained pixel-wise relation segmentation; this provides a new glimpse into better relation modeling. A preliminary version of our CP-HOI model reached 1st place in the ICCV2019 Person in Context Challenge, on both relation detection and segmentation. In addition, our CP-HOI shows promising results on two popular HOI recognition benchmarks, i.e., V-COCO and HICO-DET. [ABSTRACT FROM AUTHOR]

Skin lesion segmentation is the first and indispensable step of malignant melanoma recognition and diagnosis. At present, most of the existing skin lesions segmentation techniques often used traditional methods like optimum thresholding, etc., and deep learning methods like U-net, etc. However, the edges of skin lesions in malignant melanoma images are gradually changed in color, and this change is nonlinear. The existing methods can not effectively distinguish banded edges between lesion areas and healthy skin areas well. Aiming at the uncertainty and fuzziness of banded edges, the neutrosophic set theory is used in this paper which is better than fuzzy theory to deal with banded edge segmentation. Therefore, we proposed a neutrosophy domain-based segmentation method that contains six steps. Firstly, an image is converted into three channels and the pixel matrix of each channel is obtained. Secondly, the pixel matrixes are converted into Neutrosophic Set domain by using the neutrosophic set conversion method to express the uncertainty and fuzziness of banded edges of malignant melanoma images. Thirdly, a new Neutrosophic Entropy model is proposed to combine the three memberships according to some rules by using the transformations in the neutrosophic space to comprehensively express three memberships and highlight the banded edges of the images. Fourthly, the feature augment method is established by the difference of three components. Fifthly, the dilation is used on the neutrosophic entropy matrixes to fill in the noise region. Finally, the image that is represented by transformed matrix is segmented by the Hierarchical Gaussian Mixture Model clustering method to obtain the banded edge of the image. Qualitative and quantitative experiments are performed on malignant melanoma image dataset to evaluate the performance of the NeDSeM method. Compared with some state-of-the-art methods, our method has achieved good results in terms of performance and accuracy. [ABSTRACT FROM AUTHOR]

Dealing with low-light images is a challenging problem in the image processing field. A mature low-light enhancement technology will not only be conductive to human visual perception but also lay a solid foundation for the subsequent high-level tasks, such as target detection and image classification. In order to balance the visual effect of the image and the contribution of the subsequent task, this paper proposes utilizing shallow Convolutional Neural Networks (CNNs) as the priori image processing to restore the necessary image feature information, which is followed by super-pixel image segmentation to obtain image regions with similar colors and brightness and, finally, the Attentive Neural Processes (ANPs) network to find its local enhancement function on each super-pixel to further restore features and details. Through extensive experiments on the synthesized low-light image and the real low-light image, the experimental results of our algorithm reach 23.402, 0.920, and 2.2490 for Peak Signal to Noise Ratio (PSNR), Structural Similarity (SSIM), and Natural Image Quality Evaluator (NIQE), respectively. As demonstrated by the experiments on image Scale-Invariant Feature Transform (SIFT) feature detection and subsequent target detection, the results of our approach achieve excellent results in visual effect and image features. [ABSTRACT FROM AUTHOR]

The task of semantic segmentation is to obtain strong pixel-level annotations for each pixel in the image. For fully supervised semantic segmentation, the task is achieved by a segmentation model trained using pixel-level annotations. However, the pixel-level annotation process is very expensive and time-consuming. To reduce the cost, the paper proposes a semantic candidate regions trained extreme learning machine (ELM) method with image-level labels to achieve pixel-level labels mapping. In this work, the paper casts the pixel mapping problem into a candidate region semantic inference problem. Specifically, after segmenting each image into a set of superpixels, superpixels are automatically combined to achieve segmentation of candidate region according to the number of image-level labels. Semantic inference of candidate regions is realized based on the relationship and neighborhood rough set associated with semantic labels. Finally, the paper trains the ELM using the candidate regions of the inferred labels to classify the test candidate regions. The experiment is verified on the MSRC dataset and PASCAL VOC 2012, which are popularly used in semantic segmentation. The experimental results show that the proposed method outperforms several state-of-the-art approaches for deep semantic segmentation. [ABSTRACT FROM AUTHOR]

The semantic segmentation of human body images has huge application potential in many fields, such as autonomous driving, artificial intelligence (AI) face changing, and virtual try-on. Nowadays, many researchers use additional human body posture information to generate multi-level human body analysis images. However, the existing method has limitations when faced with multiple poses and overlapping targets. In this paper, a novel algorithm based on Mask RCNN which has pixel-level accuracy is proposed. In the feature extraction process, a multi-scale feature fusion module applying dilated convolution is proposed to obtain richer semantic information from different perceptual fields. We added a small residual module to the original residual unit structure to increase the size of the receptive field of each layer to capture details and global characteristics. Three convolution kernels with different ratios are designed to obtain receptive fields of different scales. The experimental results show that our method has better performance while considering both object positioning and target classification. [ABSTRACT FROM AUTHOR]

This paper introduces a simple but effective image filtering method, namely, local adaptive image filtering (LAIF), based on an image segmentation method, i.e., recursive dilation segmentation (RDS). The algorithm is motivated by the observation that for the pixel to be smoothed, only the similar pixels nearby are utilized to obtain the filtering result. Relying on this observation, similar pixels are partitioned by RDS before applying a locally adaptive filter to smooth the image. More specifically, by directly taking the spatial information between adjacent pixels into consideration in a recursive dilation way, RDS is firstly proposed to partition the guided image into several regions, so that the pixels belonging to the same segmentation region share a similar property. Then, guided by the iterative segmented results, the input image can be easily filtered via a local adaptive filtering technique, which smooths each pixel by selectively averaging its local similar pixels. It is worth mentioning that RDS makes full use of multiple integrated information including pixel intensity, hue information, and especially spatial adjacent information, leading to more robust filtering results. In addition, the application of LAIF in the remote sensing field has achieved outstanding results, specifically in areas such as image dehazing, denoising, enhancement, and edge preservation, among others. Experimental results show that the proposed LAIF can be successfully applied to various filtering-based tasks with favorable performance against state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Medical image segmentation has made significant progress when a large amount of labeled data are available. However, annotating medical image segmentation datasets is expensive due to the requirement of professional skills. Additionally, classes are often unevenly distributed in medical images, which severely affects the classification performance on minority classes. To address these problems, this paper proposes Co-Distribution Alignment (Co-DA) for semi-supervised medical image segmentation. Specifically, Co-DA aligns marginal predictions on unlabeled data to marginal predictions on labeled data in a class-wise manner with two differently initialized models before using the pseudo-labels generated by one model to supervise the other. Besides, we design an over-expectation cross-entropy loss for filtering the unlabeled pixels to reduce noise in their pseudo-labels. Quantitative and qualitative experiments on three public datasets demonstrate that the proposed approach outperforms existing state-of-the-art semi-supervised medical image segmentation methods on both the 2D CaDIS dataset and the 3D LGE-MRI and ACDC datasets, achieving an mIoU of 0.8515 with only 24% labeled data on CaDIS, and a Dice score of 0.8824 and 0.8773 with only 20% data on LGE-MRI and ACDC, respectively. [ABSTRACT FROM AUTHOR]

In recent years, Convolutional Neural Networks (CNNs) have made significant strides in the field of segmentation, particularly in semantic segmentation where both accuracy and efficiency are crucial. However, despite their high accuracy, these deep networks are not practical for real-time use due to their low inference speed. This issue has prompted researchers to explore various techniques to improve the efficiency of CNNs. One such technique is knowledge distillation, which involves transferring knowledge from a larger, cumbersome (teacher) model to a smaller, more compact (student) model. This paper proposes a simple yet efficient approach to address the issue of low inference speed in CNNs using knowledge distillation. The proposed method involves distilling knowledge from the feature maps of the teacher model to guide the learning of the student model. The approach uses a straightforward technique known as pixel-wise distillation to transfer the feature maps of the last convolution layer of the teacher model to the student model. Additionally, a pair-wise distillation technique is used to transfer pair-wise similarities of the intermediate layers. To validate the effectiveness of the proposed method, extensive experiments were conducted on the PascalVoc 2012 dataset using a state-of-the-art DeepLabV3+ segmentation network with different backbone architectures. The results showed that the proposed method achieved a balanced mean Intersection over Union (mIoU) and training time. [ABSTRACT FROM AUTHOR]