检索结果-内蒙古大学图书馆

Multilevel Perception Boundary-guided Network for Breast Lesion Segmentation in Ultrasound Images

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yang, Xing Zhang, Jian Chen, Qijian Wang, Li Wang, Lihui Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China

Automatic segmentation of breast tumors from the ultrasound images is essential for the subsequent clinical diagnosis and treatment plan. Although the existing deep learning-based methods have achieved significant progress in automatic segmentation of breast tumor, their performance on tumors with similar intensity to the normal tissues is still not pleasant, especially for the tumor boundaries. To address this issue, we propose a PBNet composed by a multilevel global perception module (MGPM) and a boundary guided module (BGM) to segment breast tumors from ultrasound images. Specifically, in MGPM, the long-range spatial dependence between the voxels in a single level feature maps are modeled, and then the multilevel semantic information is fused to promote the recognition ability of the model for non-enhanced tumors. In BGM, the tumor boundaries are extracted from the high-level semantic maps using the dilation and erosion effects of max pooling, such boundaries are then used to guide the fusion of low and high-level features. Moreover, to improve the segmentation performance for tumor boundaries, a multi-level boundary-enhanced segmentation (BS) loss is proposed. The extensive comparison experiments on both publicly available dataset and in-house dataset demonstrate that the proposed PBNet outperforms the state-of-the-art methods in terms of both qualitative visualization results and quantitative evaluation metrics, with the Dice score, Jaccard coefficient, Specificity and HD95 improved by 0.70%, 1.1%, 0.1% and 2.5% respectively. In addition, the ablation experiments validate that the proposed MGPM is indeed beneficial for distinguishing the non-enhanced tumors and the BGM as well as the BS loss are also helpful for refining the segmentation contours of the tumor. Copyright © 2023, The Authors. All rights reserved.

关键词： Tumors

Hard Sample Matters a Lot in Zero-Shot Quantization

学校读者我要写书评

暂无评论

Hard Sample Matters a Lot in Zero-Shot Quantization

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Huantong Li Xiangmiao Wu Fanbing Lv Daihai Liao Thomas H. Li Yonggang Zhang Bo Han Mingkui Tan South China University of Technology Information Technology R&D Innovation Center of Peking University Changsha Hisense Intelligent System Research Institute Co. Ltd School of Electronic and Computer Engineering Peking University Shenzhen Graduate School Shenzhen China Hong Kong Baptist University Key Laboratory of Big Data and Intelligent Robot Ministry of Education PengCheng Laboratory

Zero-shot quantization (ZSQ) is promising for compressing and accelerating deep neural networks when the data for training full-precision models are inaccessible. In ZSQ, network quantization is performed using synthetic samples, thus, the performance of quantized models depends heavily on the quality of synthetic samples. Nonetheless, we find that the synthetic samples constructed in existing ZSQ methods can be easily fitted by models. Accordingly, quantized models obtained by these methods suffer from significant performance degradation on hard samples. To address this issue, we propose HArd sample Synthesizing and Training (HAST). Specifically, HAST pays more attention to hard samples when synthesizing samples and makes synthetic samples hard to fit when training quantized models. HAST aligns features extracted by full-precision and quantized models to ensure the similarity between features extracted by these two models. Extensive experiments show that HAST significantly outperforms existing ZSQ methods, achieving performance comparable to models that are quantized with real data.

关键词：

Find Beauty in the Rare: Contrastive Composition Feature Clustering for Nontrivial Cropping Box Regression

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Pan, Zhiyu Chen, Yinpeng Zhang, Jiale Lu, Hao Cao, Zhiguo Zhong, Weicai Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology China Huawei CBG Consumer Cloud Service Search Product & Big Data Platform Department China

Automatic image cropping algorithms aim to recompose images like human-being photographers by generating the cropping boxes with improved composition quality. Cropping box regression approaches learn the beauty of composition from annotated cropping boxes. However, the bias of annotations leads to quasi-trivial recomposing results, which has an obvious tendency to the average location of training samples. The crux of this predicament is that the task is naively treated as a box regression problem, where rare samples might be dominated by normal samples, and the composition patterns of rare samples are not well exploited. Observing that similar composition patterns tend to be shared by the cropping boundaries annotated nearly, we argue to find the beauty of composition from the rare samples by clustering the samples with similar cropping boundary annotations, i.e., similar composition patterns. We propose a novel Contrastive Composition Clustering (C2C) to regularize the composition features by contrasting dynamically established similar and dissimilar pairs. In this way, common composition patterns of multiple images can be better summarized, which especially benefits the rare samples and endows our model with better generalizability to render nontrivial results. Extensive experimental results show the superiority of our model compared with prior arts. We also illustrate the philosophy of our design with an interesting analytical visualization. Copyright © 2023, The Authors. All rights reserved.

