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

An iris recognition approach through structural pattern analysis methods

EXPERT SYSTEMS 2010年第1期27卷 6-16页

作者： Proenca, Hugo Univ Beira Interior IT Dept Comp Sci Covilha Portugal

Continuous efforts have been made to improve the robustness of iris coding methods since Daugman's pioneering work on iris recognition was published. Iris recognition is at present used in several scenarios (airport check-in, refugee control etc.) with very satisfactory results. However, in order to achieve acceptable error rates several imaging constraints are enforced, which reduce the fluidity of the iris recognition systems. The majority of the published iris recognition methods follow a statistical pattern recognition paradigm and encode the iris texture information through phase, zero-crossing or texture-analysis based methods. In this paper we propose a method that follows the structural (syntactic) pattern recognition paradigm. In addition to the intrinsic advantages of this type of approach (intuitive description and human perception of the system functioning), our experiments show that the proposed method behaves comparably to the statistical approach that constitutes the basis of nearly all deployed systems.

关键词： noisy iris recognition structural pattern analysis graph matching biometrics

来源：评论

学校读者我要写书评

暂无评论

Matching based ground-truth annotation for online handwritten mathematical expressions

引用

pattern RECOGNITION 2015年第3期48卷 837-848页

作者： Hirata, Nina S. T. Julca-Aguilar, Frank D. Univ Sao Paulo Inst Math & Stat Dept Comp Sci BR-1010 Sao Paulo Brazil

Assessment of mathematical expression recognition at expression level only is not sufficient to diagnose strengths and weaknesses of different recognition systems. In order to make assessment at different levels possible, large datasets annotated with ground-truth data at different levels, such as at symbol segmentation, symbol classification, symbol/sub-expression spatial relationships, baselines or whole expression levels, are needed. Creation of ground-truthed datasets of handwritten mathematical expressions is a challenging task due to the need to cope with a large variability of symbol classes, expression layouts, writing styles, among other issues including the fact that manual annotation is an error-prone procedure. We propose an expression matching approach where symbols in a transcribed expression are assigned to the corresponding symbols in the respective model expression. Matching is formulated as a simple linear assignment problem where matching cost is defined as a weighted linear combination of local (symbol) and global (structural) characteristics. Once a symbol-to-symbol assignment is computed, not only symbol labels but all other ground-truth data attached to the model expression can be automatically transferred to the transcribed expression. We use two independent large test sets to empirically evaluate the influence of the cost function terms on matching performance. Results show mean symbol assignment rates above 99% on both sets, suggesting the potential of the method as an useful tool for helping the creation of ground-truthed online mathematical expression datasets. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： structural pattern analysis Shape information Handwriting recognition Linear assignment problem Ground-truth annotation Mathematical expression dataset

来源：评论

学校读者我要写书评

暂无评论

Multifocal electroretinography: structural pattern analysis and early glaucoma detection

引用

ELECTRONICS LETTERS 2009年第22期45卷 1113-1114页

作者： Miguel-Jimenez, J. M. Ortega, S. Boquete, L. Rodriguez-Ascariz, J. M. Blanco, R. Univ Alcala de Henares Dept Elect Alcala De Henares 28701 Spain Univ Alcala de Henares Dept Surg Alcala De Henares 28701 Spain

Glaucomatous optic neuropathy is probably one of the most prevalent chronic ophthalmologic diseases, affecting more than 5% of the population over 60 years of age. Early-stage glaucoma may be detected by studying local responses from many different areas of the retina, obtained by means of multifocal electroretinography (multifocal ERG), a new functional diagnostic technique. The described multifocal ERG waveform analysis, involved extracting waveform identity patterns and a neural network classifier, and allows detection of early glaucoma visual field defects.

