| Home | << 1 2 3 4 5 6 7 8 9 10 >> [11–12] |
|
| Records | |||||
|---|---|---|---|---|---|
| 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 | Dani Rowe; Jordi Gonzalez; Marco Pedersoli; Juan J. Villanueva | ||||
| Title | On Tracking Inside Groups | Type | Journal Article | ||
| Year | 2010 | Publication | Machine Vision and Applications | Abbreviated Journal | MVA |
| Volume | 21 | Issue | 2 | Pages | 113–127 |
| Keywords | |||||
| Abstract | This work develops a new architecture for multiple-target tracking in unconstrained dynamic scenes, which consists of a detection level which feeds a two-stage tracking system. A remarkable characteristic of the system is its ability to track several targets while they group and split, without using 3D information. Thus, special attention is given to the feature-selection and appearance-computation modules, and to those modules involved in tracking through groups. The system aims to work as a stand-alone application in complex and dynamic scenarios. No a-priori knowledge about either the scene or the targets, based on a previous training period, is used. Hence, the scenario is completely unknown beforehand. Successful tracking has been demonstrated in well-known databases of both indoor and outdoor scenarios. Accurate and robust localisations have been yielded during long-term target merging and occlusions. | ||||
| Address | |||||
| Corporate Author |
Thesis | ||||
| Publisher | Springer-Verlag | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0932-8092 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ISE | Approved | no | ||
| Call Number | ISE @ ise @ RGP2010 | Serial | 1158 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; Josep Llados; Gemma Sanchez | ||||
| Title | Symbol Spotting in Vectorized Technical Drawings Through a Lookup Table of Region Strings | Type | Journal Article | ||
| Year | 2010 | Publication | Pattern Analysis and Applications | Abbreviated Journal | PAA |
| Volume | 13 | Issue | 3 | Pages | 321-331 |
| Keywords | |||||
| Abstract | In this paper, we address the problem of symbol spotting in technical document images applied to scanned and vectorized line drawings. Like any information spotting architecture, our approach has two components. First, symbols are decomposed in primitives which are compactly represented and second a primitive indexing structure aims to efficiently retrieve similar primitives. Primitives are encoded in terms of attributed strings representing closed regions. Similar strings are clustered in a lookup table so that the set median strings act as indexing keys. A voting scheme formulates hypothesis in certain locations of the line drawing image where there is a high presence of regions similar to the queried ones, and therefore, a high probability to find the queried graphical symbol. The proposed approach is illustrated in a framework consisting in spotting furniture symbols in architectural drawings. It has been proved to work even in the presence of noise and distortion introduced by the scanning and raster-to-vector processes. | ||||
| Address | |||||
| Corporate Author |
Thesis | ||||
| Publisher | Springer-Verlag | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1433-7541 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG | Approved | no | ||
| Call Number | DAG @ dag @ RLS2010 | Serial | 1165 | ||
| Permanent link to this record | |||||
| Author | Marçal Rusiñol; Agnes Borras; Josep Llados | ||||
| Title | Relational Indexing of Vectorial Primitives for Symbol Spotting in Line-Drawing Images | Type | Journal Article | ||
| Year | 2010 | Publication | Pattern Recognition Letters | Abbreviated Journal | PRL |
| Volume | 31 | Issue | 3 | Pages | 188–201 |
| Keywords | Document image analysis and recognition, Graphics recognition, Symbol spotting ,Vectorial representations, Line-drawings | ||||
| Abstract | This paper presents a symbol spotting approach for indexing by content a database of line-drawing images. As line-drawings are digital-born documents designed by vectorial softwares, instead of using a pixel-based approach, we present a spotting method based on vector primitives. Graphical symbols are represented by a set of vectorial primitives which are described by an off-the-shelf shape descriptor. A relational indexing strategy aims to retrieve symbol locations into the target documents by using a combined numerical-relational description of 2D structures. The zones which are likely to contain the queried symbol are validated by a Hough-like voting scheme. In addition, a performance evaluation framework for symbol spotting in graphical documents is proposed. The presented methodology has been evaluated with a benchmarking set of architectural documents achieving good performance results. | ||||
| 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 @ RBL2010 | Serial | 1177 | ||
| Permanent link to this record | |||||
| Author | Mikhail Mozerov; Ignasi Rius; Xavier Roca; Jordi Gonzalez | ||||
| Title | Nonlinear synchronization for automatic learning of 3D pose variability in human motion sequences | Type | Journal Article | ||
| Year | 2010 | Publication | EURASIP Journal on Advances in Signal Processing | Abbreviated Journal | EURASIPJ |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | Article ID 507247
A dense matching algorithm that solves the problem of synchronizing prerecorded human motion sequences, which show different speeds and accelerations, is proposed. The approach is based on minimization of MRF energy and solves the problem by using Dynamic Programming. Additionally, an optimal sequence is automatically selected from the input dataset to be a time-scale pattern for all other sequences. The paper utilizes an action specific model which automatically learns the variability of 3D human postures observed in a set of training sequences. The model is trained using the public CMU motion capture dataset for the walking action, and a mean walking performance is automatically learnt. Additionally, statistics about the observed variability of the postures and motion direction are also computed at each time step. The synchronized motion sequences are used to learn a model of human motion for action recognition and full-body tracking purposes. |
||||
| 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 | 1110-8657 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ISE | Approved | no | ||
| Call Number | ISE @ ise @ MRR2010 | Serial | 1208 | ||
| 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 | Eduard Vazquez; Theo Gevers; M. Lucassen; Joost Van de Weijer; Ramon Baldrich | ||||
| Title | Saliency of Color Image Derivatives: A Comparison between Computational Models and Human Perception | Type | Journal Article | ||
| Year | 2010 | Publication | Journal of the Optical Society of America A | Abbreviated Journal | JOSA A |
| Volume | 27 | Issue | 3 | Pages | 613–621 |
| Keywords | |||||
| Abstract | In this paper, computational methods are proposed to compute color edge saliency based on the information content of color edges. The computational methods are evaluated on bottom-up saliency in a psychophysical experiment, and on a more complex task of salient object detection in real-world images. The psychophysical experiment demonstrates the relevance of using information theory as a saliency processing model and that the proposed methods are significantly better in predicting color saliency (with a human-method correspondence up to 74.75% and an observer agreement of 86.8%) than state-of-the-art models. Furthermore, results from salient object detection confirm that an early fusion of color and contrast provide accurate performance to compute visual saliency with a hit rate up to 95.2%. | ||||
| 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 | ISE;CIC | Approved | no | ||
| Call Number | CAT @ cat @ VGL2010 | Serial | 1275 | ||
| Permanent link to this record | |||||
| Author | Sergio Escalera; Oriol Pujol; Petia Radeva | ||||
| Title | Traffic sign recognition system with β -correction | Type | Journal Article | ||
| Year | 2010 | Publication | Machine Vision and Applications | Abbreviated Journal | MVA |
| Volume | 21 | Issue | 2 | Pages | 99–111 |
| Keywords | |||||
| Abstract | Traffic sign classification represents a classical application of multi-object recognition processing in uncontrolled adverse environments. Lack of visibility, illumination changes, and partial occlusions are just a few problems. In this paper, we introduce a novel system for multi-class classification of traffic signs based on error correcting output codes (ECOC). ECOC is based on an ensemble of binary classifiers that are trained on bi-partition of classes. We classify a wide set of traffic signs types using robust error correcting codings. Moreover, we introduce the novel β-correction decoding strategy that outperforms the state-of-the-art decoding techniques, classifying a high number of classes with great success. | ||||
| Address | |||||
| Corporate Author |
Thesis | ||||
| Publisher | Springer-Verlag | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0932-8092 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | MILAB;HUPBA | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ EPR2010a | Serial | 1276 | ||
| Permanent link to this record | |||||
| Author | Sergio Escalera; Oriol Pujol; Petia Radeva | ||||
| Title | On the Decoding Process in Ternary Error-Correcting Output Codes | Type | Journal Article | ||
| Year | 2010 | Publication | IEEE on Pattern Analysis and Machine Intelligence | Abbreviated Journal | TPAMI |
| Volume | 32 | Issue | 1 | Pages | 120–134 |
| Keywords | |||||
| Abstract | A common way to model multiclass classification problems is to design a set of binary classifiers and to combine them. Error-correcting output codes (ECOC) represent a successful framework to deal with these type of problems. Recent works in the ECOC framework showed significant performance improvements by means of new problem-dependent designs based on the ternary ECOC framework. The ternary framework contains a larger set of binary problems because of the use of a ldquodo not carerdquo symbol that allows us to ignore some classes by a given classifier. However, there are no proper studies that analyze the effect of the new symbol at the decoding step. In this paper, we present a taxonomy that embeds all binary and ternary ECOC decoding strategies into four groups. We show that the zero symbol introduces two kinds of biases that require redefinition of the decoding design. A new type of decoding measure is proposed, and two novel decoding strategies are defined. We evaluate the state-of-the-art coding and decoding strategies over a set of UCI machine learning repository data sets and into a real traffic sign categorization problem. The experimental results show that, following the new decoding strategies, the performance of the ECOC design is significantly improved. | ||||
| 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 | 0162-8828 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | MILAB;HUPBA | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ EPR2010b | Serial | 1277 | ||
| Permanent link to this record | |||||
| Author | Carme Julia; Angel Sappa; Felipe Lumbreras; Joan Serrat; Antonio Lopez | ||||
| Title | An Iterative Multiresolution Scheme for SFM with Missing Data: single and multiple object scenes | Type | Journal Article | ||
| Year | 2010 | Publication | Image and Vision Computing | Abbreviated Journal | IMAVIS |
| Volume | 28 | Issue | 1 | Pages | 164-176 |
| Keywords | |||||
| Abstract | Most of the techniques proposed for tackling the Structure from Motion problem (SFM) cannot deal with high percentages of missing data in the matrix of trajectories. Furthermore, an additional problem should be faced up when working with multiple object scenes: the rank of the matrix of trajectories should be estimated. This paper presents an iterative multiresolution scheme for SFM with missing data to be used in both the single and multiple object cases. The proposed scheme aims at recovering missing entries in the original input matrix. The objective is to improve the results by applying a factorization technique to the partially or totally filled in matrix instead of to the original input one. Experimental results obtained with synthetic and real data sequences, containing single and multiple objects, are presented to show the viability of the proposed approach. | ||||
| 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 | 0262-8856 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ JSL2010 | Serial | 1278 | ||
| Permanent link to this record | |||||
| Author | David Geronimo | ||||
| Title | A Global Approach to Vision-Based Pedestrian Detection for Advanced Driver Assistance Systems | Type | Book Whole | ||
| Year | 2010 | Publication | PhD Thesis, Universitat Autonoma de Barcelona-CVC | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | At the beginning of the 21th century, traffic accidents have become a major problem not only for developed countries but also for emerging ones. As in other scientific areas in which Artificial Intelligence is becoming a key actor, advanced driver assistance systems, and concretely pedestrian protection systems based on Computer Vision, are becoming a strong topic of research aimed at improving the safety of pedestrians. However, the challenge is of considerable complexity due to the varying appearance of humans (e.g., clothes, size, aspect ratio, shape, etc.), the dynamic nature of on-board systems and the unstructured moving environments that urban scenarios represent. In addition, the required performance is demanding both in terms of computational time and detection rates. In this thesis, instead of focusing on improving specific tasks as it is frequent in the literature, we present a global approach to the problem. Such a global overview starts by the proposal of a generic architecture to be used as a framework both to review the literature and to organize the studied techniques along the thesis. We then focus the research on tasks such as foreground segmentation, object classification and refinement following a general viewpoint and exploring aspects that are not usually analyzed. In order to perform the experiments, we also present a novel pedestrian dataset that consists of three subsets, each one addressed to the evaluation of a different specific task in the system. The results presented in this thesis not only end with a proposal of a pedestrian detection system but also go one step beyond by pointing out new insights, formalizing existing and proposed algorithms, introducing new techniques and evaluating their performance, which we hope will provide new foundations for future research in the area. | ||||
| Address | Antonio Lopez;Krystian Mikolajczyk;Jaume Amores;Dariu M. Gavrila;Oriol Pujol;Felipe Lumbreras | ||||
| Corporate Author |
Thesis | Ph.D. thesis | |||
| Publisher | Ediciones Graficas Rey | Place of Publication | Editor | Antonio Lopez;Krystian Mikolajczyk;Jaume Amores;Dariu M. Gavrila;Oriol Pujol;Felipe Lumbreras | |
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | ISBN | 978-84-936529-5-1 | Medium | ||
| Area | Expedition | Conference | |||
| Notes | ADAS | Approved | no | ||
| Call Number | ADAS @ adas @ Ger2010 | Serial | 1279 | ||
| Permanent link to this record | |||||
| Author | Bogdan Raducanu; Jordi Vitria; Ales Leonardis | ||||
| Title | Online pattern recognition and machine learning techniques for computer-vision: Theory and applications | Type | Journal Article | ||
| Year | 2010 | Publication | Image and Vision Computing | Abbreviated Journal | IMAVIS |
| Volume | 28 | Issue | 7 | Pages | 1063–1064 |
| Keywords | |||||
| Abstract | (Editorial for the Special Issue on Online pattern recognition and machine learning techniques)
In real life, visual learning is supposed to be a continuous process. This paradigm has found its way also in artificial vision systems. There is an increasing trend in pattern recognition represented by online learning approaches, which aims at continuously updating the data representation when new information arrives. Starting with a minimal dataset, the initial knowledge is expanded by incorporating incoming instances, which may have not been previously available or foreseen at the system’s design stage. An interesting characteristic of this strategy is that the train and test phases take place simultaneously. Given the increasing interest in this subject, the aim of this special issue is to be a landmark event in the development of online learning techniques and their applications with the hope that it will capture the interest of a wider audience and will attract even more researchers. We received 19 contributions, of which 9 have been accepted for publication, after having been subjected to usual peer review process. |
||||
| 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 | 0262-8856 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | OR;MV | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ RVL2010 | Serial | 1280 | ||
| Permanent link to this record | |||||
| Author | Mario Rojas; David Masip; A. Todorov; Jordi Vitria | ||||
| Title | Automatic Point-based Facial Trait Judgments Evaluation | Type | Conference Article | ||
| Year | 2010 | Publication | 23rd IEEE Conference on Computer Vision and Pattern Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 2715–2720 | ||
| Keywords | |||||
| Abstract | Humans constantly evaluate the personalities of other people using their faces. Facial trait judgments have been studied in the psychological field, and have been determined to influence important social outcomes of our lives, such as elections outcomes and social relationships. Recent work on textual descriptions of faces has shown that trait judgments are highly correlated. Further, behavioral studies suggest that two orthogonal dimensions, valence and dominance, can describe the basis of the human judgments from faces. In this paper, we used a corpus of behavioral data of judgments on different trait dimensions to automatically learn a trait predictor from facial pixel images. We study whether trait evaluations performed by humans can be learned using machine learning classifiers, and used later in automatic evaluations of new facial images. The experiments performed using local point-based descriptors show promising results in the evaluation of the main traits. | ||||
| Address | San Francisco CA, USA | ||||
| 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 | 1063-6919 | ISBN | 978-1-4244-6984-0 | Medium | |
| Area | Expedition | Conference | CVPR | ||
| Notes | OR;MV | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ RMT2010 | Serial | 1282 | ||
| Permanent link to this record | |||||
| Author | Sergio Escalera; Oriol Pujol; Petia Radeva; Jordi Vitria; Maria Teresa Anguera | ||||
| Title | Automatic Detection of Dominance and Expected Interest | Type | Journal Article | ||
| Year | 2010 | Publication | EURASIP Journal on Advances in Signal Processing | Abbreviated Journal | EURASIPJ |
| Volume | Issue | Pages | 12 | ||
| Keywords | |||||
| Abstract | Article ID 491819
Social Signal Processing is an emergent area of research that focuses on the analysis of social constructs. Dominance and interest are two of these social constructs. Dominance refers to the level of influence a person has in a conversation. Interest, when referred in terms of group interactions, can be defined as the degree of engagement that the members of a group collectively display during their interaction. In this paper, we argue that only using behavioral motion information, we are able to predict the interest of observers when looking at face-to-face interactions as well as the dominant people. First, we propose a simple set of movement-based features from body, face, and mouth activity in order to define a higher set of interaction indicators. The considered indicators are manually annotated by observers. Based on the opinions obtained, we define an automatic binary dominance detection problem and a multiclass interest quantification problem. Error-Correcting Output Codes framework is used to learn to rank the perceived observer's interest in face-to-face interactions meanwhile Adaboost is used to solve the dominant detection problem. The automatic system shows good correlation between the automatic categorization results and the manual ranking made by the observers in both dominance and interest detection 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 | 1110-8657 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | OR;MILAB;HUPBA;MV | Approved | no | ||
| Call Number | BCNPCL @ bcnpcl @ EPR2010d | Serial | 1283 | ||
| 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 | |||||