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

International Conference on Advanced Infocomm Technology (ICAIT)

作者： Alberto Pepe H.Y. Fu Xin Liu Faisal Nadeem Khan Tsinghua-Berkeley Shenzhen Institute Shenzhen P.R. China The Hong Kong Polytechnic University Kowloon Hong Kong

ISBN: (数字)9781728183848

ISBN: (纸本)9781728183855

We propose a digital transmission system guaranteeing both encryption and compression of multimedia data. Encryption is performed via chaotic compressive sensing, while compression is ensured via latent vector transmission based on a stacked autoencoder (StAE). We demonstrated successful compression in eight cases up to a 0.03 compression ratio corresponding to 80 pixels transmitted. A compression ratio below 0.4 with StAE can achieve peak signal-to-noise ratio (PSNR) and mutual information (MI) between original and reconstructed images comparable to compression ratios between 0.6 to 0.8 without StAE, meaning same performances for about half of the pixels. Moreover, StAE can guarantee at least a 78,4% slower decrease of PSNR per pixel transmitted and at least 81.3% slower decrease of MI per pixel, averaging at 81.6% and 93.96%, respectively, for the four tested images. StAE can hence push the compression ratio of secure multimedia data while preserving the quality of the received image at receiver side.

关键词： Image coding Image reconstruction Encryption Compressed sensing Receivers pursuit algorithms Systems architecture

来源：评论

学校读者我要写书评

暂无评论

Bayesian stagewise week conjugate gradient pursuit algorithm for sparse signal reconstruction

Bayesian stagewise week conjugate gradient pursuit algorithm...

引用

International Conference on Systems and Informatics (ICSAI)

作者： Wei Gan Hongye Li Rong Jiao School of Electronic Engineering Xian Shi you University Xi'an China

ISBN: (数字)9781728152561

ISBN: (纸本)9781728152578

A directional pursuit algorithm is proposed to reconstruct an unknown sparse signal from noisy measurements. The algorithm offered an iterative update direction for improving the reconstructive accuracy of compressive sensing. Unlike traditional directional pursuit methods which only select the atoms owning higher correlation with the residual signal, the proposed algorithm not only values the higher correlation atoms but also reserves the lower correlation atoms with the residual signal. In the lower correlation atoms, only a few are active which usually impact the reconstructive performance and decide the reconstruction dynamic range of directional pursuit methods. The others are inactive. In order to avoid redundant atoms impacting the reconstructive accuracy, Bayesian hypothesis testing model is used to identify active atoms and eliminate redundant ones. Simulation results of the proposed algorithm show that the reconstructive accuracy and reconstructive dynamic range can indeed be improved. Furthermore, better noisy immunity compared with the traditional directional pursuit methods can be obtained.

关键词： Bayes methods Matching pursuit algorithms pursuit algorithms Image reconstruction Correlation Dynamic range Noise measurement

来源：评论

学校读者我要写书评

暂无评论

A greedy pursuit algorithm for separating signals from nonlinear compressive observations

A greedy pursuit algorithm for separating signals from nonli...

引用

2018 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2018

作者： Chin, Sang Peter Tran, Trac D. Tran, Dung Rangamani, Akshay Department of Computer Science Boston University BostonMA United States Electrical and Computer Engineering Department Johns Hopkins University BaltimoreMD United States

ISBN: (纸本)9781538646588

In this paper we study the unmixing problem which aims to separate a set of structured signals from their superposition. In this paper, we consider the scenario in which the mixture is observed via nonlinear compressive measurements. We present a fast, robust, greedy algorithm called Unmixing Matching pursuit (UnmixMP) to solve this problem. We prove rigorously that the algorithm can recover the constituents from their noisy nonlinear compressive measurements with arbitrarily small error. We compare our algorithm to the Demixing with Hard Thresholding (DHT) algorithm [1], in a number of experiments on synthetic and real data. © 2018 IEEE.

关键词： Dictionaries Matching pursuit algorithms Signal processing algorithms pursuit algorithms Sensors Convergence Robustness"

来源：评论

学校读者我要写书评

暂无评论

Computational Task Offloading in Mobile Edge Computing using Learning Automata

Computational Task Offloading in Mobile Edge Computing using...

引用

IEEE/CIC International Conference on Communications in China (ICCC)

作者： Abbas, Zahir Li, Jun Yadav, Nagendra Tariq, Irfan Nanjing Univ Sci & Technol Sch Elect & Opt Engn Nanjing 210094 Jiangsu Peoples R China

