| Records |
| Author |
C. Alejandro Parraga; Jordi Roca; Dimosthenis Karatzas; Sophie Wuerger |
| Title |
Limitations of visual gamma corrections in LCD displays |
Type |
Journal Article |
| Year |
2014 |
Publication |
Displays |
Abbreviated Journal |
Dis |
| Volume |
35 |
Issue |
5 |
Pages |
227–239 |
| Keywords |
Display calibration; Psychophysics; Perceptual; Visual gamma correction; Luminance matching; Observer-based calibration |
| Abstract |
A method for estimating the non-linear gamma transfer function of liquid–crystal displays (LCDs) without the need of a photometric measurement device was described by Xiao et al. (2011) [1]. It relies on observer’s judgments of visual luminance by presenting eight half-tone patterns with luminances from 1/9 to 8/9 of the maximum value of each colour channel. These half-tone patterns were distributed over the screen both over the vertical and horizontal viewing axes. We conducted a series of photometric and psychophysical measurements (consisting in the simultaneous presentation of half-tone patterns in each trial) to evaluate whether the angular dependency of the light generated by three different LCD technologies would bias the results of these gamma transfer function estimations. Our results show that there are significant differences between the gamma transfer functions measured and produced by observers at different viewing angles. We suggest appropriate modifications to the Xiao et al. paradigm to counterbalance these artefacts which also have the advantage of shortening the amount of time spent in collecting the psychophysical measurements. |
| 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  |
CIC; DAG; 600.052; 600.077; 600.074 |
Approved |
no |
| Call Number |
Admin @ si @ PRK2014 |
Serial |
2511 |
| Permanent link to this record |
| |
|
| |
| Author |
Shida Beigpour; Christian Riess; Joost Van de Weijer; Elli Angelopoulou |
| Title |
Multi-Illuminant Estimation with Conditional Random Fields |
Type |
Journal Article |
| Year |
2014 |
Publication |
IEEE Transactions on Image Processing |
Abbreviated Journal |
TIP |
| Volume |
23 |
Issue |
1 |
Pages |
83-95 |
| Keywords |
color constancy; CRF; multi-illuminant |
| Abstract |
Most existing color constancy algorithms assume uniform illumination. However, in real-world scenes, this is not often the case. Thus, we propose a novel framework for estimating the colors of multiple illuminants and their spatial distribution in the scene. We formulate this problem as an energy minimization task within a conditional random field over a set of local illuminant estimates. In order to quantitatively evaluate the proposed method, we created a novel data set of two-dominant-illuminant images comprised of laboratory, indoor, and outdoor scenes. Unlike prior work, our database includes accurate pixel-wise ground truth illuminant information. The performance of our method is evaluated on multiple data sets. Experimental results show that our framework clearly outperforms single illuminant estimators as well as a recently proposed multi-illuminant estimation 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 |
1057-7149 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
CIC; LAMP; 600.074; 600.079 |
Approved |
no |
| Call Number |
Admin @ si @ BRW2014 |
Serial |
2451 |
| Permanent link to this record |
| |
|
| |
| Author |
Fahad Shahbaz Khan; Shida Beigpour; Joost Van de Weijer; Michael Felsberg |
| Title |
Painting-91: A Large Scale Database for Computational Painting Categorization |
Type |
Journal Article |
| Year |
2014 |
Publication |
Machine Vision and Applications |
Abbreviated Journal |
MVAP |
| Volume |
25 |
Issue |
6 |
Pages |
1385-1397 |
| Keywords |
|
| Abstract |
Computer analysis of visual art, especially paintings, is an interesting cross-disciplinary research domain. Most of the research in the analysis of paintings involve medium to small range datasets with own specific settings. Interestingly, significant progress has been made in the field of object and scene recognition lately. A key factor in this success is the introduction and availability of benchmark datasets for evaluation. Surprisingly, such a benchmark setup is still missing in the area of computational painting categorization. In this work, we propose a novel large scale dataset of digital paintings. The dataset consists of paintings from 91 different painters. We further show three applications of our dataset namely: artist categorization, style classification and saliency detection. We investigate how local and global features popular in image classification perform for the tasks of artist and style categorization. For both categorization tasks, our experimental results suggest that combining multiple features significantly improves the final performance. We show that state-of-the-art computer vision methods can correctly classify 50 % of unseen paintings to its painter in a large dataset and correctly attribute its artistic style in over 60 % of the cases. Additionally, we explore the task of saliency detection on paintings and show experimental findings using state-of-the-art saliency estimation algorithms. |
| Address |
|
| 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 |
0932-8092 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
CIC; LAMP; 600.074; 600.079 |
Approved |
no |
| Call Number |
Admin @ si @ KBW2014 |
Serial |
2510 |
| Permanent link to this record |
| |
|
| |
| Author |
Domicele Jonauskaite; Lucia Camenzind; C. Alejandro Parraga; Cecile N Diouf; Mathieu Mercapide Ducommun; Lauriane Müller; Melanie Norberg; Christine Mohr |
| Title |
Colour-emotion associations in individuals with red-green colour blindness |
Type |
Journal Article |
| Year |
2021 |
Publication |
PeerJ |
Abbreviated Journal |
|
| Volume |
9 |
Issue |
|
Pages |
e11180 |
| Keywords |
Affect; Chromotherapy; Colour cognition; Colour vision deficiency; Cross-modal correspondences; Daltonism; Deuteranopia; Dichromatic; Emotion; Protanopia. |
| Abstract |
Colours and emotions are associated in languages and traditions. Some of us may convey sadness by saying feeling blue or by wearing black clothes at funerals. The first example is a conceptual experience of colour and the second example is an immediate perceptual experience of colour. To investigate whether one or the other type of experience more strongly drives colour-emotion associations, we tested 64 congenitally red-green colour-blind men and 66 non-colour-blind men. All participants associated 12 colours, presented as terms or patches, with 20 emotion concepts, and rated intensities of the associated emotions. We found that colour-blind and non-colour-blind men associated similar emotions with colours, irrespective of whether colours were conveyed via terms (r = .82) or patches (r = .80). The colour-emotion associations and the emotion intensities were not modulated by participants' severity of colour blindness. Hinting at some additional, although minor, role of actual colour perception, the consistencies in associations for colour terms and patches were higher in non-colour-blind than colour-blind men. Together, these results suggest that colour-emotion associations in adults do not require immediate perceptual colour experiences, as conceptual experiences are sufficient. |
| 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 |
CIC; LAMP; 600.120; 600.128 |
Approved |
no |
| Call Number |
Admin @ si @ JCP2021 |
Serial |
3564 |
| Permanent link to this record |
| |
|
| |
| Author |
Fahad Shahbaz Khan; Joost Van de Weijer; Muhammad Anwer Rao; Michael Felsberg; Carlo Gatta |
| Title |
Semantic Pyramids for Gender and Action Recognition |
Type |
Journal Article |
| Year |
2014 |
Publication |
IEEE Transactions on Image Processing |
Abbreviated Journal |
TIP |
| Volume |
23 |
Issue |
8 |
Pages |
3633-3645 |
| Keywords |
|
| Abstract |
Person description is a challenging problem in computer vision. We investigated two major aspects of person description: 1) gender and 2) action recognition in still images. Most state-of-the-art approaches for gender and action recognition rely on the description of a single body part, such as face or full-body. However, relying on a single body part is suboptimal due to significant variations in scale, viewpoint, and pose in real-world images. This paper proposes a semantic pyramid approach for pose normalization. Our approach is fully automatic and based on combining information from full-body, upper-body, and face regions for gender and action recognition in still images. The proposed approach does not require any annotations for upper-body and face of a person. Instead, we rely on pretrained state-of-the-art upper-body and face detectors to automatically extract semantic information of a person. Given multiple bounding boxes from each body part detector, we then propose a simple method to select the best candidate bounding box, which is used for feature extraction. Finally, the extracted features from the full-body, upper-body, and face regions are combined into a single representation for classification. To validate the proposed approach for gender recognition, experiments are performed on three large data sets namely: 1) human attribute; 2) head-shoulder; and 3) proxemics. For action recognition, we perform experiments on four data sets most used for benchmarking action recognition in still images: 1) Sports; 2) Willow; 3) PASCAL VOC 2010; and 4) Stanford-40. Our experiments clearly demonstrate that the proposed approach, despite its simplicity, outperforms state-of-the-art methods for gender and action recognition. |
| 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 |
1057-7149 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
CIC; LAMP; 601.160; 600.074; 600.079;MILAB |
Approved |
no |
| Call Number |
Admin @ si @ KWR2014 |
Serial |
2507 |
| Permanent link to this record |
| |
|
| |
| Author |
Danna Xue; Javier Vazquez; Luis Herranz; Yang Zhang; Michael S Brown |
| Title |
Integrating High-Level Features for Consistent Palette-based Multi-image Recoloring |
Type |
Journal Article |
| Year |
2023 |
Publication |
Computer Graphics Forum |
Abbreviated Journal |
CGF |
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
Achieving visually consistent colors across multiple images is important when images are used in photo albums, websites, and brochures. Unfortunately, only a handful of methods address multi-image color consistency compared to one-to-one color transfer techniques. Furthermore, existing methods do not incorporate high-level features that can assist graphic designers in their work. To address these limitations, we introduce a framework that builds upon a previous palette-based color consistency method and incorporates three high-level features: white balance, saliency, and color naming. We show how these features overcome the limitations of the prior multi-consistency workflow and showcase the user-friendly nature of our framework. |
| 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 |
CIC; MACO |
Approved |
no |
| Call Number |
Admin @ si @ XVH2023 |
Serial |
3883 |
| Permanent link to this record |
| |
|
| |
| Author |
Arjan Gijsenij; Theo Gevers; Joost Van de Weijer |
| Title |
Improving Color Constancy by Photometric Edge Weighting |
Type |
Journal Article |
| Year |
2012 |
Publication |
IEEE Transaction on Pattern Analysis and Machine Intelligence |
Abbreviated Journal |
TPAMI |
| Volume |
34 |
Issue |
5 |
Pages |
918-929 |
| Keywords |
|
| Abstract |
: Edge-based color constancy methods make use of image derivatives to estimate the illuminant. However, different edge types exist in real-world images such as material, shadow and highlight edges. These different edge types may have a distinctive influence on the performance of the illuminant estimation. Therefore, in this paper, an extensive analysis is provided of different edge types on the performance of edge-based color constancy methods. First, an edge-based taxonomy is presented classifying edge types based on their photometric properties (e.g. material, shadow-geometry and highlights). Then, a performance evaluation of edge-based color constancy is provided using these different edge types. From this performance evaluation it is derived that specular and shadow edge types are more valuable than material edges for the estimation of the illuminant. To this end, the (iterative) weighted Grey-Edge algorithm is proposed in which these edge types are more emphasized for the estimation of the illuminant. Images that are recorded under controlled circumstances demonstrate that the proposed iterative weighted Grey-Edge algorithm based on highlights reduces the median angular error with approximately $25\%$. In an uncontrolled environment, improvements in angular error up to $11\%$ are obtained with respect to regular edge-based color constancy. |
| Address |
Los Alamitos; 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 |
0162-8828 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
CIC;ISE |
Approved |
no |
| Call Number |
Admin @ si @ GGW2012 |
Serial |
1850 |
| Permanent link to this record |
| |
|
| |
| Author |
Oriol Ramos Terrades; Ernest Valveny |
| Title |
A new use of the ridgelets transform for describing linear singularities in images |
Type |
Journal Article |
| Year |
2006 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
| Volume |
27 |
Issue |
6 |
Pages |
587–596 |
| Keywords |
|
| Abstract |
|
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ RaV2006a |
Serial |
635 |
| Permanent link to this record |
| |
|
| |
| Author |
Miquel Ferrer; Ernest Valveny; F. Serratosa |
| Title |
Median graph: A new exact algorithm using a distance based on the maximum common subgraph |
Type |
Journal Article |
| Year |
2009 |
Publication |
Pattern Recognition Letters |
Abbreviated Journal |
PRL |
| Volume |
30 |
Issue |
5 |
Pages |
579–588 |
| Keywords |
|
| Abstract |
Median graphs have been presented as a useful tool for capturing the essential information of a set of graphs. Nevertheless, computation of optimal solutions is a very hard problem. In this work we present a new and more efficient optimal algorithm for the median graph computation. With the use of a particular cost function that permits the definition of the graph edit distance in terms of the maximum common subgraph, and a prediction function in the backtracking algorithm, we reduce the size of the search space, avoiding the evaluation of a great amount of states and still obtaining the exact median. We present a set of experiments comparing our new algorithm against the previous existing exact algorithm using synthetic data. In addition, we present the first application of the exact median graph computation to real data and we compare the results against an approximate algorithm based on genetic search. These experimental results show that our algorithm outperforms the previous existing exact algorithm and in addition show the potential applicability of the exact solutions to real problems. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
Elsevier Science Inc. |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
0167-8655 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ FVS2009a |
Serial |
1114 |
| 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; Josep Llados |
| Title |
A Performance Evaluation Protocol for Symbol Spotting Systems in Terms of Recognition and Location Indices |
Type |
Journal Article |
| Year |
2009 |
Publication |
International Journal on Document Analysis and Recognition |
Abbreviated Journal |
IJDAR |
| Volume |
12 |
Issue |
2 |
Pages |
83-96 |
| Keywords |
Performance evaluation; Symbol Spotting; Graphics Recognition |
| Abstract |
Symbol spotting systems are intended to retrieve regions of interest from a document image database where the queried symbol is likely to be found. They shall have the ability to recognize and locate graphical symbols in a single step. In this paper, we present a set of measures to evaluate the performance of a symbol spotting system in terms of recognition abilities, location accuracy and scalability. We show that the proposed measures allow to determine the weaknesses and strengths of different methods. In particular we have tested a symbol spotting method based on a set of four different off-the-shelf shape descriptors. |
| 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 |
1433-2833 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ RuL2009a |
Serial |
1166 |
| Permanent link to this record |
| |
|
| |
| Author |
Miquel Ferrer; Ernest Valveny; F. Serratosa |
| Title |
Median Graphs: A Genetic Approach based on New Theoretical Properties |
Type |
Journal Article |
| Year |
2009 |
Publication |
Pattern Recognition |
Abbreviated Journal |
PR |
| Volume |
42 |
Issue |
9 |
Pages |
2003–2012 |
| Keywords |
Median graph; Genetic search; Maximum common subgraph; Graph matching; Structural pattern recognition |
| Abstract |
Given a set of graphs, the median graph has been theoretically presented as a useful concept to infer a representative of the set. However, the computation of the median graph is a highly complex task and its practical application has been very limited up to now. In this work we present two major contributions. On one side, and from a theoretical point of view, we show new theoretical properties of the median graph. On the other side, using these new properties, we present a new approximate algorithm based on the genetic search, that improves the computation of the median graph. Finally, we perform a set of experiments on real data, where none of the existing algorithms for the median graph computation could be applied up to now due to their computational complexity. With these results, we show how the concept of the median graph can be used in real applications and leaves the box of the only-theoretical concepts, demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs. |
| Address |
|
| Corporate Author |
|
Thesis |
|
| Publisher |
|
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ FVS2009b |
Serial |
1167 |
| 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 |
Oriol Ramos Terrades; Ernest Valveny; Salvatore Tabbone |
| Title |
Optimal Classifier Fusion in a Non-Bayesian Probabilistic Framework |
Type |
Journal Article |
| Year |
2009 |
Publication |
IEEE Transactions on Pattern Analysis and Machine Intelligence |
Abbreviated Journal |
TPAMI |
| Volume |
31 |
Issue |
9 |
Pages |
1630–1644 |
| Keywords |
|
| Abstract |
The combination of the output of classifiers has been one of the strategies used to improve classification rates in general purpose classification systems. Some of the most common approaches can be explained using the Bayes' formula. In this paper, we tackle the problem of the combination of classifiers using a non-Bayesian probabilistic framework. This approach permits us to derive two linear combination rules that minimize misclassification rates under some constraints on the distribution of classifiers. In order to show the validity of this approach we have compared it with other popular combination rules from a theoretical viewpoint using a synthetic data set, and experimentally using two standard databases: the MNIST handwritten digit database and the GREC symbol database. Results on the synthetic data set show the validity of the theoretical approach. Indeed, results on real data show that the proposed methods outperform other common combination schemes. |
| 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 |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ RVT2009 |
Serial |
1220 |
| Permanent link to this record |
| |
|
| |
| Author |
Mathieu Nicolas Delalandre; Ernest Valveny; Tony Pridmore; Dimosthenis Karatzas |
| Title |
Generation of Synthetic Documents for Performance Evaluation of Symbol Recognition & Spotting Systems |
Type |
Journal Article |
| Year |
2010 |
Publication |
International Journal on Document Analysis and Recognition |
Abbreviated Journal |
IJDAR |
| Volume |
13 |
Issue |
3 |
Pages |
187-207 |
| Keywords |
|
| Abstract |
This paper deals with the topic of performance evaluation of symbol recognition & spotting systems. We propose here a new approach to the generation of synthetic graphics documents containing non-isolated symbols in a real context. This approach is based on the definition of a set of constraints that permit us to place the symbols on a pre-defined background according to the properties of a particular domain (architecture, electronics, engineering, etc.). In this way, we can obtain a large amount of images resembling real documents by simply defining the set of constraints and providing a few pre-defined backgrounds. As documents are synthetically generated, the groundtruth (the location and the label of every symbol) becomes automatically available. We have applied this approach to the generation of a large database of architectural drawings and electronic diagrams, which shows the flexibility of the system. Performance evaluation experiments of a symbol localization system show that our approach permits to generate documents with different features that are reflected in variation of localization results. |
| 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-2833 |
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
|
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ DVP2010 |
Serial |
1289 |
| Permanent link to this record |
