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

International Conference on BioMedical Engineering and Informatics (BMEI)

作者： Yong Yin Gang Yu Hongjun Wang Zhi Liu Dengwang Li School of Information science and engineering Shandong University Jinan China Key Laboratory of Intelligent Computing Information Processing of Ministry of Education Xiangtan China

Cone-Beam Computed Tomography (CBCT) has always been in the forefront of medical image processing. The denoising as a image pre-processing, has a great affected on the image analysis and recognition. In this paper, a new algorithm for image denoising was proposed. By thresholding the interscale wavelet coefficient magnitude sum(WCMS) within a cone of influence (COI), the wavelet coefficients are classified into 2 categories: irregular coefficients, and edge-related and regular coefficients. They are processed by different ways. Meanwhile according to the projection image sequences characteristics in CBCT system, an effective noise variance estimated methods was proposed. The experiment shows that our algorithm can improve PSNR form 1.3dB to 2.6dB, and the image border is more clearly.

关键词： Noise Wavelet coefficients Image reconstruction Classification algorithms Noise reduction Image edge detection Image denoising

来源：评论

学校读者我要写书评

暂无评论

Counter designs in quantum-dot cellular automata

Counter designs in quantum-dot cellular automata

引用

2010 10th IEEE Conference on Nanotechnology, NANO 2010

作者： Kong, Kun Shang, Yun Lu, Ruqian Institute of Mathematics Academy of Mathematics and Systems Science CAS Beijing 100190 China Shanghai Key Lab. of Intelligent Information Processing Fudan University Shanghai 200433 China CAS Key Lab. of IIP Institute of Computing Technology CAS Beijing 100190 China

ISBN: (纸本)9781424470334

In this paper, we present a new method for the design of an n-bit synchronous binary up counter in quantum-dot cellular automata (QCA). This method is based on the JK flip-flop which almost always produces the simplest combinational logic in traditional sequential circuits. We implement a new QCA architecture for the JK flip-flop. Compared to the existing QCA JK flip-flop, the majority gate count, cell count, clock cycle count, and area of our QCA JK flip-flop are reduced by 57.1%, 88.1%, 55.6%, and 92.0%, respectively. Based on our QCA JK flip-flop, a method of extending state cells is proposed to design the QCA layout of the n-bit counter, such that all the clock cycle counts between any two state cells become 1. This feature can ensure that one count just takes one clock cycle, in existing methods, however, one count needs to take n-1 clock cycles. Comparisons indicate that, by applying our method, the hardware requirements (i.e., complexity and area) for QCA n-bit counter can be greatly reduced. ©2010 IEEE.

关键词： Design

来源：评论

学校读者我要写书评

暂无评论

A visual search system based on multi-scale population cell coding

A visual search system based on multi-scale population cell ...

引用

IEEE International Conference on Cognitive Informatics

作者： Fang, Fang Miao, Jun Qing, Laiyun Gao, Wen School of Computer Science and Technology Harbin Institute of Technology Harbin 150001 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Information Science and Engineering Graduate University of the Chinese Academy of Sciences Beijing 100049 China Institute for Digital Media Peking University Beijing 100871 China

ISBN: (纸本)9781424480401

Gaze movement plays an important role in human visual search system. How to simulate such a system to efficiently encode and decode gaze movement for target searching is a meaningful issue. There are two key points that should be addressed for this issue. First, eye movement is affected by the visual context that includes more than one object in images. It is important to study how to encode the spatial relationship between the target and the other objects, and decode the spatial relationship to drive the gaze moving to the target. Second, the human retina has a non-uniform distribution of light sensing neurons, which can be viewed as a composition of neuron arrays in different spatial resolutions. When a system searches a target, how many scales of visual fields should be involved to sense the image stimulus? In this paper, we propose a visual search system using the population cell coding mechanism and the multi-scale visual field as sensing input. As an example, the system is applied to human eye center searching. An experimental comparison of a Full-scale visual field coding system and a Gradual-scale coding system is carried out. The experiment results show the Gradual-scale coding system performs better than Full-scale coding system for target searching. © 2010 IEEE.