ISBN: (纸本)9781538670057

The widespread diffusion of mobile devices is triggering an exponential growth of mobile data causing an offloading problem. In this paper, a model has been proposed to investigate computing task offloading problem of small base stations (SBSs). We formulate an optimization problem to minimize utility function for energy and execution time consumptions, where mobile devices (MDs) can select local computation or offloading to SBSs. We use discrete generalist pursuit algorithm (DGPA) based on learning automata (LA) to optimize the computation allocation. First, we examine a faster-converging of discrete generalist pursuit algorithm (DGPA) for LA is based on the concept of conditional inaction discrete generalist pursuit algorithm (CIDGPA). Then, we design a reward function for the selection of optimal allocation of SBSs with minimum offloading latency. After convergence to optimal allocation, the offloading computing task of MDs has been performed to SBSs with minimum weighted sum of time and energy consumption. Finally, numerical results demonstrate the best improvement of DGPA algorithm.

关键词： Mobile handsets Task analysis Resource management Energy consumption pursuit algorithms Servers Learning automata

来源：评论

学校读者我要写书评

暂无评论

Research on Compressed Sensing DOA Estimation Based on Priori Space Sparsity of Information Theory

Research on Compressed Sensing DOA Estimation Based on Prior...

引用

International Conference on Electronic Engineering and Informatics (EEI)

作者： Yang Jing Qing Wang Li-ting Wang Wei Zhu China Shipbuilding Industry Corporation Hangzhou China

ISBN: (纸本)9781728140773

Using spatial sparsity of array signal, compressed sensing technology can be used to model DOA estimation. The matching pursuit algorithm of classical greedy orthogonal is used to solve the problem. However, this algorithm must take spatial sparsity of signal that the number of sources of spatial array signal as a prior condition to accurately estimate multiple DOAs. The AIC and MDL criteria based on information theory are adopted to estimate the spatial sparsity in this paper, and spatial sparse distribution of equal sinusoid is used. Finally better MDL criteria and greedy orthogonal matching pursuit algorithm are combined to solve the problem. The simulation results show that the better performance of direction estimation can be obtained under multiple snapshot data model.

关键词： array signal processing compressed sensing direction-of-arrival estimation greedy algorithms iterative methods Direction of arrival estimation Compressed sensing greedy algorithm array signal processing Information Theory iterative methods pursuit algorithms Matching pursuit algorithms

来源：评论

学校读者我要写书评

暂无评论

Topologically distinct trajectory predictions for probabilistic pursuit

Topologically distinct trajectory predictions for probabilis...

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) / Workshop on Machine Learning Methods for High-Level Cognitive Capabilities in Robotics

作者： Shkurti, Florian Dudek, Gregory McGill Univ Sch Comp Sci Montreal PQ Canada McGill Univ Ctr Intelligent Machines Montreal PQ Canada

ISBN: (纸本)9781538626825

We address the integrated planning and control problem that enables a single follower robot (the "photographer") to maintain a moving target (the "subject") in its field of view for as long as possible. We propose a real-time pursuit algorithm that seamlessly handles the often neglected, yet unavoidable, scenario in which the target escapes the follower's field of view;a scenario that simple, reactive controllers are ill-equipped to handle. Our algorithm aims to minimize the expected time until visual contact is re-established, which enables the photographer to track the subject for as long as possible, even in the presence of loss of visibility. At the core of our pursuit algorithm is an efficient method for sampling plausible trajectories from different homotopy classes. We do this by generating topologically distinct shortest paths by using the Voronoi diagram. We use these paths to make informed, model-based predictions of the likely future locations of the target, given a history of observations. Given these predictions, our algorithm produces pursuit trajectories that approximately minimize the expected time to recover visual contact. We show that constraining the predictive pursuit problem to the space of homotopy classes condenses the expanse of possibilities that our algorithm must consider, which enables target tracking in large occupancy grids, as opposed to many POMDP methods that are constrained to small environments. We benchmark the tracking behavior of our algorithm against the baseline of human subjects who performed the same set of pursuit tasks in simulation, as well as against two other pursuit algorithms that only take into account paths from a single homotopy class. We show that considering homotopy alternatives in 2D pursuit improves the tracking performance and that our algorithm does at least as well as humans in most pursuit scenarios.

关键词： Visualization Robots Trajectory Planning Target tracking Games pursuit algorithms

来源：评论

学校读者我要写书评

暂无评论

