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

18th International Workshop on Digital Forensics and Watermarking, IWDW 2019

作者： Wang, Jinwei Huang, Wei Luo, Xiangyang Shi, Yung-Qing Nanjing University of Information Science and Technology Nanjing210044 China Department of Computer and Software Nanjing University of Information Science and Technology NanjingJiangsu210044 China Shanxi Key Laboratory of Network and System Security Xidian University Xi’an710071 China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001 China State Key Laboratory of Information Security Institute Information Engineering Chinese Academy of Sciences Beijing100093 China Department of Electrical Computer Engineering New Jersey Institute of Technology NewarkNJ07102 United States

ISBN: (纸本)9783030435745

In this paper, a feature based on the Markov model in quaternion discrete cosine transform (QDCT) domain is proposed for double JPEG compression detection. Firstly, a given JPEG image is extracted from blocked images to obtain amplitude and three angles (ψ, φ, and θ). Secondly, when extracting the Markov features, we process the transition probability matrix with the corresponding refinement. Our proposed refinement method not only reduces redundant features, but also makes the acquired features more efficient for detection. Finally, a support vector machine (SVM) is employed for NA-DJPEG compression detection. It is well known that detecting NA-DJPEG compressed images with (Formula Presented) is a challenging task, and when the images with small size (i.e., 64 × 64), the detection will be more difficult. The experimental result indicates that our method can still achieve a high classification accuracy in this case. © 2020, Springer Nature Switzerland AG.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

MedSteGAN: Medical Embedding-Optimized Steganography with Improved GAN

SSRN

引用

SSRN 2023年

作者： Peng, Yuxiang Fu, Chong Zheng, Yu Tian, Yunjia Cao, Guixing Chen, Junxin School of Computer Science and Engineering Northeastern University Liaoning Shenyang110819 China Engineering Research Center of Security Technology of Complex Network System Ministry of Education China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Liaoning Shenyang110819 China Department of Information Engineering The Chinese University of Hong Kong Ma Liu Shui Shatin New Territories Hong Kong Institute of Telecommunication Satellite China Academy of Space Technology Beijing100094 China School of Software Dalian University of Technology Liaoning Dalian116621 China

Medical diagnosing systems contain sensitive information, especially the resulting certificate of diagnosis that involves the patient’s privacy, required to be protected carefully. An effective way is to secretly embed privacy-sensitive information into medical-generated images, eventually being viewed as arbitrary images of nobody/nothing in public. The current research line of medical steganography targets simple data-hiding methods, yet remains barren in optimal embedding and stronger robustness. To fill this gap, we propose an end-to-end steganographic framework for medical images. Our idea is to integrate medical-image adaptive steganography with a generative adversarial network (GAN), named MedSteGAN. To improve both robustness, we design an optimized U-shape gen- erator that extracts features more efficiently utilizing larger kernel convolutions and the ReLU6 function. Also, deconvolutions are replaced by upsampling and convolution layers to avoid the checkerboard effect. To enhance security and image quality, we employ visual quality loss and mean squared error (MSE) loss based on the multi-scale structural similarity index metric (MS- SSIM) and the high-pass filters, respectively. Extensive experiments demonstrate that MedSteGAN outperforms state-of-the-art steganographic schemes in terms of robustness and image quality. © 2023, The Authors. All rights reserved.

关键词： Image quality

来源：评论

学校读者我要写书评

暂无评论

Sparse random compressive sensing based data aggregation in wireless sensor networks

Sparse random compressive sensing based data aggregation in ...

引用

作者： Yin, Li Liu, Cuiye Guo, Songtao Yang, Yuanyuan Key Laboratory of Networks and Cloud Computing Security of Universities in Chongqing College of Electronic and Information Engineering Southwest University Chongqing400715 China School of Software Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Department of Electrical and Computer Engineering Stony Brook University Stony BrookNY11794 United States

In wireless sensor networks (WSNs), the volume of data is increasing at an unpredictable rate, which inevitably leads to high spatial-temporal correlation. To eliminate data redundancy, some researchers have proposed many data aggregation methods. However, a few of aggregation approaches can handle energy consumption and latency simultaneously. Therefore, in this paper, we propose an efficient algorithm, called Delay-Minimum Energy-Balanced (DMEB) data aggregation, which benefits from the superiority of the sparse random measurement matrix and minimum delay algorithm. Owing to the sparsity characteristics of the measurement matrix, only the nodes whose corresponding elements in the matrix are non-zero take part in the measurement. Each measurement can form an aggregation tree with minimum delay. After a sink node receives all the measurements, original readings can be recovered precisely. In addition, we adopt a novel scheduling method to avoid information interference. Experiment results demonstrate that, under recovering the original data accurately, the proposed data aggregation algorithm can not only shorten delay in data collection process but also reduce communication cost and prolong network lifetime during data transmission process. © 2018 John Wiley & Sons, Ltd.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Crsanet: Class Representations Self-Attention Network for the Segmentation of Thyroid Nodules

