Publicacions CVC -- Query Results

	Publicacions CVC Home \| Show All \| Simple Search \| Advanced Search \| Add Record \| Import	Login Quick Search: Field: contains: ...
	1786–1800 of 3413 records found matching your query (RSS):

Search & Display Options

Select All Deselect All

[101–110] << 111 112 113 114 115 116 117 118 119 120 >> [121–130]

List View

Citations

Details

	Records
	Author	Pau Riba; Andreas Fischer; Josep Llados; Alicia Fornes
	Title	Learning Graph Distances with Message Passing Neural Networks			Type	Conference Article
	Year	2018	Publication	24th International Conference on Pattern Recognition	Abbreviated Journal
	Volume		Issue		Pages	2239-2244
	Keywords	★Best Paper Award★
	Abstract	Graph representations have been widely used in pattern recognition thanks to their powerful representation formalism and rich theoretical background. A number of error-tolerant graph matching algorithms such as graph edit distance have been proposed for computing a distance between two labelled graphs. However, they typically suffer from a high computational complexity, which makes it difficult to apply these matching algorithms in a real scenario. In this paper, we propose an efficient graph distance based on the emerging field of geometric deep learning. Our method employs a message passing neural network to capture the graph structure and learns a metric with a siamese network approach. The performance of the proposed graph distance is validated in two application cases, graph classification and graph retrieval of handwritten words, and shows a promising performance when compared with (approximate) graph edit distance benchmarks.
	Address	Beijing; China; August 2018
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	ICPR
	Notes	DAG; 600.097; 603.057; 601.302; 600.121			Approved	no
	Call Number	Admin @ si @ RFL2018			Serial	3168
Permanent link to this record



	Author	Jaume Gibert; Ernest Valveny; Horst Bunke; Alicia Fornes
	Title	On the Correlation of Graph Edit Distance and L1 Distance in the Attribute Statistics Embedding Space			Type	Conference Article
	Year	2012	Publication	Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop	Abbreviated Journal
	Volume	7626	Issue		Pages	135-143
	Keywords
	Abstract	Graph embeddings in vector spaces aim at assigning a pattern vector to every graph so that the problems of graph classification and clustering can be solved by using data processing algorithms originally developed for statistical feature vectors. An important requirement graph features should fulfil is that they reproduce as much as possible the properties among objects in the graph domain. In particular, it is usually desired that distances between pairs of graphs in the graph domain closely resemble those between their corresponding vectorial representations. In this work, we analyse relations between the edit distance in the graph domain and the L1 distance of the attribute statistics based embedding, for which good classification performance has been reported on various datasets. We show that there is actually a high correlation between the two kinds of distances provided that the corresponding parameter values that account for balancing the weight between node and edge based features are properly selected.
	Address
	Corporate Author				Thesis
	Publisher	Springer-Berlag, Berlin	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-3-642-34165-6	Medium
	Area		Expedition		Conference	SSPR&SPR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ GVB2012c			Serial	2167
Permanent link to this record



	Author	Klaus Broelemann; Anjan Dutta; Xiaoyi Jiang; Josep Llados
	Title	Hierarchical Plausibility-Graphs for Symbol Spotting in Graphical Documents			Type	Book Chapter
	Year	2014	Publication	Graphics Recognition. Current Trends and Challenges	Abbreviated Journal
	Volume	8746	Issue		Pages	25-37
	Keywords
	Abstract	Graph representation of graphical documents often suffers from noise such as spurious nodes and edges, and their discontinuity. In general these errors occur during the low-level image processing viz. binarization, skeletonization, vectorization etc. Hierarchical graph representation is a nice and efficient way to solve this kind of problem by hierarchically merging node-node and node-edge depending on the distance. But the creation of hierarchical graph representing the graphical information often uses hard thresholds on the distance to create the hierarchical nodes (next state) of the lower nodes (or states) of a graph. As a result, the representation often loses useful information. This paper introduces plausibilities to the nodes of hierarchical graph as a function of distance and proposes a modified algorithm for matching subgraphs of the hierarchical graphs. The plausibility-annotated nodes help to improve the performance of the matching algorithm on two hierarchical structures. To show the potential of this approach, we conduct an experiment with the SESYD dataset.
	Address
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor	Bart Lamiroy; Jean-Marc Ogier
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-662-44853-3	Medium
	Area		Expedition		Conference
	Notes	DAG; 600.045; 600.056; 600.061; 600.077			Approved	no
	Call Number	Admin @ si @ BDJ2014			Serial	2699
