| Home | << 1 2 3 4 5 6 7 8 9 10 >> |
|
| Records | |||||
|---|---|---|---|---|---|
| Author | Joost Van de Weijer; Cordelia Schmid; Jakob Verbeek; Diane Larlus | ||||
| Title | Learning Color Names for Real-World Applications | Type | Journal Article | ||
| Year | 2009 | Publication | IEEE Transaction in Image Processing | Abbreviated Journal | TIP |
| Volume | 18 | Issue | 7 | Pages | 1512–1524 |
| Keywords | |||||
| Abstract | Color names are required in real-world applications such as image retrieval and image annotation. Traditionally, they are learned from a collection of labelled color chips. These color chips are labelled with color names within a well-defined experimental setup by human test subjects. However naming colors in real-world images differs significantly from this experimental setting. In this paper, we investigate how color names learned from color chips compare to color names learned from real-world images. To avoid hand labelling real-world images with color names we use Google Image to collect a data set. Due to limitations of Google Image this data set contains a substantial quantity of wrongly labelled data. We propose several variants of the PLSA model to learn color names from this noisy data. Experimental results show that color names learned from real-world images significantly outperform color names learned from labelled color chips for both image retrieval and image annotation. | ||||
| 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 | Approved | no | |||
Call Number  |
CAT @ cat @ WSV2009 | Serial | 1195 | ||
| Permanent link to this record | |||||
| Author | Murad Al Haj; Andrew Bagdanov; Jordi Gonzalez; Xavier Roca | ||||
| Title | Robust and Efficient Multipose Face Detection Using Skin Color Segmentation | Type | Conference Article | ||
| Year | 2009 | Publication | 4th Iberian Conference on Pattern Recognition and Image Analysis | Abbreviated Journal | |
| Volume | 5524 | Issue | Pages | ||
| Keywords | |||||
| Abstract | In this paper we describe an efficient technique for detecting faces in arbitrary images and video sequences. The approach is based on segmentation of images or video frames into skin-colored blobs using a pixel-based heuristic. Scale and translation invariant features are then computed from these segmented blobs which are used to perform statistical discrimination between face and non-face classes. We train and evaluate our method on a standard, publicly available database of face images and analyze its performance over a range of statistical pattern classifiers. The generalization of our approach is illustrated by testing on an independent sequence of frames containing many faces and non-faces. These experiments indicate that our proposed approach obtains false positive rates comparable to more complex, state-of-the-art techniques, and that it generalizes better to new data. Furthermore, the use of skin blobs and invariant features requires fewer training samples since significantly fewer non-face candidate regions must be considered when compared to AdaBoost-based approaches. | ||||
| Address | Springer Berlin Heidelberg | ||||
| 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-02171-8 | Medium | |
| Area | Expedition | Conference | IbPRIA | ||
| Notes | ISE | Approved | no | ||
| Call Number |
DAG @ dag @ ABG2009 | Serial | 1216 | ||
| Permanent link to this record | |||||
| Author | Agnes Borras; Josep Llados | ||||
| Title | Corest: A measure of color and space stability to detect salient regions according to human criteria | Type | Conference Article | ||
| Year | 2009 | Publication | 5th International Conference on Computer Vision Theory and Applications | Abbreviated Journal | |
| Volume | Issue | Pages | 204-209 | ||
| Keywords | |||||
| Abstract | |||||
| Address | Lisboa, 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-8111-69-2 | Medium | ||
| Area | Expedition | Conference | VISAPP | ||
| Notes | DAG | Approved | no | ||
| Call Number |
DAG @ dag @ BoL2009 | Serial | 1225 | ||
| Permanent link to this record | |||||
| Author | Agnes Borras | ||||
| Title | Contributions to the Content-Based Image Retrieval Using Pictorial Queries | Type | Book Whole | ||
| Year | 2009 | Publication | PhD Thesis, Universitat Autonoma de Barcelona-CVC | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | The broad access to digital cameras, personal computers and Internet, has lead to the generation of large volumes of data in digital form. If we want an effective usage of this huge amount of data, we need automatic tools to allow the retrieval of relevant information. Image data is a particular type of information that requires specific techniques of description and indexing. The computer vision field that studies these kind of techniques is called Content-Based Image Retrieval (CBIR). Instead of using text-based descriptions, a system of CBIR deals on properties that are inherent in the images themselves. Hence, the feature-based description provides a universal via of image expression in contrast with the more than 6000 languages spoken in the world.
Nowadays, the CBIR is a dynamic focus of research that has derived in important applications for many professional groups. The potential fields of application can be such diverse as: the medical domain, the crime prevention, the protection of the intel- lectual property, the journalism, the graphic design, the web search, the preservation of cultural heritage, etc. The definition on the role of the user is a key point in the development of a CBIR application. The user is in charge to formulate the queries from which the images are retrieved. We have centered our attention on the image retrieval techniques that use queries based on pictorial information. We have identified a taxonomy composed by four main query paradigms: query-by-selection, query-by-iconic-composition, query- by-sketch and query-by-paint. Each one of these paradigms allows a different degree of user expressivity. From a simple image selection, to a complete painting of the query, the user takes control of the input in the CBIR system. Along the chapters of this thesis we have analyzed the influence that each query paradigm imposes in the internal operations of a CBIR system. Moreover, we have proposed a set of contributions that we have exemplified in the context of a final application. |
||||
| Address | Barcelona (Spain) | ||||
| Corporate Author | Thesis | Ph.D. thesis | |||
| Publisher | Ediciones Graficas Rey | Place of Publication | Bellaterra | Editor | Josep Llados |
| 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 @ Bor2009; IAM @ iam @ Bor2009 | Serial | 1269 | ||
| Permanent link to this record | |||||
| Author | Bhaskar Chakraborty; Andrew Bagdanov; Jordi Gonzalez | ||||
| Title | Towards Real-Time Human Action Recognition | Type | Conference Article | ||
| Year | 2009 | Publication | 4th Iberian Conference on Pattern Recognition and Image Analysis | Abbreviated Journal | |
| Volume | 5524 | Issue | Pages | ||
| Keywords | |||||
| Abstract | This work presents a novel approach to human detection based action-recognition in real-time. To realize this goal our method first detects humans in different poses using a correlation-based approach. Recognition of actions is done afterward based on the change of the angular values subtended by various body parts. Real-time human detection and action recognition are very challenging, and most state-of-the-art approaches employ complex feature extraction and classification techniques, which ultimately becomes a handicap for real-time recognition. Our correlation-based method, on the other hand, is computationally efficient and uses very simple gradient-based features. For action recognition angular features of body parts are extracted using a skeleton technique. Results for action recognition are comparable with the present state-of-the-art. | ||||
| Address | Póvoa de Varzim, Portugal | ||||
| 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-02171-8 | Medium | |
| Area | Expedition | Conference | IbPRIA | ||
| Notes | ISE | Approved | no | ||
| Call Number |
DAG @ dag @ CBG2009 | Serial | 1215 | ||
| Permanent link to this record | |||||
| Author | Ricard Coll; Alicia Fornes; Josep Llados | ||||
| Title | Graphological Analysis of Handwritten Text Documents for Human Resources Recruitment | Type | Conference Article | ||
| Year | 2009 | Publication | 10th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 1081–1085 | ||
| Keywords | |||||
| Abstract | The use of graphology in recruitment processes has become a popular tool in many human resources companies. This paper presents a model that links features from handwritten images to a number of personality characteristics used to measure applicant aptitudes for the job in a particular hiring scenario. In particular we propose a model of measuring active personality and leadership of the writer. Graphological features that define such a profile are measured in terms of document and script attributes like layout configuration, letter size, shape, slant and skew angle of lines, etc. After the extraction, data is classified using a neural network. An experimental framework with real samples has been constructed to illustrate the performance of the approach. | ||||
| Address | Barcelona, Spain | ||||
| 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 | 1520-5363 | ISBN | 978-1-4244-4500-4 | Medium | |
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number |
DAG @ dag @ CFL2009 | Serial | 1221 | ||
| Permanent link to this record | |||||
| Author | Antonio Clavelli; Dimosthenis Karatzas | ||||
| Title | Text Segmentation in Colour Posters from the Spanish Civil War Era | Type | Conference Article | ||
| Year | 2009 | Publication | 10th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 181 - 185 | ||
| Keywords | |||||
| Abstract | The extraction of textual content from colour documents of a graphical nature is a complicated task. The text can be rendered in any colour, size and orientation while the existence of complex background graphics with repetitive patterns can make its localization and segmentation extremely difficult.
Here, we propose a new method for extracting textual content from such colour images that makes no assumption as to the size of the characters, their orientation or colour, while it is tolerant to characters that do not follow a straight baseline. We evaluate this method on a collection of documents with historical connotations: the Posters from the Spanish Civil War. |
||||
| Address | Barcelona, Spain | ||||
| 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 | 1520-5363 | ISBN | 978-1-4244-4500-4 | Medium | |
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number |
DAG @ dag @ ClK2009 | Serial | 1172 | ||
| 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 | Conference Article | ||
| Year | 2009 | Publication | 8th IAPR International Workshop on Graphics Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 3-11 | ||
| 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 | La Rochelle; July 2009 | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer | 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 | GREC | ||
| Notes | DAG | Approved | no | ||
| Call Number |
DAG @ dag @ DRV2009 | Serial | 1443 | ||
| Permanent link to this record | |||||
| Author | Miquel Ferrer; Dimosthenis Karatzas; Ernest Valveny; Horst Bunke | ||||
| Title | A Recursive Embedding Approach to Median Graph Computation | Type | Conference Article | ||
| Year | 2009 | Publication | 7th IAPR – TC–15 Workshop on Graph–Based Representations in Pattern Recognition | Abbreviated Journal | |
| Volume | 5534 | Issue | Pages | 113–123 | |
| Keywords | |||||
| Abstract | The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Nevertheless, its computation is extremely complex. Several approaches have been presented up to now based on different strategies. In this paper we present a new approximate recursive algorithm for median graph computation based on graph embedding into vector spaces. Preliminary experiments on three databases show that this new approach is able to obtain better medians than the previous existing approaches. | ||||
| Address | Venice, Italy | ||||
| Corporate Author | Thesis | ||||
| Publisher | Springer Berlin Heidelberg | Place of Publication | Editor | ||
| Language | Summary Language | Original Title | |||
| Series Editor | Series Title | Abbreviated Series Title | LNCS | ||
| Series Volume | Series Issue | Edition | |||
| ISSN | 0302-9743 | ISBN | 978-3-642-02123-7 | Medium | |
| Area | Expedition | Conference | GBR | ||
| Notes | DAG | Approved | no | ||
| Call Number |
DAG @ dag @ FKV2009 | Serial | 1173 | ||
| Permanent link to this record | |||||
| Author | Alicia Fornes; Josep Llados; Gemma Sanchez; Horst Bunke | ||||
| Title | Symbol-independent writer identification in old handwritten music scores | Type | Conference Article | ||
| Year | 2009 | Publication | In proceedings of 8th IAPR International Workshop on Graphics Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 186–197 | ||
| Keywords | |||||
| Abstract | |||||
| Address | La Rochelle, France | ||||
| 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-13727-3 | Medium | |
| Area | Expedition | Conference | GREC | ||
| Notes | DAG | Approved | no | ||
| Call Number |
DAG @ dag @ FLS2009a | Serial | 1222 | ||
| Permanent link to this record | |||||
| Author | Alicia Fornes; Josep Llados; Gemma Sanchez; Horst Bunke | ||||
| Title | On the use of textural features for writer identification in old handwritten music scores | Type | Conference Article | ||
| Year | 2009 | Publication | 10th International Conference on Document Analysis and Recognition | Abbreviated Journal | |
| Volume | Issue | Pages | 996 - 1000 | ||
| Keywords | |||||
| Abstract | Writer identification consists in determining the writer of a piece of handwriting from a set of writers. In this paper we present a system for writer identification in old handwritten music scores which uses only music notation to determine the author. The steps of the proposed system are the following. First of all, the music sheet is preprocessed for obtaining a music score without the staff lines. Afterwards, four different methods for generating texture images from music symbols are applied. Every approach uses a different spatial variation when combining the music symbols to generate the textures. Finally, Gabor filters and Grey-scale Co-ocurrence matrices are used to obtain the features. The classification is performed using a k-NN classifier based on Euclidean distance. The proposed method has been tested on a database of old music scores from the 17th to 19th centuries, achieving encouraging identification rates. | ||||
| Address | Barcelona | ||||
| 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 | 1520-5363 | ISBN | 978-1-4244-4500-4 | Medium | |
| Area | Expedition | Conference | ICDAR | ||
| Notes | DAG | Approved | no | ||
| Call Number |
DAG @ dag @ FLS2009b | Serial | 1223 | ||
| Permanent link to this record | |||||
| Author | Alicia Fornes | ||||
| Title | Writer Identification by a Combination of Graphical Features in the Framework of Old Handwritten Music Scores | Type | Book Whole | ||
| Year | 2009 | Publication | PhD Thesis, Universitat Autonoma de Barcelona-CVC | Abbreviated Journal | |
| Volume | Issue | Pages | |||
| Keywords | |||||
| Abstract | The analysis and recognition of historical document images has attracted growing interest in the last years. Mass digitization and document image understanding allows the preservation, access and indexation of this artistic, cultural and technical heritage. The analysis of handwritten documents is an outstanding subfield. The main interest is not only the transcription of the document to a standard format, but also, the identification of the author of a document from a set of writers (namely writer identification).
Writer identification in handwritten text documents is an active area of study, however, the identification of the writer of graphical documents is still a challenge. The main objective of this thesis is the identification of the writer in old music scores, as an example of graphic documents. Concerning old music scores, many historical archives contain a huge number of sheets of musical compositions without information about the composer, and the research on this field could be helpful for musicologists. The writer identification framework proposed in this thesis combines three different writer identification approaches, which are the main scientific contributions. The first one is based on symbol recognition methods. For this purpose, two novel symbol recognition methods are proposed for coping with the typical distortions in hand-drawn symbols. The second approach preprocesses the music score for obtaining music lines, and extracts information about the slant, width of the writing, connected components, contours and fractals. Finally, the third approach extracts global information by generating texture images from the music scores and extracting textural features (such as Gabor filters and co-occurence matrices). The high identification rates obtained in the experimental results demonstrate the suitability of the proposed ensemble architecture. To the best of our knowledge, this work is the first contribution on writer identification from images containing graphical languages. |
||||
| Address | Barcelona (Spain) | ||||
| Corporate Author | Thesis | Ph.D. thesis | |||
| Publisher | Ediciones Graficas Rey | Place of Publication | Editor | Josep Llados;Gemma Sanchez | |
| 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 |
DAG @ dag @ For2009 | Serial | 1265 | ||
| 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 | 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 | Miquel Ferrer; Ernest Valveny; F. Serratosa | ||||
| Title | Median Graph Computation by means of a Genetic Approach Based on Minimum Common Supergraph and Maximum Common Subraph | Type | Conference Article | ||
| Year | 2009 | Publication | 4th Iberian Conference on Pattern Recognition and Image Analysis | Abbreviated Journal | |
| Volume | 5524 | Issue | Pages | 346–353 | |
| Keywords | |||||
| 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 a new genetic algorithm for the median graph computation. 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, show that we obtain good approximations of the median graph. Finally, we use the median graph in a real nearest neighbour classification showing that it leaves the box of the only-theoretical concepts and demonstrating, from a practical point of view, that can be a useful tool to represent a set of graphs. | ||||
| Address | Póvoa de Varzim, Portugal | ||||
| 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-02171-8 | Medium | |
| Area | Expedition | Conference | IbPRIA | ||
| Notes | DAG | Approved | no | ||
| Call Number |
DAG @ dag @ FVS2009c | Serial | 1174 | ||
| Permanent link to this record | |||||