SSRN

引用

SSRN 2023年

作者： Sun, Shiyao Fu, Chong Xu, Sen Wen, Yingyou Ma, Tao School of Computer Science and Engineering Northeastern University Shenyang110819 China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Shenyang110819 China Engineering Research Center of Security Technology of Complex Network System Ministry of Education China General Hospital of Northern Theatre Command Shenyang110016 China Medical Imaging Research Department Neusoft Research of Intelligent Healthcare Technology Co. Ltd. Shenyang China Dopamine Group Ltd. Auckland1542 New Zealand

Segmenting accurate thyroid nodules in medical ultrasound images is always non-trivial due to the large variation in size, shape and texture of nodules, and also the presence of surrounding tissues and organs with similar intensity values. Existing algorithms solve this by designing multi-scale spatial context modeling modules and introducing the emerging self-attention based paradigm, while failing to learn the class-wise relational context around nodules. To this end, we propose a novel coarse-to-fine framework, namely, CRSANet, which leverages both class-wise relational context and spatial multi-scale context for comprehensive context perception. Specifically, we first introduce the concept of Class Representations, which describe the overall representation of thyroid nodules in ultrasound images from a categorical perspective. Secondly, we propose a backbone-free dual-branch Class Representation Self-Attention Module (CRSA) to refine the coarse segmentation results from segmentation backbones. Concretely, Fine Class Region (FCR) branch is proposed to impose consistency between pixels and their corresponding Class Representations to correct the wrongly classified pixels. Meanwhile, Class Contextual Representation (CCR) branch is introduced to enhance the ability of pixel representations with the corresponding Class Representations. We evaluate the effectiveness and generality of CRSANet using three types of backbone networks. In the experiments, our proposed U-CRSANet achieves a mIoU of 78.86% and 81.35%, an accuracy of 97.11% and 98.63%, a Dice value of 74.26% and 87.57%, respectively, which outperforms most state-of-the-art methods on the public DDTI and TN-SCUI datasets. © 2023, The Authors. All rights reserved.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-guided Boundary Learning for Imbalanced Social Event Detection

arXiv

引用

arXiv 2023年

作者： Ren, Jiaqian Peng, Hao Jiang, Lei Liu, Zhiwei Wu, Jia Yu, Zhengtao Yu, Philip S. The Institute of Information Engineering Chinese Academy of Sciences the School of Cyber Security University of Chinese Academy of Sciences Beijing China The School of Cyber Science and Technology Beihang University Beijing1000191 China Salesforce AI Research CA94301 United States The School of Computing Macquarie University Sydney Australia The Faculty of Information Engineering and Automation Yunnan Key Laboratory of Artificial Intelligence Kunming University of Science and Technology Kunming650500 China The Department of Computer Science University of Illinois at Chicago ChicagoIL60607 United States

Real-world social events typically exhibit a severe class-imbalance distribution, which makes the trained detection model encounter a serious generalization challenge. Most studies solve this problem from the frequency perspective and emphasize the representation or classifier learning for tail classes. While in our observation, compared to the rarity of classes, the calibrated uncertainty estimated from well-trained evidential deep learning networks better reflects model performance. To this end, we propose a novel uncertainty-guided class imbalance learning framework - UCLSED, and its variant - UCL-ECSED, for imbalanced social event detection tasks. We aim to improve the overall model performance by enhancing model generalization to those uncertain classes. Considering performance degradation usually comes from misclassifying samples as their confusing neighboring classes, we focus on boundary learning in latent space and classifier learning with high-quality uncertainty estimation. First, we design a novel uncertainty-guided contrastive learning loss, namely UCL and its variant - UCL-EC, to manipulate distinguishable representation distribution for imbalanced data. During training, they force all classes, especially uncertain ones, to adaptively adjust a clear separable boundary in the feature space. Second, to obtain more robust and accurate class uncertainty, we combine the results of multi-view evidential classifiers via the Dempster-Shafer theory under the supervision of an additional calibration method. We conduct experiments on three severely imbalanced social event datasets including Events2012_100, Events2018_100, and CrisisLexT_7. Our model significantly improves social event representation and classification tasks in almost all classes, especially those uncertain ones. Copyright © 2023, The Authors. All rights reserved.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