Lensless 3D Imaging Using Mask-Based Cameras

Lensless 3D Imaging Using Mask-Based Cameras

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： M. Salman Asif Department of Electrical and Computer Engineering University of California Riverside CA 92521

ISBN: (纸本)9781538646595

Recently, coded masks have been used to demonstrate a thin form-factor lensless camera, FlatCam, in which a mask is placed immediately on top of a bare image sensor. In this paper, we present an imaging model and algorithm to jointly estimate depth and intensity information in the scene from a single or multiple FlatCams. We use a light field representation to model the mapping of 3D scene onto the sensor in which light rays from different depths yield different modulation patterns. We present a greedy depth pursuit algorithm to search the 3D volume and estimate the depth and intensity of each pixel within the camera field-of-view. We present simulation results to analyze the performance of our proposed model and algorithm with different FlatCam settings.

关键词： computational photography depth estimation coded aperture greedy algorithms greedy algorithm Cameras Masks Three dimensional imaging Light Sensors (image) pursuit algorithms

来源：评论

学校读者我要写书评

暂无评论

Second-Order Agents on Ring Digraphs

Second-Order Agents on Ring Digraphs

引用

International Conference on System Theory, Control, and Computing (ICSTCC)

作者： Sergei Parsegov Pavel Chebotarev Skolkovo Institute of Science and Technology V.A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences Moscow Russia V.A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences V.A. Kotelnikov Institute of Radioengineering and Electronics of Russian Academy of Sciences Moscow Russia

The paper addresses the problem of consensus Seeking among second-order linear agents interconnected in a specific ring topology. Unlike the existing results in the field dealing with one-directional digraphs arising in various cyclic pursuit algorithms or two-directional graphs, we focus on the case where some arcs in a two-directional ring graph are dropped in a regular fashion. The derived condition for achieving consensus turns out to be independent of the number of agents in a network.

关键词： Eigenvalues and eigenfunctions Topology Laplace equations Complexity theory Damping Protocols pursuit algorithms

来源：评论

学校读者我要写书评

暂无评论

DGPA-Based Tone Reservation for PAPR Reduction in OFDM Systems

DGPA-Based Tone Reservation for PAPR Reduction in OFDM Syste...

引用

International Conference on Computer and Communications (ICCC)

作者： Jun Li Renjie Zhang Yajun Wang Tingting Liu Ran Ding School of Electronic and Optical Engineering Nanjing University of Science and Technology Nanjing China Department of Information and Computational Sciences JiangSu University of Science and Technology Zhangjiagang China School of Communication Engineering Nanjing Institute of Technology Nanjing China

ISBN: (纸本)9781538683408

In this paper, we concentrate on the high peak-to-average power ratio (PAPR) reduction issue in the orthogonal frequency division multiplexing (OFDM) system based on the tone reservation (TR) method. We first apply the discrete generalized pursuit algorithm (DGPA) to search the optimal peak reduction tone (PRT) set. Then, we compare the performance and computational complexity (CC) between the DGPA and other techniques in finding the PRT set. Furthermore, we apply the PRT set searched by the DGPA in the TR method to reduce the high PAPR. And we compare the PAPR reduction and the bit error rate (BER) performance between three methods. Finally, the simulation results verify that the proposed method in this paper can achieve the similar BER performance as the other benchmarks but have better performance in PAPR reduction.

关键词： Peak to average power ratio Estimation pursuit algorithms Kernel Time-domain analysis Frequency-domain analysis

来源：评论

学校读者我要写书评

暂无评论

An algorithm of matched pursuit with compensation for the analysis of multicomponent Doppler signals

引用

JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS 2016年第10期61卷 1107-1114页

作者： Fedosov, V. P. Evdokimova, E. O. Southern Fed Univ Nekrasovskii Per 44 Taganrog 347922 Russia

The problem of decomposition of multicomponent Doppler signals in order to increase the operation efficiency of systems based on the use of Doppler radars for a wide range of applications is considered. To study the structure of these signals, a matched pursuit algorithm and its modification-matched pursuit with compensation, which have been developed for the analysis of signals represented by functions of time and their spectrograms, respectively, are used. Obtained and analyzed the Results of decomposition of a simulated three-component signal against the background of noise for a signal-to-noise ratio of 20 dB as well as actual Doppler signals by these algorithmsare obtained and analyzed.

关键词： Signal analysis operating efficiency pursuit algorithms Doppler effect BACKGROUND NOISE signals compensated Doppler radar

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：