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

A distributed high-rate and low-detection complexity cooperative relay transmission scheme

Journal of Information and Computational Science 2014年第18期11卷 6591-6599页

作者： Xu, Lei Jiang, Ran Zhang, Gongquan Zou, Mingquan Li, Xiaohui Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China

Since the existing full-rate cooperative transmission schemes have a serious defect in low Bit Error Rate (BER) performance while the existing high-rate cooperative transmission schemes have a serious defect in low spectral efficiency, a distributed high-rate cooperative relay transmission scheme based on full-rate cooperative communication model is proposed in this paper, in which Cyclic Delay Diversity (CDD) technology and Linear Constellation Precoding (LCP) technology are employed. Moreover, the proposed scheme addresses the issue of obtaining maximum spatial and multipath diversity with low decoding complexity and high transmission reliability. The BER performance of the proposed scheme is contrasted to that of the full-rate transmission scheme where better performance is achieved, and is improved when the number of the multipath or the relay nodes increases.

关键词： Bit error rate

来源：评论

学校读者我要写书评

暂无评论

Diffusion tensor based curvature-driven difiusion model for digital inpainting

引用

Journal of Computational Information Systems 2015年第1期11卷 185-194页

作者： Qu, Lei Huang, Linsheng Wei, Sui Key Lab of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China

In this paper, we formulate the digital inpainting as a curvature-driven anisotropic concentration difiusing process. The difiusion strength along the gradient directions is defined as a function of curvature, so that the "Connectivity Principle" can be satisfied. Difierent to the classic Curvature-Driven Difiusion (CDD) model, the difiusion along the edge directions can be easily integrated into the difiusion equation in our model by using difiusion tensor. As result, more exibility in designing the local difiusion behavior is allowed, and the CDD model can be generalized as a special case. We show that our model can boost inpainting speed 3fi6 times and at the same time has similar inpainting quality compared to the widely used CDD model. Experimental results on synthetic and real images have verified the stability and eficiency of our model. ©, 2014, Journal of Computational Information Systems. All right reserved.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Spectral matching algorithm based on nonsubsampled contourlet transform and scale-invariant feature transform

引用

Journal of Systems Engineering and Electronics 2012年第3期23卷 453-459页

作者： Dong Liang Pu Yan Ming Zhu Yizheng Fan Kui Wang Key Lab of Intelligent Computing ＆ Signal Processing Ministry of Education Anhui University Hefei 230039 E R. China School of Electronics and Information Engineering Anhui University Hefei 230039 P. R. China School of Mathematics and Computation Sciences Anhui University Hefei 230039 P. R. China

A new spectral matching algorithm is proposed by us- ing nonsubsampled contourlet transform and scale-invariant fea- ture transform. The nonsubsampled contourlet transform is used to decompose an image into a low frequency image and several high frequency images, and the scale-invariant feature transform is employed to extract feature points from the low frequency im- age. A proximity matrix is constructed for the feature points of two related images. By singular value decomposition of the proximity matrix, a matching matrix （or matching result） reflecting the match- ing degree among feature points is obtained. Experimental results indicate that the proposed algorithm can reduce time complexity and possess a higher accuracy.

关键词： point pattern matching nonsubsampled contourlet transform scale-invariant feature transform spectral algorithm.

来源：评论

学校读者我要写书评

暂无评论

A mixed structure of full-rate and low-detection complexity cooperative relay transmission scheme

引用

Journal of Computational Information Systems 2014年第21期10卷 9339-9349页

作者： Jiang, Ran Meng, Fanzhi Li, Xiaohui Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China

Since the single-antenna relay cooperative communication systems have a serious defect in reliability of data transmission, while the MIMO communication systems have difficulty in design and decoding, we propose a mixed structure of full-rate and low-detection complexity cooperative relay transmission scheme based on full-rate relay cooperative transmission model, which combines the advantages of cyclic delay diversity (CDD) technology and linear constellation precoding (LCP) technology. This scheme can excavation diversity gain by using single antenna terminal and multiple antenna simultaneously, moreover, the decoding complexity is low. The bit error rate (BER) performance is improved with the number of the antenna or the multipath or the relay nodes increases.

