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

Dynamic Sparse Graph Learning Jointly With Projective Graph Embedding for Image Feature Extraction

IEEE Sensors Journal 2025年第9期25卷 16455-16467页

作者： Hu, Liangchen Dai, Zhenlei Chen, Zhenghua Zhang, Wensheng Hu, Peng Du, Tongchun Luo, Yonglong Anhui Normal University School of Computer and Information Wuhu241002 China Anhui Provincial Key Laboratory of Industrial Intelligence Data Security Wuhu241002 China Fusionopolis 138632 Singapore Institute of Automation Chinese Academy of Sciences State Key Laboratory of Multimodel Artificial Intelligence Systems Beijing100190 China University of Chinese Academy of Sciences School of Artificial Intelligence Beijing100049 China

In the context of advancing industrial automation, sensor-generated image data often exhibit high dimensionality and complexity, presenting challenges for effective feature extraction. Especially when sensors are deployed in complex and dynamic environments, image data can be affected by various factors, leading to increased noise and thus impacting the performance of feature extraction. To tackle these issues, this article introduces a method combining dynamic sparse graph learning jointly with projective graph embedding for feature extraction from sensor images. Initially, sparse representation learning constructs similarity graphs among the data, pruning unnecessary connections to retain the most pertinent features. Then, projective graph embedding maps the image data into a lower dimensional space, achieving a more concise and discriminative feature representation. These two primary modules in our model form an optimized closed loop, achieving overall optimality. The integrated approach effectively reveals the local manifold structure within the data. Experimental results indicate significant performance enhancements compared to several state-of-the-art methods across multiple benchmark datasets. © 2001-2012 IEEE.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

Source-free Domain Adaptation with Multiple Alignment for Efficient Image Retrieval

Source-free Domain Adaptation with Multiple Alignment for Ef...

引用

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

作者： Jinghui Ni Hui Cui Lihai Zhao Fengling Li Xiaohui Han Lijuan Xu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Quan Cheng Laboratory Shandong Open University University of Technology Sydney

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Domain adaptation techniques help models generalize to target domains by addressing domain discrepancies between the source and target domain data distributions. These techniques are particularly valuable for cross-domain hashing retrieval, as they reduce training costs while maintaining high retrieval efficiency. However, existing unsupervised domain adaptative hashing methods often require access to both source and target domain data, which may raise privacy concerns regarding source domain data. To address these concerns, restricting access to source domain data is crucial, but this restriction also makes the alignment process between domains more challenging. In this paper, we propose a Source-free Domain Adaptive Hashing with Multiple Alignment (SFDAH-MA) approach for image retrieval. SFDAH-MA integrates model structure alignment, class moment alignment, and semantic relationship alignment to maximize inter-domain knowledge transfer. This comprehensive alignment strategy not only enhances retrieval performance across domains but also minimizes reliance on source domain data, thereby supporting data privacy protection. Extensive experiments show that SFDAH-MA achieves state-of-the-art performance in source-free settings and achieves comparable results to existing unsupervised domain adaptive hashing methods under conventional settings. The source codes of our method are available at: https://***/Nikphyc/SFDAH-MA.

关键词： Training Data privacy Adaptation models Source coding Semantics Image retrieval Signal processing Protection Speech processing Knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

Depth-Enhanced Alignment for Label-Free 3D Semantic Segmentation 27th

Depth-Enhanced Alignment for Label-Free 3D Semantic Segment...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Xie, Shangjin Feng, Jiawei Chen, Zibo Liu, Zhixuan Zheng, Wei-Shi School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou China Guangdong Province Key Laboratory of Information Security Technology Sun Yat-sen University Guangzhou China

ISBN: (纸本)9783031784552

