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

arXiv 2024年

作者： Jiang, Feibo Peng, Yubo Dong, Li Wang, Kezhi Yang, Kun Pan, Cunhua You, Xiaohu Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China School of Information Science and Engineering Hunan Normal University Changsha China Changsha Social Laboratory of Artificial Intelligence Hunan University of Technology and Business Changsha China The Department of Computer Science Brunel University London United Kingdom The School of Computer Science and Electronic Engineering University of Essex ColchesterCO4 3SQ United Kingdom Changchun Institute of Technology China The National Mobile Communications Research Laboratory Southeast University Nanjing210096 China The Frontiers Science Center for Mobile Information Communication and Security National Mobile Communications Research Laboratory Southeast University Nanjing China The Purple Mountain Laboratories Nanjing China

Semantic Communication (SC) is a novel paradigm for data transmission in 6G. However, there are several challenges posed when performing SC in 3D scenarios: 1) 3D semantic extraction;2) Latent semantic redundancy;and 3) Uncertain channel estimation. To address these issues, we propose a Generative AI Model assisted 3D SC (GAM-3DSC) system. Firstly, we introduce a 3D Semantic Extractor (3DSE), which employs generative AI models, including Segment Anything Model (SAM) and Neural Radiance Field (NeRF), to extract key semantics from a 3D scenario based on user requirements. The extracted 3D semantics are represented as multi-perspective images of the goal-oriented 3D object. Then, we present an Adaptive Semantic Compression Model (ASCM) for encoding these multi-perspective images, in which we use a semantic encoder with two output heads to perform semantic encoding and mask redundant semantics in the latent semantic space, respectively. Next, we design a conditional Generative adversarial network and Diffusion model aided-Channel Estimation (GDCE) to estimate and refine the Channel State information (CSI) of physical channels. Finally, simulation results demonstrate the advantages of the proposed GAM-3DSC system in effectively transmitting the goal-oriented 3D scenario. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Solving linear Bayesian inverse problems using a fractional total variation-Gaussian (FTG) prior and transport map

arXiv

引用

arXiv 2021年

作者： Sun, Zejun Zheng, Guang-Hui College of Mathematics Hunan University Changsha410082 China College of Mathematics Hunan Provincial Key Laboratory of Intelligent Information Processing and Applied Mathematics Hunan University Changsha410082 China

The Bayesian inference is widely used in many scientific and engineering problems, especially in the linear inverse problems in infinite-dimensional setting where the unknowns are functions. In such problems, choosing an appropriate prior distribution is an important task. In particular, when the function to infer has much detail information, such as many sharp jumps, corners, and the discontinuous and nonsmooth oscillation, the so-called total variation-Gaussian (TG) prior is proposed in function space to address it. However, the TG prior is easy to lead the blocky (staircase) effect in numerical results. In this work, we present a fractional order-TG (FTG) hybrid prior to deal with such problems, where the fractional order total variation (FTV) term is used to capture the detail information of the unknowns and simultaneously uses the Gaussian measure to ensure that it results in a well-defined posterior measure. For the numerical implementations of linear inverse problems in function spaces, we also propose an efficient independence sampler based on a transport map, which uses a proposal distribution derived from a diagonal map, and the acceptance probability associated to the proposal is independent of discretization dimensionality. And in order to take full advantage of the transport map, the hierarchical Bayesian framework is applied to flexibly determine the regularization parameter. Finally we provide some numerical examples to demonstrate the performance of the FTG prior and the efficiency and robustness of the proposed independence sampler method. Copyright © 2021, The Authors. All rights reserved.

关键词： Differential equations

来源：评论

学校读者我要写书评

暂无评论

Improved Security for Android System based on Multi-Chaotic Maps using a Novel Image Encryption Algorithm

引用

International Journal of Performability Engineering 2019年第6期15卷 1692-1701页

作者： Jiao, Ge Li, Lang Zou, Yi College of Computer Science and Technology Hengyang Normal University Hengyang421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China

Aimed at the unsatisfactory effect of security in mobile cloud computing, we propose a novel image encryption algorithm by using the Improved Fruit Fly Optimization Algorithm-Artificial Bee Colony (hereafter referred to as IFOA-ABC). First, the feature of task scheduling function in mobile cloud computing is described to set up the task scheduling function;second, the population of fruit fly optimization algorithm is initialized by using orthogonal array and quantitative techniques, and the boundary of fruit fly optimization algorithm is processed, the step size in search is adjusted dynamically, and the artificial bee colony algorithm is used to help fruit fly optimization algorithm develop the global optimal solution;in the simulation experiment, the IFOA-ABC algorithm has obvious advantages over other intelligent algorithms in the comparison of four indicators of mobile cloud task scheduling, which means that the proposed algorithm can effectively improve the privacy and efficiency of cloud computing scheduling. © 2019 Totem Publisher, Inc. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

COMPOSITION OPERATORS ON BLOCH AND HARDY TYPE SPACES

arXiv

引用