关键词： Eye movements

来源：评论

学校读者我要写书评

暂无评论

Research and progress of cluster algorithms based on granular computing

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content Technology and its Applications 2010年第5期4卷 96-104页

作者： Shifei, Ding Li, Xu Hong, Zhu Liwen, Zhang School of Computer Science and Technology China University of Mining and Technology Xuzhou China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Science Beijing China

Granular computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval computing etc, is a way of dealing with incomplete, unreliable, uncertain fuzzy knowledge. In recent years, it is becoming one of the main study streams in Artificial Intelligence (AI). With selecting the size structure flexibly, eliminating the incompatibility between clustering results and priori knowledge, completing the clustering task effectively, cluster analysis based on GrC attracts great interest from domestic and foreign scholars. In this paper, starting from the development of GrC, firstly, the main newly achievements about clustering and GrC are researched and summarized. Secondly, principle of granularity in clustering, the effective clustering algorithms with the idea of granularity as well as their merits and faults are analyzed and evaluated from the point view of rough set, fuzzy sets and quotient space theories. Finally, the feasibility and effectiveness of handling high-dimensional complex massive data with combination of these theories is outlooked.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

On using Tabu Search for RNA secondary structure prediction

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content Technology and its Applications 2010年第9期4卷 252-262页

作者： Liu, Yongguo Hao, Jianrui School of Computer Science Engineering University of Electronic Science and Technology of China Chengdu 611731 China Key Laboratory of Intelligent Computing Information Processing of Ministry of Education Xiangtan University Xiangtan 411105 China

In this article, a novel approach is proposed to predict RNA secondary structure called RNA secondary structure prediction based on Tabu Search (RNATS). In the RNATS algorithm, two search models, intensification search and diversification search, are developed to exploit the local regions around the current solution and explore the unvisited solution space, respectively. Simulation experiments are conducted on eight RNA sequences to show that the proposed method is feasible and effective.

关键词： Tabu search

来源：评论

学校读者我要写书评

暂无评论

A novel ant colony genetic hybrid algorithm

Journal of Software

引用

Journal of Software 2010年第11期5卷 1179-1186页

作者： Gao, Shang Zhang, Zaiyue Cao, Cungen School of Computer Science and Technology Jiangsu University of Science and Technology Zhenjiang 212003 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

By use of the properties of ant colony algorithm and genetic algorithm, a novel ant colony genetic hybrid algorithm, whose framework of hybrid algorithm is genetic algorithm, is proposed to solve the traveling salesman problems. The selection operator is an artificial version of natural selection, and chromosomes with better length of tour have higher probabilities of being selected in the next generation. Based on the properties of pheromone in ant colony algorithm the ant colony crossover operation is given. Four mutation strategies are put forward using the characteristic of traveling salesman problems. The hybrid algorithm with 2-opt local search can effectively find better minimum beyond premature convergence. Ants choose several tours based on trail, and these tours will replace the worse solution. Compare with the simulated annealing algorithm, the standard genetic algorithm and the standard ant colony algorithm, all the 4 hybrid algorithms are proved effective. Especially the hybrid algorithm with strategy D is a simple and effective better algorithm than others. © 2010 ACADEMY PUBLISHER.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Bigtree Index for Resource Space Model

A Bigtree Index for Resource Space Model

引用

Sixth International Conference on Semantics,Knowledge and Grids(第六届语义、知识与网格国际会议 SKG 2010)

作者： Zhongyi Zeng Hai Zhuge Department of Computer Science and Technology University of Science & Technology of China HefeiChi Knowledge Grid Research Group Key Lab of Intelligent Information Processing Institute of Computing

This paper presents the Bigtree, which is a hierarchical index for implementing the Resource Space Model.

关键词： Semantics Indexes Data models Humans USA Councils Springs Space technology

来源：评论

学校读者我要写书评

暂无评论

Distinguishing Patients with Gastritis and Cholecystitis from the Healthy by Analyzing Wrist Radial Arterial Doppler Blood Flow Signals