关键词： Cooperative communication

来源：评论

学校读者我要写书评

暂无评论

A parallel scheme for three-dimensional reconstruction in large-field electron tomography

A parallel scheme for three-dimensional reconstruction in la...

引用

10th International Symposium on Bioinformatics Research and Applications, ISBRA 2014

作者： Zhang, Jingrong Wan, Xiaohua Zhang, Fa Ren, Fei Wang, Xuan Liu, Zhiyong Key Lab. of Intelligent Information Processing and Advanced Computing Research Lab Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Yanshan University Yanshan China

ISBN: (纸本)9783319081700

Large-field high-resolution electron tomography enables visualizing detailed mechanisms under global structure. As field enlarges, the processing time increases and the distortions in reconstruction become more critical. Adopting a nonlinear projection model instead of a linear one can compensate for curvilinear trajectories, nonlinear electron optics and sample warping. But the processing time for the reconstruction with nonlinear projection model is rather considerable. In this work, we propose a new parallel strategy for block iterative reconstruction algorithms. We also adopt a page-based data transfer in this strategy so as to dramatically reduce the processing time for data transfer and communication. We have tested this parallel strategy and it can yield speedups of approximate 40 times according to our experimental results. © 2014 Springer International Publishing Switzerland.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Inter-piconet interference mitigation schemes for converged BTLE and cellular network

Inter-piconet interference mitigation schemes for converged ...

引用

2011 International Conference on Wireless Communications and signal processing, WCSP 2011

作者： Hu, Ying Wang, Guizhu Shan, Lianhai Yuan, Zhi Ouyang, Yuling Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China Shanghai Research Center for Wireless Communications Key Lab of Wireless Sensor Network and Communication CAS Shanghai China

ISBN: (纸本)9781457710100

In a Bluetooth Low Energy (BTLE) piconet, the master node controls the channel access by a simple polling scheme. Due to an absence of coordination among independent master nodes while accessing the wireless medium, devices will encounter high packet interference if many piconets are simultaneously operating in the same area. In this paper, we propose two schemes in the converged BTLE and cellular network, one is based on bad channel prediction for the BTLE piconets, and the other is based on frequency hopping sequences transformation. We compare the performance of the proposed algorithms with original scheme in the form of channel collision probability and new signaling overhead. The simulation results show that the proposed schemes can reduce channel collision probability significantly and simultaneously the new signaling overhead introduced to the downlink is not large. © 2011 IEEE.

关键词： Bluetooth

来源：评论

学校读者我要写书评

暂无评论

Identifying high-impact sub-structures for convolution kernels in document-level sentiment classification

Identifying high-impact sub-structures for convolution kerne...

引用

50th Annual Meeting of the Association for Computational Linguistics, ACL 2012

作者： Tu, Zhaopeng He, Yifan Foster, Jennifer Van Genabith, Josef Liu, Qun Lin, Shouxun Key Lab. of Intelligent Info. Processing Institute of Computing Technology CAS China Computer Science Department New York University United States School of Computing Dublin City University Ireland

ISBN: (纸本)9781937284251

Convolution kernels support the modeling of complex syntactic information in machinelearning tasks. However, such models are highly sensitive to the type and size of syntactic structure used. It is therefore an important challenge to automatically identify high impact sub-structures relevant to a given task. In this paper we present a systematic study investigating (combinations of) sequence and convolution kernels using different types of substructures in document-level sentiment classification. We show that minimal sub-structures extracted from constituency and dependency trees guided by a polarity lexicon show 1.45 point absolute improvement in accuracy over a bag-of-words classifier on a widely used sentiment corpus. © 2012 Association for Computational Linguistics.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

The structure of the sparse basis function in compressive sensing for fast analysis of wide-angle monostatic scattering problems

The structure of the sparse basis function in compressive se...

引用

2012 International Conference on Microwave and Millimeter Wave Technology, ICMMT 2012

