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

Indian Control Conference (ICC)

作者： Ajay Kumar Yadav Vikas Kumar Mishra Abhinoy Kumar Singh Shovan Bhaumik Ministry of Education Key Lab of Intelligent Computing and Signal Processing China School of Electronics and Information Engineering Anhui University Hefei China

ISBN: (纸本)9781509017966

The conventional Bayesian framework of filtering is based on the assumption that the measurements are available at each time-step without any delay. But in real-life problems, measurements may be randomly delayed in time. In this paper, we modified the unscented Kalman filter (UKF) for arbitrary time delayed measurements. With the help of simulation results, it has been shown that the proposed filter provides more accurate estimation compared to the ordinary UKF in presence of randomly delayed measurements.

关键词： Delays Kalman filters Noise measurement Bayes methods Mathematical model Estimation

来源：评论

学校读者我要写书评

暂无评论

Color correction for stereoscopic image based on matching and optimization

Color correction for stereoscopic image based on matching an...

引用

International Conference on 3D Imaging (IC3D)

作者： Xiaohua Zheng Yuzhen Niu Junhao Chen Yuzhong Chen College of Mathematics and Computer Science Fuzhou University Fujian Provincial Key Lab of the Network Computing and Intelligent Information Processing Fujian China

Stereoscopic 3D (S3D) image color correction is a major issue in the field of image processing. However, existing color correction algorithms have limitations. Global color correction algorithms cannot handle local color discrepancies, and local color correction algorithms are sensitive to matching quality between reference and target images. In this study, we propose an S3D image color correction algorithm that combines global and local color information to correct color discrepancies between S3D images. Sparse feature matching usually generates only a few matching features, producing error correction results in some local regions. Our algorithm uses dense stereo matching and global color correction algorithms to initialize color values, and improves the local color smoothness and global color consistency of the resulting image, while maintaining the initial color in that image as much as possible. Experimental results show that our algorithm performs better than do five state-of-the-art color correction algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Low-complexity linear precoding for pilot contamination mitigation in multi-cell massive MIMO systems

Low-complexity linear precoding for pilot contamination miti...

引用

IEEE International Symposium on intelligent Signal processing and Communication Systems (ISPACS)

作者： Manman Feng Yaohua Xu Ministry of Education Key Lab of Intelligent Computing and Signal Processing China School of Electronics and Information Engineering Anhui University Hefei China

The pilot contamination is caused by non-orthogonal pilot sequences reuse in uplink, which affects the performance of Massive MIMO systems seriously, so it is necessary to mitigate pilot contamination. In this paper, we propose a pilot contamination precoding scheme to mitigate multi-cell pilot contamination. In the uplink, we propose a cell-defined training scheme, where the same pilot sequence is used in the same cell, and different cells use orthogonal pilot sequences, which eliminates inter-cell interference and introduces intra-cell interference artificially. In the downlink, we adopt Truncated Polynomial Expansion (TPE) precoding to reduce intra-cell interference, since the truncated polynomial of TPE precoding can replace the matrix inversion of Regularized Zero-Forcing (RZF) precoding, which reduces the complexity of RZF precoding and approximates the performance of RZF precoding by suitable truncation orders. Simulation results show the effectiveness of the proposed scheme.

关键词： Precoding Base stations Contamination Interference Partial transmit sequences Antennas Complexity theory

来源：评论

学校读者我要写书评

暂无评论

A Novel Compact Broadband Circularly Polarized Antenna for GNSS

A Novel Compact Broadband Circularly Polarized Antenna for G...

引用

IEEE Asia-Pacific Conference on Antennas and Propagation

作者： Aoyun Zhang Zhongxiang Zhang Wensheng Yu Xianliang Wu Key Lab of Intelligent Computing & Signal Processing Ministry of Education Anhui University School of Electronic and Information Engineering Hefei Normal University

ISBN: (纸本)9781538616093

A novel compact broadband circularly polarized (CP) antenna is proposed for use in the Global Navigation Satellite System (GNSS). Circular polarization for the presented antenna is achieved by introducing two L-shaped branches in the ground plane and inverted L-shaped microstrip fed. The antenna exhibits a wide impedance bandwidth of 44.9% (1.14-1.8GHz) for reflection coefficient<-10dB and an axial ratio (AR) bandwidth of 36.9% (1.15-1.67GHz) for AR<3dB. The CP bandwidth (reflection coefficient<-10dB and AR<3dB) can cover all GNSS frequency bands. Although simple in structure, the antenna can meet the requirements for handheld wireless terminals.