Labeling every point in a scene is a laborious journey for 3D understanding. To achieve annotation-free training, existing works introduce Contrastive Language-Image Pre-training (CLIP) to transfer the pre-trained capability of visual-linguistic correspondence to 3D-linguistic matching. However, directly adopting this CLIP-driven strategy can inevitably introduce bias: The overrated roles of the color and texture from an RGB image could overshadow the geometric nature of the corresponding 3D scene, resulting in a sub-optimal alignment. We note that different from RGB images, a depth map contains rich geometric information. Inspired by this, we propose Depth-Enhanced Alignment (D-EA) for label-free 3D semantic segmentation. D-EA aims to explore the rich geometric cues in depth maps and mitigate the color and texture biases rooted in the original CLIP-driven strategy. Specifically, we first tune a geometry-enhanced CLIP by aligning its depth prediction to the paired RGB prediction given by the original CLIP. Next, the point cloud feature space is matched with the RGB-Depth aggregated CLIP space by aligning point prediction to RGB and depth predictions. Moreover, to mitigate the semantic ambiguity caused by view-specific noise, we propose a View-Integrated Pseudo Label Generation paradigm. Experiments demonstrate the effectiveness of the proposed D-EA on the ScanNet (indoor) and GraspNet-1Billion (desktop) datasets in the label-free setting. Our method is also competitive in limited annotation semantic segmentation. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Multi-scale network for single image deblurring based on ensemble learning module

引用

Multimedia Tools and Applications 2025年第11期84卷 9045-9064页

作者： Wu, WenBo Pan, Yun Su, Na Wang, JingTao Wu, ShaoChuan Xu, ZeKun Yu, YouJian Liu, YaPeng State Key Laboratory of Media Convergence and Communication Communication University of China Beijing100024 China School of Computer and Cyberspace Security Communication University of China Beijing100024 China School of Electronics and Information Engineering Harbin Institute of Technology Harbin150080 China College of Computer and Control Engineering Northeast Forestry University Harbin150040 China School of Computer and Information Engineering Tianjin Chengjian University Tianjin300384 China School of Computer Science and Technology Anhui University Hefei230601 China

In this paper, we have identified two primary issues with current multi-scale image deblurring methods. On the one hand, the blurring scale is ignored. On the other hand, the context information of images is not fully utilized, and the spatial detail information of images is lost. To better solve the above problems, on top of that, this paper proposes a multi-scale network for single image deblurring. The designed network contains two parts: 1) Ensemble Learning Model: The Weak Learning Model in this module connects multiple weak learners in series to increase network depth. Moreover, through multi-scale feature ensemble module, the output features and intermediate features of different weak learner are integrated, and finally strong learner is used to enhance the features with semantic information at different scales;2) Spatial Feature Enhancement Module: This module can preserve spatial detail information of images and compensate for the disadvantages of losing image spatial details due to continuous downsampling in the Ensemble Learning Model structure. Our proposed deblurring model has been extensively evaluated on several benchmark datasets, and the model achieves superior performance compared to the most advanced deblurring methods. In particular, the peak signal-to-noise ratio (PSNR) and structural similarity index measure (SSIM) values are 33.57 dB and 0.965 on the GoPro dataset, respectively, with PSNR and SSIM improving by 0.49 dB and 0.002 over NAFNet, and 0.65 dB and 0.004 over Restormer. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Optimization algorithm for global k-means algorithm 13

Optimization algorithm for global k-means algorithm

引用

13th International Conference on Intelligent Control and information Processing, ICICIP 2025

作者： Li, Sen Li, Fang Luo, Xiaonan School of Computer Science and Information Security Guilin University of Electronic Technology Guilin541004 China Guilin541004 China Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin541004 China

ISBN: (纸本)9798331516147

The k-means method is widely utilized for clustering. Its simplicity, efficacy, and swiftness make it a favored choice among clustering algorithms. It faces the challenge of sensitivity to the initial class center. The enhancement strategy for the k-means algorithm focuses on refining the initial selection of cluster centroids, no longer using its random selection of initial class center points, but starting from the entire dataset, choosing the most distant point to serve as the starting cluster centroid. This can also prevent the local optimization problem of the k-means algorithm. The improved algorithm proposed in this article is an effective method that can select the initial class center point from a global perspective and reduce computation time. The suggested approach has undergone rigorous testing and comparative analysis across multiple datasets, yielding commendable outcomes. © 2025 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Improving MPCitH with Preprocessing: Mask Is All You Need

IACR Transactions on Cryptographic Hardware and Embedded Sys...

引用

IACR Transactions on Cryptographic Hardware and Embedded Systems 2025年第2期2025卷 1-22页

