|
Records |
Links |
|
Author |
Miguel Angel Bautista; Oriol Pujol; Xavier Baro; Sergio Escalera |
|
|
Title |
Introducing the Separability Matrix for Error Correcting Output Codes Coding |
Type |
Conference Article |
|
Year |
2011 |
Publication |
10th International conference on Multiple Classifier Systems |
Abbreviated Journal |
|
|
|
Volume |
6713 |
Issue |
|
Pages |
227-236 |
|
|
Keywords |
|
|
|
Abstract |
Error Correcting Output Codes (ECOC) have demonstrate to be a powerful tool for treating multi-class problems. Nevertheless, predefined ECOC designs may not benefit from Error-correcting principles for particular multi-class data. In this paper, we introduce the Separability matrix as a tool to study and enhance designs for ECOC coding. In addition, a novel problem-dependent coding design based on the Separability matrix is tested over a wide set of challenging multi-class problems, obtaining very satisfactory results. |
|
|
Address |
Napoles, Italy |
|
|
Corporate Author |
|
Thesis |
|
|
|
Publisher |
Springer-Verlag Berlin Heidelberg |
Place of Publication |
|
Editor |
Carlo Sansone; Josef Kittler; Fabio Roli |
|
|
Language |
|
Summary Language |
|
Original Title |
|
|
|
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
LNCS |
|
|
Series Volume |
|
Series Issue |
|
Edition |
|
|
|
ISSN |
|
ISBN |
978-3-642-21556-8 |
Medium |
|
|
|
Area |
|
Expedition |
|
Conference |
MCS |
|
|
Notes |
MILAB; OR;HuPBA;MV |
Approved |
no |
|
|
Call Number |
Admin @ si @ BPB2011a |
Serial |
1771 |
|
Permanent link to this record |
|
|
|
|
Author |
Eloi Puertas; Sergio Escalera; Oriol Pujol |
|
|
Title |
Multi-Class Multi-Scale Stacked Sequential Learning |
Type |
Conference Article |
|
Year |
2011 |
Publication |
10th International Conference on Multiple Classifier Systems |
Abbreviated Journal |
|
|
|
Volume |
6713 |
Issue |
|
Pages |
197-206 |
|
|
Keywords |
|
|
|
Abstract |
|
|
|
Address |
Napoles, Italy |
|
|
Corporate Author |
|
Thesis |
|
|
|
Publisher |
Springer |
Place of Publication |
|
Editor |
Carlo Sansone; Josef Kittler; Fabio Roli |
|
|
Language |
|
Summary Language |
|
Original Title |
|
|
|
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
|
Series Volume |
|
Series Issue |
|
Edition |
|
|
|
ISSN |
|
ISBN |
|
Medium |
|
|
|
Area |
|
Expedition |
|
Conference |
MCS |
|
|
Notes |
HuPBA;MILAB |
Approved |
no |
|
|
Call Number |
Admin @ si @ PEP2011b |
Serial |
1772 |
|
Permanent link to this record |
|
|
|
|
Author |
Miguel Angel Bautista; Oriol Pujol; Xavier Baro; Sergio Escalera |
|
|
Title |
Introducing the Separability Matrix for Error Correcting Output Codes Coding |
Type |
Conference Article |
|
Year |
2011 |
Publication |
10th International Conference on Multiple Classifier Systems |
Abbreviated Journal |
|
|
|
Volume |
6713 |
Issue |
|
Pages |
227-236 |
|
|
Keywords |
|
|
|
Abstract |
Error Correcting Output Codes (ECOC) have demonstrate to be a powerful tool for treating multi-class problems. Nevertheless, predefined ECOC designs may not benefit from Error-correcting principles for particular multi-class data. In this paper, we introduce the Separability matrix as a tool to study and enhance designs for ECOC coding. In addition, a novel problem-dependent coding design based on the Separability matrix is tested over a wide set of challenging multi-class problems, obtaining very satisfactory results. |
|
|
Address |
Napoles, Italy |
|
|
Corporate Author |
|
Thesis |
|
|
|
Publisher |
Springer-Verlag Berlin, Heidelberg |
Place of Publication |
|
Editor |
Carlo Sansone; Josef Kittler; Fabio Roli |
|
|
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-21556-8 |
Medium |
|
|
|
Area |
|
Expedition |
|
Conference |
MCS |
|
|
Notes |
MILAB; OR;HuPBA;MV |
Approved |
no |
|
|
Call Number |
Admin @ si @ BPB2011b |
Serial |
1887 |
|
Permanent link to this record |
|
|
|
|
Author |
Juan Andrade; F. Thomas |
|
|
Title |
Wire-Based Tracking using Mutual Information |
Type |
Miscellaneous |
|
Year |
2006 |
Publication |
10th International Symposium on Advances in Robot Kinematics, 3–14 |
Abbreviated Journal |
|
|
|
Volume |
|
Issue |
|
Pages |
|
|
|
Keywords |
|
|
|
Abstract |
|
|
|
Address |
Ljubljana (Slovenia) |
|
|
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 |
|
Approved |
no |
|
|
Call Number |
Admin @ si @ AnT2006 |
Serial |
665 |
|
Permanent link to this record |
|
|
|
|
Author |
Pierluigi Casale; Oriol Pujol; Petia Radeva |
|
|
Title |
Approximate Convex Hulls Family for One-Class Cassification |
Type |
Conference Article |
|
Year |
2011 |
Publication |
10th International Workshop on Multiple Classifier Systems |
Abbreviated Journal |
|
|
|
Volume |
6713 |
Issue |
|
Pages |
106-115 |
|
|
Keywords |
|
|
|
Abstract |
In this work, a new method for one-class classification based on the Convex Hull geometric structure is proposed. The new method creates a family of convex hulls able to fit the geometrical shape of the training points. The increased computational cost due to the creation of the convex hull in multiple dimensions is circumvented using random projections. This provides an approximation of the original structure with multiple bi-dimensional views. In the projection planes, a mechanism for noisy points rejection has also been elaborated and evaluated. Results show that the approach performs considerably well with respect to the state the art in one-class classification. |
|
|
Address |
Napoli, Italy |
|
|
Corporate Author |
|
Thesis |
|
|
|
Publisher |
Springer Berlin Heidelberg |
Place of Publication |
|
Editor |
Carlo Sansone; Josef Kittler; Fabio Roli |
|
|
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-21556-8 |
Medium |
|
|
|
Area |
|
Expedition |
|
Conference |
MCS |
|
|
Notes |
MILAB;HuPBA |
Approved |
no |
|
|
Call Number |
Admin @ si @ CPR2011b |
Serial |
1761 |
|
Permanent link to this record |
|
|
|
|
Author |
N. Serrano; L. Tarazon; D. Perez; Oriol Ramos Terrades; S. Juan |
|
|
Title |
The GIDOC Prototype |
Type |
Conference Article |
|
Year |
2010 |
Publication |
10th International Workshop on Pattern Recognition in Information Systems |
Abbreviated Journal |
|
|
|
Volume |
|
Issue |
|
Pages |
82-89 |
|
|
Keywords |
|
|
|
Abstract |
Transcription of handwritten text in (old) documents is an important, time-consuming task for digital libraries. It might be carried out by first processing all document images off-line, and then manually supervising system transcriptions to edit incorrect parts. However, current techniques for automatic page layout analysis, text line detection and handwriting recognition are still far from perfect, and thus post-editing system output is not clearly better than simply ignoring it.
A more effective approach to transcribe old text documents is to follow an interactive- predictive paradigm in which both, the system is guided by the user, and the user is assisted by the system to complete the transcription task as efficiently as possible. Following this approach, a system prototype called GIDOC (Gimp-based Interactive transcription of old text DOCuments) has been developed to provide user-friendly, integrated support for interactive-predictive layout analysis, line detection and handwriting transcription.
GIDOC is designed to work with (large) collections of homogeneous documents, that is, of similar structure and writing styles. They are annotated sequentially, by (par- tially) supervising hypotheses drawn from statistical models that are constantly updated with an increasing number of available annotated documents. And this is done at different annotation levels. For instance, at the level of page layout analysis, GIDOC uses a novel text block detection method in which conventional, memoryless techniques are improved with a “history” model of text block positions. Similarly, at the level of text line image transcription, GIDOC includes a handwriting recognizer which is steadily improved with a growing number of (partially) supervised transcriptions. |
|
|
Address |
Funchal, Portugal |
|
|
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 |
978-989-8425-14-0 |
Medium |
|
|
|
Area |
|
Expedition |
|
Conference |
PRIS |
|
|
Notes |
DAG |
Approved |
no |
|
|
Call Number |
Admin @ si @ STP2010 |
Serial |
1868 |
|
Permanent link to this record |
|
|
|
|
Author |
Jose Carlos Rubio; Joan Serrat; Antonio Lopez |
|
|
Title |
Video Co-segmentation |
Type |
Conference Article |
|
Year |
2012 |
Publication |
11th Asian Conference on Computer Vision |
Abbreviated Journal |
|
|
|
Volume |
7725 |
Issue |
|
Pages |
13-24 |
|
|
Keywords |
|
|
|
Abstract |
Segmentation of a single image is in general a highly underconstrained problem. A frequent approach to solve it is to somehow provide prior knowledge or constraints on how the objects of interest look like (in terms of their shape, size, color, location or structure). Image co-segmentation trades the need for such knowledge for something much easier to obtain, namely, additional images showing the object from other viewpoints. Now the segmentation problem is posed as one of differentiating the similar object regions in all the images from the more varying background. In this paper, for the first time, we extend this approach to video segmentation: given two or more video sequences showing the same object (or objects belonging to the same class) moving in a similar manner, we aim to outline its region in all the frames. In addition, the method works in an unsupervised manner, by learning to segment at testing time. We compare favorably with two state-of-the-art methods on video segmentation and report results on benchmark videos. |
|
|
Address |
Daejeon, 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-37443-2 |
Medium |
|
|
|
Area |
|
Expedition |
|
Conference |
ACCV |
|
|
Notes |
ADAS |
Approved |
no |
|
|
Call Number |
Admin @ si @ RSL2012d |
Serial |
2153 |
|
Permanent link to this record |
|
|
|
|
Author |
David Roche; Debora Gil; Jesus Giraldo |
|
|
Title |
Using statistical inference for designing termination conditions ensuring convergence of Evolutionary Algorithms |
Type |
Conference Article |
|
Year |
2011 |
Publication |
11th European Conference on Artificial Life |
Abbreviated Journal |
|
|
|
Volume |
|
Issue |
|
Pages |
|
|
|
Keywords |
|
|
|
Abstract |
A main challenge in Evolutionary Algorithms (EAs) is determining a termination condition ensuring stabilization close to the optimum in real-world applications. Although for known test functions distribution-based quantities are good candidates (as far as suitable parameters are used), in real-world problems an open question still remains unsolved. How can we estimate an upper-bound for the termination condition value ensuring a given accuracy for the (unknown) EA solution?
We claim that the termination problem would be fully solved if we defined a quantity (depending only on the EA output) behaving like the solution accuracy. The open question would be, then, satisfactorily answered if we had a model relating both quantities, since accuracy could be predicted from the alternative quantity. We present a statistical inference framework addressing two topics: checking the correlation between the two quantities and defining a regression model for predicting (at a given confidence level) accuracy values from the EA output. |
|
|
Address |
Paris, France |
|
|
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 |
ECAL |
|
|
Notes |
IAM; |
Approved |
no |
|
|
Call Number |
IAM @ iam @ RGG2011b |
Serial |
1678 |
|
Permanent link to this record |
|
|
|
|
Author |
Marco Pedersoli; Jordi Gonzalez; Andrew Bagdanov; Juan J. Villanueva |
|
|
Title |
Recursive Coarse-to-Fine Localization for fast Object Recognition |
Type |
Conference Article |
|
Year |
2010 |
Publication |
11th European Conference on Computer Vision |
Abbreviated Journal |
|
|
|
Volume |
6313 |
Issue |
II |
Pages |
280–293 |
|
|
Keywords |
|
|
|
Abstract |
Cascading techniques are commonly used to speed-up the scan of an image for object detection. However, cascades of detectors are slow to train due to the high number of detectors and corresponding thresholds to learn. Furthermore, they do not use any prior knowledge about the scene structure to decide where to focus the search. To handle these problems, we propose a new way to scan an image, where we couple a recursive coarse-to-fine refinement together with spatial constraints of the object location. For doing that we split an image into a set of uniformly distributed neighborhood regions, and for each of these we apply a local greedy search over feature resolutions. The neighborhood is defined as a scanning region that only one object can occupy. Therefore the best hypothesis is obtained as the location with maximum score and no thresholds are needed. We present an implementation of our method using a pyramid of HOG features and we evaluate it on two standard databases, VOC2007 and INRIA dataset. Results show that the Recursive Coarse-to-Fine Localization (RCFL) achieves a 12x speed-up compared to standard sliding windows. Compared with a cascade of multiple resolutions approach our method has slightly better performance in speed and Average-Precision. Furthermore, in contrast to cascading approach, the speed-up is independent of image conditions, the number of detected objects and clutter. |
|
|
Address |
Crete (Greece) |
|
|
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-15566-6 |
Medium |
|
|
|
Area |
|
Expedition |
|
Conference |
ECCV |
|
|
Notes |
ISE |
Approved |
no |
|
|
Call Number |
DAG @ dag @ PGB2010 |
Serial |
1438 |
|
Permanent link to this record |
|
|
|
|
Author |
Carles Fernandez; Jordi Gonzalez; Xavier Roca |
|
|
Title |
Automatic Learning of Background Semantics in Generic Surveilled Scenes |
Type |
Conference Article |
|
Year |
2010 |
Publication |
11th European Conference on Computer Vision |
Abbreviated Journal |
|
|
|
Volume |
6313 |
Issue |
II |
Pages |
678–692 |
|
|
Keywords |
|
|
|
Abstract |
Advanced surveillance systems for behavior recognition in outdoor traffic scenes depend strongly on the particular configuration of the scenario. Scene-independent trajectory analysis techniques statistically infer semantics in locations where motion occurs, and such inferences are typically limited to abnormality. Thus, it is interesting to design contributions that automatically categorize more specific semantic regions. State-of-the-art approaches for unsupervised scene labeling exploit trajectory data to segment areas like sources, sinks, or waiting zones. Our method, in addition, incorporates scene-independent knowledge to assign more meaningful labels like crosswalks, sidewalks, or parking spaces. First, a spatiotemporal scene model is obtained from trajectory analysis. Subsequently, a so-called GI-MRF inference process reinforces spatial coherence, and incorporates taxonomy-guided smoothness constraints. Our method achieves automatic and effective labeling of conceptual regions in urban scenarios, and is robust to tracking errors. Experimental validation on 5 surveillance databases has been conducted to assess the generality and accuracy of the segmentations. The resulting scene models are used for model-based behavior analysis. |
|
|
Address |
Crete (Greece) |
|
|
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-15551-2 |
Medium |
|
|
|
Area |
|
Expedition |
|
Conference |
ECCV |
|
|
Notes |
ISE |
Approved |
no |
|
|
Call Number |
ISE @ ise @ FGR2010 |
Serial |
1439 |
|
Permanent link to this record |