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

Efficient and secure image compression and encryption based on compressive sensing and four-dimensional hyperchaotic system

引用

Information Sciences 2025年 719卷

作者： Ming Yao Hongwei Deng Zhong Chen Pan Zhang College of Computer Science and Technology Hengyang Normal University Hengyang 421002 Hunan China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang 421002 Hunan China Hunan Engineering Research Center of Cyberspace Security Technology and Applications Hengyang 421002 Hunan China National Enterprise Research and Development Center Sunward Intelligent Equipment Co Ltd Changsha 410100 Hunan China

With the growing awareness of privacy protection, the security of image data during network transmission has become a focal point of concern. Reducing computational complexity and improving transmission efficiency while meeting high-security requirements has become a primary focus of current research. To address this, we propose a novel image privacy protection scheme that combines compressive sensing with chaotic encryption, aiming to ensure image privacy and security while enhancing transmission and storage efficiency. We employ compressive sensing technology to achieve efficient compression of image data. Unlike traditional compression and encryption schemes, the proposed method does not require explicit sparsification preprocessing, thereby avoiding the complex operations introduced by signal transformations and simplifying the signal recovery process. To enhance encryption security, a four-dimensional hyperchaotic system with stronger chaotic properties is designed to generate highly random and unpredictable key streams, ensuring the security of the encrypted data. Furthermore, this paper combines disjoint Latin squares with fractal generation strategies to design a new fractal index matrix, based on which a novel image permutation scheme is proposed. This scheme effectively eliminates the linear relationships and correlations between adjacent pixels, achieving global pixel permutation. Coupled with the proposed dual-channel bidirectional diffusion structure, the algorithm effectively diffuses pixel information across the entire image, increasing the complexity and unpredictability of the image encryption process. Experimental results indicate that the proposed algorithm exhibits excellent performance in terms of compression efficiency, encryption effectiveness, and resistance to attacks, providing a highly efficient and reliable solution in the field of image compression and encryption.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Log Data Analysis Management System Based on Hadoop

引用

Journal of Information Hiding and Privacy Protection 2020年第2期2卷 59-65页

作者： Dunhong Yao Yu Chen School of Computer Science and Engineering Huaihua UniversityHuaihua418000China Key Laboratory of Wuling-Mountain Health Big Data Intelligent Processing and Application in Hunan Province Universities Huaihua418000China Key Laboratory of Intelligent Control Technology for Wuling-Mountain Ecological Agriculture in Hunan Province Huaihua418000China School of Computer Science and Engineering Yulin Normal UniversityYulin537000China

With the rapid development of the Internet,many enterprises have launched their network *** users browse,search,and click the products of these platforms,most platforms will keep records of these network behaviors,these records are often heterogeneous,and it is called log *** effectively to analyze and manage these heterogeneous log data,so that enterprises can grasp the behavior characteristics of their platform users in time,to realize targeted recommendation of users,increase the sales volume of enterprises’products,and accelerate the development of ***,we follow the process of big data collection,storage,analysis,and visualization to design the system,then,we adopt HDFS storage technology,Yarn resource management technology,and gink load balancing technology to build a Hadoop cluster to process the log data,and adopt MapReduce processing technology and data warehouse hive technology analyze the log data to obtain the ***,the obtained results are displayed visually,and a log data analysis system is successfully *** has been proved by practice that the system effectively realizes the collection,analysis and visualization of log data,and can accurately realize the recommendation of products by *** system is stable and effective.

关键词： Log data Hadoop data analysis data visualization

来源：评论

学校读者我要写书评

暂无评论

Near-Field Hybrid Beamforming for Extremely Large-Scale (XL)-MIMO Communications

引用

IEEE Transactions on Wireless Communications 2025年

