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

International Conference on Computer and Information Technology (CIT)

作者： Xiaoxin Guo Zhiwen Xu Yinan Lu Yunjie Pang Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China

ISBN: (纸本)076952432X

In this paper, a novel filter model called extended adaptive weighted averaging (EAWA) filter model is proposed, by which some particular filters can be designed via selecting an appropriate pixel of interest (POI) and defining a weight distribution function for the filter according to some specified requirements. Based on the novel model, a fluorescein-angiogram-oriented filter, high-intensity preserving (HIP) filter is introduced to solve the problems of high-intensity preservation when filtering noise. The results of the experiments show that the HIP filter has the features of frame-averaging, which can achieve noise suppression efficiently, and the features of high-intensity preservation, which can keep the intensities of bright pixels from degrading via distributing the weights adoptively according to the intensity of each pixel

关键词： Noise reduction Filtering Adaptive filters Hip Degradation Image analysis Fluorescence Distribution functions Image sequences Retina

来源：评论

学校读者我要写书评

暂无评论

Robust estimation of the fundamental matrix based on an error model

Robust estimation of the fundamental matrix based on an erro...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Hui-Xiang Zhong Yue-Ping Feng Yun-Jie Pang College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun China

A new method is presented for robustly estimating fundamental matrix from matched points. The method comprises two parts. The first uses a robust technique - the random sample consensus (RANSAC) to discard outliers in an initial set of matched points. It adopts the sampling strategy to generate inliers from the initial set. The second part of the method is an algorithm for computing fundamental matrix, using the output of the RANSAC. This algorithm is based on the consistent fundamental matrix estimation in a quadratic measurement error model. An extended system for determining the estimator is proposed, and an efficient implementation for solving the system - a continuation method is developed. The proposed algorithm avoids solving total eigenvalue problems. Results for both synthetic and real images show the effectiveness of the proposed method.

关键词： Robustness Measurement errors Computer errors Eigenvalues and eigenfunctions Computer vision Layout Educational institutions Computer science Educational technology Laboratories

来源：评论

学校读者我要写书评

暂无评论

Qualitative spatial relationships cleaning for spatial data mining

Qualitative spatial relationships cleaning for spatial data ...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Hai-Bin Sun Wen-Hui Li Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China

In this article, we investigate the problem of preparing qualitative spatial relations before implementing spatial data mining by checking consistency in a constraint network, which includes topological and cardinal directional relations between pairs of spatial objects. We aim to explore potential spatial relations and possible inconsistency among the data of relationships for enforcing the correctness of spatial data mining. This task is carried out through qualitative spatial reasoning method, specifically consistency checking. We try to lay the theoretical foundation for this kind of problem. Instead of using conventional composition tables, we investigate the interactions between topological and cardinal directional relations with the aid of rules. These rules are shown to be sound, i.e. the deductions are logically correct. Based on these rules, an improved constraint propagation algorithm is introduced to enforce the path consistency. An example is presented to show the utility of these rules.

关键词： Cleaning Data mining computational complexity Spatial databases Topology Sun Laboratories Computer networks knowledge engineering Computer science education

来源：评论

学校读者我要写书评

暂无评论

An Application of Fourier-Mellin Transform in Image Registration

An Application of Fourier-Mellin Transform in Image Registra...

引用

International Conference on Computer and Information Technology (CIT)

ISBN: (纸本)076952432X

Fourier-Mellin transform (FMT) is frequently used in content-based image retrieval and digital image watermarking. This paper extends the application of FMT into image registration and proposes an improved registration algorithm based on FMT for the alignment of images differing in translation, rotation angle, and uniform scale factor. The proposed algorithm can eliminate the conversion from Cartesian to log-polar coordinates, avoid the process of interpolation required in the conversion, and obtain a more significant improvement than the conventional method using cross-correlation. Experiments show that the algorithm is accurate and robust regardless of white noise

关键词： Fourier transforms Image registration Image converters Image retrieval Content based retrieval Digital images Watermarking Interpolation Noise robustness White noise

来源：评论

学校读者我要写书评

暂无评论

Realize utility-driven decision theoretic planning on the planning graph

Realize utility-driven decision theoretic planning on the pl...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： You-hong Zhang Ming-hao Yin Wen-xiang Gu Department of Information and Mathematics College of Science Foshan University Foshan China School of Computer Science Northeast Normal University Changchun Jilin China Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun China

This paper presents a new model to incorporate decision theory into Graphplan framework, which enables our planner to handle uncertainty and make decision to choose the optimal one among a set of hypothesis valid plans. This planer, called UTDP is tested on several experimental domains. And the experimental results show that UTGP is sound and efficient and performs better than the famous probabilistic planner Buridan.

关键词： Uncertainty Decision theory Strips Mathematics Educational institutions Computer science Laboratories Computer science education Electronic mail Mathematical model

来源：评论

学校读者我要写书评

暂无评论

AN IMPROVED BICLUSTERING ALGORITHM AND ITS APPLICATION TO GENE EXPRESSION SPECTRUM ANALYSIS

引用

Genomics, Proteomics & Bioinformatics 2005年第3期3卷 189-193页

作者： Hua Qu Liu-Pu Wang Yan-Chun Liang Chun-Guo Wu College of Software Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun 130012 China Guangzhou Institute of China Telecom Guangzhou 510630 China College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China Key Laboratory of Information Science and Engineering of the Ministry of Railway/Key Laboratory of Advanced Information Science and Network Technology of Beijing Beijing Jiaotong University Beijing 100044 China.