作者： Liu, Guowei Liu, Guoxiao Jiang, Kaijie Yu, Qingyuan Jia, Keting Wei, Puwen Wang, Meiqin School of Cyber Science and Technology Shandong University Qingdao China Institute for Network Sciences and Cyberspace Tsinghua University Beijing China Institute for Advanced Study Tsinghua University Beijing China Quan Cheng Shandong Laboratory Jinan China Zhongguancun Laboratory Beijing China BNRist Tsinghua University Beijing China Key Laboratory of Cryptologic Technology and Information Security Ministry of Education Shandong University Jinan China

The MPC-in-the-head with preprocessing (MPCitH-PP) paradigm presents a novel approach for constructing post-quantum digital signatures like Picnic3. This paper revisits the MPCitH-PP construction, analyzing both its offline and online phases and proposing a reformulation of the protocol. By identifying redundant computations in these phases, we optimize them into a single phase, thereby enhancing the efficiency of MPCitH-PP. Furthermore, we explore the independence of the mask, demonstrating that it can be calculated in parallel, which also enables the optimization of the masked witness calculation. Our optimized implementation of Picnic3 shows significant improvements. At the L1 security level, the optimal software implementation reduces MPCitH-PP calculation time to about 30% of the previous implementation. The optimal signature implementation costs about 78% of the previous implementation time. At the L5 security level, MPCitH-PP with parallelism optimal is reduced to about 26% of the previous solution’s time, and the optimal signature implementation runs at about 53% of the previous solution’s time. For the hardware implementation, our optimizations reduce the clock cycles of MPCitH-PP from r sequential rounds to a single parallel round, where r denotes the number of rounds in the LowMC algorithm, with little change in hardware usage, and perform better in AT product, especially for parallel computing. © 2025, Ruhr-University of Bochum. All rights reserved.

关键词： Masks

来源：评论

学校读者我要写书评

暂无评论

Discriminative Score Suppression for Weakly Supervised Video Anomaly Detection

Discriminative Score Suppression for Weakly Supervised Video...

引用

2025 IEEE/CVF Winter Conference on Applications of computer Vision, WACV 2025

作者： Xu, Chen Li, Chunguo Xing, Hongjie College of Mathematics and Information Science Hebei University Hebei Key Laboratory of Machine Learning and Computational Intelligence Baoding071002 China School of Cyber Security and Computer Hebei University Baoding071000 China

ISBN: (纸本)9798331510831

Weakly supervised video anomaly detection (WSVAD) often relies on Multiple Instance Learning (MIL). However, selecting only the most discriminative segments for training limits the model's ability to comprehensively detect anomalous events, particularly hard anomalies. To overcome this limitation, we propose the Discriminative Score Suppression (DSS) module. This module suppresses the discriminative scores of the most prominent anomalies, shifting the model's attention to less obvious but important hard anomalies. This approach guides the model to learn the critical features of hard anomalies, enabling a more comprehensive detection of anomalous events. Additionally, the Anomaly Score Refinement (ASR) module constructs a dissimilarity-based classifier by storing normal patterns as prototypes, and integrates this with a neural network classifier. By combining the anomaly scores from both classifiers, more accurate detection of true hard anomalies is achieved. A score-sensitive inner-bag loss function not only adjusts penalties based on anomaly scores but also ensures that the model avoids erroneous selections. Our method accurately detects various anomalies, including challenging and multi-segment anomalies, while minimizing false positives for normal events. Extensive experiments show that the proposed framework outperforms state-of-the-art methods on the UCF-Crime and XD-Violence datasets. © 2025 IEEE.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

LASS: A Novel and Economical Data Augmentation Framework Based on Language Models for Debiasing Opinion Summarization 31

LASS: A Novel and Economical Data Augmentation Framework Bas...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Zhang, Yanyue Li, Pengfei Lai, Yilong He, Yulan Zhou, Deyu School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University China Department of Informatics King's College London United Kingdom The Alan Turing Institute United Kingdom

ISBN: (纸本)9798891761964