作者： Yang, Songjie Elbir, Ahmet M. Chen, Hua Xiong, Youzhi Zhang, Zhongpei Yuen, Chau University of Electronic Science and Technology of China National Key Laboratory of Wireless Communications Chengdu611731 China Istinye University Department of Electrical and Electronics Engineering Istanbul34396 Turkey at the University of Luxembourg L-1855 Luxembourg Ningbo University Faculty of Electrical Engineering and Computer Science Ningbo315211 China Zhejiang Key Laboratory of Mobile Network Application Technology Ningbo315211 China Sichuan Normal University College of Physics and Electronic Engineering Chengdu610101 China Nanyang Technological University School of Electrical and Electronics Engineering China

As extremely large-scale (XL) arrays advance, near-field (NF) communications have gained significant *** this shift, traditional far-field techniques are being revised for compatibility with new XL NF communication paradigms. This work presents NF hybrid beamforming (NF-HBF) approaches for XL-MIMO, focusing on challenges like near-field effects and spatial non-stationarity. First, it redefines the sparse recovery-based NF-HBF problem, shifting from angular- to polar-domain code-books, leading to direct greedy hybrid beamforming (DG-HBF). However, challenges such as high computational complexity, phase shifter (PS) resolution, and spatial non-stationarities persist. To overcome these, this study proposes stepwise-individual and stepwise-joint greedy HBF methods, namely SIG-HBF and SJG-HBF. These methods simplify the process by approximating spherical-wave beams with planar-wave beams, promising lower PS resolution needs, reduced complexity, and the ability to tackle spatially non-stationary channels. Moreover, by exploring conjugate symmetric sequency-ordered Hadamard transforms, NF-HBF can be efficiently achieved using 2-bit PSs with values in {1,−1, j,−j}, facilitated by the SJG-HBF and SJG-HBF methods. Numerical simulations on the proposed methods demonstrate that DG-HBF can approach NF fully-digital beamforming, while SIG-HBF and SJG-HBF highlight the feasibility of utilizing angular-domain codebooks with low PS cost and low memory storage for NF-HBF. © 2002-2012 IEEE.

关键词： Hadamard transforms

来源：评论

学校读者我要写书评

暂无评论

Gaussian noise removal with exponential functions and spectral norm of weighted hankel matrices

arXiv

引用

arXiv 2020年

作者： Qiu, Tianyu Liao, Wenjing Guo, Di Liu, Dongbao Wang, Xin Qu, Xiaobo Department of Electronic Science Fujian Provincial Key Laboratory of Plasma and Magnetic Resonance Xiamen University Xiamen China School of Mathematics Georgia Institute of Technology AtlantaGA United States School of Computer and Information Engineering Fujian Provincial University Key Laboratory of Internet of Things Application Technology Xiamen University of Technology Xiamen China

Exponential functions are powerful tools to model signals in various scenarios, such as magnetic resonance spectroscopy/ imaging, radar, and concatenative text-to-speech synthesis. Exponential signals, however, are usually corrupted by Gaussian noise in practice, raising difficulties in sequential analysis and quantification of the signals. In this work, we propose a denoising method based on low-rank Hankel matrices for exponential signals corrupted by Gaussian noise. An accurate estimate on the spectral norm of weighted Hankel matrices is provided as a theoretical guidance to set the regularization parameter. The bound can be efficiently calculated since it only depends on the standard deviation of the noise and a constant. Aided by the bound, one can easily obtain a good regularization parameter to produce promising denoised results. Our experiments on simulated and magnetic resonance spectroscopy data demonstrate a superior denoising performance of our proposed approach in comparison with the typical Cadzow and the state-ofthe-art QR decomposition methods, especially in the low signalto-noise ratio regime. Copyright © 2020, The Authors. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Hyper-Parameter-Free Latent Factor Analysis via Adaptive Moment Estimation-Incorporated Particle Swarm Optimization

Hyper-Parameter-Free Latent Factor Analysis via Adaptive Mom...

引用

Cyber-Physical Social Intelligence (ICCSI), International Conference on

作者： Jiufang Chen Ye Yuan Chunlin He School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing China Chinese Academy of Sciences Chongqing Institute of Green and Intelligent Technology Chongqing China Chongqing School University of Chinese Academy of Sciences Chongqing China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Engineering Research Center of Big Data Application for Smart Cities Chongqing China School of Computer Science China West Normal University Nanchong Sichuan China