arXiv 2022年

作者： Chen, Shaolin Hamada, Hidetaka Zhu, Jian-Feng College of Mathematics and Statistics Hengyang Normal University Hunan Hengyang421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application 421002 China Faculty of Science and Engineering Kyushu Sangyo University 3-1 Matsukadai 2-Chome Higashi-Ku Fukuoka813-8503 Japan School of Mathematical Sciences Huaqiao University Quanzhou362021 China

The main purpose of this paper is to discuss Hardy type spaces, Bloch type spaces and the composition operators of complex-valued harmonic functions. We first establish a sharp estimate of the Lipschitz continuity of complex-valued harmonic functions in Bloch type spaces with respect to the pseudo-hyperbolic metric, which gives an answer to an open problem. Then some classes of composition operators on Bloch and Hardy type spaces will be investigated. The obtained results improve and extend some corresponding known *** Codes 31A05, 47B33, 30H10, 30H30 Copyright © 2022, The Authors. All rights reserved.

关键词： Harmonic functions

来源：评论

学校读者我要写书评

暂无评论

On Fixed-Order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering 14th

On Fixed-Order Book Thickness Parameterized by the Pathwidth...

引用

14th International Conference on Algorithmic Aspects in information and Management, AAIM 2020

作者： Liu, Yunlong Chen, Jie Huang, Jingui Wang, Jianxin Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China School of Computer Science and Engineering Central South University Changsha410083 China

ISBN: (纸本)9783030576011

Given a graph (Formula Presented) and a fixed linear order (Formula Presented) of V, the problem fixed-order book thickness asks whether there is a page assignment (Formula Presented) such that (Formula Presented) is a k-page book embedding of G. Recently, Bhore et al.(GD2019) presented an algorithm parameterized by the pathwidth of the vertex ordering (denoted by (Formula Presented)). In this paper, we first re-analyze the running time for Bhore et al.’s algorithm, and prove a bound of (Formula Presented) improving on Bhore et al.’s bound of (Formula Presented). We further show that this parameterized problem does not admit a polynomial kernel unless NP (Formula Presented) coNP/poly. Finally, we show that the general fixed-order book thickness problem, in which a budget of at most c crossings over all pages was given, admits an algorithm running in time (Formula Presented). © 2020, Springer Nature Switzerland AG.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Efficient Match Pair Retrieval for Large-scale UAV Images via Graph Indexed Global Descriptor

arXiv

引用

arXiv 2023年

作者： Jiang, San Ma, Yichen Li, Qingquan Jiang, Wanshou Guo, Bingxuan Li, Lelin Wang, Lizhe The School of Computer Science China University of Geosciences Wuhan430074 China Shenzhen518060 China The Hubei Key Laboratory of Intelligent Geo-Information Processing China University of Geosciences Wuhan430078 China The College of Civil and Transportation Engineering Shenzhen University Shenzhen518060 China The State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University Wuhan430072 China The Provincial Key Laboratory of Geo-information Engineering in Surveying Mapping and Remote Sensing Hunan University of Science and Technology Xiangtan411201 China

SfM (Structure from Motion) has been extensively used for UAV (Unmanned Aerial Vehicle) image orientation. Its efficiency is directly influenced by feature matching. Although image retrieval has been extensively used for match pair selection, high computational costs are consumed due to a large number of local features and the large size of the used codebook. Thus, this paper proposes an efficient match pair retrieval method and implements an integrated workflow for parallel SfM reconstruction. First, an individual codebook is trained online by considering the redundancy of UAV images and local features, which avoids the ambiguity of training codebooks from other datasets. Second, local features of each image are aggregated into a single high-dimension global descriptor through the VLAD (Vector of Locally Aggregated Descriptors) aggregation by using the trained codebook, which remarkably reduces the number of features and the burden of nearest neighbor searching in image indexing. Third, the global descriptors are indexed via the HNSW (Hierarchical Navigable Small World) based graph structure for the nearest neighbor searching. Match pairs are then retrieved by using an adaptive threshold selection strategy and utilized to create a view graph for divide-and-conquer based parallel SfM reconstruction. Finally, the performance of the proposed solution has been verified using three large-scale UAV datasets. The test results demonstrate that the proposed solution accelerates match pair retrieval with a speedup ratio ranging from 36 to 108 and improves the efficiency of SfM reconstruction with competitive accuracy in both relative and absolute orientation. © 2023, CC BY.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Decomposed Neural Architecture Search for image denoising

引用

Applied Soft Computing 2022年 124卷

作者： Li, Di Bai, Yunpeng Bai, Zongwen Li, Ying Shang, Changjing Shen, Qiang School of Computer Science National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Shaanxi Provincial Key Laboratory of Speech & Image Information Processing Northwestern Polytechnical University Xi'an710129 China Department of Computer Science Faculty of Business and Physical Sciences Aberystwyth University AberystwythSY233DB United Kingdom Shaanxi Key Laboratory of Intelligent Processing for Big Energy Data School of Physics and Electronic Information Yan'an University Yan'an716000 China

