| Records |
| 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 |
Partha Pratim Roy; Josep Llados; Umapada Pal |
| Title |
A Complete System for Detection and Recognition of Text in Graphical Documents using Background Information |
Type |
Conference Article |
| Year |
2009 |
Publication |
5th International Conference on Computer Vision Theory and Applications |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| 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 @ RLP2009 |
Serial |
1238 |
| Permanent link to this record |
| |
|
| |
| Author |
David Aldavert; Ricardo Toledo; Arnau Ramisa; Ramon Lopez de Mantaras |
| Title |
Efficient Object Pixel-Level Categorization using Bag of Features: Advances in Visual Computing |
Type |
Conference Article |
| Year |
2009 |
Publication |
5th International Symposium on Visual Computing |
Abbreviated Journal |
|
| Volume |
5875 |
Issue |
|
Pages |
44–55 |
| Keywords |
|
| Abstract |
In this paper we present a pixel-level object categorization method suitable to be applied under real-time constraints. Since pixels are categorized using a bag of features scheme, the major bottleneck of such an approach would be the feature pooling in local histograms of visual words. Therefore, we propose to bypass this time-consuming step and directly obtain the score from a linear Support Vector Machine classifier. This is achieved by creating an integral image of the components of the SVM which can readily obtain the classification score for any image sub-window with only 10 additions and 2 products, regardless of its size. Besides, we evaluated the performance of two efficient feature quantization methods: the Hierarchical K-Means and the Extremely Randomized Forest. All experiments have been done in the Graz02 database, showing comparable, or even better results to related work with a lower computational cost. |
| Address |
Las Vegas, USA |
| 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-10330-8 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ISVC |
| Notes |
ADAS |
Approved |
no |
| Call Number |
Admin @ si @ ATR2009a |
Serial |
1246 |
| Permanent link to this record |
| |
|
| |
| Author |
Bogdan Raducanu; Fadi Dornaika |
| Title |
Natural Facial Expression Recognition Using Dynamic and Static Schemes |
Type |
Conference Article |
| Year |
2009 |
Publication |
5th International Symposium on Visual Computing |
Abbreviated Journal |
|
| Volume |
5875 |
Issue |
|
Pages |
730–739 |
| Keywords |
|
| Abstract |
Affective computing is at the core of a new paradigm in HCI and AI represented by human-centered computing. Within this paradigm, it is expected that machines will be enabled with perceiving capabilities, making them aware about users’ affective state. The current paper addresses the problem of facial expression recognition from monocular videos sequences. We propose a dynamic facial expression recognition scheme, which is proven to be very efficient. Furthermore, it is conveniently compared with several static-based systems adopting different magnitude of facial expression. We provide evaluations of performance using Linear Discriminant Analysis (LDA), Non parametric Discriminant Analysis (NDA), and Support Vector Machines (SVM). We also provide performance evaluations using arbitrary test video sequences. |
| Address |
Las Vegas, USA |
| 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-10330-8 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ISVC |
| Notes |
OR;MV |
Approved |
no |
| Call Number |
BCNPCL @ bcnpcl @ RaD2009 |
Serial |
1257 |
| 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 |
Marçal Rusiñol; K. Bertet; Jean-Marc Ogier; Josep Llados |
| Title |
Symbol Recognition Using a Concept Lattice of Graphical Patterns |
Type |
Conference Article |
| Year |
2009 |
Publication |
8th IAPR International Workshop on Graphics Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| 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 |
La Rochelle; July 2009 |
| 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 |
GREC |
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ RBO2009 |
Serial |
1444 |
| Permanent link to this record |
| |
|
| |
| Author |
Partha Pratim Roy; Umapada Pal; Josep Llados |
| Title |
Touching Text Character Localization in Graphical Documents using SIFT |
Type |
Conference Article |
| Year |
2009 |
Publication |
In proceedings 8th IAPR International Workshop on Graphics Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| 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 |
La rochelle; July 2009 |
| 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 |
GREC |
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ RPL2009c |
Serial |
1445 |
| Permanent link to this record |
| |
|
| |
| Author |
Joan Mas; Gemma Sanchez; Josep Llados |
| Title |
SSP: Sketching slide Presentations, a Syntactic Approach |
Type |
Conference Article |
| Year |
2009 |
Publication |
8th IAPR International Workshop on Graphics Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| 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 |
La Rochelle; France; July 2009 |
| 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 |
GREC |
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ MSL2009a |
Serial |
1441 |
| Permanent link to this record |
| |
|
| |
| Author |
Salim Jouili; Salvatore Tabbone; Ernest Valveny |
| Title |
Comparing Graph Similarity Measures for Graphical Recognition. |
Type |
Conference Article |
| Year |
2009 |
Publication |
8th IAPR International Workshop on Graphics Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
In this paper we evaluate four graph distance measures. The analysis is performed for document retrieval tasks. For this aim, different kind of documents are used including line drawings (symbols), ancient documents (ornamental letters), shapes and trademark-logos. The experimental results show that the performance of each graph distance measure depends on the kind of data and the graph representation technique. |
| Address |
La Rochelle; France; July 2009 |
| Corporate Author |
|
Thesis |
|
| Publisher |
Springer |
Place of Publication |
|
Editor |
|
| Language |
|
Summary Language |
|
Original Title |
|
| Series Editor |
|
Series Title |
|
Abbreviated Series Title |
LNCS |
| Series Volume |
|
Series Issue |
|
Edition |
|
| ISSN |
|
ISBN |
|
Medium |
|
| Area |
|
Expedition |
|
Conference |
GREC |
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ JTV2009 |
Serial |
1442 |
| 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 |
Salim Jouili; Salvatore Tabbone; Ernest Valveny |
| Title |
Evaluation of graph matching measures for documents retrieval |
Type |
Conference Article |
| Year |
2009 |
Publication |
In proceedings of 8th IAPR International Workshop on Graphics Recognition |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
13–21 |
| Keywords |
Graph Matching; Graph retrieval; structural representation; Performance Evaluation |
| Abstract |
In this paper we evaluate four graph distance measures. The analysis is performed for document retrieval tasks. For this aim, different kind of documents are used which include line drawings (symbols), ancient documents (ornamental letters), shapes and trademark-logos. The experimental results show that the performance of each grahp distance measure depends on the kind of data and the graph representation technique. |
| Address |
La Rochelle, 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 |
0302-9743 |
ISBN |
978-3-642-13727-3 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
GREC |
| Notes |
DAG |
Approved |
no |
| Call Number |
DAG @ dag @ JTV2009a |
Serial |
1230 |
| Permanent link to this record |
| |
|
| |
| Author |
Fahad Shahbaz Khan; Joost Van de Weijer; Maria Vanrell |
| Title |
Top-Down Color Attention for Object Recognition |
Type |
Conference Article |
| Year |
2009 |
Publication |
12th International Conference on Computer Vision |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
979 - 986 |
| Keywords |
|
| Abstract |
Generally the bag-of-words based image representation follows a bottom-up paradigm. The subsequent stages of the process: feature detection, feature description, vocabulary construction and image representation are performed independent of the intentioned object classes to be detected. In such a framework, combining multiple cues such as shape and color often provides below-expected results. This paper presents a novel method for recognizing object categories when using multiple cues by separating the shape and color cue. Color is used to guide attention by means of a top-down category-specific attention map. The color attention map is then further deployed to modulate the shape features by taking more features from regions within an image that are likely to contain an object instance. This procedure leads to a category-specific image histogram representation for each category. Furthermore, we argue that the method combines the advantages of both early and late fusion. We compare our approach with existing methods that combine color and shape cues on three data sets containing varied importance of both cues, namely, Soccer ( color predominance), Flower (color and shape parity), and PASCAL VOC Challenge 2007 (shape predominance). The experiments clearly demonstrate that in all three data sets our proposed framework significantly outperforms the state-of-the-art methods for combining color and shape information. |
| Address |
Kyoto, Japan |
| 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 |
1550-5499 |
ISBN |
978-1-4244-4420-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICCV |
| Notes |
CIC |
Approved |
no |
| Call Number |
CAT @ cat @ SWV2009 |
Serial |
1196 |
| Permanent link to this record |
| |
|
| |
| Author |
Ivan Huerta; Michael Holte; Thomas B. Moeslund; Jordi Gonzalez |
| Title |
Detection and Removal of Chromatic Moving Shadows in Surveillance Scenarios |
Type |
Conference Article |
| Year |
2009 |
Publication |
12th International Conference on Computer Vision |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
1499 - 1506 |
| Keywords |
|
| Abstract |
Segmentation in the surveillance domain has to deal with shadows to avoid distortions when detecting moving objects. Most segmentation approaches dealing with shadow detection are typically restricted to penumbra shadows. Therefore, such techniques cannot cope well with umbra shadows. Consequently, umbra shadows are usually detected as part of moving objects. In this paper we present a novel technique based on gradient and colour models for separating chromatic moving cast shadows from detected moving objects. Firstly, both a chromatic invariant colour cone model and an invariant gradient model are built to perform automatic segmentation while detecting potential shadows. In a second step, regions corresponding to potential shadows are grouped by considering “a bluish effect” and an edge partitioning. Lastly, (i) temporal similarities between textures and (ii) spatial similarities between chrominance angle and brightness distortions are analysed for all potential shadow regions in order to finally identify umbra shadows. Unlike other approaches, our method does not make any a-priori assumptions about camera location, surface geometries, surface textures, shapes and types of shadows, objects, and background. Experimental results show the performance and accuracy of our approach in different shadowed materials and illumination conditions. |
| Address |
Kyoto, Japan |
| 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 |
1550-5499 |
ISBN |
978-1-4244-4420-5 |
Medium |
|
| Area |
|
Expedition |
|
Conference |
ICCV |
| Notes |
|
Approved |
no |
| Call Number |
ISE @ ise @ HHM2009 |
Serial |
1213 |
| Permanent link to this record |
| |
|
| |
| Author |
Gemma Roig; Xavier Boix; Fernando De la Torre |
| Title |
Optimal Feature Selection for Subspace Image Matching |
Type |
Conference Article |
| Year |
2009 |
Publication |
2nd IEEE International Workshop on Subspace Methods in conjunction |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
Image matching has been a central research topic in computer vision over the last decades. Typical approaches to correspondence involve matching feature points between images. In this paper, we present a novel problem for establishing correspondences between a sparse set of image features and a previously learned subspace model. We formulate the matching task as an energy minimization, and jointly optimize over all possible feature assignments and parameters of the subspace model. This problem is in general NP-hard. We propose a convex relaxation approximation, and develop two optimization strategies: naïve gradient-descent and quadratic programming. Alternatively, we reformulate the optimization criterion as a sparse eigenvalue problem, and solve it using a recently proposed backward greedy algorithm. Experimental results on facial feature detection show that the quadratic programming solution provides better selection mechanism for relevant features. |
| Address |
Kyoto, Japan |
| 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 |
ICCV |
| Notes |
|
Approved |
no |
| Call Number |
Admin @ si @ RBT2009 |
Serial |
1233 |
| Permanent link to this record |
| |
|
| |
| Author |
Xavier Boix; Josep M. Gonfaus; Fahad Shahbaz Khan; Joost Van de Weijer; Andrew Bagdanov; Marco Pedersoli; Jordi Gonzalez; Joan Serrat |
| Title |
Combining local and global bag-of-word representations for semantic segmentation |
Type |
Conference Article |
| Year |
2009 |
Publication |
Workshop on The PASCAL Visual Object Classes Challenge |
Abbreviated Journal |
|
| Volume |
|
Issue |
|
Pages |
|
| Keywords |
|
| Abstract |
|
| Address |
Kyoto (Japan) |
| 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 |
ICCV |
| Notes |
ADAS;ISE |
Approved |
no |
| Call Number |
ADAS @ adas @ BGS2009 |
Serial |
1273 |
| Permanent link to this record |
