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

arXiv 2021年

作者： Wei, Kangkang Luo, Weiqi Tan, Shunquan Huang, Jiwu The Guangdong Key Lab of Information Security Technology School of Computer Science and Engineering Sun Yat-Sen University Guangzhou510006 China The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China The Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China

Up to now, most existing steganalytic methods are designed for grayscale images, and they are not suitable for color images that are widely used in current social networks. In this paper, we design a universal color image steganalysis network (called UCNet) in spatial and JPEG domains. The proposed method includes preprocessing, convolutional, and classification modules. To preserve the steganographic artifacts in each color channel, in preprocessing module, we firstly separate the input image into three channels according to the corresponding embedding spaces (i.e. RGB for spatial steganography and YCbCr for JPEG steganography), and then extract the image residuals with 62 fixed high-pass filters, finally concatenate all truncated residuals for subsequent analysis rather than adding them together with normal convolution like existing CNN-based steganalyzers. To accelerate the network convergence and effectively reduce the number of parameters, in convolutional module, we carefully design three types of layers with different shortcut connections and group convolution structures to further learn high-level steganalytic features. In classification module, we employ a global average pooling and fully connected layer for classification. We conduct extensive experiments on ALASKA II to demonstrate that the proposed method can achieve state-of-the-art results compared with the modern CNN-based steganalyzers (e.g., SRNet and J-YeNet) in both spatial and JPEG domains, while keeping relatively few memory requirements and training time. Furthermore, we also provide necessary descriptions and many ablation experiments to verify the rationality of the network design. Copyright © 2021, The Authors. All rights reserved.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

LSTM-Based Distributed Conditional Generative Adversarial Network For Data-Driven 5G-Enabled Maritime UAV Communications

arXiv

引用

arXiv 2022年

作者： Rasheed, Iftikhar Asif, Muhammad Ihsan, Asim Khan, Wali Ullah Ahmed, Manzoor Rabie, Khaled The Department of Information and Communication Engineering The Islamia University of Bahawalpur Pakistan Guangdong Key Laboratory of Intelligent Information Processing College of Electronics and Information Engineering Shenzhen Univerisyt Guangdong Shenzhen China The Department of Information and Communication Engineering Shanghai Jiao Tong University Shanghai China University of Luxembourg Luxembourg City1855 Luxembourg The College of Computer Science and Technology Qingdao University Qingdao266071 China The Department of Engineering Manchester Metropolitan University United Kingdom The Department of Electrical and Electronic Engineering University of Johannesburg P.O. Box 17011 Doornfontein Johannesburg2028 South Africa

5G enabled maritime unmanned aerial vehicle (UAV) communication is one of the important applications of 5G wireless network which requires minimum latency and higher reliability to support mission-critical applications. Therefore, lossless reliable communication with a high data rate is the key requirement in modern wireless communication systems. These all factors highly depend upon channel conditions. In this work, a channel model is proposed for air-to-surface link exploiting millimeter wave (mmWave) for 5G enabled maritime unmanned aerial vehicle (UAV) communication. Firstly, we will present the formulated channel estimation method which directly aims to adopt channel state information (CSI) of mmWave from the channel model inculcated by UAV operating within the Long Short Term Memory (LSTM)-Distributed Conditional generative adversarial network (DCGAN) i.e. (LSTM-DCGAN) for each beamforming direction. Secondly, to enhance the applications for the proposed trained channel model for the spatial domain, we have designed an LSTM-DCGAN based UAV network, where each one will learn mmWave CSI for all the distributions. Lastly, we have categorized the most favorable LSTM-DCGAN training method and emanated certain conditions for our UAV network to increase the channel model learning rate. Simulation results have shown that the proposed LSTM-DCGAN based network is vigorous to the error generated through local training. A detailed comparison has been done with the other available state-of-the-art CGAN network architectures i.e. stand-alone CGAN (without CSI sharing), Simple CGAN (with CSI sharing), multi-discriminator CGAN, federated learning CGAN and DCGAN. Simulation results have shown that the proposed LSTM-DCGAN structure demonstrates higher accuracy during the learning process and attained more data rate for downlink transmission as compared to the previous state of artworks. Copyright © 2022, The Authors. All rights reserved.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

Size-Invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection

arXiv

引用

arXiv 2024年

作者： Li, Feiran Xu, Qianqian Bao, Shilong Yang, Zhiyong Cong, Runmin Cao, Xiaochun Huang, Qingming Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China School of Control Science and Engineering Shandong University Jinan China Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Sun Yat-Sen University Shenzhen Campus China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD. Copyright © 2024, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Feature-guided Deep Subdomain Adaptation Network for Dataset Mismatch in Spatial Steganalysis

Research Square

引用

Research Square 2021年

作者： Zhang, Lei Wang, Hongxia He, Peisong Abdullahi, Sani M. Li, Bin School of Cyber Science and Engineering Sichuan University Chengdu610065 China College of Computer and Information Technology China Three Gorges University Yichang443002 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen Key Laboratory of Media Security Shenzhen518060 China

