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

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

作者： Gonzalez-Diaz, Rocio Ion, Adrian Iglesias-Ham, Mabel Kropatsch, Walter G. Univ Seville Dept Appl Math Seville Spain CENATAV Pattern Recognit Dept Havana Cuba Vienna Univ Technol Pattern Recognit & Image Proc Grp A-1040 Vienna Austria

ISBN: (纸本)9783642021237

Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide more refined algebraic invariants to a topological space that does homology. It assigns 'quantities' to the chains used in homology to characterize holes of any dimension. graph pyramids can be used to describe subdivisions of the same object at multiple levels of detail. this paper presents cohomology in the context of structural pattern recognition and introduces an algorithm to efficiency compute representative cocycles (the basic elements of cohomology) in 2D using a graph pyramid. Extension to nD and application in the context of pattern recognition are discussed.

关键词： graph pyramids representative cocycles of cohomology generators

来源：评论

学校读者我要写书评

暂无评论

Characteristic Polynomial Analysis on Matrix representations of graphs

Characteristic Polynomial Analysis on Matrix Representations...

引用

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

作者： Ren, Peng Wilson, Richard C. Hancock, Edwin R. Univ York Dept Comp Sci York YO10 5DD N Yorkshire England

ISBN: (纸本)9783642021237

Matrix representations for graphs play an important role in combinatorics. In this paper, we investigate four matrix representations for graphs and carry out an characteristic polynomial analysis upon them. the first two graph matrices are the adjacency matrix and Laplacian matrix. these two matrices call be obtained straightforwardly from graphs. the second two matrix representations, which are newly introduced [9][3], arc closely related with the Ihara zeta function and the discrete time quantum walk. they have a similar form and are established from a transformed graph. i.e. the oriented line graph of the original graph. We make use of the characteristic polynomial coefficients of the four matrices to characterize graphs and construct pattern spaces with a fixed dimensionality. Experimental results indicate that the two matrices in the transformed domain perform better than the two matrices in the original graph domain whereas the matrix associated with the Ihara zeta function is more efficient and effective than the matrix associated with the discrete time quantum walk and the remaining methods.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Image Segmentation Using graph representations and Local Appearance and Shape Models

Image Segmentation Using Graph Representations and Local App...

引用

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

作者： Keustermans, Johannes Seghers, Dieter Mollemans, Wouter Vandermeulen, Dirk Suetens, Paul Katholieke Univ Leuven Fac Med Med Imaging Res Ctr Radiol ESAT PSI Univ Hosp Gasthuisberg Herestr 49 B-3000 Louvain Belgium Medicim NV B-2800 Mechelen Belgium

ISBN: (纸本)9783642021237

A generic model-based segmentation algorithm is presented. based on a set of training data, consisting of images with corresponding object segmentations, a local appearance and local shape model is build. the object is described by a set of landmarks. For each landmark a local appearance model is build. this model describes the local intensity values in the image around each landmark. the local shape model is constructed by considering the landmarks to be vertices in an undirected graph. the edges represent the relations between neighboring landmarks. By implying the markovianity property on the graph, every landmark is only directly dependent upon its neighboring landmarks, leading to a local shape model. the objective function to be minimized is obtained from a maximum a-posteriori approach. To minimize this objective function, the problem is discretized by considering a finite set of possible candidates for each landmark. In this way the segmentation problem is turned into a labeling problem. Mean field annealing is used to optimize this labeling problem. the, algorithm is validated for the segmentation of teeth from cone beam computed tomography images and for automated cephalometric analysis.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Directly computing the generators of image homology using graph pyramids

引用

IMAGE AND VISION COMPUTING 2009年第7期27卷 846-853页

作者： Peltier, Samuel Ion, Adrian Kropatsch, Walter G. Damiand, Guillaume Haxhimusa, Yll Vienna Univ Technol Pattern Recognit & Image Proc Grp Fac Informat A-1040 Vienna Austria Univ Lyon CNRS LIRIS UMR5205 F-69622 Villeurbanne France Purdue Univ Dept Psychol Sci W Lafayette IN 47907 USA

We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure, i.e. irregular graph pyramid. Starting from an image, a hierarchy of the image is built by two operations that preserve homology of each region. Instead of computing homology generators in the base where the number of entities (cells) is large, we first reduce the number of cells by a graph pyramid. then homology generators are computed efficiently on the top level of the pyramid, since the number of cells is small. A top down process is then used to deduce homology generators in any level of the pyramid, including the base level, i.e. the initial image. the produced generators fit on the object boundaries. A unique set of generators called the minimal set, is defined and its computation is discussed. We show that the new method produces valid homology generators and present some experimental results. (C) 2008 Elsevier B.V. All rights reserved.

关键词： Homology generators Irregular graph pyramids

来源：评论

学校读者我要写书评

暂无评论

On-line signature verification: An approach based on cluster representations of global features

On-line signature verification: An approach based on cluster...

引用

7th international Conference on Advances in pattern recognition, ICAPR 2009

作者： Guru, D.S. Prakash, H.N. Manjunath, S. Department of Studies in Computer Science University of Mysore Mysore 570 006 India

ISBN: (纸本)9780769535203

