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

Adversarial multi-image steganography via texture evaluation and multi-scale image enhancement

Multimedia Tools and Applications 2025年第9期84卷 5793-5823页

作者： Li, Fengyong Li, Longwei Zeng, Yishu Yu, Jiang Qin, Chuan College of Computer Science and Technology Shanghai University of Electric Power Shanghai201306 China School of Information and Computer Shanghai Business School Shanghai201400 China School of Optical-Electrical and Computer Engineering University of Shanghai for Science and Technology Shanghai200092 China

Multi-image steganography refers to a data-hiding scheme where a user tries to hide confidential messages within multiple images. Different from the traditional steganography which only requires the security of an individual image, multi-image steganography considers an overall security for a batch of images. However, existing multi-image steganography all faces a nontrivial problem: how to optimally allocate payload into multiple images to guarantee the security of batch images. To address this problem, this paper proposes an adversarial multi-image steganographic scheme. A multi-scale texture evaluation mechanism is firstly calculated to determine the embeddable cover images. Subsequently, a series of multi-scale filters are introduced to enhance the image content, which can be used to guide the optimal payload assignment of each image. Furthermore, an adversarial embedding mechanism is designed by dynamically adjusting the random gradient mapping of batch images, and finally achieving secure multi-image steganography. Our proposed scheme can optimize the overall steganographic security performance of multiple images, while ensuring the anti-steganalysis capability of a single image. Extensive experiments demonstrate that our scheme can achieve superior performance for multi-image steganography over different large-scale image sets, and outperforms state-of-the art schemes in terms of both single-image and multi-image anti-steganalysis capability. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

A topical VAEGAN-IHMM approach for automatic story segmentation

引用

Mathematical Biosciences and engineering 2024年第7期21卷 6608-6630页

作者： Yu, Jia Peng, Huiling Wang, Guoqiang Shi, Nianfeng School of Computer and Information Engineering Luoyang Institute of Science and Technology China Software Research Institute Technological University of Shannon Ireland

Feature representations with rich topic information can greatly improve the performance of story segmentation tasks. VAEGAN offers distinct advantages in feature learning by combining variational autoencoder (VAE) and generative adversarial network (GAN), which not only captures intricate data representations through VAE's probabilistic encoding and decoding mechanism but also enhances feature diversity and quality via GAN's adversarial training. To better learn topical domain representation, we used a topical classifier to supervise the training process of VAEGAN. Based on the learned feature, a segmentor splits the document into shorter ones with different topics. Hidden Markov model (HMM) is a popular approach for story segmentation, in which stories are viewed as instances of topics (hidden states). The number of states has to be set manually but it is often unknown in real scenarios. To solve this problem, we proposed an infinite HMM (IHMM) approach which utilized an HDP prior on transition matrices over countably infinite state spaces to automatically infer the state's number from the data. Given a running text, a Blocked Gibbis sampler labeled the states with topic classes. The position where the topic changes was a story boundary. Experimental results on the TDT2 corpus demonstrated that the proposed topical VAEGAN-IHMM approach was significantly better than the traditional HMM method in story segmentation tasks and achieved state-of-the-art performance. © 2024 the Author(s).

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

A comprehensive survey of visible infrared person re-identification from an application perspective

引用

Multimedia Tools and Applications 2024年第42期83卷 90243-90270页

作者： Chang, Hua Xu, Xin Liu, Wei Lu, Lingyi Li, Weigang School of Computer Science and Technology Wuhan University of Science and Technology Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology Wuhan430065 China School of Information Science and Engineering Wuhan University of Science and Technology Wuhan China