关键词： early glaucoma detection neural nets structural pattern analysis medical diagnostic computing glaucomatous optic neuropathy pattern classification multifocal electroretinography Neural computing techniques Patient diagnostic methods and instrumentation chronic ophthalmologic disease glaucoma visual field defect Biology and medical computing Electrodiagnostics and other electrical measurement techniques multifocal ERG waveform analysis diseases neural network classifier functional diagnostic technique electroretinography

来源：评论

学校读者我要写书评

暂无评论

structural network analysis of biological networks for assessment of potential disease model organisms

引用

JOURNAL OF BIOMEDICAL INFORMATICS 2014年 47卷 178-191页

作者： Nabhan, Ahmed Ragab Sarkar, Indra Neil Univ Vermont Ctr Clin & Translat Sci Burlington VT 05405 USA Univ Vermont Dept Mol Genet & Microbiol Burlington VT 05405 USA Univ Vermont Dept Comp Sci Burlington VT 05405 USA Fayoum Univ Fac Comp & Informat Al Fayoum Egypt

Model organisms provide opportunities to design research experiments focused on disease-related processes (e.g., using genetically engineered populations that produce phenotypes of interest). For some diseases, there may be non-obvious model organisms that can help in the study of underlying disease factors. In this study, an approach is presented that leverages knowledge about human diseases and associated biological interactions networks to identify potential model organisms for a given disease category. The approach starts with the identification of functional and interaction patterns of diseases within genetic pathways. Next, these characteristic patterns are matched to interaction networks of candidate model organisms to identify similar subsystems that have characteristic patterns for diseases of interest. The quality of a candidate model organism is then determined by the degree to which the identified subsystems match genetic pathways from validated knowledge. The results of this study suggest that non-obvious model organisms may be identified through the proposed approach. (C) 2013 Elsevier Inc. All rights reserved.

关键词： Disease pathway mining Translational bioinformatics structural pattern analysis Interaction networks

来源：评论

学校读者我要写书评

暂无评论

Opinion Mining through structural Data analysis Using Neuronal Group Learning

Opinion Mining through Structural Data Analysis Using Neuron...

引用

6th Atlantic Web Intelligence Conference

作者： Pryczek, Michal Szczepaniak, Piotr S. Tech Univ Lodz Inst Informat Technol PL-90924 Lodz Poland

ISBN: (纸本)9783642106866

Opinion Mining (OM) and Sentiment analysis problems lay in the conjunction of such fields as Information Retrieval and Computational Linguistics. As the problems are semantic oriented, the solution must be looked for not in data as such, but in its meaning, considering complex (both internal and external,) domain specific context relations. This paper presents Opinion Mining as a specific definition of structural pattern recognition problem. Neuronal Group Learning, earlier presented as general structural data analysis tool, is specialised to infer annotations from natural language text.

关键词： Opinion Mining Neural Networks structural pattern analysis

来源：评论

学校读者我要写书评

暂无评论

Fast kernel for calculating structural information similarities

Fast kernel for calculating structural information similarit...

引用

3rd IEEE International Conference on Intelligent Systems

作者： Wei, Jin-Mao Wang, Shu-Qin Wang, Jing You, Jun-Ping Institute of Computational Intelligence Northeast Normal University Open Symbol Computation and Knowledge Engineering Laboratory of State Education Jilin University Changchun Jilin 130024 China School of Mathematics and Statistics Northeast Normal University Changchun Jilin 130024 China

ISBN: (纸本)9781424401956

structural similarity computation plays a crucial role in many applications such as in searching similar documents, in comparing chemical compounds, in finding genetic similarities, etc. We propose in this paper to use structural information content (SIC) for measuring structural information, considering both the nodes and edges of trees. We utilize a binary encoding approach for assigning the weights of different layer nodes and determining if some tree is a subtree of another tree. By defining a fast kernel and recursively computing SICs, we evaluate the structural information similarities of data trees to pattern trees. In the paper, we present the algorithm for calculating SICs with computation complexity of O(n), and use simple examples to instantiate the performance of the proposed method..

