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

A new multilevel reversible bit-planes data hiding technique based on histogram shifting of efficient compressed domain

引用

Vietnam Journal of Computer Science 2018年第2期5卷 185-196页

作者： Rashid Abbasi Bin Luo Gohar Rehman Haseeb Hassan Muhammad Shahid Iqbal Lixiang Xu School of Computer and Technology Anhui University Hefei People’s Republic of China Key Lab of Intelligent Computing and Signal Processing of MOE and School of Computer and Technology Anhui University Hefei People’s Republic of China College of Computer Science Technology Chongqing University Chongqing People’s Republic of China

In this paper, we proposed a new technique for reversible data hiding based on efficient compressed domain with multiple bit planes. We conducted a sequence of experiments to use block division scheme to appraise the result with different parameters and amended the probability of zero point in every block of histogram. This scheme attained more embedding capacity and high-quality of stego-image. Experimental consequences prove that the proposed method effectively achieved the objective of high embedding capacity and sustaining the quality of image.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Secure Edge Caching Placement and Delivery for Ultra-Reliable and Low-Latency Vehicular Networks

Secure Edge Caching Placement and Delivery for Ultra-Reliabl...

引用

IEEE Globecom Workshops

作者： Haojun Yang Kuan Zhang Kan Zheng Yi Qian Intelligent Computing and Communications (IC) Lab Wireless Signal Processing and Networks (WSPN) Lab Key Laboratory of Universal Wireless Communications Ministry of Education Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering University of Nebraska-Lincoln Omaha NE USA

ISBN: (数字)9781728109602

ISBN: (纸本)9781728109619

To meet the urgent requirements of ultra-reliable and low-latency communications (URLLCs) in vehicular networks, vehicular edge caching (VEC) becomes a promising solution to reduce backhaul costs and mitigate network congestion. However, the data requested by vehicular users may be maliciously tampered by attackers during the caching delivery phase. In this paper, we investigate the problem of secure caching placement and delivery for a VEC URLLC system. Specifically, we first analyze the lower bound of spectral efficiency for URLLCs and security metric, i.e., vulnerability. Then, an optimization problem of minimizing the maximum vulnerability among all vehicular users is formulated based on the analysis. Subsequently, we propose a secure caching placement and delivery algorithm to obtain the solutions of our formulated problem by reasonable complexity. Simulation results show that the proposed algorithm can significantly improve the performance of security for the VEC URLLC system.

关键词： Security Optimization Roads Reliability Fading channels signal to noise ratio Antennas

来源：评论

学校读者我要写书评

暂无评论

Efficiently Finding Top-K Items from Evolving Distributed Data Streams

Efficiently Finding Top-K Items from Evolving Distributed Da...

引用

International Conference on Semantics, Knowledge and Grid (SKG)

作者： Baoyuan Qi Gang Ma Zhongzhi Shi Wei Wang University of Chinese Academy of Sciences Beijing China Key Lab of Intelligent Information Processing Institute of Computing Technology Cas Beijing China Key Lab. of Intell. Inf. Process. Institute of Computing Technology Chinese Academy of Sciences Beijing CN Beijing Lexo Technologies Co. Ltd. Beijing China

ISBN: (纸本)9781479967162

The problem of efficiently finding top-k frequent items has attracted much attention in recent years. Storage constraints in the processing node and intrinsic evolving feature of the data streams are two main challenges. In this paper, we propose a method to tackle these two challenges based on space-saving and gossip-based algorithms respectively. Our method is implemented on SAMOA, a scalab.e advanced massive online analysis machine learning framework. The experimental results show its effectiveness and scalab.lity.

关键词： Peer-to-peer computing Data mining Distributed databases Protocols Machine learning algorithms Monitoring Radiation detectors

来源：评论

学校读者我要写书评

暂无评论

Ranking Sentences in Scientific Literatures

Ranking Sentences in Scientific Literatures

引用

International Conference on Semantics, Knowledge and Grid (SKG)

作者： Jiao Tian Mengyun Cao Jin Liu Xiaoping Sun Zhuge Hai University of Chinese Academy of Sciences Beijing China Knowledge Grid Group CAS Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China Wuhan University CAS Key Lab. of Intell. Inf. Process. Institute of Computing Technology Chinese Academy of Sciences Beijing CN

Sentence ranking is one of the most important research issues in text analysis. It can be used in extracted textual summarization and information retrieval. Graph-based methods are a common way of ranking and extracting sentences. In graph based methods, sentences are nodes of graph and edges are built based on the sentence similarities or on sentence co-occurrence relationship. PageRank style algorithms can be applied to get sentence ranks. In this paper, we focus on how to rank sentences in a single scientific paper. A scientific literature has more structural information than general texts and this structural information has not been fully explored yet in graph based ranking models. We investigated several different methods that used structural information such as paragraph and section information to construct a heterogeneous graph for ranking sentences. We conducted experiments on these methods to compare the results on sentence ranking. It shows that structural information can help identify more representative sentences.