Person re-identification (ReID) is a significant issue in computer vision, aiming to match the same pedestrian across various cameras. Recent research on this issue has successfully reached a satisfactory performance level in the daytime scenario. However, the performance of ReID in low illumination scenarios suffers a dramatic degradation due to the insufficient personal information captured by visible cameras in low or no light scenarios. To address this challenge, the adoption of novel camera technologies for more effective pedestrian data is imperative. Owing to the constraints of distance and usage scenarios in deploying depth cameras, practical infrared cameras are frequently utilized, spurring research in visible infrared person re-identification (VI-ReID). Significant progress has been made in the field of VI-ReID in recent years, but only a few reviews have categorized this problem based on methodology. This article offers a novel perspective by classifying VI-ReID according to application scenarios. Following our categorization scheme, the main advancements in deep learning for VI-ReID over the past five years have been grouped into three categories as follows: retrieval of infrared images using visible images (V→IR), retrieval of visible images using infrared images (IR→V), and joint retrieval of infrared and visible images (V→IR and IR→V). Next, this survey outlines the available datasets and evaluation metrics. After that, we categorize diverse methodologies under the proposed classification and assess their performance metrics across common datasets. Finally, we present two prospective avenues for future research in this domain, informed by the current state of advancement. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Infrared imaging

来源：评论

学校读者我要写书评

暂无评论

DCL-depth: monocular depth estimation network based on iam and depth consistency loss

引用

Multimedia Tools and Applications 2025年第8期84卷 4773-4787页

作者： Han, Chenggong Lv, Chen Kou, Qiqi Jiang, He Cheng, Deqiang The School of Information and Control Engineering China University of Mining and Technology Xuzhou221116 China The School of Computer Science and Technology China University of Mining and Technology Xuzhou221116 China

The self-supervised monocular depth estimation algorithm obtains excellent results in outdoor environments. However, traditional self-supervised depth estimation methods often suffer from edge blurring in complex textured regions and the loss of depth information in pixels within weakly-textured areas. To enhance the perception ability of the deep network for complex textured areas and the accuracy of depth estimation in weakly-textured regions, the following methods are proposed in this paper. First of all, the image activity measure (IAM) is used to segment the image features. Based on the multi-directional distribution of image contours, the network's perception ability has been improved, resulting in effective enhancement of depth estimation in complex regions. Furthermore, a new loss function called depth consistency loss (DCL) is proposed, which is based on recursive recurrent networks. The DCL aims to measure the similarity between the output images of the first-order network and the second-order network, and the network's constraint on weak-texture regions has been strengthened. By employing this approach, the accuracy of estimating depth information in weakly-textured regions can be enhanced. Through adequate experimentation on the public indoor datasets, the results show that our network outperforms the compared algorithms in terms of accuracy and visualization of predicted depth. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Complex Social Networks: Dynamics, Domains, and Dimensions 1

引用

International Conference on Electrical and Electronics engineering, ICEEE 2023

作者： Gera, Suruchi Sinha, Adwitiya Department of Computer Science and Engineering JSS Academy of Technical Education Noida India Department of Computer Science and Engineering and Information Technology Jaypee Institute of Information Technology Noida India

ISBN: (数字)9789819986613

ISBN: (纸本)9789819986606

The online social platforms witnessed enormous growth in its networked structure as users continue to connect and interact through e-social dialogues. This eventually causes the transformational emergence of online social systems into complex networks. These large-scale networks inherently allow social entities to get engaged in diverse forms of interactions, thereby resulting in dynamic and complex user behavior. This raises many distinct challenges in social networks, which requires cross-dimensional analysis of the complex information for societal benefits. Understanding these complex systems has become crucial for analyzing the behavioral characteristics for drawing essential inferences. Analysis and evaluation of social complex networks in the context of several parameters are performed with prerequisites of graph theory, computational statistics, and probabilistic models. Our research provides a review of the evolving challenges in the social domain with case studies being conducted over multiple social systems. The study covers major aspects of social network theory that reveal communities and the impact of the central behavior of users. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

An efficient Quasi-Affine Transformation Evolutionary algorithm with fixed dimension updating and its application in UAV 3D path planning

引用

Journal of Intelligent and Fuzzy Systems 2024年第4期46卷 9755-9781页

作者： Sung, Tien-Wen Zhao, Baohua Zhang, Xin Lee, Chao-Yang Fang, Qingjun Fujian Provincial Key Laboratory of Big Data Mining and Applications College of Computer Science and Mathematics Fujian University of Technology Fuzhou China Department of Computer Science and Information Engineering National Yunlin University of Science and Technology Yunlin Taiwan