Steganalysis aims to detect covert communication established via steganography. In recent years, numerous deep learning-based image steganalysis methods with high performance have been proposed. However, these methods tend to suffer from distinct performance degradation when cover images in the train and test set are quite different, also known as cover source mismatch. To address this limitation, in this paper, a feature-guided deep subdomain adaptation network is proposed. Initially, the predictions of the pretrained model are used as pseudo labels to divide the unlabeled samples of the target domain into different subdomains, and the distributions of the relevant subdomains are aligned by subdomain adaptation. Afterwards, since the steganalysis model may assign incorrect predictions to samples in the target domain, we integrate guiding features to make the division of subdomains more precise. The experimental results show that the proposed network is significantly better than other three networks such as Steganalysis Residual Network (SRNet), deep adaptive network (J-Net) and Deep Subdomain Adaptation Network (DSAN), when it is used to detect three spatial steganographic algorithms with a wide variety of datasets and payloads. Especially, compared with SRNet, the average accuracy of our method is increased by 5.4% at 0.4bpp and 8.5% at 0.2bpp in the case of dataset mismatch. © 2021, CC BY.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

ER: Equivariance Regularizer for Knowledge Graph Completion

arXiv

引用

arXiv 2022年

作者： Cao, Zongsheng Xu, Qianqian Yang, Zhiyong Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China

Tensor factorization and distanced based models play important roles in knowledge graph completion (KGC). However, the relational matrices in KGC methods often induce a high model complexity, bearing a high risk of overfitting. As a remedy, researchers propose a variety of different regularizers such as the tensor nuclear norm regularizer. Our motivation is based on the observation that the previous work only focuses on the "size" of the parametric space, while leaving the implicit semantic information widely untouched. To address this issue, we propose a new regularizer, namely, Equivariance Regularizer (ER), which can suppress overfitting by leveraging the implicit semantic information. Specifically, ER can enhance the generalization ability of the model by employing the semantic equivariance between the head and tail entities. Moreover, it is a generic solution for both distance based models and tensor factorization based models. The experimental results indicate a clear and substantial improvement over the state-of-the-art relation prediction methods. © 2022, CC BY.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Geometry Interaction Knowledge Graph Embeddings

arXiv

引用

arXiv 2022年

作者： Cao, Zongsheng Xu, Qianqian Yang, Zhiyong Cao, Xiaochun Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Peng Cheng Laboratory Shenzhen China

Knowledge graph (KG) embeddings have shown great power in learning representations of entities and relations for link prediction tasks. Previous work usually embeds KGs into a single geometric space such as Euclidean space (zero curved), hyperbolic space (negatively curved) or hyperspherical space (positively curved) to maintain their specific geometric structures (e.g., chain, hierarchy and ring structures). However, the topological structure of KGs appears to be complicated, since it may contain multiple types of geometric structures simultaneously. Therefore, embedding KGs in a single space, no matter the Euclidean space, hyperbolic space or hyperspheric space, cannot capture the complex structures of KGs accurately. To overcome this challenge, we propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces. Theoretically, our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities. Experimental results on three well-established knowledge graph completion benchmarks show that our GIE achieves the state-of-the-art performance with fewer parameters. © 2022, CC BY.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

The minority matters: a diversity-promoting collaborative metric learning algorithm 22

The minority matters: a diversity-promoting collaborative me...

引用

Proceedings of the 36th International Conference on Neural information processing Systems

作者： Shilong Bao Qianqian Xu Zhiyong Yang Yuan He Xiaochun Cao Qingming Huang State Key Laboratory of Information Security 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 Technology CAS School of Computer Science and Tech. University of Chinese Academy of Sciences Alibaba Group School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Laboratory of Big Data Mining and Knowledge Management CAS and Peng Cheng Laboratory

ISBN: (纸本)9781713871088

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a Diversity Control Regularization Scheme (DCRS) to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robust Minimum Geometric Power Distortionless Response Beamforming with Sparse Constraint in Heavy-tailed Noise of Unknown Statistics

Robust Minimum Geometric Power Distortionless Response Beamf...

引用

2019 IEEE International Conference on Signal, information and Data processing, ICSIDP 2019

作者： Wang, Xiaoye Yang, Zhaocheng Huang, Jianjun College of Electronics and Information Engineering Shenzhen University Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China

ISBN: (纸本)9781728123455

