Ensemble learning consistently improves the performance of multi-class classification through aggregating a series of base classifiers. To this end, data-independent ensemble methods like Error Correcting Output Codes...
详细信息
Accurate polyp segmentation is essential for early detection of polyps, which is of significant clinical importance for the prevention of colorectal cancer. Although various fully-supervised deep learning techniques h...
详细信息
Accurate polyp segmentation is essential for early detection of polyps, which is of significant clinical importance for the prevention of colorectal cancer. Although various fully-supervised deep learning techniques have been developed for polyp segmentation, pixel-wise annotation by physicians during diagnosis is both time-consuming and expensive. Meanwhile, visual foundation models such as the Segment Anything Model (SAM) have demonstrated remarkable performance in general segmentation tasks. However, directly applying SAM to medical segmentation may not yield satisfactory results due to the lack of medical knowledge. In this paper, we propose a novel SAM-driven weakly-supervised polyp segmentation framework (termed WeakPolyp-SAM), which enables a collaborative learning process between our segmentation network and SAM to boost the model performance. Specifically, we propose a Cross-aware Feature Aggregation Network (CFANet) to effectively aggregate cross-level features and leverage global cues for weakly-supervised polyp segmentation. Within CFANet, we propose a Cross-level Fusion Module (CFM) that integrates the adjacent features to enhance the representation capabilities of different resolution features. Additionally, a Local-and-global Context Decoder (LCD) is presented to capture richer features across multiple levels. Moreover, we present a box-augmentation strategy that combines the segmentation maps generated by CFANet with scribble annotations to create more precise prompts. These prompts are then fed into SAM, generating segmentation SAM-driven masks, which provide additional supervision to effectively train CFANet. Furthermore, we present an image-level filtering mechanism to filter out unreliable masks. Experimental results demonstrate that our WeakPolyp-SAM outperforms state-of-the-art weakly-supervised segmentation methods. The scribble-annotated datasets and code will be released at https://***/taozh2017/WeakPolyp-SAM .
Currently, deep neural networks (DNNs) are widely adopted in different applications. Despite its commercial values, training a well-performing DNN is resource-consuming. Accordingly, the well-trained model is valuable...
详细信息
Currently, deep neural networks (DNNs) are widely adopted in different applications. Despite its commercial values, training a well-performing DNN is resource-consuming. Accordingly, the well-trained model is valuable intellectual property for its owner. However, recent studies revealed the threats of model stealing, where the adversaries can obtain a function-similar copy of the victim model, even when they can only query the model. In this paper, we propose an effective and harmless model ownership verification (MOVE) to defend against different types of model stealing simultaneously, without introducing new security risks. In general, we conduct the ownership verification by verifying whether a suspicious model contains the knowledge of defender-specified external features. Specifically, we embed the external features by modifying a few training samples with style transfer. We then train a meta-classifier to determine whether a model is stolen from the victim. This approach is inspired by the understanding that the stolen models should contain the knowledge of features learned by the victim model. In particular, we develop our MOVE method under both glass-boxand closed-box settings and analyze its theoretical foundation to provide comprehensive model protection. Extensive experiments on benchmark datasets verify the effectiveness of our method and its resistance to potential adaptive attacks.
We propose a novel algorithm for extracting data from images of tabular documents having a specific structure. Our proposed method is able to maintain the original table format and structure, and offers better efficie...
详细信息
To resolve complex multiscale, multiphysics problems at high resolution, modern large-scale parallel scientific and engineering simulations with structured meshes have exceeded the scale of tens of billions mesh eleme...
详细信息
Steiner connected dominating set (SCDS) is a generalization of the famous connected dominating set problem, where only a specified set of required vertices has to be dominated by a connected dominating set, and know...
详细信息
Steiner connected dominating set (SCDS) is a generalization of the famous connected dominating set problem, where only a specified set of required vertices has to be dominated by a connected dominating set, and known to be NP- hard. This paper firstly modifies the SCDS algorithm of Guha and Khuller and achieves a worst case approximation ratio of (2 + 1/(m - 1))H(min(△, k)) +O(1), which outperforms the previous best result (c + 1)H(min(△, k)) + O(1) in the case of m ≥ 1 +1/(c - 1), where c is the best approximation ratio for Steiner tree, A is the maximum degree of the graph, k is the cardinality of the set of required vertices, m is an optional integer satisfying 0 ≤ m ≤ min(△, k) and H is the harmonic function. This paper also proposes another approximation algorithm which is based on a greedy approach. The second algorithm can establish a worst case approximation ratio of 2 ln(min(△, k)) + O(1), which can also be improved to 2 lnk if the optimal solution is greater than c·e^2c+1/2(c+1).
Recently, more and more people are focused on the energy efficiency of HPC(highperformancecomputing) centers. The power consumption of supercomputer listed in the first 10 of top 500 is usually more than 1Mkw. Power...
详细信息
We report on the development of a simple process model, motivated by a need to predict the evolution of surface roughness and geometrical change over external, three dimensional free form surfaces undergoing a loose a...
详细信息
We present a novel quantum secret sharing scheme of secure direct communication and analyze its *** scheme takes Einstein-Podolsky-Rosen(EPR)pairs in Bell states as quantum *** order to obtain thedirect communication ...
详细信息
We present a novel quantum secret sharing scheme of secure direct communication and analyze its *** scheme takes Einstein-Podolsky-Rosen(EPR)pairs in Bell states as quantum *** order to obtain thedirect communication message,all agents only need to perform Bell measurements,not to perform any local unitary *** total efficiency in this scheme approaches 100%as the classical information exchanged is unnecessary except for the eavesdropping checks.
We investigate the dependence of the switching process on the perpendicular magnetic anisotropy (PMA) constant in perpendicular spin transfer torque magnetic tunnel junctions (P-MTJs) using micromagnetic simulatio...
详细信息
We investigate the dependence of the switching process on the perpendicular magnetic anisotropy (PMA) constant in perpendicular spin transfer torque magnetic tunnel junctions (P-MTJs) using micromagnetic simulations. It is found that the final stable states of the magnetization distribution of the free layer after switching can be divided into three different states based on different PMA constants: vortex, uniform, and steady. Different magnetic states can be attributed to a trade-off among demagnetization, exchange, and PMA energies. The generation of the vortex state is also related to the non-uniform stray field from the polarizer, and the final stable magnetization is sensitive to the PMA constant. The vortex and uniform states have different switching processes, and the switching time of the vortex state is longer than that of the uniform state due to hindrance by the vortex.
暂无评论