| Home | [201–210] << 211 212 213 214 215 216 217 218 219 220 >> [221–228] |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Fadi Dornaika; A.Assoum; Bogdan Raducanu | ||||
| Title | Automatic Dimensionality Estimation for Manifold Learning through Optimal Feature Selection | Type | Conference Article | ||
| Year | 2012 | Publication | Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop | Abbreviated Journal | |
| Volume | 7626 | Issue | Pages | 575-583 | |
| Keywords | |||||
| Abstract | A very important aspect in manifold learning is represented by automatic estimation of the intrinsic dimensionality. Unfortunately, this problem has received few attention in the literature of manifold learning. In this paper, we argue that feature selection paradigm can be used to the problem of automatic dimensionality estimation. Besides this, it also leads to improved recognition rates. Our approach for optimal feature selection is based on a Genetic Algorithm. As a case study for manifold learning, we have considered Laplacian Eigenmaps (LE) and Locally Linear Embedding (LLE). The effectiveness of the proposed framework was tested on the face recognition problem. Extensive experiments carried out on ORL, UMIST, Yale, and Extended Yale face data sets confirmed our hypothesis. | ||||
| 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-34165-6 | Medium | |
| Area | Expedition | Conference | SSPR&SPR | ||
| Notes | OR;MV | Approved | no | ||
| Call Number | Admin @ si @ DAR2012 | Serial | 2174 | ||
| Permanent link to this record | |||||
| Author | Bogdan Raducanu; Fadi Dornaika | ||||
| Title | Out-of-Sample Embedding by Sparse Representation | Type | Conference Article | ||
| Year | 2012 | Publication | Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshop | Abbreviated Journal | |
| Volume | 7626 | Issue | Pages | 336-344 | |
| Keywords | |||||
| Abstract | A critical aspect of non-linear dimensionality reduction techniques is represented by the construction of the adjacency graph. The difficulty resides in finding the optimal parameters, a process which, in general, is heuristically driven. Recently, sparse representation has been proposed as a non-parametric solution to overcome this problem. In this paper, we demonstrate that this approach not only serves for the graph construction, but also represents an efficient and accurate alternative for out-of-sample embedding. Considering for a case study the Laplacian Eigenmaps, we applied our method to the face recognition problem. Experimental results conducted on some challenging datasets confirmed the robustness of our approach and its superiority when compared to existing techniques. | ||||
| 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 | 0302-9743 | ISBN | 978-3-642-34165-6 | Medium | |
| Area | Expedition | Conference | SSPR&SPR | ||
| Notes | OR;MV | Approved | no | ||
| Call Number | Admin @ si @ RaD2012c | Serial | 2175 | ||
| Permanent link to this record | |||||
| Author | Bogdan Raducanu; Fadi Dornaika | ||||
| Title | Pose-Invariant Face Recognition in Videos for Human-Machine Interaction | Type | Conference Article | ||
| Year | 2012 | Publication | 12th European Conference on Computer Vision | Abbreviated Journal | |
| Volume | 7584 | Issue | Pages | 566.575 | |
| Keywords | |||||
| Abstract | Human-machine interaction is a hot topic nowadays in the communities of computer vision and robotics. In this context, face recognition algorithms (used as primary cue for a person’s identity assessment) work well under controlled conditions but degrade significantly when tested in real-world environments. This is mostly due to the difficulty of simultaneously handling variations in illumination, pose, and occlusions. In this paper, we propose a novel approach for robust pose-invariant face recognition for human-robot interaction based on the real-time fitting of a 3D deformable model to input images taken from video sequences. More concrete, our approach generates a rectified face image irrespective with the actual head-pose orientation. Experimental results performed on Honda video database, using several manifold learning techniques, show a distinct advantage of the proposed method over the standard 2D appearance-based snapshot approach. | ||||
| 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-33867-0 | Medium | |
| Area | Expedition | Conference | ECCVW | ||
| Notes | OR;MV | Approved | no | ||
| Call Number | Admin @ si @ RaD2012e | Serial | 2182 | ||
| Permanent link to this record | |||||
| Author | Jose Manuel Alvarez; Y. LeCun; Theo Gevers; Antonio Lopez | ||||
| Title | Semantic Road Segmentation via Multi-Scale Ensembles of Learned Features | Type | Conference Article | ||
| Year | 2012 | Publication | 12th European Conference on Computer Vision – Workshops and Demonstrations | Abbreviated Journal | |
| Volume | 7584 | Issue | Pages | 586-595 | |
| Keywords | road detection | ||||
| Abstract | Semantic segmentation refers to the process of assigning an object label (e.g., building, road, sidewalk, car, pedestrian) to every pixel in an image. Common approaches formulate the task as a random field labeling problem modeling the interactions between labels by combining local and contextual features such as color, depth, edges, SIFT or HoG. These models are trained to maximize the likelihood of the correct classification given a training set. However, these approaches rely on hand–designed features (e.g., texture, SIFT or HoG) and a higher computational time required in the inference process.
Therefore, in this paper, we focus on estimating the unary potentials of a conditional random field via ensembles of learned features. We propose an algorithm based on convolutional neural networks to learn local features from training data at different scales and resolutions. Then, diversification between these features is exploited using a weighted linear combination. Experiments on a publicly available database show the effectiveness of the proposed method to perform semantic road scene segmentation in still images. The algorithm outperforms appearance based methods and its performance is similar compared to state–of–the–art methods using other sources of information such as depth, motion or stereo. |
||||
| 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-33867-0 | Medium | |
| Area | Expedition | Conference | ECCVW | ||
| Notes | ADAS;ISE | Approved | no | ||
| Call Number | Admin @ si @ ALG2012; ADAS @ adas | Serial | 2187 | ||
| Permanent link to this record | |||||
| Author | Sergio Vera; Debora Gil; Agnes Borras; Marius George Linguraru; Miguel Angel Gonzalez Ballester | ||||
| Title | Geometric Steerable Medial Maps | Type | Journal Article | ||
| Year | 2013 | Publication | Machine Vision and Applications | Abbreviated Journal | MVA |
| Volume | 24 | Issue | 6 | Pages | 1255-1266 |
| Keywords | Medial Representations ,Medial Manifolds Comparation , Surface , Reconstruction | ||||
| Abstract | In order to provide more intuitive and easily interpretable representations of complex shapes/organs, medial manifolds should reach a compromise between simplicity in geometry and capability for restoring the anatomy/shape of the organ/volume. Existing morphological methods show excellent results when applied to 2D objects, but their quality drops across dimensions.
This paper contributes to the computation of medial manifolds in two aspects. First, we provide a standard scheme for the computation of medial manifolds that avoids degenerated medial axis segments. Second, we introduce a continuous operator for accurate and efficient computation of medial structures of arbitrary dimension. We evaluate quantitatively the performance of our method with respect to existing approaches, by applying them to syn- thetic shapes of known medial geometry. We also show its higher performance for medical imaging applications in terms of simplicity of medial structures and capability for reconstructing the anatomical volume. |
||||
| Address | |||||
| Corporate Author | Thesis | ||||
| Publisher |
Springer Berlin Heidelberg | Place of Publication | Editor | Mubarak Shah | |
| 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 | IAM; 605.203; 600.060; 600.044 | Approved | no | ||
| Call Number | IAM @ iam @ VGB2013 | Serial | 2192 | ||
| Permanent link to this record | |||||
| Author | David Vazquez; Antonio Lopez; Daniel Ponsa; David Geronimo | ||||
| Title | Interactive Training of Human Detectors | Type | Book Chapter | ||
| Year | 2013 | Publication | Multiodal Interaction in Image and Video Applications | Abbreviated Journal | |
| Volume | 48 | Issue | Pages | 169-182 | |
| Keywords | Pedestrian Detection; Virtual World; AdaBoost; Domain Adaptation | ||||
| Abstract | Image based human detection remains as a challenging problem. Most promising detectors rely on classifiers trained with labelled samples. However, labelling is a manual labor intensive step. To overcome this problem we propose to collect images of pedestrians from a virtual city, i.e., with automatic labels, and train a pedestrian detector with them, which works fine when such virtual-world data are similar to testing one, i.e., real-world pedestrians in urban areas. When testing data is acquired in different conditions than training one, e.g., human detection in personal photo albums, dataset shift appears. In previous work, we cast this problem as one of domain adaptation and solve it with an active learning procedure. In this work, we focus on the same problem but evaluating a different set of faster to compute features, i.e., Haar, EOH and their combination. In particular, we train a classifier with virtual-world data, using such features and Real AdaBoost as learning machine. This classifier is applied to real-world training images. Then, a human oracle interactively corrects the wrong detections, i.e., few miss detections are manually annotated and some false ones are pointed out too. A low amount of manual annotation is fixed as restriction. Real- and virtual-world difficult samples are combined within what we call cool world and we retrain the classifier with this data. Our experiments show that this adapted classifier is equivalent to the one trained with only real-world data but requiring 90% less manual annotations. | ||||
| Address | Springer Heidelberg New York Dordrecht London | ||||
| Corporate Author | Thesis | ||||
| Publisher |
Springer Berlin Heidelberg | Place of Publication | Editor | ||
| Language | English | Summary Language | Original Title | ||
| Series Editor | Series Title | Abbreviated Series Title | |||
| Series Volume | Series Issue | Edition | |||
| ISSN | 1868-4394 | ISBN | 978-3-642-35931-6 | Medium | |
| Area | Expedition | Conference | |||
| Notes | ADAS; 600.057; 600.054; 605.203 | Approved | no | ||
| Call Number | VLP2013; ADAS @ adas @ vlp2013 | Serial | 2193 | ||
| Permanent link to this record | |||||
| Author | Angel Sappa; Jordi Vitria | ||||
| Title | Multimodal Interaction in Image and Video Applications | Type | Book Whole | ||
| Year | 2013 | Publication | Multimodal Interaction in Image and Video Applications | Abbreviated Journal | |
| Volume | 48 | Issue | Pages | ||
| Keywords | |||||
| Abstract | Book Series Intelligent Systems Reference Library | ||||
| 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 | 1868-4394 | ISBN | 978-3-642-35931-6 | Medium | |
| Area | Expedition | Conference | |||
| Notes | ADAS; OR;MV | Approved | no | ||
| Call Number | Admin @ si @ SaV2013 | Serial | 2199 | ||
| Permanent link to this record | |||||
| Author | Thierry Brouard; Jordi Gonzalez; Caifeng Shan; Massimo Piccardi; Larry S. Davis | ||||
| Title | Special issue on background modeling for foreground detection in real-world dynamic scenes | Type | Journal Article | ||
| Year | 2014 | Publication | Machine Vision and Applications | Abbreviated Journal | MVAP |
| Volume | 25 | Issue | 5 | Pages | 1101-1103 |
| Keywords | |||||
| Abstract | Although background modeling and foreground detection are not mandatory steps for computer vision applications, they may prove useful as they separate the primal objects usually called “foreground” from the remaining part of the scene called “background”, and permits different algorithmic treatment in the video processing field such as video surveillance, optical motion capture, multimedia applications, teleconferencing and human–computer interfaces. Conventional background modeling methods exploit the temporal variation of each pixel to model the background, and the foreground detection is made using change detection. The last decade witnessed very significant publications on background modeling but recently new applications in which background is not static, such as recordings taken from mobile devices or Internet videos, need new developments to detect robustly moving objects in challenging environments. Thus, effective methods for robustness to deal both with dynamic backgrounds, i | ||||
| 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 | ISE; 600.078 | Approved | no | ||
| Call Number | BGS2014a | Serial | 2411 | ||
| 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 | Katerine Diaz; Francesc J. Ferri; W. Diaz | ||||
| Title | Fast Approximated Discriminative Common Vectors using rank-one SVD updates | Type | Conference Article | ||
| Year | 2013 | Publication | 20th International Conference On Neural Information Processing | Abbreviated Journal | |
| Volume | 8228 | Issue | III | Pages | 368-375 |
| Keywords | |||||
| Abstract | An efficient incremental approach to the discriminative common vector (DCV) method for dimensionality reduction and classification is presented. The proposal consists of a rank-one update along with an adaptive restriction on the rank of the null space which leads to an approximate but convenient solution. The algorithm can be implemented very efficiently in terms of matrix operations and space complexity, which enables its use in large-scale dynamic application domains. Deep comparative experimentation using publicly available high dimensional image datasets has been carried out in order to properly assess the proposed algorithm against several recent incremental formulations.
K. Diaz-Chito, F.J. Ferri, W. Diaz |
||||
| Address | Daegu; Korea; November 2013 | ||||
| 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-42050-4 | Medium | |
| Area | Expedition | Conference | ICONIP | ||
| Notes | ADAS | Approved | no | ||
| Call Number | Admin @ si @ DFD2013 | Serial | 2439 | ||
| Permanent link to this record | |||||
| Author | David Fernandez; Josep Llados; Alicia Fornes | ||||
| Title | A graph-based approach for segmenting touching lines in historical handwritten documents | Type | Journal Article | ||
| Year | 2014 | Publication | International Journal on Document Analysis and Recognition | Abbreviated Journal | IJDAR |
| Volume | 17 | Issue | 3 | Pages | 293-312 |
| Keywords | Text line segmentation; Handwritten documents; Document image processing; Historical document analysis | ||||
| Abstract | Text line segmentation in handwritten documents is an important task in the recognition of historical documents. Handwritten document images contain text lines with multiple orientations, touching and overlapping characters between consecutive text lines and different document structures, making line segmentation a difficult task. In this paper, we present a new approach for handwritten text line segmentation solving the problems of touching components, curvilinear text lines and horizontally overlapping components. The proposed algorithm formulates line segmentation as finding the central path in the area between two consecutive lines. This is solved as a graph traversal problem. A graph is constructed using the skeleton of the image. Then, a path-finding algorithm is used to find the optimum path between text lines. The proposed algorithm has been evaluated on a comprehensive dataset consisting of five databases: ICDAR2009, ICDAR2013, UMD, the George Washington and the Barcelona Marriages Database. The proposed method outperforms the state-of-the-art considering the different types and difficulties of the benchmarking data. | ||||
| 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 | 1433-2833 | ISBN | Medium | ||
| Area | Expedition | Conference | |||
| Notes | DAG; 600.056; 600.061; 602.006; 600.077 | Approved | no | ||
| Call Number | Admin @ si @ FLF2014 | Serial | 2459 | ||
| 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 | |||||