关键词： Broadband Circular polarization Compact GNSS

来源：评论

学校读者我要写书评

暂无评论

Isometrically subdivisible tetrahedra

引用

Computer Aided Drafting,Design and Manufacturing 2017年第2期27卷 24-31页

作者： Li Erbo Li Zhi Li Hua EON Reality Inc Liaoning Center for Disease Prevention and Control Key Lab of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of Sciences University of Chinese Academy of Sciences

It is well known that a triangle can be divided by mid-point refinement into four sub-triangles with the same shape. Similarly, a tetrahedron can be parted into eight subtetrahedra, which are generally not uniform in shape. This paper proves that there exist a set of tetrahedra, which is called isometrically subdivisible tetrahedra(IST) and can be divided into eight isometric subtetrahedra, including identical and reflection ones. And a new classification of tetrahedra is put forward, based on which all tetrahedra can be categorized into 26 classes according to both the number of maximum equal edges and topological relations. The IST belongs only to three of the classes. That result provides a new viewpoint of spatial structure and may be used to tile or subdivide space uniformly or isometrically.

关键词： regular subdivision isometric identical tetrahedra classification tetrahedra direction

来源：评论

学校读者我要写书评

暂无评论

Quantitative composite decision-theoretic rough set

Quantitative composite decision-theoretic rough set

引用

International Conference on intelligent System and Knowledge Engineering, ISKE

作者： Linna Wang Ling Liu Xin Yang Pan Zhuo School of Electronic and Information Engineering Sichuan Technology and Business University Chengdu China Key Lab of Cloud Computing and Intelligent Information Processing Sichuan Technology and Business University Chengdu China

In practical decision-making, we prefer to characterize the uncertain problems with the hybrid data, which consists of various types of data, e.g., categorical, numerical, set-valued and interval-valued. The extended rough sets can deal with single types of data based on specific binary relation, including the equivalence relation, neighborhood relation, partial order relation, tolerance relation, etc. However, the fusion of these relations is a significant challenge task in such composite information table. To tackle this issue, this paper proposes the intersection and union composite relation, and further introduces a quantitative composite decision-theoretic rough set model. Moreover, we present a novel matrix-based approach to compute the upper and lower approximations in proposed model. Finally, an numerical example is conducted to illustrate the efficiency of proposed method.

关键词： Rough sets Numerical models Mathematical model Computational modeling Data models Probabilistic logic Business

来源：评论

学校读者我要写书评

暂无评论

Predicting protein inter-residue contacts using composite likelihood maximization and deep learning

arXiv

引用

arXiv 2018年

作者： Zhang, Haicang Zhang, Qi Ju, Fusong Zhu, Jianwei Sun, Shiwei Gao, Yujuan Xie, Ziwei Deng, Minghua Sun, Shiwei Zheng, Wei-Mou Bu, Dongbo Key Lab of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Center for Quantitative Biology School of Mathematical Sciences Center for Statistical Sciences Peking University Beijing China Institute of Theoretical Physics Chinese Academy of Sciences Beijing China College of Life Science and Technology Huazhong University of Science and Technology Wuhan China

Accurate prediction of inter-residue contacts of a protein is important to calculating its tertiary structure. Analysis of co-evolutionary events among residues has been proved effective to inferring inter-residue contacts. The Markov random field (MRF) technique, although being widely used for contact prediction, suffers from the following dilemma: the actual likelihood function of MRF is accurate but time-consuming to calculate;in contrast, approximations to the actual likelihood, say pseudo-likelihood, are efficient to calculate but inaccurate. Thus, how to achieve both accuracy and efficiency simultaneously remains a challenge. In this study, we present such an approach (called clmDCA) for contact prediction. Unlike plmDCA using pseudo-likelihood, i.e., the product of conditional probability of individual residues, our approach uses composite-likelihood, i.e., the product of conditional probability of all residue pairs. Composite likelihood has been theoretically proved as a better approximation to the actual likelihood function than pseudo-likelihood. Meanwhile, composite likelihood is still efficient to maximize, thus ensuring the efficiency of clmDCA. We present comprehensive experiments on popular benchmark datasets, including PSICOV dataset and CASP-11 dataset, to show that: i) clmDCA alone outperforms the existing MRF-based approaches in prediction accuracy. ii) When equipped with deep learning technique for refinement, the prediction accuracy of clmDCA was further significantly improved, suggesting the suitability of clmDCA for subsequent refinement procedure. We further present successful application of the predicted contacts to accurately build tertiary structures for proteins in the PSICOV dataset. Accessibility: The software clmDCA and a server are publicly accessible through http://***/clmDCA/. Copyright © 2018, The Authors. All rights reserved.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