In this paper, we propose a new method of representation of on-line signatures by clustering of signatures. Our idea is to provide better representation by clustering of signatures based on global features. Global features of signatures of each cluster are used to form an interval valued feature vector which is a symbolic representation for a cluster. based on cluster representation, we propose methods of signature verification. We compare the feasibility of the proposed representation scheme for signature verification on a large MCYT-signature database [1] of 16500 signatures. Unlike other signature verification methods, the proposed method is simple and efficient and in addition, shows a remarkable reduction in EER. © 2009 IEEE.

关键词： Fuzzy C-means (FCM) clustering Global features On-line signature verification Symbolic feature vector

来源：评论

学校读者我要写书评

暂无评论

Run-Length and Edge Statistics based Approach for Image Splicing Detection

Run-Length and Edge Statistics Based Approach for Image Spli...

引用

7th international workshop on Digital Watermarking

作者： Dong, Jing Wang, Wei Tan, Tieniu Shi, Yun Q. Chinese Acad Sci Inst Automat Natl Lab Pattern Recognit POB 2728 Beijing Peoples R China New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA

ISBN: (纸本)9783642044373

In this paper, a simple but efficient approach for blind image splicing detection is proposed. Image splicing is a common and fundamental operation used for image forgery. the detection of image splicing is a preliminary but desirable study for image forensics. Passive detection approaches of image splicing are usually regarded as pattern recognition problems based on features which are sensitive to splicing. In the proposed approach, we analyze the discontinuity of image pixel correlation and coherency caused by splicing in terms of image run-length representation and sharp image characteristics. the statistical features extracted from image run-length representation and image edge statistics are used for splicing detection. the support vector machine (SVM) is used as the classifier. Our experimental results demonstrate that the two proposed features outperform existing ones both in detection accuracy and computational complexity.

关键词： image splicing run-length edge detection characteristic functions support vector machine (SVM)

来源：评论

学校读者我要写书评

暂无评论

Syntax tree fingerprinting for source code similarity detection

Syntax tree fingerprinting for source code similarity detect...

引用

IEEE workshop on Program Comprehension

作者： Michel Chilowicz Etienne Duris Gilles Roussel Laboratoire d'Informatique de l'Institut Gaspard-Monge UMR CNRS 8049 Université Paris-Est Marne-la-Vallee France

Numerous approaches based on metrics, token sequence pattern-matching, abstract syntax tree (AST) or program dependency graph (PDG) analysis have already been proposed to highlight similarities in source code: in this paper we present a simple and scalable architecture based on AST fingerprinting. thanks to a study of several hashing strategies reducing false-positive collisions, we propose a framework that efficiently indexes AST representations in a database, that quickly detects exact (w.r.t source code abstraction) clone clusters and that easily retrieves their corresponding ASTs. Our aim is to allow further processing of neighboring exact matches in order to identify the larger approximate matches, dealing with the common modification patterns seen in the intra-project copy-pastes and in the plagiarism cases.

关键词： Fingerprint recognition Cloning Databases Plagiarism Software maintenance Scalability pattern analysis Indexes Information retrieval pattern matching

来源：评论

学校读者我要写书评

暂无评论

graph-based representations in pattern recognition: 6th IAPR-TC-15 international workshop, GbRPR 2007

Graph-based Representations in Pattern Recognition: 6th IAPR...

引用

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

ISBN: (纸本)9783540729020

the proceedings contain 37 papers. the topics discussed include: bipartite graph matching for computing the edit distance of graphs;matching of tree structures for registration of medical images;graph-based methods for retinal mosaicing and vascular characterization;graph based shapes representation and recognition;a continuous-based approach for partial clique enumeration;a bound for non-subgraph isomorphism;a correspondence measure for graph matching using the discrete quantum walk;a quadratic programming approach to the graph edit distance problem;image classification using marginalized kernels for graphs;comparing sets of 3D digital shapes through topological structures;hierarchy construction schemes within the scale set framework;local reasoning in fuzzy attribute graphs for optimizing sequential segmentation;and graph-based perceptual segmentation of stereo vision 3D images at multiple abstraction levels.

关键词： pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Spotting Symbols in Line Drawing Images Using graph representations

引用

7th international workshop on graphics recognition (GREC 2007)

作者： Qureshi, Rashid Jalal Ramel, Jean-Yves Barret, Didier Cardot, Hubert Univ Tours Lab Informat EA 2101 F-37200 Tours France

ISBN: (纸本)9783540881841

Many methods of graphics recognition have been developed throughout the years for the recognition of pre-segmented graphics symbols but very few techniques achieved the objective of symbol spotting and recognition together in a generic case. To go one step forward through this objective. this paper presents an original solution for symbol spotting using a graph representation of graphical documents. the proposed strategy has two main step. In the first step, a graph based representation of a document image is generated that includes selection of description primitives (nodes of the graph) and organisation of these features (edges). In the second step the graph is used to spot interesting parts of the image that potentially correspond to symbols. the sub-graphs associated to selected zones are then submitted to a graph matching algorithm in order to take the final decision and to recognize the class of the symbol. the experimental results obtained on different types of documents demonstrates that the system can handle different types of images without any modification.

关键词： Document Image Analysis graphics Symbols recognition Symbol Spotting Raster-to-Vector Techniques Line drawings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：