关键词： Semantics Algorithm design and analysis Web pages Data mining Iterative methods Current measurement

来源：评论

学校读者我要写书评

暂无评论

SSE-SAM: Balancing Head and Tail Classes Gradually through Stage-Wise SAM

arXiv

引用

arXiv 2024年

作者： Lyu, Xingyu Xu, Qianqian Yang, Zhiyong Lyu, Shaojie Huang, Qingming Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS China School of Computer Science and Tech University of Chinese Academy of Sciences China Tencent Corporate China BDKM University of Chinese Academy of Sciences China

Real-world datasets often exhibit a long-tailed distribution, where vast majority of classes known as tail classes have only few samples. Traditional methods tend to overfit on these tail classes. Recently, a new approach called Imbalanced SAM (ImbSAM) is proposed to leverage the generalization benefits of Sharpness-Aware Minimization (SAM) for long-tailed distributions. The main strategy is to merely enhance the smoothness of the loss function for tail classes. However, we argue that improving generalization in long-tail scenarios requires a careful balance between head and tail classes. We show that neither SAM nor ImbSAM alone can fully achieve this balance. For SAM, we prove that although it enhances the model’s generalization ability by escaping saddle point in the overall loss landscape, it does not effectively address this for tail-class losses. Conversely, while ImbSAM is more effective at avoiding saddle points in tail classes, the head classes are trained insufficiently, resulting in significant performance drops. Based on these insights, we propose Stage-wise Saddle Escaping SAM (SSE-SAM), which uses complementary strengths of ImbSAM and SAM in a phased approach. Initially, SSE-SAM follows the majority sample to avoid saddle points of the head-class loss. During the later phase, it focuses on tail-classes to help them escape saddle points. Our experiments confirm that SSE-SAM has better ability in escaping saddles both on head and tail classes, and shows performance improvements. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

WISERNet: Wider Separate-then-reunion Network for Steganalysis of Color Images

arXiv

引用

arXiv 2018年

作者： Zeng, Jishen Tan, Shunquan Liu, Guangqing Li, Bin Huang, Jiwu Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China College of Computer Science and Software Engineering Shenzhen University Guangdong Key Lab. of Intelligent Info. Processing and Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen518060 China Peng Cheng Laboratory Shenzhen518052 China

Until recently, deep steganalyzers in spatial domain have been all designed for gray-scale images. In this paper, we propose WISERNet (the wider separate-then-reunion network) for steganalysis of color images. We provide theoretical rationale to claim that the summation in normal convolution is one sort of "linear collusion attack" which reserves strong correlated patterns while impairs uncorrelated noises. Therefore in the bottom convolutional layer which aims at suppressing correlated image contents, we adopt separate channel-wise convolution without summation instead. Conversely, in the upper convolutional layers we believe that the summation in normal convolution is beneficial. Therefore we adopt united normal convolution in those layers and make them remarkably wider to reinforce the effect of "linear collusion attack". As a result, our proposed wide-and-shallow, separate-then-reunion network structure is specifically suitable for color image steganalysis. We have conducted extensive experiments on color image datasets generated from BOSSBase raw images and another large-scale dataset which contains 100,000 raw images, with di_erent demosaicking algorithms and downsampling algorithms. The experimental results show that our proposed network outperforms other state-of-the-art color image steganalytic models either hand-crafted or learned using deep networks in the literature by a clear margin. Specifically, it is noted that the detection performance gain is achieved with less than half the complexity compared to the most advanced deeplearning steganalyzer as far as we know, which is scarce in the literature. Copyright © 2018, The Authors. All rights reserved.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

AUCSeg: AUC-oriented Pixel-level Long-tail Semantic Segmentation

arXiv

引用

arXiv 2024年

作者： Han, Boyu Xu, Qianqian Yang, Zhiyong Bao, Shilong Wen, Peisong Jiang, Yangbangyan Huang, Qingming Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Peng Cheng Laboratory China Key Laboratory of Big Data Mining and Knowledge Management CAS China

The Area Under the ROC Curve (AUC) is a well-known metric for evaluating instance-level long-tail learning problems. In the past two decades, many AUC optimization methods have been proposed to improve model performance under long-tail distributions. In this paper, we explore AUC optimization methods in the context of pixel-level long-tail semantic segmentation, a much more complicated scenario. This task introduces two major challenges for AUC optimization techniques. On one hand, AUC optimization in a pixel-level task involves complex coupling across loss terms, with structured inner-image and pairwise inter-image dependencies, complicating theoretical analysis. On the other hand, we find that mini-batch estimation of AUC loss in this case requires a larger batch size, resulting in an unaffordable space complexity. To address these issues, we develop a pixel-level AUC loss function and conduct a dependency-graph-based theoretical analysis of the algorithm’s generalization ability. Additionally, we design a Tail-Classes Memory Bank (T-Memory Bank) to manage the significant memory demand. Finally, comprehensive experiments across various benchmarks confirm the effectiveness of our proposed AUCSeg method. The code is availab.e at https://***/boyuh/AUCSeg. © 2024, CC BY.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