Quasi-Affine Transformation Evolutionary (QUATRE) algorithm is a kind of swarm-based collaborative optimization algorithm that solves the problem of a position deviation in a DE search by using the co-evolution matrix M instead of the cross-control parameter CR in the differential evolution algorithm (DE). However, QUATRE shares some of the same weaknesses as DE, such as premature convergence and search stagnation. Inspired by the artificial bee colony algorithm (ABC), we propose a new QUATRE algorithm to improve these problems that ranks all the individuals and evolves only the poorer half of the population. In an evolving population, individuals of different levels intersect with dimensions of different sizes to improve search efficiency and accuracy. In addition, we establish a better selection framework for the parent generation individuals and select more excellent parent individuals to complete the evolution for the individuals trapped in search stagnation. To verify the performance of the new QUATRE algorithm, we divide the comparison algorithm into three groups, including ABC variant group, DE variant group, and QUATRE variant group, and the CEC2014 test suite is used for the comparison. The experimental results show the new QUATRE algorithm performance is competitive. We also successfully apply the new QUATRE algorithm on the 3D path planning of UAV, and compared with the other famous algorithm performance it is still outstanding, which verifies the algorithm's practicability. © 2024 - IOS Press. All rights reserved.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Enhancing Offensive Language Detection with Data Augmentation and Knowledge Distillation

引用

Research 2024年第2期6卷 29-40页

作者： Jiawen Deng Zhuang Chen Hao Sun Zhexin Zhang Jincenzi Wu Satoshi Nakagawa Fuji Ren Minlie Huang The CoAl group DCSTInstitute for Artificial InteligenceState Key Lab of Intelligent Technology and SystemsBeijing National Research Center for Information Science and TechnologyTsinghua UniversityBeijing 100084China Graduate School of Information Science&Technology The University of Tokyo.Tokyo 1138654Japan School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengduSichuan611731China

Offensive language detection has received important attention and plays a crucial role in promoting healthy communication on social platforms,as well as promoting the safe deployment of large language *** data is the basis for developing detectors;however,the available offense-related dataset in Chinese is severely limited in terms of data scale and coverage when compared to English *** significantly affects the accuracy of Chinese offensive language detectors in practical applications,especially when dealing with hard cases or out-of-domain *** alleviate the limitations posed by available datasets,we introduce AugCOLD(Augmented Chinese Offensive Language Dataset),a large-scale unsupervised dataset containing 1 million samples gathered by data crawling and model ***,we employ a multiteacher distillation framework to enhance detection performance with unsupervised *** is,we build multiple teachers with publicly accessible datasets and use them to assign soft labels to *** soft labels serve as a bridge for knowledge to be distilled from both AugCOLD and multiteacher to the student network,i.e.,the final offensive *** conduct experiments on multiple public test sets and our well-designed hard tests,demonstrating that our proposal can effectively improve the generalization and robustness of the offensive language detector.

关键词： COLD dealing limitations

来源：评论

学校读者我要写书评

暂无评论

Simultaneous Wireless information and Power Transfer for STAR-RIS Assisted UAV Networks

引用

IEEE Internet of Things Journal 2025年第12期12卷 19915-19928页

作者： Xie, Wenwu Qin, Lijuan Wang, Ji Wu, Weimin Li, Xingwang Xu, Hongbo Yang, Liang Hunan Institute of Science and Technology School of Information Science and Engineering Yueyang414006 China Central China Normal University Department of Electronics and Information Engineering Wuhan430079 China Huazhong University of Science and Technology School of Electronic Information and Communications Wuhan430074 China Henan Polytechnic University School of Physics and Electronic Information Engineering Jiaozuo454003 China Hunan University College of Computer Science and Electronic Engineering Changsha410082 China

This paper explores the benefits of deploying simultaneously transmitting and reflecting reconfigurable intelligence surfaces (STAR-RIS) in unmanned aerial vehicle (UAV) networks with simultaneous wireless information and power transfer. In the proposed system, the UAV utilizes STAR-RIS to radiate energy-carrying information signals (ECISs) to multiple outdoor energy receivers and multiple indoor information receivers without flying over indoor no-fly zone. Based on the UAV propulsion power formula, we successively introduce fly-hover-broadcast (FHB) and path discretization (PD) protocols to minimize the total UAV energy consumption by jointly using the extended penalty function and optimization algorithm based on the expected value of channel status information, where the UAV flight constraints, no-fly constraint, minimized energy or information threshold constraints, and STAR-RIS phase-shift constraints are met. The FHB protocol, which requires the UAV to radiate the ECISs to the users at only a few hovering positions, provides a lower-bound performance of UAV energy consumption, while the PD protocol is used to discuss the general situation of the ECISs during UAV flight. Simulation results demonstrate that the utilization of the STAR-RIS in UAV networks outperforms the traditional RIS in improving energy efficiency and extending UAV flight time. © 2014 IEEE.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