OpenAPMax: Abnormal Patterns-based Model for Real-World Alzheimer’s Disease Diagnosis

arXiv

引用

arXiv 2023年

作者： Huang, Yunyou Guan, Xianglong Lu, Xiangjiang Liang, Xiaoshuang Miao, Xiuxia Xie, Jiyue Liu, Wenjing Ma, Li Tang, Suqin Zhang, Zhifei Zhan, Jianfeng The Key Lab of Education Blockchain and Intelligent Technology Ministry of Education The Guangxi Key Laboratory of Multi-Source Information Mining and Security Guangxi Normal University China The School of Electronic and Information Engineering School of Integrated Circuits Guangxi Normal University Guilin530015 China The Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University China The State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing100086 China The Department of Physiology and Pathophysiology Capital Medical University Beijing100069 China The Guilin Medical University Guilin541001 China The Guangxi Key Lab of Multi-Source Information Mining & Security China

Alzheimer’s disease (AD) cannot be reversed, but early diagnosis will significantly benefit patients’ medical treatment and care. In recent works, AD diagnosis has the primary assumption that all categories are known a prior—a closed-set classification problem, which contrasts with the open-set recognition problem. This assumption hinders the application of the model in natural clinical settings. Although many open-set recognition technologies have been proposed in other fields, they are challenging to use for AD diagnosis directly since 1) AD is a degenerative disease of the nervous system with similar symptoms at each stage, and it is difficult to distinguish from its pre-state, and 2) diversified strategies for AD diagnosis are challenging to model uniformly. In this work, inspired by the concerns of clinicians during diagnosis, we propose an open-set recognition model, OpenAPMax, based on the anomaly pattern to address AD diagnosis in real-world settings. OpenAPMax first obtains the abnormal pattern of each patient relative to each known category through statistics or a literature search, clusters the patients’ abnormal pattern, and finally, uses extreme value theory (EVT) to model the distance between each patient’s abnormal pattern and the center of their category and modify the classification probability. We evaluate the performance of the proposed method with recent open-set recognition, where we obtain state-of-the-art results. Copyright © 2023, The Authors. All rights reserved.

关键词： Patient treatment

来源：评论

学校读者我要写书评

暂无评论

Some Sufficient Conditions Under Which a Non-Autonomous Discrete System or Semi-Flow is Sensitive

SSRN

引用

SSRN 2022年

作者： Li, Risong Wang, Hongqing Lu, Tianxiu Li, YongJiang Quan, Weizhen School of Mathematics and Computer Science Guangdong Ocean University Zhanjiang524025 China College of Mathematics and Statistics Sichuan University of Science and Engineering Zigong Sichuan 643000 China Bridge Non-destruction Detecting and Engineering Computing Key Laboratory of Sichuan Province Zigong Sichuan 643000 China Artificial Intelligence Key Laboratory of Sichuan Province Key Laboratory of Higher Education of Sichuan Province for Enterprise Informationalization and Internet of Things Zigong Sichuan 643000 China Department of Mathematics Zhanjiang Preschool Education College Zhanjiang524037 China