Permanent link to this record



	Author	Klaus Broelemann; Anjan Dutta; Xiaoyi Jiang; Josep Llados
	Title	Plausibility-Graphs for Symbol Spotting in Graphical Documents			Type	Conference Article
	Year	2013	Publication	10th IAPR International Workshop on Graphics Recognition	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	Graph representation of graphical documents often suffers from noise viz. spurious nodes and spurios edges of graph and their discontinuity etc. In general these errors occur during the low-level image processing viz. binarization, skeletonization, vectorization etc. Hierarchical graph representation is a nice and efficient way to solve this kind of problem by hierarchically merging node-node and node-edge depending on the distance. But the creation of hierarchical graph representing the graphical information often uses hard thresholds on the distance to create the hierarchical nodes (next state) of the lower nodes (or states) of a graph. As a result the representation often loses useful information. This paper introduces plausibilities to the nodes of hierarchical graph as a function of distance and proposes a modified algorithm for matching subgraphs of the hierarchical graphs. The plausibility-annotated nodes help to improve the performance of the matching algorithm on two hierarchical structures. To show the potential of this approach, we conduct an experiment with the SESYD dataset.
	Address	Bethlehem; PA; USA; August 2013
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	GREC
	Notes	DAG; 600.045; 600.056; 600.061; 601.152			Approved	no
	Call Number	Admin @ si @ BDJ2013			Serial	2360
Permanent link to this record



	Author	Pau Riba; Josep Llados; Alicia Fornes
	Title	Error-tolerant coarse-to-fine matching model for hierarchical graphs			Type	Conference Article
	Year	2017	Publication	11th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition	Abbreviated Journal
	Volume	10310	Issue		Pages	107-117
	Keywords	Graph matching; Hierarchical graph; Graph-based representation; Coarse-to-fine matching
	Abstract	Graph-based representations are effective tools to capture structural information from visual elements. However, retrieving a query graph from a large database of graphs implies a high computational complexity. Moreover, these representations are very sensitive to noise or small changes. In this work, a novel hierarchical graph representation is designed. Using graph clustering techniques adapted from graph-based social media analysis, we propose to generate a hierarchy able to deal with different levels of abstraction while keeping information about the topology. For the proposed representations, a coarse-to-fine matching method is defined. These approaches are validated using real scenarios such as classification of colour images and handwritten word spotting.
	Address	Anacapri; Italy; May 2017
	Corporate Author				Thesis
	Publisher	Springer International Publishing	Place of Publication		Editor	Pasquale Foggia; Cheng-Lin Liu; Mario Vento
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	GbRPR
	Notes	DAG; 600.097; 601.302; 600.121			Approved	no
	Call Number	Admin @ si @ RLF2017a			Serial	2951
Permanent link to this record



	Author	Anjan Dutta; Hichem Sahbi
	Title	Stochastic Graphlet Embedding			Type	Journal Article
	Year	2018	Publication	IEEE Transactions on Neural Networks and Learning Systems	Abbreviated Journal	TNNLS
	Volume		Issue		Pages	1-14
	Keywords	Stochastic graphlets; Graph embedding; Graph classification; Graph hashing; Betweenness centrality
	Abstract	Graph-based methods are known to be successful in many machine learning and pattern classification tasks. These methods consider semi-structured data as graphs where nodes correspond to primitives (parts, interest points, segments, etc.) and edges characterize the relationships between these primitives. However, these non-vectorial graph data cannot be straightforwardly plugged into off-the-shelf machine learning algorithms without a preliminary step of – explicit/implicit –graph vectorization and embedding. This embedding process should be resilient to intra-class graph variations while being highly discriminant. In this paper, we propose a novel high-order stochastic graphlet embedding (SGE) that maps graphs into vector spaces. Our main contribution includes a new stochastic search procedure that efficiently parses a given graph and extracts/samples unlimitedly high-order graphlets. We consider these graphlets, with increasing orders, to model local primitives as well as their increasingly complex interactions. In order to build our graph representation, we measure the distribution of these graphlets into a given graph, using particular hash functions that efficiently assign sampled graphlets into isomorphic sets with a very low probability of collision. When combined with maximum margin classifiers, these graphlet-based representations have positive impact on the performance of pattern comparison and recognition as corroborated through extensive experiments using standard benchmark databases.
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG; 602.167; 602.168; 600.097; 600.121			Approved	no
	Call Number	Admin @ si @ DuS2018			Serial	3225