Distinguishing Patients with Gastritis and Cholecystitis fro...

引用

International Conference on Pattern Recognition

作者： Xiaorui Jiang Dongyu Zhang Kuanquan Wang Wangmeng Zuo Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences China Department of Computer Science and Technology Harbin Institute of Technology China

ISBN: (纸本)9781424475421

This paper tries to fill the gap between Traditional Chinese Pulse Diagnosis (TCPD) and Doppler diagnosis by applying digital signal analysis and pattern classification techniques to wrist radial arterial Doppler blood flow signals. Doppler blood flows signals (DBFS) of patients with cholecystitis, gastritis and healthy people are classified by L2-soft margin SVM and 5 linear classifiers using the proposed feature - piecewise axially integrated bispectra (PAIB). A 5-fold cross validation is used for performance evaluation. The classification accuracies between either two groups of subjects are greater than 93%. Gastritis can be recognized with higher accuracy than cholecystitis. Cholecystitis can be recognized with higher accuracy on left hand data than right. The findings in this paper partly conform to the theory of TCPD. Though the sample size is relatively small, we could still argue that the methods proposed here are effective and could serve as an assistive tool for TCPD.

关键词： Support vector machines Doppler effect Feature extraction Diseases Wrist Pathology Accuracy

来源：评论

学校读者我要写书评

暂无评论

Using genetic algorithms to optimize artificial neural networks

引用

Journal of Convergence information Technology 2010年第8期5卷 6-6页

作者： Ding, Shifei Xu, Li Su, Chunyang Zhu, Hong School of Computer Science and Technology China University of Mining and Technology Xuzhou 221116 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

Artificial Neural Networks (ANNs), as a nonlinear and adaptive information processing systems, play an important role in machine learning, artificial intelligence, and data mining. But the performance of ANNs is sensitive to the number of neurons, and chieving a better network performance and simplifying the network topology are two competing objectives. While Genetic Algorithms (GAs) is a kind of random search algorithm which simulates the nature selection and evolution, which has the advantages of good global search abilities and learning the approximate optimal solution without the gradient information of the error functions. This paper makes a brief survey on ANNs optimization with GAs. Firstly, the basic principles of ANNs and GAs are introduced, by analyzing the advantages and disadvantages of GAs and ANNs, the superiority of using GAs to optimize ANNs is expressed. Secondly, we make a brief survey on the basic theories and algorithms of optimizing the network weights, optimizing the network architecture and optimizing the learning rules, and make a discussion on the latest research progresses. At last, we make a prospect on the development trend of the theory.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

An improved bp neural network algorithm based on factor analysis

引用

Journal of Convergence information Technology 2010年第4期5卷

作者： Ding, Shifei Jia, Weikuan Su, Chunyang Liu, Xiaoliang Chen, Jinrong School of Computer Science and Technology China University of Mining and Technology Xuzhou 221116 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

Back-Propagation (BP) neural network, as one of the most mature and most widespread algorithms, has the ability of large scale computing and has unique advantages when dealing with nonlinear high dimensional data. But when we manipulate high dimensional data with BP neural network, many feature variables provide enough information, but too many network inputs go against designing of the hidden-layer of the network and take up plenty of storage space as well as computing time, and in the process interfere the convergence of the training network, even influence the the accuracy of recognition finally. Factor analysis (FA) is a multivariate analysis method which transforms many feature variables into few synthetic variables. Aiming at the characteristics that the samples processed have more feature variables, combining with the structure feature of BP neural network, a FA-BP neural network algorithm is proposed. Firstly we reduce the dimensionality of the feature factor using FA, and then regard the features reduced as the input of the BP neural network, carry on network training and simulation with low dimensional data that we get. This algorithm here can simplify the network structure, improve the velocity of convergence, and save the running time. Then we apply the new algorithm in the field of pest prediction to emulate. The results show that under the prediction precision is not reduced, the error of the prediction value is reduced by using the new algorithm, and therefore the algorithm is effective.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：