In this paper we are concerned withsensitivity for non-autonomous discrete systems and semi-flows. Somesufficient conditions of sensitivity for non-autonomous discretesystems and semi-flows are established, where it is not requiredthat maps and semi-flows are continuous or measure-preserving, andthat spaces are compact. In particular, it is shown that if anon-autonomous discrete system (F1,∞, G) (resp. a semi-flow F) on a nontrivial metric space (G,p) satisfies one of thefollowing two conditions:(1) d(NF1,∞(V,V)) + d(NF1,∞(U,V)) > 1 (resp. d(NF(V,V) + d(NF(U,V)) > 1) for any open sets U,V ⊂ G with U, V ≠ ∅;(2) [[EQUATION]] for any open sets U,V ⊂ G with U, V ≠ ∅,then it is ergodically sensitive, which means that it is sensitive. Our results improve and extend the exiting results. © 2022, The Authors. All rights reserved.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

A 2-bit graphene encoder based on the plasmon-induced transparency effect and its sensing characteristics

引用

Results in Physics 2024年 59卷

作者： Zhu, Aijun Li, Zongteng Hou, Weigang Yang, Xinghua Cheng, Lei Hu, Cong Qiao, Fei Mahapatra, Rabi Guangxi Key Laboratory of Automatic Detecting Technology and Instruments Guilin University of Electronic Technology Guilin 541004 China Shanxi Key Laboratory of Advanced Semiconductor Optoelectronic Devices and Integrated Systems Jincheng Shanxi 048000 China Institute of Intelligent Communication and Network Security Chongqing University of Posts and Telecommunications Chongqing 400000 China College of Science Beijing Forestry University Beijing 100083 China Jincheng Research Institute of Opto-mechatronics Industry Jincheng Shanxi 048000 China Guangxi Key Laboratory of Brain-inspired Computing and Intelligent Chips Guangxi Normal University Guilin 541004 China Department of Electronic Engineering Tsinghua University Beijing 100084 China Department of Computer Science and Engineering Texas A&M University College Station 77843-3112 TX United States

A 2-bit encoder based on the plasmon-induced transparency (PIT) effect was proposed and investigated in the range from 2 to 7 THz. The Lorentz oscillation coupling model was utilized to confirm the simulation. By tuning the Fermi levels of cross1 and cross2, the 2-bit encoder was achieved. And the minimum MD was 94.73 %, the minimum ER was 12.77 dB, and the maximum IL was 0.32 dB. As a sensor, the structure had a sensitivity of up to 2.33 THz/RIU. In addition, due to the insensitivities to incidence angle and polarization angle, the encoder could be utilized to complex environments. Therefore, these results reveals that our work is significant in terahertz encoders, optical switches, sensors, slow light devices, and modulators. © 2024 The Author(s)

关键词： 2-bit encoder Metamaterial Plasmon-induced transparency (PIT) effect Plasmonic-graphene Terahertz (THz)

来源：评论

学校读者我要写书评

暂无评论

A many-objective evolutionary algorithm based on rotation and decomposition

引用

Swarm and Evolutionary Computation 2021年 60卷

作者： Zou, Juan Liu, Jing Yang, Shengxiang Zheng, Jinhua Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University XiangtanHunan411105 China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Information Engineering College of Xiangtan University XiangtanHunan411105 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

Evolutionary algorithms have shown their promise in addressing multiobjective problems (MOPs). However, the Pareto dominance used in multiobjective optimization loses its effectiveness when addressing many-objective problems (MaOPs), which are defined as having more than three objectives. This is because the Pareto dominance loses its ability to distinguish between individuals. In this paper, a many-objective evolutionary algorithm based on rotation and decomposition is proposed (MaOEA-RD) to overcome the shortcoming of insufficient selection pressure caused by the Pareto dominance. First, the coordinates system is rotated and a hyperplane is established to distinguish between the nondominated individuals. Then, a novel individual selection mechanism incorporating decomposition is adopted to maintain the diversity of the population. In order to compensate for the deficiency of the predefined reference vectors, a reference vector adjustment mechanism is proposed. Experimental studies on several well-known benchmark problems show that the proposed algorithm is competitive compared with nine state-of-the-art many-objective algorithms. © 2020 Elsevier B.V.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Detection of Deepfake videos using long distance attention

arXiv

引用

arXiv 2021年

作者： Lu, Wei Liu, Lingyi Luo, Junwei Zhao, Xianfeng Zhou, Yicong Huang, Jiwu School of Computer Science and Engineering Guangdong Province Key Laboratory of Information Security Technology Ministry of Education Key Laboratory of Machine Intelligence and Advanced Computing Sun Yat-sen University Guangzhou510006 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100195 China School of Cyber Security University of Chinese Academy of Sciences Beijing100195 China Department of Computer and Information Science University of Macau 999078 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security Shenzhen University Shenzhen518060 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518055 China

With the rapid progress of deepfake techniques in recent years, facial video forgery can generate highly deceptive video contents and bring severe security threats. And detection of such forgery videos is much more urgent and challenging. Most existing detection methods treat the problem as a vanilla binary classification problem. In this paper, the problem is treated as a special fine-grained classification problem since the differences between fake and real faces are very subtle. It is observed that most existing face forgery methods left some common artifacts in the spatial domain and time domain, including generative defects in the spatial domain and inter-frame inconsistencies in the time domain. And a spatial-temporal model is proposed which has two components for capturing spatial and temporal forgery traces in global perspective respectively. The two components are designed using a novel long distance attention mechanism. The one component of the spatial domain is used to capture artifacts in a single frame, and the other component of the time domain is used to capture artifacts in consecutive frames. They generate attention maps in the form of patches. The attention method has a broader vision which contributes to better assembling global information and extracting local statistic information. Finally, the attention maps are used to guide the network to focus on pivotal parts of the face, just like other fine-grained classification methods. The experimental results on different public datasets demonstrate that the proposed method achieves the state-of-the-art performance, and the proposed long distance attention method can effectively capture pivotal parts for face forgery. Copyright © 2021, The Authors. All rights reserved.

关键词： Time domain analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：