关键词： Image enhancement

Using Depth-Enhanced Spatial Transformation for Student Gaze Target Estimation in Dual-View Classroom Images

学校读者我要写书评

暂无评论

Using Depth-Enhanced Spatial Transformation for Student Gaze...

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Haonan Miao Peizheng Zhao Yuqi Sun Fang Nan Xiaolong Zhang Yaqiang Wu Feng Tian School of Computer Science and Technology Xi’an Jiaotong University Xi’an China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi’an Jiaotong University Xi’an China School of Advanced Technology Xi’an Jiaotong-Liverpool University Suzhou China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Dual-view gaze target estimation in classroom environments has not been thoroughly explored. Existing methods lack consideration of depth information, primarily focusing on 2D image information and neglecting the latent 3D spatial context, which could lead to suboptimal transformation and cause the gaze cone to intersect with an incorrect object. This paper introduces a novel dual-view gaze target estimation method tailored for classroom settings, leveraging depth-enhanced spatial transformations. By formulating a depth-enhanced 2D space, our method uses depth-enhanced spatial transformation to accurately project students’ gaze cones to the teacher-oriented image. Additionally, we collected a dataset named DVSGE, specifically for student gaze target estimation in dual-view classroom images. Experimental results demonstrate significant performance improvements of 9.8% in AUC and 19.9% in L2-Distance for our method, surpassing existing methods.

关键词： Three-dimensional displays Estimation Focusing Signal processing Acoustics Speech processing

Decoupled Prototype Learning for Reliable Test-Time Adaptation

学校读者我要写书评

暂无评论

IEEE Transactions on Multimedia 2025年 27卷 3585-3597页

作者： Wang, Guowei Ding, Changxing Tan, Wentao Tan, Mingkui South China University of Technology School of Electronic and Information Engineering 381 Wushan Road Tianhe District Guangzhou510000 China Pazhou Lab Guangzhou510330 China South China University of Technology School of Future Technology 381 Wushan Road Tianhe District Guangzhou510000 China South China University of Technology School of Software Engineering Key Laboratory of Big Data and Intelligent Robot Ministry of Education Guangzhou510006 China

Test-time adaptation (TTA) is a task that continually adapts a pre-trained source model to the target domain during inference. One popular approach involves fine-tuning model with cross-entropy loss according to estimated pseudo-labels. However, its performance is significantly affected by noisy pseudo-labels. This study reveals that minimizing the classification error of each sample causes the cross-entropy loss's vulnerability to label noise. To address this issue, we propose a novel Decoupled Prototype Learning (DPL) method that features prototype-centric loss computation. First, we decouple the optimization of class prototypes. For each class prototype, we reduce its distance with positive samples and enlarge its distance with negative samples in a contrastive manner. This strategy prevents the model from overfitting to noisy pseudo-labels. Second, we propose a memory-based strategy to enhance DPL's robustness for the small batch sizes often encountered in TTA. We update each class's pseudo-feature from a memory in a momentum manner and insert an additional DPL loss. Finally, we introduce a consistency regularization-based approach to leverage samples with unconfident pseudo-labels. This approach transfers feature styles of samples with unconfident pseudo-labels to those with confident pseudo-labels. Thus, more reliable samples for TTA are created. The experimental results demonstrate that our methods achieve state-of-the-art performance on domain generalization benchmarks, and reliably improve the performance of self-training-based methods on image corruption benchmarks. The code will be released. © 1999-2012 IEEE.

关键词： Benchmarking

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorithm 19th

学校读者我要写书评

暂无评论

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorit...

19th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Chen, Jiebin Hu, Ziqiang Ye, Renjie Zhang, Qishan Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Xianda College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (纸本)9789819623723

Large-scale graphs have become prevalent with the advent of the big data era. Distributed graph computing systems are commonly used for processing and analyzing large-scale graphs, with graph partitioning being a key prerequisite for their efficient computation. Graph partitioning aims to balance the load across partitions while minimizing the number of cut-edges. Moreover, it should achieve high efficiency and scalability. However, the existing popular graph partitioning algorithms do not fully take into account the internal topology of real-world graphs, which affects the final partition quality and convergence. Meanwhile, they easily fall into the local optimum due to partition load constraints. This paper introduces a Novel Optimized Balanced Graph Partitioning algorithm (NOBGP). First, we propose an initialization strategy based on label propagation of core vertices to achieve initial partitions with good locality and accelerate convergence. Second, we optimize the label propagation process to ensure balanced partitions and propose a probability-based disruption strategy to avoid the local optimum. We implement NOBGP on the distributed graph computing framework GraphX. Extensive experimental results on real-world graphs show that the proposed algorithm is scalable and performs better than the existing algorithms. We also run PageRank and Louvain applications using the graph partitioning results to demonstrate the efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Graph algorithms