ISBN: (纸本)9781665426220

A latent factor analysis (LFA) model can efficiently address a high-dimensional and sparse (HiDS) matrix with a stochastic gradient descent (SGD) algorithm. However, an SGD-based LFA model's performance depends heavily on its hyper-parameters. The popular method is based on grid-search, which fails because of expensive computation and time-consuming. Aiming at implementing a hyper-parameter-free LFA model, this study proposes an adaptive moment estimation-incorporated particle swarm optimization (Adam-PSO) algorithm that efficiently addresses the premature issues in a PSO algorithm. With achieved the hyper-parameter adaptation in an SGD-based LFA model, an Adam-PSO-based LFA (APL) model possessing hyper-parameter-free training is further implemented. Empirical studies on four HiDS matrices indicate that compared with state-of-the-art models with hyper-parameter adaptation settings, an APL model achieves the most efficient hyper-parameter-free training and highly competitive prediction accuracy for missing data of an HiDS matrix. Hence, it fits the need of real applications with high scalability and efficiency.

关键词： Training Adaptation models Computational modeling Stochastic processes Predictive models Prediction algorithms Data models

来源：评论

学校读者我要写书评

暂无评论

Assessing the memory ability of recurrent neural networks

arXiv

引用

arXiv 2020年

作者： Zhang, Cheng Li, Qiuchi Hua, Lingyu Song, Dawei Tianjin Key Laboratory of Cognitive Computing and Application Tianjin University Tianjin China Department of Information Engineering University of Padua Padua Italy School of Computer Science Beijing Institute of Technology Beijing China School of Computer Science Beijing Institute of Technology Beijing China

It is known that Recurrent Neural Networks (RNNs) can remember, in their hidden layers, part of the semantic information expressed by a sequence (e.g., a sentence) that is being processed. Different types of recurrent units have been designed to enable RNNs to remember information over longer time spans. However, the memory abilities of different recurrent units are still theoretically and empirically unclear, thus limiting the development of more effective and explainable RNNs. To tackle the problem, in this paper, we identify and analyze the internal and external factors that affect the memory ability of RNNs, and propose a Semantic Euclidean Space to represent the semantics expressed by a sequence. Based on the Semantic Euclidean Space, a series of evaluation indicators are defined to measure the memory abilities of different recurrent units and analyze their limitations. These evaluation indicators also provide a useful guidance to select suitable sequence lengths for different RNNs during training. Copyright © 2020, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

How likely is a random graph shift-enabled?

arXiv

引用

arXiv 2021年

作者： Chen, Liyan Cheng, Samuel Stankovic, Vladimir Stankovic, Lina Key Laboratory of Oceanographic Big Data Mining & Application of Zhejiang Province Zhejiang Ocean University Zhejiang Zhoushan316022 China Department of Computer Science and Technology Tongji University Shanghai201804 China School of Electrical and Computer Engineering University of Oklahoma OK74105 United States Department of Electronic and Electrical Engineering University of Strathclyde GlasgowG1 1XW United Kingdom

The shift-enabled property of an underlying graph is essential in designing distributed filters. This article discusses when a random graph is shift-enabled. In particular, popular graph models Erdős–Rényi (ER), Watts–Strogatz (WS), Barabási–Albert (BA) random graph are used, weighted and unweighted, as well as signed graphs. Our results show that the considered unweighted connected random graphs are shift-enabled with high probability when the number of edges is moderately high. However, very dense graphs, as well as fully connected graphs, are not shift-enabled. Interestingly, this behaviour is not observed for weighted connected graphs, which are always shift-enabled unless the number of edges in the graph is very low. © 2021, CC BY.

关键词： Signal processing

来源：评论

学校读者我要写书评

暂无评论

Video-based point cloud compression artifact removal

arXiv

引用

arXiv 2021年

作者： Akhtar, Anique Gao, Wen Li, Li Li, Zhu Jia, Wei Liu, Shan Department of Computer Science and Electrical Engineering University of Missouri-Kansas City Kansas CityMO64110 United States Tencent America 661 Bryant St. Palo AltoCA94301 United States Department of Computer Science and Electrical Engineering University of Missouri-Kansas City Kansas CityMO64110 United States CAS Key Laboratory of Technology in Geo-Spatial Information Processing and Application System University of Science and Technology of China Hefei230027 China