关键词： structural information content structural similarity structural pattern analysis web mining

来源：评论

学校读者我要写书评

暂无评论

Cyclic sequence alignments: Approximate versus optimal techniques

引用

INTERNATIONAL JOURNAL OF pattern RECOGNITION AND ARTIFICIAL INTELLIGENCE 2002年第3期16卷 291-299页

作者： Mollineda, RA Vidal, E Casacuberta, F Univ Politecn Valencia Inst Tecnol Informat E-46071 Valencia Spain

The problem of cyclic sequence alignment is considered. Most existing optimal methods for comparing cyclic sequences are very time consuming. For applications where these alignments are intensively used, optimal methods axe seldom a feasible choice. The alternative to an exact and costly solution is to use a close-to-optimal but cheaper approach. In previous works, we have presented three suboptimal techniques inspired on the quadratic-time suboptimal algorithm proposed by Bunke and Buhler. Do these approximate approaches come sufficiently close to the optimal solution, with a considerable reduction in computing time? Is it thus worthwhile investigating these approximate methods? This paper shows that approximate techniques are good alternatives to optimal methods.

关键词： cyclic sequences cyclic string matching structural pattern analysis

来源：评论

学校读者我要写书评

暂无评论

Cyclic sequence alignments: Approximate versus optimal techniques

Cyclic sequence alignments: Approximate versus optimal techn...

引用

9th Spanish Symposium on pattern Recognition and Image analysis (SNRAFI 2001)

作者： Mollineda, RA Vidal, E Casacuberta, F Univ Politecn Valencia Inst Tecnol Informat E-46071 Valencia Spain

关键词： cyclic sequences cyclic string matching structural pattern analysis

来源：评论

学校读者我要写书评

暂无评论

A windowed weighted approach for approximate cyclic string matching

A windowed weighted approach for approximate cyclic string m...

引用

16th International Conference on pattern Recognition (ICPR)

作者： Mollineda, RA Vidal, E Casacuberta, F Univ Politecn Valencia Inst Tecnol Informat E-46071 Valencia Spain

ISBN: (纸本)076951695X

A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, which are founded on a window-constrained edit graph related to the strings involved. Weights are the ones which minimize the sum of squared relative errors of the weighted solution with respect to exact values, on a training set of string pairs. This method takes O(n(2)) time. Experiments on both artificial and real data, show the highly accurate solutions achieved by this technique, which is clearly faster than the most efficient exact algorithms.

关键词： cyclic string cyclic edit distance approximate string matching structural pattern analysis

来源：评论

学校读者我要写书评

暂无评论

Efficient techniques for a very accurate measurement of dissimilarities between cyclic patterns

Efficient techniques for a very accurate measurement of diss...

引用

Joint International-Association-of-pattern-Recognition International Workshops - SSPR 2000 and SPR 2000

作者： Mollineda, RA Vidal, E Casacuberta, F Univ Politecn Valencia Inst Tecnol Informat E-46071 Valencia Spain

ISBN: (纸本)3540679464

Two efficient approximate techniques for measuring dissimilarities between cyclic patterns are presented. They are inspired on the quadratic time algorithm proposed by Bunke and Buhler. The first technique completes pseudoalignments built by the Bunke and Buhler algorithm (BBA), obtaining full alignments between cyclic patterns. The edit cost of the minimum-cost alignment is given as an upper-bound estimation of the exact cyclic edit distance, which results in a more accurate bound than the lower one obtained by BBA. The second technique uses both bounds to compute a weighted average, achieving even more accurate solutions. Weights come from minimizing the sum of squared relative errors with respect to exact distance values on a training set of string pairs. Experiments were conducted on both artificial and real data, to demonstrate the capabilities of new techniques in both accurateness and quadratic computing time.

关键词： cyclic patterns cyclic strings approximate string matching structural pattern analysis 2D shape recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：