| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–12] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Umapada Pal; Partha Pratim Roy; N. Tripathya; Josep Llados | ||||
| Title | Multi-oriented Bangla and Devnagari text recognition | Type | Journal Article | ||
| Year | 2010 | Publication | Pattern Recognition | Abbreviated Journal | PR |
| Volume | 43 | Issue | 12 | Pages | 4124–4136 |
| Keywords | |||||
| Abstract | There are printed complex documents where text lines of a single page may have different orientations or the text lines may be curved in shape. As a result, it is difficult to detect the skew of such documents and hence character segmentation and recognition of such documents are a complex task. In this paper, using background and foreground information we propose a novel scheme towards the recognition of Indian complex documents of Bangla and Devnagari script. In Bangla and Devnagari documents usually characters in a word touch and they form cavity regions. To take care of these cavity regions, background information of such documents is used. Convex hull and water reservoir principle have been applied for this purpose. Here, at first, the characters are segmented from the documents using the background information of the text. Next, individual characters are recognized using rotation invariant features obtained from the foreground part of the characters.
For character segmentation, at first, writing mode of a touching component (word) is detected using water reservoir principle based features. Next, depending on writing mode and the reservoir base-region of the touching component, a set of candidate envelope points is then selected from the contour points of the component. Based on these candidate points, the touching component is finally segmented into individual characters. For recognition of multi-sized/multi-oriented characters the features are computed from different angular information obtained from the external and internal contour pixels of the characters. These angular information are computed in such a way that they do not depend on the size and rotation of the characters. Circular and convex hull rings have been used to divide a character into smaller zones to get zone-wise features for higher recognition results. We combine circular and convex hull features to improve the results and these features are fed to support vector machines (SVM) for recognition. From our experiment we obtained recognition results of 99.18% (98.86%) accuracy when tested on 7515 (7874) Devnagari (Bangla) characters. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
Publisher  |
Elsevier | 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 | DAG @ dag @ PRT2010 | Serial | 1337 | ||
| Permanent link to this record | |||||
| Author | Sergio Escalera; Oriol Pujol; Petia Radeva | ||||
| Title | Re-coding ECOCs without retraining | Type | Journal Article | ||
| Year | 2010 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 31 | Issue | 7 | Pages | 555–562 |
| Keywords | |||||
| Abstract | A standard way to deal with multi-class categorization problems is by the combination of binary classifiers in a pairwise voting procedure. Recently, this classical approach has been formalized in the Error-Correcting Output Codes (ECOC) framework. In the ECOC framework, the one-versus-one coding demonstrates to achieve higher performance than the rest of coding designs. The binary problems that we train in the one-versus-one strategy are significantly smaller than in the rest of designs, and usually easier to be learnt, taking into account the smaller overlapping between classes. However, a high percentage of the positions coded by zero of the coding matrix, which implies a high sparseness degree, does not codify meta-class membership information. In this paper, we show that using the training data we can redefine without re-training, in a problem-dependent way, the one-versus-one coding matrix so that the new coded information helps the system to increase its generalization capability. Moreover, the new re-coding strategy is generalized to be applied over any binary code. The results over several UCI Machine Learning repository data sets and two real multi-class problems show that performance improvements can be obtained re-coding the classical one-versus-one and Sparse random designs compared to different state-of-the-art ECOC configurations. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Elsevier | 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 | MILAB;HUPBA | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ EPR2010e | Serial | 1338 | ||
| Permanent link to this record | |||||
| Author | Aura Hernandez-Sabate; Monica Mitiko; Sergio Shiguemi; Debora Gil | ||||
| Title | A validation protocol for assessing cardiac phase retrieval in IntraVascular UltraSound | Type | Conference Article | ||
| Year | 2010 | Publication | Computing in Cardiology | Abbreviated Journal | |
| Volume | 37 | Issue | Pages | 899-902 | |
| Keywords | |||||
| Abstract | A good reliable approach to cardiac triggering is of utmost importance in obtaining accurate quantitative results of atherosclerotic plaque burden from the analysis of IntraVascular UltraSound. Although, in the last years, there has been an increase in research of methods for retrospective gating, there is no general consensus in a validation protocol. Many methods are based on quality assessment of longitudinal cuts appearance and those reporting quantitative numbers do not follow a standard protocol. Such heterogeneity in validation protocols makes faithful comparison across methods a difficult task. We propose a validation protocol based on the variability of the retrieved cardiac phase and explore the capability of several quality measures for quantifying such variability. An ideal detector, suitable for its application in clinical practice, should produce stable phases. That is, it should always sample the same cardiac cycle fraction. In this context, one should measure the variability (variance) of a candidate sampling with respect a ground truth (reference) sampling, since the variance would indicate how spread we are aiming a target. In order to quantify the deviation between the sampling and the ground truth, we have considered two quality scores reported in the literature: signed distance to the closest reference sample and distance to the right of each reference sample. We have also considered the residuals of the regression line of reference against candidate sampling. The performance of the measures has been explored on a set of synthetic samplings covering different cardiac cycle fractions and variabilities. From our simulations, we conclude that the metrics related to distances are sensitive to the shift considered while the residuals are robust against fraction and variabilities as far as one can establish a pair-wise correspondence between candidate and reference. We will further investigate the impact of false positive and negative detections in experimental data. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
IEEE | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0276-6547 | ISBN | 978-1-4244-7318-2 | Medium | |
| Area | Expedition | Conference | CINC | ||
| Notes | IAM; | Approved | no | ||
| Call Number | IAM @ iam @ HSM2010 | Serial | 1551 | ||
| Permanent link to this record | |||||
| Author | David Aldavert; Arnau Ramisa; Ramon Lopez de Mantaras; Ricardo Toledo | ||||
| Title | Real-time Object Segmentation using a Bag of Features Approach | Type | Conference Article | ||
| Year | 2010 | Publication | 13th International Conference of the Catalan Association for Artificial Intelligence | Abbreviated Journal | |
| Volume | 220 | Issue | Pages | 321–329 | |
| Keywords | Object Segmentation; Bag Of Features; Feature Quantization; Densely sampled descriptors | ||||
| Abstract | In this paper, we propose an object segmentation framework, based on the popular bag of features (BoF), which can process several images per second while achieving a good segmentation accuracy assigning an object category to every pixel of the image. We propose an efficient color descriptor to complement the information obtained by a typical gradient-based local descriptor. Results show that color proves to be a useful cue to increase the segmentation accuracy, specially in large homogeneous regions. Then, we extend the Hierarchical K-Means codebook using the recently proposed Vector of Locally Aggregated Descriptors method. Finally, we show that the BoF method can be easily parallelized since it is applied locally, thus the time necessary to process an image is further reduced. The performance of the proposed method is evaluated in the standard PASCAL 2007 Segmentation Challenge object segmentation dataset. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
IOS Press Amsterdam, | Place of Publication | Editor | In R.Alquezar, A.Moreno, J.Aguilar. | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 9781607506423 | Medium | ||
| Area | Expedition | Conference | CCIA | ||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ ARL2010b | Serial | 1417 | ||
| Permanent link to this record | |||||
| Author | Arjan Gijsenij; Theo Gevers; Joost Van de Weijer | ||||
| Title | Generalized Gamut Mapping using Image Derivative Structures for Color Constancy | Type | Journal Article | ||
| Year | 2010 | Publication | International Journal of Computer Vision | Abbreviated Journal | IJCV |
| Volume | 86 | Issue | 2-3 | Pages | 127-139 |
| Keywords | |||||
| Abstract | The gamut mapping algorithm is one of the most promising methods to achieve computational color constancy. However, so far, gamut mapping algorithms are restricted to the use of pixel values to estimate the illuminant. Therefore, in this paper, gamut mapping is extended to incorporate the statistical nature of images. It is analytically shown that the proposed gamut mapping framework is able to include any linear filter output. The main focus is on the local n-jet describing the derivative structure of an image. It is shown that derivatives have the advantage over pixel values to be invariant to disturbing effects (i.e. deviations of the diagonal model) such as saturated colors and diffuse light. Further, as the n-jet based gamut mapping has the ability to use more information than pixel values alone, the combination of these algorithms are more stable than the regular gamut mapping algorithm. Different methods of combining are proposed. Based on theoretical and experimental results conducted on large scale data sets of hyperspectral, laboratory and realworld scenes, it can be derived that (1) in case of deviations of the diagonal model, the derivative-based approach outperforms the pixel-based gamut mapping, (2) state-of-the-art algorithms are outperformed by the n-jet based gamut mapping, (3) the combination of the different n-jet based gamut | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Kluwer Academic Publishers Hingham, MA, USA | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0920-5691 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ISE | Approved | no | ||
| Call Number | CAT @ cat @ GGW2010 | Serial | 1274 | ||
| Permanent link to this record | |||||
| Author | David Geronimo; Angel Sappa; Antonio Lopez | ||||
| Title | Stereo-based Candidate Generation for Pedestrian Protection Systems | Type | Book Chapter | ||
| Year | 2010 | Publication | Binocular Vision: Development, Depth Perception and Disorders | Abbreviated Journal | |
| Volume | Issue | 9 | Pages | 189–208 | |
| Keywords | Pedestrian Detection | ||||
| Abstract | This chapter describes a stereo-based algorithm that provides candidate image windows to a latter 2D classification stage in an on-board pedestrian detection system. The proposed algorithm, which consists of three stages, is based on the use of both stereo imaging and scene prior knowledge (i.e., pedestrians are on the ground) to reduce the candidate searching space. First, a successful road surface fitting algorithm provides estimates on the relative ground-camera pose. This stage directs the search toward the road area thus avoiding irrelevant regions like the sky. Then, three different schemes are used to scan the estimated road surface with pedestrian-sized windows: (a) uniformly distributed through the road surface (3D); (b) uniformly distributed through the image (2D); (c) not uniformly distributed but according to a quadratic function (combined 2D-3D). Finally, the set of candidate windows is reduced by analyzing their 3D content. Experimental results of the proposed algorithm, together with statistics of searching space reduction are provided. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
NOVA Publishers | 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 | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ GSL2010 | Serial | 1301 | ||
| Permanent link to this record | |||||
| Author | Thierry Brouard; A. Delaplace; Muhammad Muzzamil Luqman; H. Cardot; Jean-Yves Ramel | ||||
| Title | Design of Evolutionary Methods Applied to the Learning of Bayesian Nerwork Structures | Type | Book Chapter | ||
| Year | 2010 | Publication | Bayesian Network | Abbreviated Journal | |
| Volume | Issue | Pages | 13-37 | ||
| Keywords | |||||
| Abstract | |||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Sciyo | Place of Publication | Editor | Ahmed Rebai | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-953-307-124-4 | Medium | ||
| Area | Expedition | Conference | |||
| Notes | Approved | no | |||
| Call Number | Admin @ si @ BDL2010 | Serial | 1461 | ||
| Permanent link to this record | |||||
| Author | Debora Gil; Jaume Garcia; Aura Hernandez-Sabate; Enric Marti | ||||
| Title | Manifold parametrization of the left ventricle for a statistical modelling of its complete anatomy | Type | Conference Article | ||
| Year | 2010 | Publication | 8th Medical Imaging | Abbreviated Journal | |
| Volume | 7623 | Issue | 762304 | Pages | 304 |
| Keywords | |||||
| Abstract | Distortion of Left Ventricle (LV) external anatomy is related to some dysfunctions, such as hypertrophy. The architecture of myocardial fibers determines LV electromechanical activation patterns as well as mechanics. Thus, their joined modelling would allow the design of specific interventions (such as peacemaker implantation and LV remodelling) and therapies (such as resynchronization). On one hand, accurate modelling of external anatomy requires either a dense sampling or a continuous infinite dimensional approach, which requires non-Euclidean statistics. On the other hand, computation of fiber models requires statistics on Riemannian spaces. Most approaches compute separate statistical models for external anatomy and fibers architecture. In this work we propose a general mathematical framework based on differential geometry concepts for computing a statistical model including, both, external and fiber anatomy. Our framework provides a continuous approach to external anatomy supporting standard statistics. We also provide a straightforward formula for the computation of the Riemannian fiber statistics. We have applied our methodology to the computation of complete anatomical atlas of canine hearts from diffusion tensor studies. The orientation of fibers over the average external geometry agrees with the segmental description of orientations reported in the literature. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
SPIE | 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 | SPIE | ||
| Notes | IAM | Approved | no | ||
| Call Number | IAM @ iam @ GGH2010a | Serial | 1522 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; Josep Llados | ||||
| Title | Symbol Spotting in Digital Libraries:Focused Retrieval over Graphic-rich Document Collections | Type | Book Whole | ||
| Year | 2010 | Publication | Symbol Spotting in Digital Libraries:Focused Retrieval over Graphic-rich Document Collections | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | Focused Retrieval , Graphical Pattern Indexation,Graphics Recognition ,Pattern Recognition , Performance Evaluation , Symbol Description ,Symbol Spotting | ||||
| Abstract | The specific problem of symbol recognition in graphical documents requires additional techniques to those developed for character recognition. The most well-known obstacle is the so-called Sayre paradox: Correct recognition requires good segmentation, yet improvement in segmentation is achieved using information provided by the recognition process. This dilemma can be avoided by techniques that identify sets of regions containing useful information. Such symbol-spotting methods allow the detection of symbols in maps or technical drawings without having to fully segment or fully recognize the entire content.
This unique text/reference provides a complete, integrated and large-scale solution to the challenge of designing a robust symbol-spotting method for collections of graphic-rich documents. The book examines a number of features and descriptors, from basic photometric descriptors commonly used in computer vision techniques to those specific to graphical shapes, presenting a methodology which can be used in a wide variety of applications. Additionally, readers are supplied with an insight into the problem of performance evaluation of spotting methods. Some very basic knowledge of pattern recognition, document image analysis and graphics recognition is assumed. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Springer | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-1-84996-208-7 | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ RuL2010a | Serial | 1292 | ||
| Permanent link to this record | |||||
| Author | Jaume Garcia; Debora Gil; Aura Hernandez-Sabate | ||||
| Title | Endowing Canonical Geometries to Cardiac Structures | Type | Book Chapter | ||
| Year | 2010 | Publication | Statistical Atlases And Computational Models Of The Heart | Abbreviated Journal | |
| Volume | 6364 | Issue | Pages | 124-133 | |
| Keywords | |||||
| Abstract | International conference on Cardiac electrophysiological simulation challenge
In this paper, we show that canonical (shape-based) geometries can be endowed to cardiac structures using tubular coordinates defined over their medial axis. We give an analytic formulation of these geometries by means of B-Splines. Since B-Splines present vector space structure PCA can be applied to their control points and statistical models relating boundaries and the interior of the anatomical structures can be derived. We demonstrate the applicability in two cardiac structures, the 3D Left Ventricular volume, and the 2D Left-Right ventricle set in 2D Short Axis view. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Springer Berlin / Heidelberg | Place of Publication | Editor | Camara, O.; Pop, M.; Rhode, K.; Sermesant, M.; Smith, N.; Young, A. | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Lecture Notes in Computer Science | Abbreviated Series Title | LNCS | |
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | Medium | |||
| Area | Expedition | Conference | |||
| Notes | IAM | Approved | no | ||
| Call Number | IAM @ iam @ GGH2010b | Serial | 1515 | ||
| Permanent link to this record | |||||
| Author | Salim Jouili; Salvatore Tabbone; Ernest Valveny | ||||
| Title | Comparing Graph Similarity Measures for Graphical Recognition | Type | Book Chapter | ||
| Year | 2010 | Publication | Graphics Recognition. Achievements, Challenges, and Evolution. 8th International Workshop, GREC 2009. Selected Papers | Abbreviated Journal | |
| Volume | 6020 | Issue | Pages | 37-48 | |
| Keywords | |||||
| Abstract | In this paper we evaluate four graph distance measures. The analysis is performed for document retrieval tasks. For this aim, different kind of documents are used including line drawings (symbols), ancient documents (ornamental letters), shapes and trademark-logos. The experimental results show that the performance of each graph distance measure depends on the kind of data and the graph representation technique. | ||||
| 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-13727-3 | Medium | |
| Area | Expedition | Conference | GREC | ||
| Notes | DAG | Approved | no | ||
| Call Number | Admin @ si @ JTV2010 | Serial | 2404 | ||
| Permanent link to this record | |||||
| Author | Santiago Segui; Laura Igual; Jordi Vitria | ||||
| Title | Weighted Bagging for Graph based One-Class Classifiers | Type | Conference Article | ||
| Year | 2010 | Publication | 9th International Workshop on Multiple Classifier Systems | Abbreviated Journal | |
| Volume | 5997 | Issue | Pages | 1-10 | |
| Keywords | |||||
| Abstract | Most conventional learning algorithms require both positive and negative training data for achieving accurate classification results. However, the problem of learning classifiers from only positive data arises in many applications where negative data are too costly, difficult to obtain, or not available at all. Minimum Spanning Tree Class Descriptor (MSTCD) was presented as a method that achieves better accuracies than other one-class classifiers in high dimensional data. However, the presence of outliers in the target class severely harms the performance of this classifier. In this paper we propose two bagging strategies for MSTCD that reduce the influence of outliers in training data. We show the improved performance on both real and artificially contaminated data. | ||||
| Address | Cairo, Egypt | ||||
| 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-12126-5 | Medium | |
| Area | Expedition | Conference | MCS | ||
| Notes | MILAB;OR;MV | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ SIV2010 | Serial | 1284 | ||
| Permanent link to this record | |||||
| Author | Susana Alvarez; Anna Salvatella; Maria Vanrell; Xavier Otazu | ||||
| Title | 3D Texton Spaces for color-texture retrieval | Type | Conference Article | ||
| Year | 2010 | Publication | 7th International Conference on Image Analysis and Recognition | Abbreviated Journal | |
| Volume | 6111 | Issue | Pages | 354–363 | |
| Keywords | |||||
| Abstract | Color and texture are visual cues of different nature, their integration in an useful visual descriptor is not an easy problem. One way to combine both features is to compute spatial texture descriptors independently on each color channel. Another way is to do the integration at the descriptor level. In this case the problem of normalizing both cues arises. In this paper we solve the latest problem by fusing color and texture through distances in texton spaces. Textons are the attributes of image blobs and they are responsible for texture discrimination as defined in Julesz’s Texton theory. We describe them in two low-dimensional and uniform spaces, namely, shape and color. The dissimilarity between color texture images is computed by combining the distances in these two spaces. Following this approach, we propose our TCD descriptor which outperforms current state of art methods in the two different approaches mentioned above, early combination with LBP and late combination with MPEG-7. This is done on an image retrieval experiment over a highly diverse texture dataset from Corel. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Springer Berlin Heidelberg | Place of Publication | Editor | A.C. Campilho and M.S. Kamel | |
| 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-13771-6 | Medium | |
| Area | Expedition | Conference | ICIAR | ||
| Notes | CIC | Approved | no | ||
| Call Number | CAT @ cat @ ASV2010a | Serial | 1325 | ||
| Permanent link to this record | |||||
| Author | Naveen Onkarappa; Angel Sappa | ||||
| Title | On-Board Monocular Vision System Pose Estimation through a Dense Optical Flow | Type | Conference Article | ||
| Year | 2010 | Publication | 7th International Conference on Image Analysis and Recognition | Abbreviated Journal | |
| Volume | 6111 | Issue | Pages | 230-239 | |
| Keywords | |||||
| Abstract | This paper presents a robust technique for estimating on-board monocular vision system pose. The proposed approach is based on a dense optical flow that is robust against shadows, reflections and illumination changes. A RANSAC based scheme is used to cope with the outliers in the optical flow. The proposed technique is intended to be used in driver assistance systems for applications such as obstacle or pedestrian detection. Experimental results on different scenarios, both from synthetic and real sequences, shows usefulness of the proposed approach. | ||||
| Address | Povoa de Varzim (Portugal) | ||||
| 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-13771-6 | Medium | |
| Area | Expedition | Conference | ICIAR | ||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ OnS2010 | Serial | 1342 | ||
| Permanent link to this record | |||||
| Author | Jaume Gibert; Ernest Valveny | ||||
| Title | Graph Embedding based on Nodes Attributes Representatives and a Graph of Words Representation. | Type | Conference Article | ||
| Year | 2010 | Publication | 13th International worshop on structural and syntactic pattern recognition and 8th international worshop on statistical pattern recognition | Abbreviated Journal | |
| Volume | 6218 | Issue | Pages | 223–232 | |
| Keywords | |||||
| Abstract | Although graph embedding has recently been used to extend statistical pattern recognition techniques to the graph domain, some existing embeddings are usually computationally expensive as they rely on classical graph-based operations. In this paper we present a new way to embed graphs into vector spaces by first encapsulating the information stored in the original graph under another graph representation by clustering the attributes of the graphs to be processed. This new representation makes the association of graphs to vectors an easy step by just arranging both node attributes and the adjacency matrix in the form of vectors. To test our method, we use two different databases of graphs whose nodes attributes are of different nature. A comparison with a reference method permits to show that this new embedding is better in terms of classification rates, while being much more faster. | ||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Springer Berlin Heidelberg | Place of Publication | Editor | In E.R. Hancock, R.C. Wilson, T. Windeatt, I. Ulusoy and F. Escolano, | |
| 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-14979-5 | Medium | |
| Area | Expedition | Conference | S+SSPR | ||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ GiV2010 | Serial | 1416 | ||
| Permanent link to this record | |||||