In practical applications of deep learning, as the demand for the modeling capability increases, the network size may need to be massively enlarged in response. This may form a significant challenge in practice, especially when facing the dilemma of limited computational resources, making model compression indispensable. It can be time-consuming and interminable to obtain an appropriate network architecture through manual compression. In this paper, we propose an automated method for searching decomposed network architectures, named DNAS (standing for Decomposed Neural Architecture Search). It integrates both tasks of neural architecture search and tensor decomposition based model compression within a unified framework. The method is able to efficiently find a compact network with high performance for image denoising, with respect to memory and runtime. Particularly, using one single V100 GPU, it only takes about 1.5 h to obtain a denoising network on the BSD500 dataset. Experimental results demonstrate that compared with models developed using existing methods, DNAS consumes significantly less inference time and employs much fewer trainable parameters, outperforming existing approaches on both synthetic and real-world denoising datasets. © 2022 Elsevier B.V.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Large AI Model-Based Semantic Communications

arXiv

引用

arXiv 2023年

作者： Jiang, Feibo Peng, Yubo Dong, Li Wang, Kezhi Yang, Kun Pan, Cunhua You, Xiaohu Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China School of Information Science and Engineering Hunan Normal University Changsha China Changsha Social Laboratory of Artificial Intelligence Hunan University of Technology and Business Changsha China Department of Computer Science Brunel University London United Kingdom School of Computer Science and Electronic Engineering University of Essex ColchesterCO4 3SQ United Kingdom Changchun Institute of Technology China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China

Semantic communication (SC) is an emerging intelligent paradigm, offering solutions for various future applications like metaverse, mixed reality, and the Internet of Everything. However, in current SC systems, the construction of the knowledge base (KB) faces several issues, including limited knowledge representation, frequent knowledge updates, and insecure knowledge sharing. Fortunately, the development of the large AI model (LAM) provides new solutions to overcome the above issues. Here, we propose a LAM-based SC framework (LAM-SC) specifically designed for image data, where we first apply the segment anything model (SAM)-based KB (SKB) that can split the original image into different semantic segments by universal semantic knowledge. Then, we present an attention-based semantic integration (ASI) to weigh the semantic segments generated by SKB without human participation and integrate them as the semanticaware image. Additionally, we propose an adaptive semantic compression (ASC) encoding to remove redundant information in semantic features, thereby reducing communication overhead. Finally, through simulations, we demonstrate the effectiveness of the LAM-SC framework and the possibility of applying the LAM-based KB in future SC paradigms. Copyright © 2023, The Authors. All rights reserved.

关键词： Latent semantic analysis

来源：评论

学校读者我要写书评

暂无评论

The Optimal Implementation of Khudra Lightweight Block Cipher

The Optimal Implementation of Khudra Lightweight Block Ciphe...

引用

作者： Xiantong Huang Lang Li Ying Guo College of Computer Science and Technology Hengyang Normal University Hunan Provincial Key Laboratory of Intelligent Information Processing and Application

In this paper,we discuss the area and speed balance optimization of Khudra lightweight block *** are three major ***,because the whole structure of the Khudra block cipher and its F-function are based on a Feistel structure,we make the main module directly call the Ffunction in the hardware optimization ***,through the clock control,the plaintext can be XORed with the key and the round constant under certain *** the same time,the 3 rounds of the F-function are merged into one module,whose F-function module contains the F-function of the left and right branches of the ***,three rounds of operations can be completed with only one S-box,which can effectively reduce the number of registers and the number of iterations to increase the encryption and decryption ***,because of the particularity of key expansion in Khudra,we separately calculated the round key and stored its results in the register,which can effectively save the time of key expansion.

关键词： Lightweight block cipher Khudra Optimization FPGA implementation

来源：评论

学校读者我要写书评

暂无评论

An Optimized Scheme of information Hiding-Based Visual Secret Sharing

An Optimized Scheme of Information Hiding-Based Visual Secre...

引用

作者： Yi Zou Lang Li Ge Jiao College of Computer Science and Technology Hengyang Normal University Hunan Provincial Key Laboratory of Intelligent Information Processing and Application

information hiding-based visual secret sharing(IH-VSS) uses the information hiding techniques to embed secret data into *** the IH-VSS scheme,hidden images are divided into n shadows under the guidance and constraints of some predetermined methods,and only a certain number or all of the credible shadows work together to recover hidden *** on(2,2)-threshold IH-VSS scheme,this paper proposes an optimized IH-VSS scheme,it can randomly locate the hidden position of the secret *** set a random number and use it as the initial hiding position,then combined with the length of the secret data,assigns the address,and completes the hiding of the secret *** experimental results show that,under the same embedding capacity,the peak signal-to-noise ratio(PSNR) of the optimized scheme is higher than other similar schemes,which is high to 55.41 ***,the difference between the two shadows is very small.

关键词： IH-VSS Reference matrix Random position

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：