TISCMB: design of a highly efficient blockchain consensus model with trust integrated self-correcting miner selection

引用

International Journal of information technology (Singapore) 2023年第4期15卷 1845-1858页

作者： Ravi Kumar, Shipra Goyal, Mukta Department of Computer Science Engineering and Information Technology Jaypee Institute of Information Technology Noida India

Blockchain is rapidly becoming the de facto standard for storage applications requiring high transparency, record traceability, immutable data, and distributed processing. Researchers have proposed a large number of such models, including Proof-of-Work (PoW), Proof-of-Stake (PoS), Proof-of-Authority (PoA), etc. Due to their respective limitations, each of these models is applied to context-specific blockchain deployments. In addition, the selection of the most efficient miners for hash calculation and verification is a complex task that must be executed with high efficiency in order to improve network performance. The novel contribution of this work is to design a hybrid consensus model which uses a combination of Proof-of-Work and Proof-of-Stake consensus methods for fast hash computations. Proposed model is supported by a highly efficient trust-based miner selection method that aids in choosing the most optimal miner nodes with low processing delay and high energy efficiency. In addition, this text proposes a self-correcting mechanism for the designed blockchain, which assists in the blockchain's correction in the event of any internal or external attacks. Due to these characteristics, it is observed that the proposed model has 20% less delay, 8% less energy consumption, and 15% higher levels of trust than standard PoS and PoW consensus models. The model was also subjected to various attack scenarios, and it was determined that it is capable of self-correcting the node's internal blockchain with a 99.9% success rate, thereby enhancing its real-time deployment capabilities. © 2023, The Author(s), under exclusive licence to Bharati Vidyapeeth's Institute of computer Applications and Management.

关键词： Blockchain Consensus Delay Energy Self-correcting Trust

来源：评论

学校读者我要写书评

暂无评论

Solving Multi-Objective Vehicle Routing Problems with Time Windows: A Decomposition-Based Multiform Optimization Approach

引用

Tsinghua science and technology 2024年第2期29卷 305-324页

作者： Yiqiao Cai Zifan Lin Meiqin Cheng Peizhong Liu Ying Zhou Xiamen Key Laboratory of Data Security and Blockchain Technology College of Computer Science and TechnologyHuaqiao UniversityXiamen361021China College of Engineering Huaqiao UniversityQuanzhou362000China School of Computer Sciences Shenzhen Institute of Information TechnologyShenzhen518000China

In solving multi-objective vehicle routing problems with time windows (MOVRPTW),most existing algorithms focus on the optimization of a single problem formulation. However,little effort has been devoted to exploiting valuable knowledge from the alternate formulations of MOVRPTW for better optimization performance. Aiming at this insufficiency,this study proposes a decomposition-based multi-objective multiform evolutionary algorithm (MMFEA/D),which performs the evolutionary search on multiple alternate formulations of MOVRPTW simultaneously to complement each other. In particular,the main characteristics of MMFEA/D are three folds. First,a multiform construction (MFC) strategy is adopted to construct multiple alternate formulations,each of which is formulated by grouping several adjacent subproblems based on the decomposition of MOVRPTW. Second,a transfer reproduction (TFR) mechanism is designed to generate offspring for each formulation via transferring promising solutions from other formulations,making that the useful traits captured from different formulations can be shared and leveraged to guide the evolutionary search. Third,an adaptive local search (ALS) strategy is developed to invest search effort on different alternate formulations as per their usefulness for MOVRPTW,thus facilitating the efficient allocation of computational resources. Experimental studies have demonstrated the superior performance of MMFEA/D on the classical Solomon instances and the real-world instances.

关键词： MOVRPTW multiform optimization multiform construction knowledge transfer adaptive local search

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：