Cross-layer Joint Relay Selection and Power Allocation Scheme for Cooperative Relaying System

引用

IOP Conference Series: Materials Science and Engineering 2018年第7期322卷

作者： Hui Zhi Mengmeng He Feiyue Wang Ziju Huang Key Lab of Computing Intelligent and Signal Processing (Ministry of Education) Anhui University Hefei China College of Electronics and Information Engineering Anhui University Hefei China

A novel cross-layer joint relay selection and power allocation (CL-JRSPA) scheme over physical layer and data-link layer is proposed for cooperative relaying system in this paper. Our goal is finding the optimal relay selection and power allocation scheme to maximize system achievable rate when satisfying total transmit power constraint in physical layer and statistical delay quality-of-service (QoS) demand in data-link layer. Using the concept of effective capacity (EC), our goal can be formulated into an optimal joint relay selection and power allocation (JRSPA) problem to maximize the EC when satisfying total transmit power limitation. We first solving optimal power allocation (PA) problem with Lagrange multiplier approach, and then solving optimal relay selection (RS) problem. Simulation results demonstrate that CL-JRSPA scheme gets larger EC than other schemes when satisfying delay QoS demand. In addition, the proposed CL-JRSPA scheme achieves the maximal EC when relay located approximately halfway between source and destination, and EC becomes smaller when the QoS exponent becomes larger.

关键词：

来源：评论

学校读者我要写书评

暂无评论

From social to individuals: A parsimonious path of multi-level models for crowdsourced preference aggregation

arXiv

引用

arXiv 2018年

作者： Xu, Qianqian Xiong, Jiechao Cao, Xiaochun Huang, Qingming Yao, Yuan Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing1000190 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Tencent AI Lab Shenzhen518057 BICMR-LMAM-LMEQF-LMP School of Mathematical Sciences Peking University Beijing100871 China University of Chinese Academy of Sciences Institute of Computing Technology of Chinese Academy of Sciences Beijing100190 China Department of Mathematics and by courtesy Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Hong Kong

In crowdsourced preference aggregation, it is often assumed that all the annotators are subject to a common preference or social utility function which generates their comparison behaviors in experiments. However, in reality annotators are subject to variations due to multi-criteria, abnormal, or a mixture of such behaviors. In this paper, we propose a parsimonious mixed-effects model, which takes into account both the fixed effect that the majority of annotators follows a common linear utility model, and the random effect that some annotators might deviate from the common significantly and exhibit strongly personalized preferences. The key algorithm in this paper establishes a dynamic path from the social utility to individual variations, with different levels of sparsity on personalization. The algorithm is based on the Linearized Bregman Iterations, which leads to easy parallel implementations to meet the need of large-scale data analysis. In this unified framework, three kinds of random utility models are presented, including the basic linear model with L2 loss, Bradley-Terry model, and Thurstone-Mosteller model. The validity of these multi-level models are supported by experiments with both simulated and real-world datasets, which shows that the parsimonious multi-level models exhibit improvements in both interpretability and predictive precision compared with traditional HodgeRank. Copyright © 2018, The Authors. All rights reserved.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Non-rigid 3D models retrieval based on hierarchical matching

引用

Computer Aided Drafting,Design and Manufacturing 2017年第1期27卷 39-47页

作者： Liu Yujie Li Wei Song Yang Gong Weiqing Li Zongmin Li Hua Department of Computer & Communication Engineering China University of Petroleum ChinaPetro (Karamay) Data Center Sinopec Exploration & Production Research Institute (PEPRIS) Key Lab of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of Sciences

In 3D models retrieval, feature description and retrieval of non-rigid model face more complex problems due to the isometry transformation of itself. We introduce the hierarchical combination matching into the feature comparison, and build a map between the divided regions of two models, and then achieve accurate feature matching based on patch-by-patch, which successfully introduces the spatial information into feature matching. Verified by experiment, the 3D model retrieval method proposed in this paper based on hierarchical combination matching can make sure more accurate feature matching, so as to enhance the precision of retrieval.

关键词： non-rigid 3D model shape descriptor spatial distribution hierarchical combination matching

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：