Permanent link to this record



	Author	Pau Riba; Anjan Dutta; Josep Llados; Alicia Fornes
	Title	Graph-based deep learning for graphics classification			Type	Conference Article
	Year	2017	Publication	12th IAPR International Workshop on Graphics Recognition	Abbreviated Journal
	Volume		Issue		Pages	29-30
	Keywords
	Abstract	Graph-based representations are a common way to deal with graphics recognition problems. However, previous works were mainly focused on developing learning-free techniques. The success of deep learning frameworks have proved that learning is a powerful tool to solve many problems, however it is not straightforward to extend these methodologies to non euclidean data such as graphs. On the other hand, graphs are a good representational structure for graphical entities. In this work, we present some deep learning techniques that have been proposed in the literature for graph-based representations and we show how they can be used in graphics recognition problems
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference	GREC
	Notes	DAG; 600.097; 601.302; 600.121			Approved	no
	Call Number	Admin @ si @ RDL2017b			Serial	3058
Permanent link to this record



	Author	Pau Riba; Josep Llados; Alicia Fornes; Anjan Dutta
	Title	Large-scale Graph Indexing using Binary Embeddings of Node Contexts			Type	Conference Article
	Year	2015	Publication	10th IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition	Abbreviated Journal
	Volume	9069	Issue		Pages	208-217
	Keywords	Graph matching; Graph indexing; Application in document analysis; Word spotting; Binary embedding
	Abstract	Graph-based representations are experiencing a growing usage in visual recognition and retrieval due to their representational power in front of classical appearance-based representations in terms of feature vectors. Retrieving a query graph from a large dataset of graphs has the drawback of the high computational complexity required to compare the query and the target graphs. The most important property for a large-scale retrieval is the search time complexity to be sub-linear in the number of database examples. In this paper we propose a fast indexation formalism for graph retrieval. A binary embedding is defined as hashing keys for graph nodes. Given a database of labeled graphs, graph nodes are complemented with vectors of attributes representing their local context. Hence, each attribute counts the length of a walk of order k originated in a vertex with label l. Each attribute vector is converted to a binary code applying a binary-valued hash function. Therefore, graph retrieval is formulated in terms of finding target graphs in the database whose nodes have a small Hamming distance from the query nodes, easily computed with bitwise logical operators. As an application example, we validate the performance of the proposed methods in a handwritten word spotting scenario in images of historical documents.
	Address	Beijing; China; May 2015
	Corporate Author				Thesis
	Publisher	Springer International Publishing	Place of Publication		Editor	C.-L.Liu; B.Luo; W.G.Kropatsch; J.Cheng
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-319-18223-0	Medium
	Area		Expedition		Conference	GbRPR
	Notes	DAG; 600.061; 602.006; 600.077			Approved	no
	Call Number	Admin @ si @ RLF2015a			Serial	2618
Permanent link to this record



	Author	Pau Riba; Josep Llados; Alicia Fornes; Anjan Dutta
	Title	Large-scale graph indexing using binary embeddings of node contexts for information spotting in document image databases			Type	Journal Article
	Year	2017	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	87	Issue		Pages	203-211
	Keywords
	Abstract	Graph-based representations are experiencing a growing usage in visual recognition and retrieval due to their representational power in front of classical appearance-based representations. However, retrieving a query graph from a large dataset of graphs implies a high computational complexity. The most important property for a large-scale retrieval is the search time complexity to be sub-linear in the number of database examples. With this aim, in this paper we propose a graph indexation formalism applied to visual retrieval. A binary embedding is defined as hashing keys for graph nodes. Given a database of labeled graphs, graph nodes are complemented with vectors of attributes representing their local context. Then, each attribute vector is converted to a binary code applying a binary-valued hash function. Therefore, graph retrieval is formulated in terms of finding target graphs in the database whose nodes have a small Hamming distance from the query nodes, easily computed with bitwise logical operators. As an application example, we validate the performance of the proposed methods in different real scenarios such as handwritten word spotting in images of historical documents or symbol spotting in architectural floor plans.
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG; 600.097; 602.006; 603.053; 600.121			Approved	no
	Call Number	RLF2017b			Serial	2873
