Dual Branch Multi-Level Semantic Learning for Few-Shot Segmentation.

Few-shot semantic segmentation aims to segment novel-class objects in a query image with only a few annotated examples in support images. Although progress has been made recently by combining prototype-based metric learning, existing methods still face two main challenges. First, various intra-class objects between the support and query images or semantically similar inter-class objects can seriously harm the segmentation performance due to their poor feature representations. Second, the latent novel classes are treated as the background in most methods, leading to a learning bias, whereby these novel classes are difficult to correctly segment as foreground. To solve these problems, we propose a dual-branch learning method. The class-specific branch encourages representations of objects to be more distinguishable by increasing the inter-class distance while decreasing the intra-class distance. In parallel, the class-agnostic branch focuses on minimizing the foreground class feature distribution and maximizing the features between the foreground and background, thus increasing the generalizability to novel classes in the test stage. Furthermore, to obtain more representative features, pixel-level and prototype-level semantic learning are both involved in the two branches. The method is evaluated on PASCAL- 5i 1 -shot, PASCAL- 5i 5 -shot, COCO- 20i 1 -shot, and COCO- 20i 5 -shot, and extensive experiments show that our approach is effective for few-shot semantic segmentation despite its simplicity.

Improving Robustness of High-Low-Order Coupled Networks against Malicious Attacks Based on a Simulated Annealing Algorithm.

Malicious attacks can cause significant damage to the structure and functionality of complex networks. Previous research has pointed out that the ability of networks to withstand malicious attacks becomes weaker when networks are coupled. However, traditional research on improving the robustness of networks has focused on individual low-order or higher-order networks, lacking studies on coupled networks with higher-order and low-order networks. This paper proposes a method for optimizing the robustness of coupled networks with higher-order and low-order based on a simulated annealing algorithm to address this issue. Without altering the network's degree distribution, the method rewires the edges, taking the robustness of low-order and higher-order networks as joint optimization objectives. Making minimal changes to the network, the method effectively enhances the robustness of coupled networks. Experiments were conducted on Erdos-Rényi random networks (ER), scale-free networks (BA), and small-world networks (SW). Finally, validation was performed on various real networks. The results indicate that this method can effectively enhance the robustness of coupled networks with higher-order and low-order.