As more than 70% of reviews in the existing opinion summary data set are positive, current opinion summarization approaches are hesitant to generate negative summaries given the input of negative texts. To address such sentiment bias, a direct approach without the reliance on a specific structure is to generate additional data based on large language models to balance the emotional distribution of the dataset. However, large-scale data augmentation based on large language models faces an apparent disadvantage, the expensive costs. Therefore, in this paper, we propose LASS, a novel data augmentation framework based on both LArge and Small language models for debiaSing opinion summarization. Specifically, a small number of synthesized negative reviews is obtained by rewriting the positive text via a large language model. Then, a disentangle reconstruction model is trained based on the generated data. After training, a large amount of synthetic data can be obtained by decoding the new representation obtained from the combination of different sample representations and filtering based on perplexity degree and sentiment classification. Experiments have proved that LASS can effectively alleviate emotional bias, similar to using only large models, but in a more economical way. © 2025 Association for Computational Linguistics.

关键词： Data assimilation

来源：评论

学校读者我要写书评

暂无评论

Tomato Leaf Disease Identification and Growth Dataset Augmentation Based on UAE-GAN 13

Tomato Leaf Disease Identification and Growth Dataset Augmen...

引用

13th International Conference on Intelligent Control and information Processing, ICICIP 2025

作者： Li, Xin Li, Fang Luo, Xiaonan School of Computer Science and Information Security Guilin University of Electronic Technology Guilin541004 China Guilin541004 China Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin541004 China

ISBN: (纸本)9798331516147

To delve into the characterization of growth disorders in different crops, it is important to support the model with a large amount of image data that includes a variety of disease types and disease levels to capture the typical and subtle differences of various diseases on plant leaves. However, the actual process of gathering data is challenging, sample coverage is challenging to accomplish, data capture is impeded, and the quality of the data is subpar. This work aims to address the issue of data shortages by employing technical methods. In particular, we creatively investigated the UAE-GAN approach, which naturally combines CycleGAN, U-Net, Variational Autoencoder VAE, and Autoencoder to increase the data. Among these, U-Net can precisely extract the small details of disease locations in crop photos and provide a strong basis for further processing thanks to its special codec architectural benefits. The Variational Autoencoder (VAE) significantly enhances the diversity of data by mapping the image to the latent space and sampling based on a certain probability distribution, so producing new image samples that are distinct from the original image yet inherently connected. Learning the coding and decoding of the original image is the foundation of autoencoders. If a mild disruption is introduced into the coding process, it can achieve data augmentation in another dimension and create a sequence of new images with just little modifications to the original image. The aforementioned models are closely linked with CycleGAN to efficiently map and convert in a variety of picture domains and to fully leverage CycleGAN's remarkable unsupervised image conversion capabilities. The perception ability, feature capture ability, and information conversion ability of the fusion model for crop image data are significantly improved, and the key elements of each link in the data enhancement process are comprehensively considered to ensure that the generated new image data can not o

关键词： Fruits

来源：评论

学校读者我要写书评

暂无评论

Verifiable and Forward-Secure Multi-keyword Query in Internet of Medical Things

引用

IEEE Internet of Things Journal 2025年

作者： Li, Hongjun He, Debiao Feng, Qi Luo, Min Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan China Wuhan University School of Cyber Science and Engineering Wuhan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250014 China National Key Laboratory of Security Communication Chengdu China

The Internet of Medical Things (IoMT) plays a pivotal role in modern healthcare systems, enhancing patients' medical experiences and improving the efficiency of public medical services. However, concerns regarding security and privacy may hinder the widespread implementation and development of IoMT in practical applications. Dynamic Searchable Symmetric Encryption (DSSE) can maintain search capabilities on encrypted data, even when files are dynamically added or deleted. Earlier DSSE schemes typically support only single keyword query and provide forward security under the assumption of semi-honest servers, which significantly limits their applicability in real-world scenarios. To resolve these limitations, we propose a forward-secure and verifiable DSSE scheme that supports multi-keyword conjunctive query. Our scheme ensures forward security by utilizing a chain structure and guarantees correctness and completeness through RSA accumulator and Homomorphic Message Authentication Code (HMAC). Furthermore, we integrate the forward index and inverted index to enable efficient retrieval. Through comprehensive security and performance analysis, we demonstrate that our scheme effectively protects users' privacy while maintaining low computation and communication overheads. Finally, some experimental evaluations are conducted to verify both the correctness and efficiency of the proposed scheme. © 2014 IEEE.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：