GESH-NET: GRAPH-ENHANCED SPHERICAL HARMONIC CONVOLUTIONAL NETWORKS FOR CORTICAL SURFACE REGISTRATION

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Ruoyu Wang, Lihui Tang, Kun Xu, Jingwen Wei, Hongjiang Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China School of Biomedical Engineering Shanghai Jiao Tong University Shanghai China

Cortical surface registration plays a crucial role in coordinating individual cortical functions and anatomical features, serving as a fundamental step in cortical surface analysis. Its aim is to align the anatomical or functional regions of different individuals, which is of great importance for neuroimaging studies across different populations. Currently, cortical surface registration techniques based on classical methods have been well developed. However, a key issue with classical registration methods is that for each pair of images to be registered, it is necessary to search for the optimal transformation in the deformation space according to a specific optimization algorithm until the similarity measure function converges, which cannot meet the requirements of real-time and high-precision in medical image registration. With the spectacular success of deep learning in the field of computer vision, researching cortical surface image registration techniques based on deep learning models has become a new direction. But so far, there are still only a few studies on cortical surface image registration based on deep learning. Moreover, although deep learning methods theoretically have stronger representation capabilities, surpassing the most advanced classical methods in registration accuracy and distortion control remains a challenge. Therefore, to address this challenge, this paper constructs a deep learning model to study the technology of cortical surface image registration. The specific work is as follows: (1) An unsupervised cortical surface registration network based on a multi-scale cascaded structure is designed, and a convolution method based on spherical harmonic transformation is introduced to register cortical surface data. This solves the problem of scale-inflexibility of spherical feature transformation and optimizes the multi-scale registration process. The results show that the proposed network outperforms the other deep learning-based registration m

关键词： Spheres

Embedding VLAD in Transformer for Video Question Answering

学校读者我要写书评

暂无评论

Jisuanji Xuebao/Chinese Journal of Computers 2023年第4期46卷 671-689页

作者： Guo, Dan Yao, Shen-Tao Wang, Hui Wang, Meng School of Computer and Information Engineering Hefei University of Technology Hefei230601 China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei230094 China Key Laboratory of Knowledge Engineering with Big Data（Hefei University of Technology） Ministry of Education Hefei230601 China Intelligent Interconnected Systems Laboratory of Anhui Province（Hefei University of Technology） Hefei230601 China

Video question answering（VideoQA）is a typical cross-modal understanding task. Its challenge lies in how to learn appropriate multimodal representation and cross-modal correlation for answer inference. Most existing video question answering methods focus on the latter，e. g.，relationship learning between each video frame or clip and word. In this work， we devote to advanced feature embedding of both video and query. We develop a clustering-based VLAD technique for VideoQA. The novelty of our work is the joint exploitation of temporal aggregation and correlation in multimodality. We propose an end-to-end trainable Transformed VLAD embedding network， named TVLAD-Net. TVLAD-Net constructs a differentiable aggregation network module（i. e.， convolutional Residual-less VLAD Block）to generate compact VLAD descriptors（transforming N frames，clips or words to compact K descriptors while K © 2023 Science Press. All rights reserved.

关键词： Semantics

Robust Visual Question Answering: datasets, Methods, and Future Challenges

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Ma, Jie Wang, Pinghui Kong, Dechen Wang, Zewei Liu, Jun Pei, Hongbin Zhao, Junzhou Di, Jia The Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Cyber Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China The Ministry of Education of Key Laboratory for Intelligent Networks and Network Security School of Automation Science and Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China The Shannxi Provincial Key Laboratory of Big Data Knowledge Engineering School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China

Visual question answering requires a system to provide an accurate natural language answer given an image and a natural language question. However, it is widely recognized that previous generic VQA methods often tend to memorize biases present in the training data rather than learning proper behaviors, such as grounding images before predicting answers. Therefore, these methods usually achieve high in-distribution but poor out-of-distribution performance. In recent years, various datasets and debiasing methods have been proposed to evaluate and enhance the VQA robustness, respectively. This paper provides the first comprehensive survey focused on this emerging fashion. Specifically, we first provide an overview of the development process of datasets from in-distribution and out-of-distribution perspectives. Then, we examine the evaluation metrics employed by these datasets. Thirdly, we propose a typology that presents the development process, similarities and differences, robustness comparison, and technical features of existing debiasing methods. Furthermore, we analyze and discuss the robustness of representative vision-and-language pre-training models on VQA. Finally, through a thorough review of the available literature and experimental analysis, we discuss the key areas for future research from various viewpoints. Copyright © 2023, The Authors. All rights reserved.

关键词： Visual languages