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

2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010

作者： Zhang, Zhujin Wang, Shuo Zhang, Xingyi Zhang, Zheng Department of Control Science and Engineering Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Wuhan 430074 China School of Computer and Information Science University of South Australia Adelaide SA 5095 Australia Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 China

ISBN: (纸本)9781424464388

Randí et al. proposed a significant graphical representation for DNA sequences, which is very compact and avoids loss of information. In this paper, we build a fast algorithm for this graphical representation with time complexity O(n2), and find another important advantage in the representation: no degeneracy. Moreover, we propose a new method to do similarity analysis of DNA sequences based on the representation. The approach adopts four elements of covariance matrix as a descriptor, and is illustrated on the first exon of beta-globin genes from 11 different species. © 2010 IEEE.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

An Iterative Interference Cancellation Approach for OFDMA Uplink System

An Iterative Interference Cancellation Approach for OFDMA Up...

引用

WRI International Conference on communications and Mobile Computing, CMC

作者： Ruiqin Miao Jun Sun Lin Gui Jian Xiong Institute of Image Communication and Information Processing Shanghai Jiaotong University Shanghai China China and Shanghai Key Laboratory of Digital Media Processing and Transmissions Shanghai Jiaotong University Shanghai China

ISBN: (纸本)9781424463275;9780769539898

In this paper, the issue of carrier frequency offset compensation in orthogonal frequency division multiple access (OFDMA) uplink system is investigated. To mitigate the effect of the multiple access interference (MAI) caused by the carrier frequency offset (CFO) of different users, a new iterative compensation algorithm is proposed. However, this scheme has unaffordable complexity. To tackle this problem, an efficient iterative implementation is developed in this paper based on a banded interference matrix approximation. Simulations illustrate that the proposed algorithm obtains good performance, at the same time has much lower computational complexity.

关键词： Iterative methods Interference cancellation Multiple access interference Iterative algorithms Signal processing algorithms Frequency conversion OFDM Feedback Downlink Mobile communication

来源：评论

学校读者我要写书评

暂无评论

Low-contrast edge enhancing anisotropic diffusion for speckle reduction

Low-contrast edge enhancing anisotropic diffusion for speckl...

引用

International Conference on Genetic and Evolutionary Computing

作者： Zhang, Yongde Ding, Mingyue Department of Biomedical Engineering China Medical University Shenyang Liaoning China School of Life Science and Technology Image Processing and Intelligence Control Key Laboratory of Education Ministry of China Huazhong University of Science and Technology Wuhan Hubei China

ISBN: (纸本)9780769542812

This paper deals with anisotropic diffusion in image affected by speckle. The classical SRAD can remove speckle efficiently, but blur the low-contrast edges. To solve this problem, a low-contrast edge enhancement method based on anisotropic diffusion for speckle reducing is present. The method extends the SRAD to a matrix anisotropic diffusion, and suppresses the diffusion across edges while encourages diffusion along edges. Experiment results showed that the proposed method can suppress the speckle and protect low-contrast edges efficiently. © 2010 IEEE.

关键词： Speckle

来源：评论

学校读者我要写书评

暂无评论

Improving Ordinal Regression Model for Rating Inference through Optimizing Training Sample Selection

Improving Ordinal Regression Model for Rating Inference thro...

引用

第六届全国信息检索学术会议

作者：王会珍朱靖波 Key Laboratory of Medical Image Computing(Northeastern University) Ministry of Education Natural Language Processing Laboratory Northeastern University

This paper addresses the content-based rating inference issue in sentiment analysis,in which the user's assessments on social issues or products are determined with respect to multi-point scale instead of polarity (positive or negative).The most common way to tackle rating inference problem is to utilize machine learning algorithms such as ordinal regression *** practice,different reviews on the same object are generally provided by different users,and the rating annotations provided by different users are often not *** such cases,standard ordinal regression algorithms would fail due to the inconsistent rating annotation problem. To address this challenge,this paper proposes two approaches to improving standard ordinal regression algorithms by optimizing sample selection for training,including tolerance-based selection and ranking-loss-based selection *** on two publicly available English and Chinese restaurant review datasets demonstrated significant improvements over standard algorithms.

关键词： Ordinal Regression Model Rating Inference Sentiment Analysis

来源：评论

学校读者我要写书评

暂无评论

Computation of some generalized Ramsey numbers

引用

Journal of Combinatorial Mathematics and Combinatorial Computing 2010年 75卷 217-228页

作者： Shao, Zehui Xu, Jin Bao, Qiquan Pan, Linqiang Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

For given graphs G1,G2, the 2-color Ramsey number R(G1,G2) is defined to be the least positive integer n such that every 2-coloring of the edges of complete graph Kn contains a copy of G1 colored with the first color or a copy of G2 colored with the second color. In this note, we obtained some new exact values of generalized Ramsey numbers such as cycle versus book, book versus book, complete bipartite graph versus complete bipartite graph.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Ramsey multiplicities of graphs with five vertices

引用

Journal of Combinatorial Mathematics and Combinatorial Computing 2010年 75卷 3-9页

作者： Shao, Zehui Pan, Linqiang Xu, Jin Key Laboratory of Image Processing and Intelligent Control Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

