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

Parallel matching of 3D articulated object recognition

international JOURNAL OF pattern recognition AND ARTIFICIAL INTELLIGENCE 1999年第4期13卷 431-443页

作者： Wang, PSP Northeastern Univ Coll Comp Sci Boston MA 02115 USA

In dealing with large volume image data, sequential methods usually are too slow and unsatisfactory. this paper introduces a new system employing parallel matching in high-level recognition of 3D articulated objects. A new structural strategy using linear combination. and parallel graphic matching techniques is presented for 3D polyhedral objects representable by 2D line-drawings. It solves one of the basic concerns in diffusion tomography complexities, i.e. patterns can be reconstructed through fewer projections, and 3D objects can be recognized by a few learning sample views. It also improves some of the current methods while overcoming their drawbacks. Furthermore, it can distinguish very similar objects and is more accurate than other methods in the literature. An online webpage system for understanding and recognizing 3D objects is also illustrated.

关键词： image visualization and understanding 3D articulated objects pattern recognition linear combination diffusion tomography parallel graph matching finite representation

来源：评论

学校读者我要写书评

暂无评论

Data-driven Latent graph Structure Learning for Diagnosis of Alzheimer's Syndrome 26

Data-driven Latent Graph Structure Learning for Diagnosis of...

引用

26th international Conference on pattern recognition / 8th international workshop on Image Mining - theory and Applications (IMTA)

作者： Wang, Jianjia Wu, Chong Shanghai Univ Shanghai Inst Adv Commun & Data Sci Sch Comp Engn & Sci Shanghai Peoples R China Shanghai Univ Sch Comp Engn & Sci Shanghai 200444 Peoples R China

ISBN: (数字)9781665490627

ISBN: (纸本)9781665490627

Complex systems often have a latent graph structure. Studying the underlying graph structure will help us to analyze the mechanisms of complex phenomena. However, it is a challenging problem to learn effective graph structures from the data and apply them to downstream tasks. In this paper, we propose an end-to-end graph learning approach for Alzheimer's syndrome diagnosis based on functional magnetic resonance imaging (fMRI) data of brain regions, which is completely data-driven. the interactions between time-series of each brain region are represented as graph structures, and a multi-head attention mechanism is used to update the representations of the nodes. then, the graph structures are obtained from the feature sampling of the edges. Finally, the learned graph structure is combined with the left-out time-series data features and the node prior to completing the classification task of the brain network. In comparison with the latest research methods, our approach achieves higher classification accuracy.

关键词： Image edge detection Functional magnetic resonance imaging pattern recognition Task analysis Alzheimer's disease Complex systems

来源：评论

学校读者我要写书评

暂无评论

Approximative graph pyramid solution of the E-TSP

引用

IMAGE AND VISION COMPUTING 2009年第7期27卷 887-896页

作者： Haxhimusa, Yll Kropatsch, Walter G. Pizlo, Zygmunt Ion, Adrian Purdue Univ Dept Psychol Sci Coll Liberal Arts Lafayette IN 47907 USA Vienna Univ Technol Fac Informat Inst Comp Aided Automat Pattern Recognit & Image Vienna Austria

the traveling salesman problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution for an input with a large number of cities, the problem is transformed into a simpler form containing smaller number of cities, which is then solved optimally. graph pyramid solution strategies, using Boruvka's minimum spanning tree step, convert, in a bottom-up processing, a 2D Euclidean TSP problem with a large number of cities into successively smaller problems (graphs) with similar layout and solution, until the number of cities is small enough to seek the optimal solution. Expanding this tour solution in a top-down manner, to the lower levels of the pyramid, leads to an approximate solution. the new model has an adaptive spatial structure and it simulates visual acuity and visual attention. the model solves the TSP problem sequentially, by moving attention from city to city, and the quality of the solutions is similar to the solutions produced by humans. the graph pyramid data structures and processing strategies provide good methods for finding near-optimal solutions for computationally hard problems. Isolating processing used by humans to solve computationally hard problems is of general importance to psychology community and might lead to advances in pattern recognition. (C) 2008 Elsevier B.V. All rights reserved.

关键词： Hierarchical representation graph pyramids Human problem solving Traveling salesman problem Boruvka's minimum spanning tree

来源：评论

学校读者我要写书评

暂无评论

On Computing Canonical Subsets of graph-based Behavioral representations

On Computing Canonical Subsets of Graph-Based Behavioral Rep...

引用

7th international workshop on graph-based representations in pattern recognition

作者： Mankowski, Walter C. Bogunovich, Peter Shokoufandeh, Ali Salvucci, Dario D. Drexel Univ Dept Comp Sci Philadelphia PA 19104 USA

ISBN: (纸本)9783642021237

the collection of behavior protocols is a common practice in human factors research, but the analysis of these large data sets has always been a tedious and time-consuming process. We are interested in automatically finding canonical behaviors: a small subset of behavioral protocols that is most representative of the full data set, providing a view of the data with as few protocols as possible. Behavior protocols often have a natural graph-based representation, yet there has been little work applying graph theory to their study. In this paper we extend our recent algorithm by taking into account the graph topology induced by the paths taken through the space of possible behaviors. We applied this technique to find canonical web-browsing behaviors for computer users. By comparing identified canonical sets to a ground truth determined by expert human coders. we found that this graph-based metric outperforms our previous metric based on edit distance.

关键词： graph theory

来源：评论

学校读者我要写书评

暂无评论

A Survey on Applications of Bipartite graph Edit Distance 11th

A Survey on Applications of Bipartite Graph Edit Distance

引用