Permanent link to this record



	Author	Jaume Gibert; Ernest Valveny; Horst Bunke
	Title	Graph Embedding in Vector Spaces by Node Attribute Statistics			Type	Journal Article
	Year	2012	Publication	Pattern Recognition	Abbreviated Journal	PR
	Volume	45	Issue	9	Pages	3072-3083
	Keywords	Structural pattern recognition; Graph embedding; Data clustering; Graph classification
	Abstract	Graph-based representations are of broad use and applicability in pattern recognition. They exhibit, however, a major drawback with regards to the processing tools that are available in their domain. Graphembedding into vectorspaces is a growing field among the structural pattern recognition community which aims at providing a feature vector representation for every graph, and thus enables classical statistical learning machinery to be used on graph-based input patterns. In this work, we propose a novel embedding methodology for graphs with continuous nodeattributes and unattributed edges. The approach presented in this paper is based on statistics of the node labels and the edges between them, based on their similarity to a set of representatives. We specifically deal with an important issue of this methodology, namely, the selection of a suitable set of representatives. In an experimental evaluation, we empirically show the advantages of this novel approach in the context of different classification problems using several databases of graphs.
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN	0031-3203	ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ GVB2012a			Serial	1992
Permanent link to this record



	Author	Thanh Nam Le; Muhammad Muzzamil Luqman; Anjan Dutta; Pierre Heroux; Christophe Rigaud; Clement Guerin; Pasquale Foggia; Jean Christophe Burie; Jean Marc Ogier; Josep Llados; Sebastien Adam
	Title	Subgraph spotting in graph representations of comic book images			Type	Journal Article
	Year	2018	Publication	Pattern Recognition Letters	Abbreviated Journal	PRL
	Volume	112	Issue		Pages	118-124
	Keywords	Attributed graph; Region adjacency graph; Graph matching; Graph isomorphism; Subgraph isomorphism; Subgraph spotting; Graph indexing; Graph retrieval; Query by example; Dataset and comic book images
	Abstract	Graph-based representations are the most powerful data structures for extracting, representing and preserving the structural information of underlying data. Subgraph spotting is an interesting research problem, especially for studying and investigating the structural information based content-based image retrieval (CBIR) and query by example (QBE) in image databases. In this paper we address the problem of lack of freely available ground-truthed datasets for subgraph spotting and present a new dataset for subgraph spotting in graph representations of comic book images (SSGCI) with its ground-truth and evaluation protocol. Experimental results of two state-of-the-art methods of subgraph spotting are presented on the new SSGCI dataset.
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG; 600.097; 600.121			Approved	no
	Call Number	Admin @ si @ LLD2018			Serial	3150