The Ramsey multiplicity M(G) of a graph G is defined to be the smallest number of monochromatic copies of G in any two-coloring of edges of K R(G), where R(G) is the smallest integer n such that every graph on n vertices either contains G or its complement contains G. With the help of computer algorithms, we obtain the exact values of Ramsey multiplicities for most of isolate-free graphs on five vertices, and establish upper bounds for a few others.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Quantum genetic algorithm for mobile robot path planning

Quantum genetic algorithm for mobile robot path planning

引用

International Conference on Genetic and Evolutionary Computing

作者： Sun, Yangguang Ding, Mingyue College of Computer Science South-Central University for Nationalities Wuhan 430074 China College of Life Science and Technology Image Processing and Intelligence Control Key Laboratory of Education Ministry of China Huazhong University of Science and Technology Wuhan 430074 China

ISBN: (纸本)9780769542812

Based on the theory of quantum mechanics and quantum computing, a path planning method for mobile robot based on quantum genetic algorithm was presented in this paper. By using the quantum-bit with the superposition state to encode a route and introducing quantum genetic algorithm to optimize the cost function of path planning, the proposed method guides and realizes path optimization by introducing genetic operators including quantum crossover operator and quantum gate mutation operator with the essential characteristics of quantum. Primary experiments demonstrated that our method not only has the diversity of population, but also improves effectively the capabilities of searching and convergence. © 2010 IEEE.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

A sphere-dominance based preference immune-inspired algorithm for dynamic multi-objective optimization 10

A sphere-dominance based preference immune-inspired algorith...

引用

12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010

作者： Liu, Ruochen Zhang, Wei Jiao, Licheng Liu, Fang Ma, Jingjing Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China Institute of Intelligent Information Processing Xidian University Xi'an 710071 China Mail Box 224 Xidian University No.2 South TaiBai Road Xi'an 710071 China

ISBN: (纸本)9781450300728

Real-world optimization involving multiple objectives in changing environment known as dynamic multi-objective optimization (DMO) is a challenging task, especially special regions are preferred by decision maker (DM). Based on a novel preference dominance concept called sphere-dominance and the theory of artificial immune system. (AIS), a sphere-dominance preference immune-inspired algorithm (SPIA) is proposed for DMO in this paper. The main contributions of SPIA are its preference mechanism and its sampling study, which are based on the novel spheredominance and probability statistics, respectively. Besides, SPIA introduces two hypermutation strategies based on history information and Gaussian mutation, respectively. In each generation, which way to do hypermutation is automatically determined by a sampling study for accelerating the search process. Furthermore, The interactive scheme of SPIA enables DM to include his/her preference without modifying the main structure of the algorithm. The results show that SPIA can obtain a well distributed solution set efficiently converging into the DM's preferred region for DMO. Copyright 2010 ACM.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Adaptive mutation particle filter based on diversity guidance

Adaptive mutation particle filter based on diversity guidanc...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Jin-Xia Yu Yong-Li Tang Wen-Jing Liu College of Computer Science and Technology Henan Polytechnic University Jiaozuo China Jiangsu Provincial Key Laboratory of Image Processing and Image Communication Nanjing University of Posts and Telecommunications Nanjing China Department of Computer Science and Technology Tsinghua University Beijing China

Aimed at the deficiency of the resampling algorithm in PF, diversity measures ESS (effective sample size) and PDF (population diversity factor) are evaluated respectively. Combined with the estimation result, diversity measures PDF is used for adaptively tuning the resampling threshold. By integrating the operation of particle mutation after resampling into PF and using the above mechanism of diversity guidance, the AMPF algorithm (Adaptive Mutation PF) is presented so as to assure the diversity of particle sets. With the simulation program using matlab 7.0 to track a single target motion from a fixed visual observation points, the performance of diversity measures and AMPF are evaluated and the validity of the proposed method is verified.

关键词： Particle measurements Atmospheric measurements Particle filters Algorithm design and analysis Mathematical model Tuning Estimation

来源：评论

学校读者我要写书评

暂无评论

Real-time foreground detection based on tempo-spatial consistency validation and Gaussian Mixture Model

Real-time foreground detection based on tempo-spatial consis...

引用

IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)

作者： Qing Yan Yi Xu Xiaokang Yang Leonardo Traversoni Institute of Image Communication and Information Processing and Shanghai Key Laboratory of Digital Media Processing and Transmission Shanghai Jiaotong University Shanghai China Ciencias Basicas e Ingenieria University of Autonoma Metropolitana Iztapalapa Mexico

ISBN: (纸本)9781424444618

Robust foreground detection is a fundamental precursor of many video processing applications. Although various approaches were advanced, there still exist many factors making detection very challenging: 1) Dynamic background with gradual brightness changes, camera movement and large amount of noises. 2) Sharp illumination changes caused by shadows, light on-off, and so on. 3) Real-time requirement for practical systems. To overcome these problems, a new approach is proposed in this paper. It is based on the background of conventional Gaussian Mixed Model, incorporating tempo-spatial consistency validation to search genuine foreground seeds, so that foreground segments can be reliably acquired using region growth method. Experiments demonstrate that our approach achieves better performance than conventional GMM approach in detection accuracy, adaptability to sudden illumination changes and computation time.

关键词： image communication Information processing Gaussian processes Video sequences Colored noise Switches Lighting Probability Kernel Optical sensors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：