Cheng and Church algorithm is an important approach in biclustering algorithms. In this paper, the process of the extended space in the second stage of Cheng and Church algorithm is improved and the selections of two important parameters are discussed. The results of the improved algorithm used in the gene expression spectrum analysis show that, compared with Cheng and Church algorithm, the quality of clustering results is enhanced obviously, the mining expression models are better, and the data possess a strong consistency with fluctuation on the condition while the computational time does not increase significantly.

关键词： biclustering algorithm gene expression pedigree analysis Cheng and Church algorithm

来源：评论

学校读者我要写书评

暂无评论

Network intrusion detection system based on adaptive resonance theory

引用

Jisuanji Xuebao/Chinese Journal of Computers 2005年第11期28卷 1882-1889页

作者： Tian, Da-Xin Liu, Yan-Heng Wei, Da Key Laboratory of Symbolic Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China

A network intrusion detection system based on adaptive resonance theory (ARTNIDS) is put forward. It detects network intrusions by using anomaly-based detection method. Since the heads of network datagrams include almost all the control information and all datagrams can be caught through an efficient method, the description of network behavior relies upon the datagrams. The advantage of adaptive resonance theory ensures that ARTNIDS can study in real time and in an unsupervised way, which is essential to anomaly-based detection. The modified adaptive resonance theory algorithm improves the efficiency of studying and the datagram missing rate has been reduced from 15% to 10%. A similar Hamming distance method is adopted in the detection, which is effective in reducing false positive errors and false negative errors;the error rate is less than 10%. The experimental results show that the intrusion detection system based on adaptive resonance theory can detect intrusion behavior in local area network accurately.

关键词： Local area networks

来源：评论

学校读者我要写书评

暂无评论

Hierarchical topological relations model of fuzzy raster regions

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2005年第7期42卷 1166-1172页

作者： Yu, Qiangyuan Liu, Dayou Wang, Shengsheng College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory for Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China

The modeling of topological relations between spatial regions is a primary topic in spatial reasoning, geographic information systems (GIS) and spatial databases. In many geographical applications spatial regions do not always have homogeneous interiors and sharply defined boundaries, but frequently their interiors and boundaries are fuzzy. Recently, representing fuzzy spatial regions and modeling the topological relations between them plays an increasingly important theory and application role. Based on the characteristics of fuzzy regions in raster data model and the requirement of topological relations analysis in applications, a hierarchical topological relations model is proposed. The model can determine the topological relation between fuzzy raster regions on multiple levels with the values of three predicate. When predicates are evaluated within two values, it can deal with crisp raster regions as a specific case and there are 5 possible cases of topological relations. When predicates are evaluated within three values, there are 27 possible cases. There are 51 possible cases when predicates are evaluated within six values. In practical applications, the model can analyze topological relations of fuzzy raster regions according to the existing facts and the requirement. The model is wieldy in practical applications and achieves satisfactory results.

关键词： Fuzzy raster regions Hierarchical model Spatial reasoning Topological relations

来源：评论

学校读者我要写书评

暂无评论

Nondestructive quantitative analysis of compound paracetamol and diphenhydramine hydrochloride powder using RBF networks

Nondestructive quantitative analysis of compound paracetamol...

引用

International Conference on Machine Learning and Cybernetics, ICMLC 2005

作者： Zheng, Hong Wan, Li.-Ming Jiang, Jing-Qing Liang, Yan-Chun Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China College of Computer Science and Engineering Changchun University of Technology Changchun 130012 China Institute of General Development and Evaluation of Equipment EAAF of PLA Beijing 100076 China College of Mathematics and Computer Science Inner Mongolia University for Nationalities Tongliao 028043 China

ISBN: (纸本)078039092X

A method for simultaneous analysis of the two components of compound paracetamol and diphenhydramine hydrochloride powdered drugs on near-infrared (NIR) spectroscopy is developed by using a Radial Basis Function (RBF) network. Nearest neighbor-clustering algorithm is used as the learning algorithm of RBF network. Comparisons of the results obtained from the RBF models with those from BP models show that it is feasible to use the RBF network in nondestructive quantitative analysis of the components of drugs. © 2005 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Algorithm for generating concepts based on search space partition

引用

Ruan Jian Xue Bao/Journal of Software 2005年第12期16卷 2029-2035页

作者： Qi, Hong Liu, Da-You Hu, Cheng-Quan Lu, Ming Zhao, Liang College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Changchun 130012 China

Concept lattice, the core data structure in formal concept analysis, has been used widely in machine learning, data mining and knowledge discovery, information retrieval, etc. The main difficulty with concept lattice-based system comes from the lattice construction itself. This paper proposes a new algorithm called SSPCG (search space partition based concepts generation) based on the closures search space partition. The algorithm divides the closures search space into several subspaces in accordance with the criterions prescribed ahead, and introduces an efficient scheme to recognize the valid ones, which bounds searching just in these valid subspaces. An intermediate structure is employed to judge the validity of a subspace and compute closures more efficiently. Since the partition of the search space is recursive and the searching in subspaces is independent, a parallel version can be directly reached. The algorithm is experimental evaluated and compared with the famous NextClosure algorithm proposed by Ganter for random generated data, as well as for real application data. The results show that the algorithm performs much better than the later.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：