—Photo-realistic point cloud capture and transmission are the fundamental enablers for immersive visual communication. The coding process of dynamic point clouds, especially video-based point cloud compression (V-PCC) developed by the MPEG standardization group, is now delivering state-of-the-art performance in compression efficiency. V-PCC is based on the projection of the point cloud patches to 2D planes and encoding the sequence as 2D texture and geometry patch sequences. However, the resulting quantization errors from coding can introduce compression artifacts, which can be very unpleasant for the quality of experience (QoE). In this work, we developed a novel out-of-the-loop point cloud geometry artifact removal solution that can significantly improve reconstruction quality without additional bandwidth cost. Our novel framework consists of a point cloud sampling scheme, an artifact removal network, and an aggregation scheme. The point cloud sampling scheme employs a cube-based neighborhood patch extraction to divide the point cloud into patches. The geometry artifact removal network then processes these patches to obtain artifact-removed patches. The artifact-removed patches are then merged together using an aggregation scheme to obtain the final artifact-removed point cloud. We employ 3D deep convolutional feature learning for geometry artifact removal that jointly recovers both the quantization direction and the quantization noise level by exploiting projection and quantization prior. The simulation results demonstrate that the proposed method is highly effective and can considerably improve the quality of the reconstructed point cloud. Copyright © 2021, The Authors. All rights reserved.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Adaptive hybrid projective models for aerial video stitching 6

Adaptive hybrid projective models for aerial video stitching

引用

6th International Conference on Systems and Informatics, ICSAI 2019

作者： Xi, Runping Han, Tianyi Zhang, Yaqing Han, Qianqian Natl. Engineering Laboratory of Integrated Aero-Space-Ground-Ocean Big Data Application Technology Shaanxi Provincial Key Laboratory of Speech Image Information Processing School of Computer Science Northwestern Polytechnical University Xi'an China

ISBN: (纸本)9781728152561

Aerial video stitching has been widely used in many fields such as large-scale videos surveillance, disaster monitoring and unmanned aerial vehicle (UAV) navigation. Ghosting and parallax are challenging problems when the video streams are captured by UAV. This paper presents a novel method based on hybrid projective model which combines local warp alignment and global warp projection for better registration accuracy. The geometric alignment model is used for global registration of images and the content-preserving alignment model is used for local refinement. Simultaneously, reference frame is updated adaptively according to the shift of scenery, which is used to eliminate the cumulative error appearing in long video streams. The proposed approach has been tested under multiple datasets in different scenarios, which shows good performance. © 2019 IEEE.

关键词： Security systems

来源：评论

学校读者我要写书评

暂无评论

Construction and optimization of a file distribution model for all-to-all comparison of big dataset

引用

Ingenierie des Systemes d'Information 2019年第3期24卷 337-342页

作者： Li, Leixiao Gao, Jing Wang, Hui Deng, Dan Lin, Hao College of Data Science and Application Inner Mongolia University of Technology Hohhot010080 China Inner Mongolia Autonomous Region Engineering and Technology Research Center of Big Data Based Software Service Hohhot010080 China College of Computer and Information Engineering Inner Mongolia Agricultural University Hohhot010018 China Inner Mongolia Autonomous Region Key Laboratory of big data research and application for agriculture and animal husbandry Hohhot010018 China

This paper probes into the all-to-all comparison of large dataset, and gives a formal mathematical description of the problem. Then, a multi-objective file distribution model was constructed based on the LP, aiming to localize the data, balance node storage and loads, minimize the storage occupation, and control the occupied storage within the storage limit of each node. To save storage space, the established model was further optimized, and the file distribution algorithm was designed for the distributed environment. Experimental results show that our model and algorithm successfully balanced the storage occupation and loads between computing nodes, and minimized the occupation of node storage. © 2019 International Information and Engineering technology Association. All rights reserved.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：