11th IAPR-TC15 international workshop on graph-based representations in pattern recognition (GbRPR)

作者： Stauffer, Michael Tschachtli, thomas Fischer, Andreas Riesen, Kaspar Univ Appl Sci & Arts Northwestern Switzerland Inst Informat Syst Riggenbachstr 16 CH-4600 Olten Switzerland Univ Fribourg Dept Informat CH-1700 Fribourg Switzerland Univ Appl Sci & Arts Western Switzerland Inst Complex Syst CH-1705 Fribourg Switzerland Univ Pretoria Dept Informat Pretoria South Africa

ISBN: (纸本)9783319589619;9783319589602

About ten years ago, a novel graph edit distance framework based on bipartite graph matching has been introduced. this particular framework allows the approximation of graph edit distance in cubic time. this, in turn, makes the concept of graph edit distance also applicable to larger graphs. In the last decade the corresponding paper has been cited more than 360 times. Besides various extensions from the methodological point of view, we also observe a great variety of applications that make use of the bipartite graph matching framework. the present paper aims at giving a first survey on these applications stemming from six different categories (which range from document analysis, over biometrics to malware detection).

关键词： Applications of bipartite graph matching graph-based pattern representations

来源：评论

学校读者我要写书评

暂无评论

An analysis of the feasibility of graph compression techniques for indexing regular path qeries 5

An analysis of the feasibility of graph compression techniqu...

引用

5th international workshop on graph Data Management Experiences and Systems, GRADES 2017

作者： Tetzel, Frank Voigt, Hannes Paradies, Marcus Lehner, Wolfgang Dresden Database Systems Group Technische Universität Dresden Germany SAP SE Germany

ISBN: (纸本)9781450350389

Regular path queries (RPQs) are a fundamental part of recent graph query languages like SPARQL and PGQL. they allow the definition of recursive path structures through regular expressions in a declarative pattern matching environment. We study the use of the K2-tree graph compression technique to materialize RPQ results with low memory consumption for indexing. Compact index representations enable the efficient storage of multiple indexes for varying RPQs. © 2017 ACM.

关键词： pattern matching

来源：评论

学校读者我要写书评

暂无评论

graph-based representations in pattern recognition 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Walter G. Kropatsch Nicole M. Artner Yll Haxhimusa Xiaoyi Jiang

ISBN: (数字)9783642382215

ISBN: (纸本)9783642382208

this book constitutes the refereed proceedings of the 9th IAPR-TC-15 international workshop on graph-based representations in pattern recognition, GbRPR 2013, held in Vienna, Austria, in May 2013. the 24 papers presented in this volume were carefully reviewed and selected from 27 submissions. they are organized in topical sections named: finding subregions in graphs; graph matching; classification; graph kernels; properties of graphs; topology; graph representations, segmentation and shape; and search in graphs.

关键词： pattern recognition Image Processing and Computer Vision Computer Imaging, Vision, pattern recognition and graphics Computer graphics Discrete Mathematics in Computer Science Data Structures

来源：评论

学校读者我要写书评

暂无评论

graph-based clustering of random point set

引用

10th international workshop on Structural and Syntactic pattern recognition/5th international Conference on Statistical Techniques in pattern recognition

作者： Imiya, A Tatara, K Chiba Univ Inst Media & Informat Technol Inage Ku Chiba 2638522 Japan Chiba Univ Sch Sci & Technol Inage Ku Chiba 2638522 Japan

In this paper, we define clusters and the boundary curves of clusters in a random point set using the Delaunay triangulation and the principal curve analysis. the principal curve analysis is a generalization of princi... 详细信息

ISBN: (纸本)3540225706

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

A comparison of explicit and implicit graph embedding methods for pattern recognition

A comparison of explicit and implicit graph embedding method...

引用

9th IAPR-TC-15 international workshop on graph-based representations in pattern recognition, GbRPR 2013

作者： Conte, Donatello Ramel, Jean-Yves Sidère, Nicolas Luqman, Muhammad Muzzamil Gaüzère, Benoît Gibert, Jaume Brun, Luc Vento, Mario Italy 64 Avenue Jean Portalis 37200 Tours France L3i Laboratory University of la Rochelle 17042 La Rochelle France GREYC UMR CNRS 6072 14000 Caen France

ISBN: (纸本)9783642382208

In recent years graph embedding has emerged as a promising solution for enabling the expressive, convenient, powerful but computational expensive graph based representations to benefit from mature, less expensive and efficient state of the art machine learning models of statistical pattern recognition. In this paper we present a comparison of two implicit and three explicit state of the art graph embedding methodologies. Our preliminary experimentation on different chemoinformatics datasets illustrates that the two implicit and three explicit graph embedding approaches obtain competitive performance for the problem of graph classification. © 2013 Springer-Verlag.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

On the evaluation of graph centrality for shape matching

On the evaluation of graph centrality for shape matching

引用

9th IAPR-TC-15 international workshop on graph-based representations in pattern recognition, GbRPR 2013

作者： De Sousa, Samuel Artner, Nicole M. Kropatsch, Walter G. Vienna University of Technology Pattern Recognition and Image Processing Group Vienna Austria

ISBN: (纸本)9783642382208

graph centrality has been extensively applied in Social Network Analysis to model the interaction of actors and the information flow inside a graph. In this paper, we investigate the usage of graph centralities in the Shape Matching task. We create a graph-based representation of a shape and describe this graph by using different centrality measures. We build a Naive Bayes classifier whose input feature vector consists of the measurements obtained by the centralities and evaluate the different performances for each centrality. © 2013 Springer-Verlag.

关键词： graphic methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：