Records |
Author |
Jean-Marc Ogier; Wenyin Liu; Josep Llados (eds) |
Title |
Graphics Recognition: Achievements, Challenges, and Evolution |
Type |
Book Whole |
Year |
2010 |
Publication |
8th International Workshop GREC 2009. |
Abbreviated Journal |
|
Volume |
6020 |
Issue |
|
Pages |
|
Keywords |
|
Abstract |
|
Address |
La Rochelle |
Corporate Author |
|
Thesis |
|
Publisher |
Springer Link |
Place of Publication |
|
Editor |
Jean-Marc Ogier; Wenyin Liu; Josep Llados |
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 |
978-3-642-13727-3 |
Medium |
|
Area |
|
Expedition |
|
Conference |
GREC |
Notes |
DAG |
Approved |
no |
Call Number |
Admin @ si @ OLL2010 |
Serial |
1976 |
Permanent link to this record |
|
|
|
Author |
Joan Mas; Gemma Sanchez; Josep Llados |
Title |
SSP: Sketching slide Presentations, a Syntactic Approach |
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 |
118-129 |
Keywords |
|
Abstract |
The design of a slide presentation is a creative process. In this process first, humans visualize in their minds what they want to explain. Then, they have to be able to represent this knowledge in an understandable way. There exists a lot of commercial software that allows to create our own slide presentations but the creativity of the user is rather limited. In this article we present an application that allows the user to create and visualize a slide presentation from a sketch. A slide may be seen as a graphical document or a diagram where its elements are placed in a particular spatial arrangement. To describe and recognize slides a syntactic approach is proposed. This approach is based on an Adjacency Grammar and a parsing methodology to cope with this kind of grammars. The experimental evaluation shows the performance of our methodology from a qualitative and a quantitative point of view. Six different slides containing different number of symbols, from 4 to 7, have been given to the users and they have drawn them without restrictions in the order of the elements. The quantitative results give an idea on how suitable is our methodology to describe and recognize the different elements in a slide. |
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 |
MSL2010 |
Serial |
2405 |
Permanent link to this record |
|
|
|
Author |
Mathieu Nicolas Delalandre; Jean-Yves Ramel; Ernest Valveny; Muhammad Muzzamil Luqman |
Title |
A Performance Characterization Algorithm for Symbol Localization |
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 |
260–271 |
Keywords |
|
Abstract |
In this paper we present an algorithm for performance characterization of symbol localization systems. This algorithm is aimed to be a more “reliable” and “open” solution to characterize the performance. To achieve that, it exploits only single points as the result of localization and offers the possibility to reconsider the localization results provided by a system. We use the information about context in groundtruth, and overall localization results, to detect the ambiguous localization results. A probability score is computed for each matching between a localization point and a groundtruth region, depending on the spatial distribution of the other regions in the groundtruth. Final characterization is given with detection rate/probability score plots, describing the sets of possible interpretations of the localization results, according to a given confidence rate. We present experimentation details along with the results for the symbol localization system of [1], exploiting a synthetic dataset of architectural floorplans and electrical diagrams (composed of 200 images and 3861 symbols). |
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 @ DRV2010 |
Serial |
2406 |
Permanent link to this record |
|
|
|
Author |
Marçal Rusiñol; K. Bertet; Jean-Marc Ogier; Josep Llados |
Title |
Symbol Recognition Using a Concept Lattice of Graphical Patterns |
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 |
187-198 |
Keywords |
|
Abstract |
In this paper we propose a new approach to recognize symbols by the use of a concept lattice. We propose to build a concept lattice in terms of graphical patterns. Each model symbol is decomposed in a set of composing graphical patterns taken as primitives. Each one of these primitives is described by boundary moment invariants. The obtained concept lattice relates which symbolic patterns compose a given graphical symbol. A Hasse diagram is derived from the context and is used to recognize symbols affected by noise. We present some preliminary results over a variation of the dataset of symbols from the GREC 2005 symbol recognition contest. |
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 |
|
Notes |
DAG |
Approved |
no |
Call Number |
Admin @ si @ RBO2010 |
Serial |
2407 |
Permanent link to this record |
|
|
|
Author |
Partha Pratim Roy; Umapada Pal; Josep Llados |
Title |
Touching Text Character Localization in Graphical Documents using SIFT |
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 |
199-211 |
Keywords |
Support Vector Machine; Text Component; Graphical Line; Document Image; Scale Invariant Feature Transform |
Abstract |
Interpretation of graphical document images is a challenging task as it requires proper understanding of text/graphics symbols present in such documents. Difficulties arise in graphical document recognition when text and symbol overlapped/touched. Intersection of text and symbols with graphical lines and curves occur frequently in graphical documents and hence separation of such symbols is very difficult.
Several pattern recognition and classification techniques exist to recognize isolated text/symbol. But, the touching/overlapping text and symbol recognition has not yet been dealt successfully. An interesting technique, Scale Invariant Feature Transform (SIFT), originally devised for object recognition can take care of overlapping problems. Even if SIFT features have emerged as a very powerful object descriptors, their employment in graphical documents context has not been investigated much. In this paper we present the adaptation of the SIFT approach in the context of text character localization (spotting) in graphical documents. We evaluate the applicability of this technique in such documents and discuss the scope of improvement by combining some state-of-the-art approaches. |
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 |
|
Notes |
DAG |
Approved |
no |
Call Number |
Admin @ si @ RPL2010c |
Serial |
2408 |
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 |
David Aldavert; Ricardo Toledo; Arnau Ramisa; Ramon Lopez de Mantaras |
Title |
Efficient Object Pixel-Level Categorization using Bag of Features: Advances in Visual Computing |
Type |
Conference Article |
Year |
2009 |
Publication |
5th International Symposium on Visual Computing |
Abbreviated Journal |
|
Volume |
5875 |
Issue |
|
Pages |
44–55 |
Keywords |
|
Abstract |
In this paper we present a pixel-level object categorization method suitable to be applied under real-time constraints. Since pixels are categorized using a bag of features scheme, the major bottleneck of such an approach would be the feature pooling in local histograms of visual words. Therefore, we propose to bypass this time-consuming step and directly obtain the score from a linear Support Vector Machine classifier. This is achieved by creating an integral image of the components of the SVM which can readily obtain the classification score for any image sub-window with only 10 additions and 2 products, regardless of its size. Besides, we evaluated the performance of two efficient feature quantization methods: the Hierarchical K-Means and the Extremely Randomized Forest. All experiments have been done in the Graz02 database, showing comparable, or even better results to related work with a lower computational cost. |
Address |
Las Vegas, USA |
Corporate Author |
|
Thesis |
|
Publisher |
Springer Berlin Heidelberg |
Place of Publication |
|
Editor |
|
Language |
|
Summary Language |
|
Original Title |
|
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
Series Volume |
|
Series Issue |
|
Edition |
|
ISSN |
0302-9743 |
ISBN |
978-3-642-10330-8 |
Medium |
|
Area |
|
Expedition |
|
Conference |
ISVC |
Notes |
ADAS |
Approved |
no |
Call Number |
Admin @ si @ ATR2009a |
Serial |
1246 |
Permanent link to this record |
|
|
|
Author |
Bogdan Raducanu; Fadi Dornaika |
Title |
Natural Facial Expression Recognition Using Dynamic and Static Schemes |
Type |
Conference Article |
Year |
2009 |
Publication |
5th International Symposium on Visual Computing |
Abbreviated Journal |
|
Volume |
5875 |
Issue |
|
Pages |
730–739 |
Keywords |
|
Abstract |
Affective computing is at the core of a new paradigm in HCI and AI represented by human-centered computing. Within this paradigm, it is expected that machines will be enabled with perceiving capabilities, making them aware about users’ affective state. The current paper addresses the problem of facial expression recognition from monocular videos sequences. We propose a dynamic facial expression recognition scheme, which is proven to be very efficient. Furthermore, it is conveniently compared with several static-based systems adopting different magnitude of facial expression. We provide evaluations of performance using Linear Discriminant Analysis (LDA), Non parametric Discriminant Analysis (NDA), and Support Vector Machines (SVM). We also provide performance evaluations using arbitrary test video sequences. |
Address |
Las Vegas, USA |
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-10330-8 |
Medium |
|
Area |
|
Expedition |
|
Conference |
ISVC |
Notes |
OR;MV |
Approved |
no |
Call Number |
BCNPCL @ bcnpcl @ RaD2009 |
Serial |
1257 |
Permanent link to this record |
|
|
|
Author |
David Aldavert; Ricardo Toledo; Arnau Ramisa; Ramon Lopez de Mantaras |
Title |
Visual Registration Method For A Low Cost Robot: Computer Vision Systems |
Type |
Conference Article |
Year |
2009 |
Publication |
7th International Conference on Computer Vision Systems |
Abbreviated Journal |
|
Volume |
5815 |
Issue |
|
Pages |
204–214 |
Keywords |
|
Abstract |
An autonomous mobile robot must face the correspondence or data association problem in order to carry out tasks like place recognition or unknown environment mapping. In order to put into correspondence two maps, most methods estimate the transformation relating the maps from matches established between low level feature extracted from sensor data. However, finding explicit matches between features is a challenging and computationally expensive task. In this paper, we propose a new method to align obstacle maps without searching explicit matches between features. The maps are obtained from a stereo pair. Then, we use a vocabulary tree approach to identify putative corresponding maps followed by the Newton minimization algorithm to find the transformation that relates both maps. The proposed method is evaluated in a typical office environment showing good performance. |
Address |
Belgica |
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-04666-7 |
Medium |
|
Area |
|
Expedition |
|
Conference |
ICVS |
Notes |
ADAS |
Approved |
no |
Call Number |
Admin @ si @ ATR2009b |
Serial |
1247 |
Permanent link to this record |
|
|
|
Author |
Mohammad Rouhani; Angel Sappa |
Title |
A Novel Approach to Geometric Fitting of Implicit Quadrics |
Type |
Conference Article |
Year |
2009 |
Publication |
8th International Conference on Advanced Concepts for Intelligent Vision Systems |
Abbreviated Journal |
|
Volume |
5807 |
Issue |
|
Pages |
121–132 |
Keywords |
|
Abstract |
This paper presents a novel approach for estimating the geometric distance from a given point to the corresponding implicit quadric curve/surface. The proposed estimation is based on the height of a tetrahedron, which is used as a coarse but reliable estimation of the real distance. The estimated distance is then used for finding the best set of quadric parameters, by means of the Levenberg-Marquardt algorithm, which is a common framework in other geometric fitting approaches. Comparisons of the proposed approach with previous ones are provided to show both improvements in CPU time as well as in the accuracy of the obtained results. |
Address |
Bordeaux, France |
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-04696-4 |
Medium |
|
Area |
|
Expedition |
|
Conference |
ACIVS |
Notes |
ADAS |
Approved |
no |
Call Number |
ADAS @ adas @ RoS2009 |
Serial |
1194 |
Permanent link to this record |
|
|
|
Author |
Francesco Ciompi; Oriol Pujol; E Fernandez-Nofrerias; J. Mauri; Petia Radeva |
Title |
ECOC Random Fields for Lumen Segmentation in Radial Artery IVUS Sequences |
Type |
Conference Article |
Year |
2009 |
Publication |
12th International Conference on Medical Image and Computer Assisted Intervention |
Abbreviated Journal |
|
Volume |
5762 |
Issue |
II |
Pages |
|
Keywords |
|
Abstract |
The measure of lumen volume on radial arteries can be used to evaluate the vessel response to different vasodilators. In this paper, we present a framework for automatic lumen segmentation in longitudinal cut images of radial artery from Intravascular ultrasound sequences. The segmentation is tackled as a classification problem where the contextual information is exploited by means of Conditional Random Fields (CRFs). A multi-class classification framework is proposed, and inference is achieved by combining binary CRFs according to the Error-Correcting-Output-Code technique. The results are validated against manually segmented sequences. Finally, the method is compared with other state-of-the-art classifiers. |
Address |
London, UK |
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-04270-6 |
Medium |
|
Area |
|
Expedition |
|
Conference |
MICCAI |
Notes |
MILAB;HuPBA |
Approved |
no |
Call Number |
BCNPCL @ bcnpcl @ CPF2009 |
Serial |
1228 |
Permanent link to this record |
|
|
|
Author |
Sergio Escalera; Alicia Fornes; Oriol Pujol; Petia Radeva |
Title |
Multi-class Binary Symbol Classification with Circular Blurred Shape Models |
Type |
Conference Article |
Year |
2009 |
Publication |
15th International Conference on Image Analysis and Processing |
Abbreviated Journal |
|
Volume |
5716 |
Issue |
|
Pages |
1005–1014 |
Keywords |
|
Abstract |
Multi-class binary symbol classification requires the use of rich descriptors and robust classifiers. Shape representation is a difficult task because of several symbol distortions, such as occlusions, elastic deformations, gaps or noise. In this paper, we present the Circular Blurred Shape Model descriptor. This descriptor encodes the arrangement information of object parts in a correlogram structure. A prior blurring degree defines the level of distortion allowed to the symbol. Moreover, we learn the new feature space using a set of Adaboost classifiers, which are combined in the Error-Correcting Output Codes framework to deal with the multi-class categorization problem. The presented work has been validated over different multi-class data sets, and compared to the state-of-the-art descriptors, showing significant performance improvements. |
Address |
Salerno, Italy |
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-04145-7 |
Medium |
|
Area |
|
Expedition |
|
Conference |
ICIAP |
Notes |
MILAB;HuPBA;DAG |
Approved |
no |
Call Number |
BCNPCL @ bcnpcl @ EFP2009c |
Serial |
1186 |
Permanent link to this record |
|
|
|
Author |
L.Tarazon; D. Perez; N. Serrano; V. Alabau; Oriol Ramos Terrades; A. Sanchis; A. Juan |
Title |
Confidence Measures for Error Correction in Interactive Transcription of Handwritten Text |
Type |
Conference Article |
Year |
2009 |
Publication |
15th International Conference on Image Analysis and Processing |
Abbreviated Journal |
|
Volume |
5716 |
Issue |
|
Pages |
567-574 |
Keywords |
|
Abstract |
An effective approach to transcribe old text documents is to follow an interactive-predictive paradigm in which both, the system is guided by the human supervisor, and the supervisor is assisted by the system to complete the transcription task as efficiently as possible. In this paper, we focus on a particular system prototype called GIDOC, which can be seen as a first attempt to provide user-friendly, integrated support for interactive-predictive page layout analysis, text line detection and handwritten text transcription. More specifically, we focus on the handwriting recognition part of GIDOC, for which we propose the use of confidence measures to guide the human supervisor in locating possible system errors and deciding how to proceed. Empirical results are reported on two datasets showing that a word error rate not larger than a 10% can be achieved by only checking the 32% of words that are recognised with less confidence. |
Address |
Vietri sul Mare, Italy |
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-04145-7 |
Medium |
|
Area |
|
Expedition |
|
Conference |
ICIAP |
Notes |
DAG |
Approved |
no |
Call Number |
Admin @ si @ TPS2009 |
Serial |
1871 |
Permanent link to this record |
|
|
|
Author |
Mehdi Mirza-Mohammadi; Sergio Escalera; Petia Radeva |
Title |
Contextual-Guided Bag-of-Visual-Words Model for Multi-class Object Categorization |
Type |
Conference Article |
Year |
2009 |
Publication |
13th International Conference on Computer Analysis of Images and Patterns |
Abbreviated Journal |
|
Volume |
5702 |
Issue |
|
Pages |
748–756 |
Keywords |
|
Abstract |
Bag-of-words model (BOW) is inspired by the text classification problem, where a document is represented by an unsorted set of contained words. Analogously, in the object categorization problem, an image is represented by an unsorted set of discrete visual words (BOVW). In these models, relations among visual words are performed after dictionary construction. However, close object regions can have far descriptions in the feature space, being grouped as different visual words. In this paper, we present a method for considering geometrical information of visual words in the dictionary construction step. Object interest regions are obtained by means of the Harris-Affine detector and then described using the SIFT descriptor. Afterward, a contextual-space and a feature-space are defined, and a merging process is used to fuse feature words based on their proximity in the contextual-space. Moreover, we use the Error Correcting Output Codes framework to learn the new dictionary in order to perform multi-class classification. Results show significant classification improvements when spatial information is taken into account in the dictionary construction step. |
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-03766-5 |
Medium |
|
Area |
|
Expedition |
|
Conference |
CAIP |
Notes |
HuPBA; MILAB |
Approved |
no |
Call Number |
BCNPCL @ bcnpcl @ MEP2009 |
Serial |
1185 |
Permanent link to this record |
|
|
|
Author |
Miquel Ferrer; Ernest Valveny; F. Serratosa; I. Bardaji; Horst Bunke |
Title |
Graph-based k-means clustering: A comparison of the set versus the generalized median graph |
Type |
Conference Article |
Year |
2009 |
Publication |
13th International Conference on Computer Analysis of Images and Patterns |
Abbreviated Journal |
|
Volume |
5702 |
Issue |
|
Pages |
342–350 |
Keywords |
|
Abstract |
In this paper we propose the application of the generalized median graph in a graph-based k-means clustering algorithm. In the graph-based k-means algorithm, the centers of the clusters have been traditionally represented using the set median graph. We propose an approximate method for the generalized median graph computation that allows to use it to represent the centers of the clusters. Experiments on three databases show that using the generalized median graph as the clusters representative yields better results than the set median graph. |
Address |
Münster, Germany |
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-03766-5 |
Medium |
|
Area |
|
Expedition |
|
Conference |
CAIP |
Notes |
DAG |
Approved |
no |
Call Number |
DAG @ dag @ FVS2009d |
Serial |
1219 |
Permanent link to this record |