Permanent link to this record



	Author	Jaume Gibert; Ernest Valveny; Horst Bunke
	Title	Embedding of Graphs with Discrete Attributes Via Label Frequencies			Type	Journal Article
	Year	2013	Publication	International Journal of Pattern Recognition and Artificial Intelligence	Abbreviated Journal	IJPRAI
	Volume	27	Issue	3	Pages	1360002-1360029
	Keywords	Discrete attributed graphs; graph embedding; graph classification
	Abstract	Graph-based representations of patterns are very flexible and powerful, but they are not easily processed due to the lack of learning algorithms in the domain of graphs. Embedding a graph into a vector space solves this problem since graphs are turned into feature vectors and thus all the statistical learning machinery becomes available for graph input patterns. In this work we present a new way of embedding discrete attributed graphs into vector spaces using node and edge label frequencies. The methodology is experimentally tested on graph classification problems, using patterns of different nature, and it is shown to be competitive to state-of-the-art classification algorithms for graphs, while being computationally much more efficient.
	Address
	Corporate Author				Thesis
	Publisher		Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN		Medium
	Area		Expedition		Conference
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ GVB2013			Serial	2305
Permanent link to this record



	Author	Lluis Pere de las Heras
	Title	Relational Models for Visual Understanding of Graphical Documents. Application to Architectural Drawings.			Type	Book Whole
	Year	2014	Publication	PhD Thesis, Universitat Autonoma de Barcelona-CVC	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	Graphical documents express complex concepts using a visual language. This language consists of a vocabulary (symbols) and a syntax (structural relations between symbols) that articulate a semantic meaning in a certain context. Therefore, the automatic interpretation by computers of these sort of documents entails three main steps: the detection of the symbols, the extraction of the structural relations between these symbols, and the modeling of the knowledge that permits the extraction of the semantics. Dierent domains in graphical documents include: architectural and engineering drawings, maps, owcharts, etc. Graphics Recognition in particular and Document Image Analysis in general are born from the industrial need of interpreting a massive amount of digitalized documents after the emergence of the scanner. Although many years have passed, the graphical document understanding problem still seems to be far from being solved. The main reason is that the vast majority of the systems in the literature focus on very specic problems, where the domain of the document dictates the implementation of the interpretation. As a result, it is dicult to reuse these strategies on dierent data and on dierent contexts, hindering thus the natural progress in the eld. In this thesis, we face the graphical document understanding problem by proposing several relational models at dierent levels that are designed from a generic perspective. Firstly, we introduce three dierent strategies for the detection of symbols. The first method tackles the problem structurally, wherein general knowledge of the domain guides the detection. The second is a statistical method that learns the graphical appearance of the symbols and easily adapts to the big variability of the problem. The third method is a combination of the previous two methods that inherits their respective strengths, i.e. copes the big variability and does not need annotated data. Secondly, we present two relational strategies that tackle the problem of the visual context extraction. The first one is a full bottom up method that heuristically searches in a graph representation the contextual relations between symbols. Contrarily, the second is syntactic method that models probabilistically the structure of the documents. It automatically learns the model, which guides the inference algorithm to encounter the best structural representation for a given input. Finally, we construct a knowledge-based model consisting of an ontological denition of the domain and real data. This model permits to perform contextual reasoning and to detect semantic inconsistencies within the data. We evaluate the suitability of the proposed contributions in the framework of floor plan interpretation. Since there is no standard in the modeling of these documents there exists an enormous notation variability from plan to plan in terms of vocabulary and syntax. Therefore, floor plan interpretation is a relevant task in the graphical document understanding problem. It is also worth to mention that we make freely available all the resources used in this thesis {the data, the tool used to generate the data, and the evaluation scripts{ with the aim of fostering research in the graphical document understanding task.
	Address
	Corporate Author				Thesis	Ph.D. thesis
	Publisher	Ediciones Graficas Rey	Place of Publication		Editor	Gemma Sanchez
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title
	Series Volume		Series Issue		Edition
	ISSN		ISBN	978-84-940902-8-8	Medium
	Area		Expedition		Conference
	Notes	DAG; 600.077			Approved	no
	Call Number	Admin @ si @ Her2014			Serial	2574
Permanent link to this record



	Author	Anjan Dutta; Josep Llados; Umapada Pal
	Title	Bag-of-GraphPaths Descriptors for Symbol Recognition and Spotting in Line Drawings			Type	Conference Article
	Year	2011	Publication	In proceedings of 9th IAPR Workshop on Graphic Recognition	Abbreviated Journal
	Volume		Issue		Pages
	Keywords
	Abstract	Graphical symbol recognition and spotting recently have become an important research activity. In this work we present a descriptor for symbols, especially for line drawings. The descriptor is based on the graph representation of graphical objects. We construct graphs from the vectorized information of the binarized images, where the critical points detected by the vectorization algorithm are considered as nodes and the lines joining them are considered as edges. Graph paths between two nodes in a graph are the finite sequences of nodes following the order from the starting to the final node. The occurrences of different graph paths in a given graph is an important feature, as they capture the geometrical and structural attributes of a graph. So the graph representing a symbol can efficiently be represent by the occurrences of its different paths. Their occurrences in a symbol can be obtained in terms of a histogram counting the number of some fixed prototype paths, we call the histogram as the Bag-of-GraphPaths (BOGP). These BOGP histograms are used as a descriptor to measure the distance among the symbols in vector space. We use the descriptor for three applications, they are: (1) classification of the graphical symbols, (2) spotting of the architectural symbols on floorplans, (3) classification of the historical handwritten words.
	Address	Seoul, Korea
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-642-36823-3	Medium
	Area		Expedition		Conference	GREC
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ DLP2011c			Serial	1825
Permanent link to this record



	Author	Muhammad Muzzamil Luqman; Jean-Yves Ramel; Josep Llados
	Title	Improving Fuzzy Multilevel Graph Embedding through Feature Selection Technique			Type	Conference Article
	Year	2012	Publication	Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop	Abbreviated Journal
	Volume	7626	Issue		Pages	243-253
	Keywords
	Abstract	Graphs are the most powerful, expressive and convenient data structures but there is a lack of efficient computational tools and algorithms for processing them. The embedding of graphs into numeric vector spaces permits them to access the state-of-the-art computational efficient statistical models and tools. In this paper we take forward our work on explicit graph embedding and present an improvement to our earlier proposed method, named “fuzzy multilevel graph embedding – FMGE”, through feature selection technique. FMGE achieves the embedding of attributed graphs into low dimensional vector spaces by performing a multilevel analysis of graphs and extracting a set of global, structural and elementary level features. Feature selection permits FMGE to select the subset of most discriminating features and to discard the confusing ones for underlying graph dataset. Experimental results for graph classification experimentation on IAM letter, GREC and fingerprint graph databases, show improvement in the performance of FMGE.
	Address
	Corporate Author				Thesis
	Publisher	Springer Berlin Heidelberg	Place of Publication		Editor
	Language		Summary Language		Original Title
	Series Editor		Series Title		Abbreviated Series Title	LNCS
	Series Volume		Series Issue		Edition
	ISSN	0302-9743	ISBN	978-3-642-34165-6	Medium
	Area		Expedition		Conference	SSPR&SPR
	Notes	DAG			Approved	no
	Call Number	Admin @ si @ LRL2012			Serial	2381
Permanent link to this record