For impulsive noise environment, the adaptive beamformers based on second-order statistics often degrade severely. In this paper, a robust minimum geometric power distortionless response beamforming with sparse constraint is presented for arbitrary algebraically tailed impulsive signal of unknown statistics. The impulsive signal does not have finite second-order and higher order moments due to its property of heavy tails. Unlike the majority of the existing beamformers based on the second-order statistics, the proposed beamforming method minimizes a constrained mixed geometric power and l{1}-norm optimization problem. The geometric power effectively characterizes the process strength of the algebraically tailed distribution, while the l{1}-norm regularized term enforces the sparsity of the beam pattern. Therefore, the proposed algorithm can provide the potential for improved beamforming capability in the presence of impulse signals. Moreover, two adaptive algorithms, namely, the stochastic gradient (LMS)-based and the recursive least-squares (RLS)-based algorithms, are derived to solve the formulated optimization problem. Additionally, computational complexity analysis is conducted and shows that a comparable complexity between the proposed algorithms and the existing tailed impulsive beamformers. Simulation cases without and with mutual coupling are considered to illustrate that the proposed algorithms are more robust than other popular adaptive beamformers for impulsive signals. © 2019 IEEE.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Neuron segmentation using 3D wavelet integrated encoder-decoder network

arXiv

引用

arXiv 2021年

作者： Li, Qiufu Shen, Linlin Computer Vision Institute College of Computer Science and Software Engineering Shen zhen University Shenzhen518060 China AI Research Center for Medical Image Analysis and Diagnosis Shenzhen University Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China Marshall Laboratory of Biomedical Engineering Shenzhen University Shenzhen518060 China

Motivation: 3D neuron segmentation is a key step for the neuron digital reconstruction, which is essential for exploring brain circuits and understanding brain functions. However, the fine line-shaped nerve fibers of neuron could spread in a large region, which brings great computational cost to the neuron segmentation. Meanwhile, the strong noises and disconnected nerve fibers bring great challenges to the task. Results: In this paper, we propose a 3D wavelet and deep learning based 3D neuron segmentation method. The neuronal image is first partitioned into neuronal cubes to simplify the segmentation task. Then, we design 3D WaveUNet, the first 3D wavelet integrated encoder-decoder network, to segment the nerve fibers in the cubes;the wavelets could assist the deep networks in suppressing data noises and connecting the broken fibers. We also produce a Neuronal Cube Dataset (NeuCuDa) using the biggest available annotated neuronal image dataset, BigNeuron, to train 3D WaveUNet. Finally, the nerve fibers segmented in cubes are assembled to generate the complete neuron, which is digitally reconstructed using an available automatic tracing algorithm. The experimental results show that our neuron segmentation method could completely extract the target neuron in noisy neuronal images. The integrated 3D wavelets can efficiently improve the performance of 3D neuron segmentation and reconstruction. © 2021, CC BY.

关键词： Neurons

来源：评论

学校读者我要写书评

暂无评论

AIM 2024 Challenge on Video Saliency Prediction: Methods and Results

arXiv

引用

arXiv 2024年

作者： Zhan, Gen Yang, Li Tang, Yunlong Liao, Yiting Lin, Jiongzhi Huang, Baitao Moradi, Morteza Moradi, Mohammad Rundo, Francesco Spampinato, Concetto Borji, Ali Palazzo, Simone Zhu, Yuxin Sun, Yinan Duan, Huiyu Cao, Yuqin Jia, Ziheng Hu, Qiang Min, Xiongkuo Zhai, Guangtao Fang, Hao Cong, Runmin Lu, Xiankai Zhou, Xiaofei Zhang, Wei Zhao, Chunyu Mu, Wentao Deng, Tao Tavakoli, Hamed R. Moskalenko, Andrey Bryncev, Alexey Vatolin, Dmitry Timofte, Radu ByteDance China ByteDance United States University of Rochester United States College of Electronic and Information Engineering Shenzhen University China Shenzhen Key Laboratory of Digital Creative Technology China Guangdong Key Laboratory of Intelligent Information Processing China University of Catania Italy STMicrolectronics ADG Central R&D Italy Quintic AI San Francisco United States Shanghai Jiao Tong University China School of Control Science and Engineering Shandong University China School of Software Shandong University China School of Automation Hangzhou Dianzi University China School of Information Science and Technology Southwest Jiaotong University China Nokia Technologies Finland Lomonosov Moscow State University Russia AIRI Moscow Russia MSU Institute for Artificial Intelligence Russia University of Würzburg Germany

This paper reviews the Challenge on Video Saliency Prediction at AIM 2024. The goal of the participants was to develop a method for predicting accurate saliency maps for the provided set of video sequences. Saliency maps are widely exploited in various applications, including video compression, quality assessment, visual perception studies, the advertising industry, etc. For this competition, a previously unused large-scale audio-visual mouse saliency (AViMoS) dataset of 1500 videos with more than 70 observers per video was collected using crowdsourced mouse tracking. The dataset collection methodology has been validated using conventional eye-tracking data and has shown high consistency. Over 30 teams registered in the challenge, and there are 7 teams that submitted the results in the final phase. The final phase solutions were tested and ranked by commonly used quality metrics on a private test subset. The results of this evaluation and the descriptions of the solutions are presented in this report. All data, including the private test subset, is made publicly available on the challenge homepage - https://***/challenges/***. © 2024, CC BY.

关键词： Video analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：