ϵ-π: A Nonparametric Model for Neural Power Spectra Decomposition

引用

IEEE Journal of Biomedical and Health Informatics 2024年第5期28卷 2624-2635页

作者： Hu, Shiang Zhang, Zhihao Zhang, Xiaochu Wu, Xiaopei Valdes-Sosa, Pedro A. Anhui University Anhui Provincial Key Lab of Multimodal Cognitive Computation Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230601 China University of Science and Technology of China School of Humanities and Social Science Department of Psychology Hefei230026 China University of Electronic Science and Technology of China MOE Key Lab for Neuroinformation School of Life Science and Technology Chengdu611731 China

The power spectra estimated from the brain recordings are the mixed representation of aperiodic transient activity and periodic oscillations, i.e., aperiodic component (AC) and periodic component (PC). Quantitative neurophysiology requires precise decomposition preceding parameterizing each component. However, the shape, statistical distribution, scale, and mixing mechanism of AC and PCs are unclear, challenging the effectiveness of current popular parametric models such as FOOOF, IRASA, BOSC, etc. Here, was proposed to decompose the neural spectra by embedding the nonparametric spectra estimation with penalized Whittle likelihood and the shape language modeling into the expectation maximization framework. was validated on the synthesized spectra with loss statistics and on the sleep EEG and the large sample iEEG with evaluation metrics and neurophysiological evidence. Compared to FOOOF, both the simulation presenting shape irregularities and the batch simulation with multiple isolated peaks indicated that improved the fit of AC and PCs with less loss and higher F1-score in recognizing the centering frequencies and the number of peaks;the sleep EEG revealed that produced more distinguishable AC exponents and improved the sleep state classification accuracy;the iEEG showed that approached the clinical findings in peak discovery. Overall, offered good performance in the spectra decomposition, which allows flexible parameterization using descriptive statistics or kernel functions. is a seminal tool for brain signal decoding in fields such as cognitive neuroscience, brain-computer interface, neurofeedback, and brain diseases. © 2013 IEEE.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

A Unified Generalization Analysis of Re-Weighting and Logit-Adjustment for Imbalanced Learning 37

A Unified Generalization Analysis of Re-Weighting and Logit-...

引用

37th Conference on Neural Information processing Systems, NeurIPS 2023

作者： Wang, Zitai Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming SKLOIS Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Alibaba Group China School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University China BDKM University of Chinese Academy of Sciences China

ISBN: (纸本)9781713899921

Real-world datasets are typically imbalanced in the sense that only a few classes have numerous samples, while many classes are associated with only a few samples. As a result, a naïve ERM learning process will be biased towards the majority classes, making it difficult to generalize to the minority classes. To address this issue, one simple but effective approach is to modify the loss function to emphasize the learning on minority classes, such as re-weighting the losses or adjusting the logits via class-dependent terms. However, existing generalization analysis of such losses is still coarse-grained and fragmented, failing to explain some empirical results. To bridge this gap, we propose a novel technique named data-dependent contraction to capture how these modified losses handle different classes. On top of this technique, a fine-grained generalization bound is established for imbalanced learning, which helps reveal the mystery of re-weighting and logit-adjustment in a unified manner. Furthermore, a principled learning algorithm is developed based on the theoretical insights. Finally, the empirical results on benchmark datasets not only validate the theoretical results but also demonstrate the effectiveness of the proposed method. © 2023 Neural information processing systems foundation. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

DRAUC: an instance-wise distributionally robust AUC optimization framework 23

DRAUC: an instance-wise distributionally robust AUC optimiza...

引用

Proceedings of the 37th International Conference on Neural Information processing Systems

作者： Siran Dai Qianqian Xu Zhiyong Yang Xiaochun Cao Qingming Huang SKLOIS Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS School of Computer Science and Tech. University of Chinese Academy of Sciences School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS and BDKM University of Chinese Academy of Sciences

The Area Under the ROC Curve (AUC) is a widely employed metric in long-tailed classification scenarios. Nevertheless, most existing methods primarily assume that training and testing examples are drawn i.i.d. from the same distribution, which is often unachievable in practice. Distributionally Robust Optimization (DRO) enhances model performance by optimizing it for the local worst-case scenario, but directly integrating AUC optimization with DRO results in an intractable optimization problem. To tackle this challenge, methodically we propose an instance-wise surrogate loss of Distributionally Robust AUC (DRAUC) and build our optimization framework on top of it. Moreover, we highlight that conventional DRAUC may induce lab.l bias, hence introducing distribution-aware DRAUC as a more suitable metric for robust AUC learning. Theoretically, we affirm that the generalization gap between the training loss and testing error diminishes if the training set is sufficiently large. Empirically, experiments on corrupted benchmark datasets demonstrate the effectiveness of our proposed method. Code is availab.e at: https://***/EldercatSAM/DRAUC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：