作者： Du, Hong-Mei Chen, Ming-Sheng Wu, Xian-Liang Key Lab. of Intelligent Computing and Signal Processing Anhui University Ministry of Education Hefei 230029 China Department of Physics and Electronic Engineering Hefei Normal University Hefei 230601 China University of Science and Technology of China Hefei 230026 China

ISBN: (纸本)9781467321839

In the theory of compressive sensing, the selection of the basis functions directly affects the sparse transformation, observation number and reconstruction accuracy. In this paper, we introduce the structure of three sparse basic functions, which are used to analyze the electromagnetic scattering problems over a wide incident angle by the method of moment and compressive sensing. According to the characteristics of the induced current of wide angle, the best basic function is selected. Compared with the DCT, the accuracy of the reconstruction for different shape object are improved and the observation number reduces about 50%. © 2012 IEEE.

关键词： Method of moments

来源：评论

学校读者我要写书评

暂无评论

RGB-T Saliency Detection via Robust Graph Learning and Collab.rative Manifold Ranking 14th

RGB-T Saliency Detection via Robust Graph Learning and Colla...

引用

14th International Conference on Bio-inspired computing: Theories and Applications, BIC-TA 2019

作者： Sun, Dengdi Li, Sheng Ding, Zhuanlian Luo, Bin Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei230601 China School of Internet Anhui University Hefei230039 China

ISBN: (纸本)9789811534140

Visual saliency detection inspired by brain cognitive mechanisms is an important component of computer vision, aiming at automatically highlight salient visual objects from the image background. In complex real scenarios, integrating multiple different yet complementary feature representations has been proved to be an effective way for boosting saliency detection performance. In this paper, we propose a novel collab.rative algorithm for saliency detection by adaptively incorporating information from grayscale and thermal images. Specifically, we first construct an affinity graph model via robust graph learning to characterize the feature similarities and location relationships between two different image patches under each modal. Based on these affinity graphs, a collab.rative manifold ranking method cross-modality consistent constraints is designed to effectively and efficiently infer the salient score for each patch. Moreover, we introduce a weight for each modality to describe the reliability, and integrate them into the graph-based manifold ranking scheme to achieve an adaptive weighted fusion of different source data. For optimization, we propose some iterative algorithms to efficiently solve the models with several subproblems. Experiments on the grayscale-thermal datasets demonstrate the superior performance of the new method over the state-of-the-art approaches. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Dual-Graph Regularized Sparse Low-Rank Matrix Recovery for Tag Refinement 14th

Dual-Graph Regularized Sparse Low-Rank Matrix Recovery for T...

引用

14th International Conference on Bio-inspired computing: Theories and Applications, BIC-TA 2019

作者： Sun, Dengdi Bao, Yuanyuan Ge, Meiling Ding, Zhuanlian Luo, Bin Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei230601 China School of Internet Anhui University Hefei230039 China

ISBN: (纸本)9789811534140

In recent years, extremely large amounts of images with manual tags are easily availab.e in many social websites such as Twitter, Flickr, and Instagram. However, these user-provided tags are often imprecise and incomplete, which inevitably limits the performances of image retrieval and other related applications. To this end, tag refitment technology aims at improving the quality of images tags automatically, and has been a fundamental challenge in Internet era. In this paper, we propose a novel dual-graph regularized sparse low-rank matrix recovery method, referred to as DGSLR briefly, to infer and improve the manual tags. Specifically, our DGSLR model first suppress the sparse noisy tags by norm, and decompose simultaneously the residual low-rank matrix to learning the low-dimensional vector representations of images and tags. Moreover, the visual similarities and the tag pairwise correlation are fully exploited to smooth the decomposition results by using the dual lapalcian graph regularization terms. For optimization, an improved alternative iteration strategy is designed to solve the resulting objective function. Extensive experiments on the tasks of tag refinement demonstrate the superior performance of the proposed algorithms over several representative methods, especially when the manual tag data is highly noisy and sparse. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：